Finite- and infinite-volume FK measures on ℤ^d
A. The wired random-cluster measure on a finite graph
DefinitionWired random-cluster weight#✓fully proved
The unnormalized wired random-cluster weight edgeProduct G p ω · q ^ k¹(ω), where k¹ counts
clusters after wiring all boundary vertices together.
noncomputable def wiredFkWeight (p q : ℝ) (ω : ConfigSpace (Sym2 V)) : ℝ :=
edgeProduct G p ω * q ^ numClustersWired G bdry ω
abbrev ConfigSpace (E : Type*) : Type _ := E → Bool
MathlibExt/Probability/Configuration/ConfigSpace.lean:40
def edgeProduct (p : ℝ) (ω : ConfigSpace (Sym2 V)) : ℝ :=
∏ e ∈ G.edgeFinset, (if ω e then p else 1 - p)
PhyslibExt/StatisticalMechanics/RandomCluster/RandomCluster.lean:126
noncomputable def numClustersWired (ω : Sym2 V → Bool) : ℕ :=
Nat.card (wiredGraph G bdry ω).ConnectedComponent
MathlibExt/Combinatorics/SimpleGraph/Lattice/BoundaryConditions.lean:162
Uses 3 · Used by 34
DefinitionWired random-cluster partition function#✓fully proved
The wired partition function: the sum of wiredFkWeight over all configurations.
noncomputable def wiredFkZ (p q : ℝ) : ℝ :=
∑ ω : ConfigSpace (Sym2 V), wiredFkWeight G bdry p q ω
abbrev ConfigSpace (E : Type*) : Type _ := E → Bool
MathlibExt/Probability/Configuration/ConfigSpace.lean:40
noncomputable def wiredFkWeight (p q : ℝ) (ω : ConfigSpace (Sym2 V)) : ℝ :=
edgeProduct G p ω * q ^ numClustersWired G bdry ω
PhyslibExt/StatisticalMechanics/RandomCluster/InfiniteVolume.lean:81
Uses 2 · Used by 32
DefinitionWired random-cluster probability of a configuration#✓fully proved
The wired random-cluster probability of a configuration, wiredFkWeight / wiredFkZ.
noncomputable def wiredFkProb (p q : ℝ) (ω : ConfigSpace (Sym2 V)) : ℝ :=
wiredFkWeight G bdry p q ω / wiredFkZ G bdry p q
abbrev ConfigSpace (E : Type*) : Type _ := E → Bool
MathlibExt/Probability/Configuration/ConfigSpace.lean:40
noncomputable def wiredFkWeight (p q : ℝ) (ω : ConfigSpace (Sym2 V)) : ℝ :=
edgeProduct G p ω * q ^ numClustersWired G bdry ω
PhyslibExt/StatisticalMechanics/RandomCluster/InfiniteVolume.lean:81
noncomputable def wiredFkZ (p q : ℝ) : ℝ :=
∑ ω : ConfigSpace (Sym2 V), wiredFkWeight G bdry p q ω
PhyslibExt/StatisticalMechanics/RandomCluster/InfiniteVolume.lean:93
Uses 3 · Used by 95
DefinitionWired random-cluster measure as a probability mass function#✓fully proved
The wired random-cluster measure on a finite graph, as a probability mass function.
noncomputable def wiredFkPMF {p q : ℝ} (hp : 0 < p) (hp1 : p < 1) (hq : 0 < q) :
PMF (ConfigSpace (Sym2 V)) :=
PMF.ofFintype (fun ω => ENNReal.ofReal (wiredFkProb G bdry p q ω)) <| by
rw [← ENNReal.ofReal_sum_of_nonneg fun ω _ => wiredFkProb_nonneg G bdry hp hp1 hq ω,
wiredFkProb_sum_eq_one G bdry hp hp1 hq]
simp
abbrev ConfigSpace (E : Type*) : Type _ := E → Bool
MathlibExt/Probability/Configuration/ConfigSpace.lean:40
noncomputable def wiredFkProb (p q : ℝ) (ω : ConfigSpace (Sym2 V)) : ℝ :=
wiredFkWeight G bdry p q ω / wiredFkZ G bdry p q
PhyslibExt/StatisticalMechanics/RandomCluster/InfiniteVolume.lean:105
Uses 6 · Used by 10
B. Boxes of ℤ^d
AbbreviationVertices of the box \((-n, n)^d\)#✓fully proved
The vertices of the box Λ_n = [-n, n]^d ⊆ ℤ^d, as a subtype.
abbrev boxVerts (d n : ℕ) : Type := {x : Site d // x ∈ box d n}
abbrev Site (d : ℕ) : Type := Fin d → ℤ
MathlibExt/Combinatorics/SimpleGraph/Lattice/HypercubicLattice.lean:55
def box (d n : ℕ) : Set (Site d) := {x | ∀ i, (x i).natAbs ≤ n}
MathlibExt/Combinatorics/SimpleGraph/Lattice/HypercubicLattice.lean:86
Uses 2 · Used by 422
DefinitionNearest-neighbour graph on a box#✓fully proved
The nearest-neighbour graph on the box Λ_n, induced from the hypercubic lattice.
def boxGraph (d n : ℕ) : SimpleGraph (boxVerts d n) :=
SimpleGraph.comap Subtype.val (hypercubicLattice d)
abbrev boxVerts (d n : ℕ) : Type := {x : Site d // x ∈ box d n}
PhyslibExt/StatisticalMechanics/RandomCluster/InfiniteVolume.lean:131
def hypercubicLattice (d : ℕ) : SimpleGraph (Site d) where
Adj := NearestNeighbour d
symm := ⟨fun _ _ h => nearestNeighbour_symm d h⟩
loopless := nearestNeighbour_irrefl d
MathlibExt/Combinatorics/SimpleGraph/Lattice/HypercubicLattice.lean:76
Uses 4 · Used by 236
DefinitionVertex boundary of a box#✓fully proved
The vertex boundary of the box: sites of Λ_n that are not in Λ_(n-1).
def boxBoundary (d n : ℕ) (x : boxVerts d n) : Prop := (x : Site d) ∈ vertexBoundary d n
abbrev boxVerts (d n : ℕ) : Type := {x : Site d // x ∈ box d n}
PhyslibExt/StatisticalMechanics/RandomCluster/InfiniteVolume.lean:131
abbrev Site (d : ℕ) : Type := Fin d → ℤ
MathlibExt/Combinatorics/SimpleGraph/Lattice/HypercubicLattice.lean:55
def vertexBoundary (d n : ℕ) : Set (Site d) := box d n \ box d (n - 1)
MathlibExt/Combinatorics/SimpleGraph/Lattice/HypercubicLattice.lean:102
Uses 4 · Used by 104
C. Box measures on the configuration space of ℤ^d
DefinitionInclusion of box edges into \(\mathbb{Z}^d\)#✓fully proved
The inclusion of edges of the box into edges of ℤ^d.
def edgeIncl (d n : ℕ) : Sym2 (boxVerts d n) → Sym2 (Site d) :=
Sym2.map (Subtype.val : boxVerts d n → Site d)
abbrev boxVerts (d n : ℕ) : Type := {x : Site d // x ∈ box d n}
PhyslibExt/StatisticalMechanics/RandomCluster/InfiniteVolume.lean:131
abbrev Site (d : ℕ) : Type := Fin d → ℤ
MathlibExt/Combinatorics/SimpleGraph/Lattice/HypercubicLattice.lean:55
Uses 3 · Used by 157
DefinitionExtension of a box configuration by closed edges#✓fully proved
Extend a configuration on the box to ℤ^d by declaring every edge outside the box closed.
noncomputable def extendEdge (d n : ℕ) (ω : ConfigSpace (Sym2 (boxVerts d n))) :
ConfigSpace (Sym2 (Site d)) :=
fun e => if h : e ∈ Set.range (edgeIncl d n) then ω h.choose else false
abbrev ConfigSpace (E : Type*) : Type _ := E → Bool
MathlibExt/Probability/Configuration/ConfigSpace.lean:40
abbrev boxVerts (d n : ℕ) : Type := {x : Site d // x ∈ box d n}
PhyslibExt/StatisticalMechanics/RandomCluster/InfiniteVolume.lean:131
abbrev Site (d : ℕ) : Type := Fin d → ℤ
MathlibExt/Combinatorics/SimpleGraph/Lattice/HypercubicLattice.lean:55
def edgeIncl (d n : ℕ) : Sym2 (boxVerts d n) → Sym2 (Site d) :=
Sym2.map (Subtype.val : boxVerts d n → Site d)
PhyslibExt/StatisticalMechanics/RandomCluster/InfiniteVolume.lean:163
Uses 5 · Used by 19
DefinitionFree random-cluster measure on a box#✓fully proved
The free random-cluster measure φ⁰_n on the box Λ_n, pushed to the configuration space of
ℤ^d by extendEdge.
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⟩
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
noncomputable def fkPMF {p q : ℝ} (hp : 0 < p) (hp1 : p < 1) (hq : 0 < q) :
PMF (ConfigSpace (Sym2 V)) :=
PMF.ofFintype (fun ω => ENNReal.ofReal (fkProb G p q ω)) <| by
rw [← ENNReal.ofReal_sum_of_nonneg fun ω _ => fkProb_nonneg G hp hp1 hq ω,
fkProb_sum_eq_one G hp hp1 hq]
simp
PhyslibExt/StatisticalMechanics/RandomCluster/RandomCluster.lean:191
def boxGraph (d n : ℕ) : SimpleGraph (boxVerts d n) :=
SimpleGraph.comap Subtype.val (hypercubicLattice d)
PhyslibExt/StatisticalMechanics/RandomCluster/InfiniteVolume.lean:142
noncomputable def extendEdge (d n : ℕ) (ω : ConfigSpace (Sym2 (boxVerts d n))) :
ConfigSpace (Sym2 (Site d)) :=
fun e => if h : e ∈ Set.range (edgeIncl d n) then ω h.choose else false
PhyslibExt/StatisticalMechanics/RandomCluster/InfiniteVolume.lean:170
Uses 7 · Used by 58
DefinitionWired random-cluster measure on a box#✓fully proved
The wired random-cluster measure φ¹_n on the box Λ_n (boundary vertices wired), pushed to
the configuration space of ℤ^d by extendEdge.
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⟩
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
noncomputable def wiredFkPMF {p q : ℝ} (hp : 0 < p) (hp1 : p < 1) (hq : 0 < q) :
PMF (ConfigSpace (Sym2 V)) :=
PMF.ofFintype (fun ω => ENNReal.ofReal (wiredFkProb G bdry p q ω)) <| by
rw [← ENNReal.ofReal_sum_of_nonneg fun ω _ => wiredFkProb_nonneg G bdry hp hp1 hq ω,
wiredFkProb_sum_eq_one G bdry hp hp1 hq]
simp
PhyslibExt/StatisticalMechanics/RandomCluster/InfiniteVolume.lean:119
def boxGraph (d n : ℕ) : SimpleGraph (boxVerts d n) :=
SimpleGraph.comap Subtype.val (hypercubicLattice d)
PhyslibExt/StatisticalMechanics/RandomCluster/InfiniteVolume.lean:142
def boxBoundary (d n : ℕ) (x : boxVerts d n) : Prop := (x : Site d) ∈ vertexBoundary d n
PhyslibExt/StatisticalMechanics/RandomCluster/InfiniteVolume.lean:151
noncomputable def extendEdge (d n : ℕ) (ω : ConfigSpace (Sym2 (boxVerts d n))) :
ConfigSpace (Sym2 (Site d)) :=
fun e => if h : e ∈ Set.range (edgeIncl d n) then ω h.choose else false
PhyslibExt/StatisticalMechanics/RandomCluster/InfiniteVolume.lean:170
Uses 8 · Used by 88
D. Infinite-volume measures
DefinitionFree infinite-volume random-cluster measure#✓fully proved
A free infinite-volume random-cluster measure on ℤ^d: a weak limit of a subsequence of
freeFiniteMeasure d n, chosen by Prokhorov compactness.
noncomputable def freeInfiniteVolume (d : ℕ) {p q : ℝ}
(hp : 0 < p) (hp1 : p < 1) (hq : 0 < q) :
ProbabilityMeasure (ConfigSpace (Sym2 (Site d))) :=
(CompactSpace.tendsto_subseq (fun n => freeFiniteMeasure d n hp hp1 hq)).choose
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
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
Uses 3 · Used by 50
LemmaFree infinite-volume measure is a subsequential weak limit#✓fully proved
freeInfiniteVolume is the weak limit of freeFiniteMeasure along some strictly increasing
sequence of box sizes.
lemma freeInfiniteVolume_isLimit (d : ℕ) {p q : ℝ}
(hp : 0 < p) (hp1 : p < 1) (hq : 0 < q) :
∃ φ : ℕ → ℕ, StrictMono φ ∧
WeakConvergesTo (fun n => freeFiniteMeasure d (φ n) hp hp1 hq)
(freeInfiniteVolume d hp hp1 hq)
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 freeInfiniteVolume (d : ℕ) {p q : ℝ}
(hp : 0 < p) (hp1 : p < 1) (hq : 0 < q) :
ProbabilityMeasure (ConfigSpace (Sym2 (Site d))) :=
(CompactSpace.tendsto_subseq (fun n => freeFiniteMeasure d n hp hp1 hq)).choose
PhyslibExt/StatisticalMechanics/RandomCluster/InfiniteVolume.lean:199
DefinitionWired infinite-volume random-cluster measure#✓fully proved
A wired infinite-volume random-cluster measure on ℤ^d: a weak limit of a subsequence of
wiredFiniteMeasure d n, chosen by Prokhorov compactness.
noncomputable def wiredInfiniteVolume (d : ℕ) {p q : ℝ}
(hp : 0 < p) (hp1 : p < 1) (hq : 0 < q) :
ProbabilityMeasure (ConfigSpace (Sym2 (Site d))) :=
(CompactSpace.tendsto_subseq (fun n => wiredFiniteMeasure d n hp hp1 hq)).choose
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
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
Uses 3 · Used by 69
LemmaWired infinite-volume measure is a subsequential weak limit#✓fully proved
wiredInfiniteVolume is the weak limit of wiredFiniteMeasure along some strictly increasing
sequence of box sizes.
lemma wiredInfiniteVolume_isLimit (d : ℕ) {p q : ℝ}
(hp : 0 < p) (hp1 : p < 1) (hq : 0 < q) :
∃ φ : ℕ → ℕ, StrictMono φ ∧
WeakConvergesTo (fun n => wiredFiniteMeasure d (φ n) hp hp1 hq)
(wiredInfiniteVolume d hp hp1 hq)
def WeakConvergesTo (μ : ℕ → ProbabilityMeasure (ConfigSpace E))
(ν : ProbabilityMeasure (ConfigSpace E)) : Prop :=
Tendsto μ atTop (𝓝 ν)
MathlibExt/Probability/Configuration/WeakConvergence.lean:44
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
noncomputable def wiredInfiniteVolume (d : ℕ) {p q : ℝ}
(hp : 0 < p) (hp1 : p < 1) (hq : 0 < q) :
ProbabilityMeasure (ConfigSpace (Sym2 (Site d))) :=
(CompactSpace.tendsto_subseq (fun n => wiredFiniteMeasure d n hp hp1 hq)).choose
PhyslibExt/StatisticalMechanics/RandomCluster/InfiniteVolume.lean:217
Uses 5 · Used by 6
Loading dependency explorer…
The dependency explorer needs JavaScript and its graph data.