Ordering of free and wired subsequential limits
A. Domination passes to weak limits
LemmaFree limit at most wired limit along a common subsequence, \(q \ge 1\)#✓fully proved
If free and wired box measures converge weakly to ν₀ and ν₁ along a common subsequence and
q ≥ 1, then ν₀(A) ≤ ν₁(A) for every clopen increasing event A.
lemma weakLimit_extremality_of_common_subseq (d : ℕ) {p q : ℝ}
(hp : 0 < p) (hp1 : p < 1) (hq : 1 ≤ q)
{ν₀ ν₁ : ProbabilityMeasure (ConfigSpace (Sym2 (Lattice.Site d)))}
{ψ : ℕ → ℕ}
(h₀ : WeakConvergesTo
(fun n => freeFiniteMeasure d (ψ n) hp hp1 (zero_lt_one.trans_le hq)) ν₀)
(h₁ : WeakConvergesTo
(fun n => wiredFiniteMeasure d (ψ n) hp hp1 (zero_lt_one.trans_le hq)) ν₁)
{A : Set (ConfigSpace (Sym2 (Lattice.Site d)))}
(hAclopen : IsClopen A) (hAinc : IsIncreasing A) :
(ν₀ : Measure (ConfigSpace (Sym2 (Lattice.Site d)))).real A
≤ (ν₁ : Measure (ConfigSpace (Sym2 (Lattice.Site d)))).real A
abbrev ConfigSpace (E : Type*) : Type _ := E → Bool
MathlibExt/Probability/Configuration/ConfigSpace.lean:40
abbrev Site (d : ℕ) : Type := Fin d → ℤ
MathlibExt/Combinatorics/SimpleGraph/Lattice/HypercubicLattice.lean:55
def WeakConvergesTo (μ : ℕ → ProbabilityMeasure (ConfigSpace E))
(ν : ProbabilityMeasure (ConfigSpace E)) : Prop :=
Tendsto μ atTop (𝓝 ν)
MathlibExt/Probability/Configuration/WeakConvergence.lean:44
noncomputable def freeFiniteMeasure (d n : ℕ) {p q : ℝ}
(hp : 0 < p) (hp1 : p < 1) (hq : 0 < q) :
ProbabilityMeasure (ConfigSpace (Sym2 (Site d))) :=
⟨((fkPMF (boxGraph d n) hp hp1 hq).toMeasure).map (extendEdge d n),
inferInstance⟩
PhyslibExt/StatisticalMechanics/RandomCluster/InfiniteVolume.lean:179
noncomputable def wiredFiniteMeasure (d n : ℕ) {p q : ℝ}
(hp : 0 < p) (hp1 : p < 1) (hq : 0 < q) :
ProbabilityMeasure (ConfigSpace (Sym2 (Site d))) :=
⟨((wiredFkPMF (boxGraph d n) (boxBoundary d n) hp hp1 hq).toMeasure).map (extendEdge d n),
inferInstance⟩
PhyslibExt/StatisticalMechanics/RandomCluster/InfiniteVolume.lean:187
def IsIncreasing (A : Set (ConfigSpace E)) : Prop := IsUpperSet A
MathlibExt/Probability/CorrelationInequalities/IncreasingEvent.lean:55
Uses 9 · Used by 1
B. Existence of ordered limit pairs
LemmaCommon subsequence with free and wired weak limits#✓fully proved
Free and wired box measures have weak limits along a common strictly increasing subsequence.
lemma exists_common_subseq_weak_limits (d : ℕ) {p q : ℝ}
(hp : 0 < p) (hp1 : p < 1) (hq : 0 < q) :
∃ (ψ : ℕ → ℕ) (ν₀ ν₁ : ProbabilityMeasure (ConfigSpace (Sym2 (Lattice.Site d)))),
StrictMono ψ ∧
WeakConvergesTo (fun n => freeFiniteMeasure d (ψ n) hp hp1 hq) ν₀ ∧
WeakConvergesTo (fun n => wiredFiniteMeasure d (ψ n) hp hp1 hq) ν₁
abbrev ConfigSpace (E : Type*) : Type _ := E → Bool
MathlibExt/Probability/Configuration/ConfigSpace.lean:40
abbrev Site (d : ℕ) : Type := Fin d → ℤ
MathlibExt/Combinatorics/SimpleGraph/Lattice/HypercubicLattice.lean:55
def WeakConvergesTo (μ : ℕ → ProbabilityMeasure (ConfigSpace E))
(ν : ProbabilityMeasure (ConfigSpace E)) : Prop :=
Tendsto μ atTop (𝓝 ν)
MathlibExt/Probability/Configuration/WeakConvergence.lean:44
noncomputable def freeFiniteMeasure (d n : ℕ) {p q : ℝ}
(hp : 0 < p) (hp1 : p < 1) (hq : 0 < q) :
ProbabilityMeasure (ConfigSpace (Sym2 (Site d))) :=
⟨((fkPMF (boxGraph d n) hp hp1 hq).toMeasure).map (extendEdge d n),
inferInstance⟩
PhyslibExt/StatisticalMechanics/RandomCluster/InfiniteVolume.lean:179
noncomputable def wiredFiniteMeasure (d n : ℕ) {p q : ℝ}
(hp : 0 < p) (hp1 : p < 1) (hq : 0 < q) :
ProbabilityMeasure (ConfigSpace (Sym2 (Site d))) :=
⟨((wiredFkPMF (boxGraph d n) (boxBoundary d n) hp hp1 hq).toMeasure).map (extendEdge d n),
inferInstance⟩
PhyslibExt/StatisticalMechanics/RandomCluster/InfiniteVolume.lean:187
LemmaOrdered free and wired subsequential limits exist for \(q \ge 1\)#✓fully proved
For q ≥ 1 there are a subsequence and weak limits φ0 (free) and φ1 (wired) along it with
φ0(A) ≤ φ1(A) for all clopen increasing A.
lemma exists_infiniteVolume_extremal (d : ℕ) {p q : ℝ}
(hp : 0 < p) (hp1 : p < 1) (hq : 1 ≤ q) :
∃ (ψ : ℕ → ℕ) (φ0 φ1 : ProbabilityMeasure (ConfigSpace (Sym2 (Lattice.Site d)))),
StrictMono ψ ∧
WeakConvergesTo
(fun n => freeFiniteMeasure d (ψ n) hp hp1 (zero_lt_one.trans_le hq)) φ0 ∧
WeakConvergesTo
(fun n => wiredFiniteMeasure d (ψ n) hp hp1 (zero_lt_one.trans_le hq)) φ1 ∧
∀ A : Set (ConfigSpace (Sym2 (Lattice.Site d))),
IsClopen A → IsIncreasing A →
(φ0 : Measure (ConfigSpace (Sym2 (Lattice.Site d)))).real A
≤ (φ1 : Measure (ConfigSpace (Sym2 (Lattice.Site d)))).real A
abbrev ConfigSpace (E : Type*) : Type _ := E → Bool
MathlibExt/Probability/Configuration/ConfigSpace.lean:40
abbrev Site (d : ℕ) : Type := Fin d → ℤ
MathlibExt/Combinatorics/SimpleGraph/Lattice/HypercubicLattice.lean:55
def WeakConvergesTo (μ : ℕ → ProbabilityMeasure (ConfigSpace E))
(ν : ProbabilityMeasure (ConfigSpace E)) : Prop :=
Tendsto μ atTop (𝓝 ν)
MathlibExt/Probability/Configuration/WeakConvergence.lean:44
noncomputable def freeFiniteMeasure (d n : ℕ) {p q : ℝ}
(hp : 0 < p) (hp1 : p < 1) (hq : 0 < q) :
ProbabilityMeasure (ConfigSpace (Sym2 (Site d))) :=
⟨((fkPMF (boxGraph d n) hp hp1 hq).toMeasure).map (extendEdge d n),
inferInstance⟩
PhyslibExt/StatisticalMechanics/RandomCluster/InfiniteVolume.lean:179
noncomputable def wiredFiniteMeasure (d n : ℕ) {p q : ℝ}
(hp : 0 < p) (hp1 : p < 1) (hq : 0 < q) :
ProbabilityMeasure (ConfigSpace (Sym2 (Site d))) :=
⟨((wiredFkPMF (boxGraph d n) (boxBoundary d n) hp hp1 hq).toMeasure).map (extendEdge d n),
inferInstance⟩
PhyslibExt/StatisticalMechanics/RandomCluster/InfiniteVolume.lean:187
def IsIncreasing (A : Set (ConfigSpace E)) : Prop := IsUpperSet A
MathlibExt/Probability/CorrelationInequalities/IncreasingEvent.lean:55
Loading dependency explorer…
The dependency explorer needs JavaScript and its graph data.