Potts correlations and random-cluster connectivity
DefinitionPotts two-point agreement probability#✓fully proved
The Potts two-point agreement probability μ_{G,β,J,q}(σ_x = σ_y).
noncomputable def pottsAgreeProb (q : ℕ) (β J : ℝ) (x y : V) : ℝ :=
∑ σ ∈ Finset.univ.filter (fun σ : V → Fin q => σ x = σ y), Potts.pottsProb G q β J σ
noncomputable def pottsProb (q : ℕ) (β J : ℝ) (σ : V → Fin q) : ℝ :=
pottsWeight G β J σ / pottsZ G q β J
PhyslibExt/StatisticalMechanics/RandomCluster/Potts.lean:129
TheoremEdwards–Sokal correlation identity#✓fully proved
For the q-state Potts model on a finite graph with
p = 1 - e^{-βJ} ∈ (0, 1),
μ_{β,J,q}(σ_x = σ_y) - 1/q = (1 - 1/q) φ_{p,q}(x ↔ y).
The hypothesis hp1 holds for every real βJ and hq follows from [NeZero q]; the only
restriction is hp, i.e. βJ > 0 (ferromagnetic).
(Edwards–Sokal, Phys. Rev. D 38, 1988; Grimmett, The Random-Cluster Model, 2006, Theorem
1.16.)
theorem edwards_sokal_correlation (q : ℕ) [NeZero q] (β J : ℝ) (x y : V)
(hp : 0 < 1 - Real.exp (-(β * J))) (hp1 : 1 - Real.exp (-(β * J)) < 1)
(hq : 0 < (q : ℝ)) :
pottsAgreeProb G q β J x y - 1 / q
= (1 - 1 / q) * connProb G (1 - Real.exp (-(β * J))) q x y
noncomputable def pottsAgreeProb (q : ℕ) (β J : ℝ) (x y : V) : ℝ :=
∑ σ ∈ Finset.univ.filter (fun σ : V → Fin q => σ x = σ y), Potts.pottsProb G q β J σ
PhyslibExt/StatisticalMechanics/RandomCluster/PottsCorrelation.lean:112
noncomputable def connProb (p q : ℝ) (x y : V) : ℝ :=
∑ ω ∈ Finset.univ.filter (fun ω : ConfigSpace (Sym2 V) => Connected G ω x y),
fkProb G p q ω
PhyslibExt/StatisticalMechanics/RandomCluster/EsCorrelations.lean:81
Uses 24 · Used by 2
LemmaEdwards–Sokal correlation identity in \((q-1)/q\) form#✓fully proved
The Edwards–Sokal correlation identity with the prefactor written as (q - 1)/q.
lemma edwards_sokal_correlation' (q : ℕ) [NeZero q] (β J : ℝ) (x y : V)
(hp : 0 < 1 - Real.exp (-(β * J))) (hp1 : 1 - Real.exp (-(β * J)) < 1)
(hq : 0 < (q : ℝ)) :
pottsAgreeProb G q β J x y - 1 / q
= ((q : ℝ) - 1) / q * connProb G (1 - Real.exp (-(β * J))) q x y
noncomputable def pottsAgreeProb (q : ℕ) (β J : ℝ) (x y : V) : ℝ :=
∑ σ ∈ Finset.univ.filter (fun σ : V → Fin q => σ x = σ y), Potts.pottsProb G q β J σ
PhyslibExt/StatisticalMechanics/RandomCluster/PottsCorrelation.lean:112
noncomputable def connProb (p q : ℝ) (x y : V) : ℝ :=
∑ ω ∈ Finset.univ.filter (fun ω : ConfigSpace (Sym2 V) => Connected G ω x y),
fkProb G p q ω
PhyslibExt/StatisticalMechanics/RandomCluster/EsCorrelations.lean:81
Uses 3
LemmaPotts two-point agreement at least \(1/q\) for \(q \ge 2\), \(\beta J > 0\)#✓fully proved
For q ≥ 2 and βJ > 0, two Potts spins agree with probability at least 1/q.
lemma pottsAgreeProb_ge (q : ℕ) [NeZero q] (β J : ℝ) (x y : V)
(hp : 0 < 1 - Real.exp (-(β * J))) (hp1 : 1 - Real.exp (-(β * J)) < 1)
(hq : 2 ≤ q) :
1 / q ≤ pottsAgreeProb G q β J x y
noncomputable def pottsAgreeProb (q : ℕ) (β J : ℝ) (x y : V) : ℝ :=
∑ σ ∈ Finset.univ.filter (fun σ : V → Fin q => σ x = σ y), Potts.pottsProb G q β J σ
PhyslibExt/StatisticalMechanics/RandomCluster/PottsCorrelation.lean:112
Uses 11
Loading dependency explorer…
The dependency explorer needs JavaScript and its graph data.