Documentation

Graphon.RelExchangeableLaw

Exchangeable relational laws: size-vector marginals and consistency (AHK umbrella #103, R2a) #

The finite-marginal layer of the generic exchangeable-law theory (issue #105). A generic exchangeable law is given by a size-vector-indexed family of probability marginals that is consistent under arbitrary sortwise injections — the multi-sorted, arbitrary-arity analogue of Graphon.ExchangeableGraphLaw.

Crucially the finite marginals are ProbabilityMeasure (RelStructure S (Vfinite n)), not PMF: with countably many relation symbols a finite vertex carrier still has infinitely many Boolean coordinates, so RelStructure S (Vfinite n) can be an (uncountable) standard-Borel space and the law can be non-atomic. (D2 recovers PMFs in the finite-signature case.)

The compactness-based extension to an infinite law is R2b; uniqueness (via ext_of_map_restrictFin) and the finite/infinite equivalence are R2c.

theorem RelSignature.exists_const_ge {S : RelSignature} [Fintype S.Srt] (n : S.Srt) :
∃ (N : ), ∀ (s : S.Srt), n s N

Diagonal cofinality: since S.Srt is finite, every size vector is bounded above by a constant (diagonal) size vector — so diagonal marginals suffice for the extension.

An exchangeable relational law: a size-vector-indexed family of probability marginals on the finite structure spaces, consistent under every sortwise injection ∀ s, Fin (n s) ↪ Fin (m s) (the m-marginal restricts to the n-marginal).

Instances For

    Consistency under the standard size-vector inclusion n ≤ m.

    Finite exchangeability: each marginal is invariant under the sortwise permutations of its finite vertex sets — the special case n = m, e a permutation.