Documentation

TauCeti.Probability.Exchangeability.Arrays.Extreme.Basic

Extreme jointly exchangeable array laws #

A jointly exchangeable probability law on array path space ℕ × ℕ → α is an extreme point of the convex set of jointly exchangeable probability laws if and only if its coordinate array is jointly dissociated. With the corner-tail theorem and the ergodicity theorem this completes the representation-free triangle for jointly exchangeable arrays: joint dissociation, triviality of the corner tail, ergodicity of the diagonal finitary relabelling action, and extremality are one condition, stated on the law alone for any measurable value space.

The jointly exchangeable probability laws are the invariant probability laws for the diagonal finitary action established in Arrays.Ergodic. The extreme-point characterisation is the general one for a countable group action, ErgodicSMul.iff_mem_extremePoints, composed with jointlyDissociated_iff_ergodicSMul.

Main results #

References #

The convex set of jointly exchangeable probability laws on array path space.

Equations
  • One or more equations did not get rendered due to their size.
Instances For
    @[simp]

    Membership in the jointly exchangeable probability laws.

    The jointly exchangeable probability laws are the probability laws invariant under the diagonal finitary action.

    The jointly exchangeable probability laws form a convex set.

    Joint dissociation is extremality: a jointly exchangeable probability law is an extreme point of the jointly exchangeable probability laws if and only if its coordinate array is jointly dissociated.

    The jointly exchangeable probability laws carried by a set s of arrays: those giving mass zero to sᶜ.

    Equations
    Instances For
      @[simp]

      Membership in the jointly exchangeable laws carried by s.

      The jointly exchangeable laws carried by s are a face of all jointly exchangeable probability laws.

      The jointly exchangeable laws carried by s form a convex set.

      The extreme points of the jointly exchangeable laws carried by s are the extreme jointly exchangeable laws so carried.

      Joint dissociation is extremality among the laws carried by s: a jointly exchangeable probability law carried by s is an extreme point of the jointly exchangeable laws carried by s if and only if its coordinate array is jointly dissociated.

      An extreme point of the jointly exchangeable probability laws is jointly exchangeable.

      An extreme point of the jointly exchangeable probability laws is a probability law.

      The coordinate array of an extreme point of the jointly exchangeable probability laws is jointly dissociated.

      The coordinate array of an extreme point of the jointly exchangeable laws carried by s is jointly dissociated.

      The jointly exchangeable probability laws carried by the symmetric arrays with diagonal d. For α = Bool and d = false the carrier is the adjacency arrays of the simple graphs on ℕ, and these are the laws of exchangeable random graphs read as arrays.

      Equations
      • One or more equations did not get rendered due to their size.
      Instances For
        theorem TauCeti.Probability.JointlyDissociated.ae_eq_of_comp_eq {α : Type u_1} [MeasurableSpace α] [StandardBorelSpace α] {Z : Type u_2} [MeasurableSpace Z] {ρ : MeasureTheory.Measure (ℕ × ℕ → α)} [MeasureTheory.IsProbabilityMeasure ρ] {π : MeasureTheory.Measure Z} {κ : ProbabilityTheory.Kernel Z (ℕ × ℕ → α)} [ProbabilityTheory.IsMarkovKernel κ] (hρ : JointlyDissociated ρ fun (p : ℕ × ℕ) (x : ℕ × ℕ → α) => x p) (hκ : ∀ᵐ (z : Z) ∂π, JointlyExchangeable (κ z) fun (p : ℕ × ℕ) (x : ℕ × ℕ → α) => x p) (hmix : π.bind ⇑κ = ρ) :
        ∀ᵐ (z : Z) ∂π, κ z = ρ

        A jointly dissociated array law is not a nontrivial mixture of jointly exchangeable laws. If ρ is the mixture κ ∘ₘ π of a Markov kernel whose laws are almost all jointly exchangeable, then almost every κ z is ρ itself. This is the integral form of jointlyDissociated_iff_mem_extremePoints.