Documentation

Graphon.MixtureExistence

The collision estimate for empirical mixing measures (issue #33, existence step 5) #

The empirical hom-density integrals of an exchangeable graph law converge to its upper masses, quantitatively:

Combined with mixtureExchangeableLaw_injective (Graphon/MixtureUniqueness.lean), this makes the mixture map a bijection — the full representation theorem is assembled next.

theorem Graphon.ExchangeableGraphLaw.law_eq_sum_comap (L : ExchangeableGraphLaw) {k n : } (e : Fin k Fin n) (G : SimpleGraph (Fin k)) :
(L.law k) G = H : SimpleGraph (Fin n), if G = SimpleGraph.comap (⇑e) H then (L.law n) H else 0

The exact-event restriction identity from consistency (in ℝ≥0∞): for any injection of labels, each k-vertex mass is the total n-vertex mass of its exact preimage event.

theorem Graphon.ExchangeableGraphLaw.sum_upperEvent_comap (L : ExchangeableGraphLaw) {k n : } (e : Fin k Fin n) (F : SimpleGraph (Fin k)) :
(∑ H : SimpleGraph (Fin n), if F SimpleGraph.comap (⇑e) H then (L.law n) H else 0) = G : SimpleGraph (Fin k), if F G then (L.law k) G else 0

The restriction identity from consistency (in ℝ≥0∞): for any injection of labels, the mass of the upper event F ≤ ·.comap e under the n-vertex law is the upper mass of F under the k-vertex law.

The collision estimate (issue #33, existence step 5): the empirical hom-density integral of an exchangeable law at size n + 1 is within k²/(n + 1) of the upper mass of F under the k-vertex marginal. Injective vertex maps contribute the exact upper mass by consistency (sum_upperEvent_comap); non-injective maps are controlled by the birthday bound (Graphon.card_not_injective_le).

The induced-marginal bound: each k-vertex marginal mass of the empirical mixing measure at size n + 1 is within k²/(n + 1) of the law's mass. Injective vertex maps contribute the exact mass by consistency (law_eq_sum_comap); non-injective maps are controlled by the birthday bound.

Every weak limit of empirical mixing measures along a diverging index sequence represents the law: weak convergence and the collision estimate identify every hom-density integral of the limit, and upper-sum injectivity identifies the marginals.

The existence half of the Diaconis–Janson correspondence (issue #33): every exchangeable graph law is the mixture law of a probability measure on the graphon space, obtained as a Prokhorov subsequential limit of the empirical mixing measures.