Theorem 5.2 (Lee–Yang polydisc) — Potts color-field zero-freeness near in three regimes
OpenPottsCIZeroFree.Supplement.theorem_5_2Let be integers with . Write for the class of finite simple graphs of maximum degree at most and, for , for those graphs in of girth at least (an acyclic graph has girth ). Each of the parameter assumptions
- ;
- and ;
- and
yields the following. In cases 1 and 2 put ; in case 3 there is an integer for which . There is such that, for every and every pinning (proper or not),
where is the normalized pinned field polynomial (38). If is proper on , then also the pinned field polynomial under the same polydisc condition on provided for every ; in particular whenever for every vertex and every color .
This is the Lee–Yang analogue of the edge-activity theorem: zero-freeness in independent complex color fields around the uniform field, uniformly over the graph class and the pinning.
Formalization Note The three cases are the three conjuncts. are natural numbers and the thresholds are real inequalities, with . Girth is Mathlib's SimpleGraph.egirth : ℕ∞. (and ) are chosen after and before the graph. The conclusion is the definition PolydiscZeroFree.
Differences from the source:
- encoding: girth with acyclic graphs of girth →
(g : ℕ∞) ≤ G.egirth, Mathlib's extended girth, which is⊤exactly for acyclic graphs; reason: same graphs. - encoding: integers, →
q Δ : ℕ,(1809/1000 : ℝ) * Δ ≤ q; reason: every threshold forces , so no instance is lost. - encoding: , colors →
lam : V → Fin q → ℂ, colorsFin q; reason: Lean convention, same instances. - reading: "the corresponding statement for follows from (39) provided " for a proper pinning → the conclusion clause " whenever on and on ", with the same , and "proper pinning" read as proper on (
pinnedMono G Λ τ = 0); reason: this is what (39) yields and is the paper's usage of "proper on " (p.2, p.26).
import Mathlib import Definitions.Def_PottsCIZeroFree_normPinnedPoly import Definitions.Def_PottsCIZeroFree_Supplement_fieldNormPinned open Classical
namespace PottsCIZeroFree.Supplement
open PottsCIZeroFree
/-- Theorem 5.2 (Lee–Yang polydisc) of Shao, Shi, *Coupling Independence Implies Zero-Freeness*,
arXiv:2610.12456 (PDF sha256 831a1633…), printed p.27 (PDF p.29). Let `q, Δ` be integers with
`Δ ≥ 2`. Under each of (i) `q ≥ (11/6 − 1/84000)Δ`; (ii) `Δ ≥ 125` and `q ≥ 1.809Δ`;
(iii) `Δ ≥ 3` and `q ≥ Δ + 3`, there is `θ = θ(q, Δ) ∈ (0, 1/2]` such that for every `G` in the
class `𝒢` and every pinning `τ`, `Ẑ^τ_G(λ) ≠ 0` whenever `|λ_{u,c} − 1| < θ` (`u ∈ V^τ`,
`c ∈ [q]`); for a proper pinning the same holds for `Z^τ_G(λ)` provided `λ_{v,τ_v} ≠ 0` on `Λ`,
in particular under the polydisc condition at every vertex and color. In cases (i), (ii)
`𝒢 = 𝒢_Δ` (maximum degree `≤ Δ`); in case (iii) `𝒢 = 𝒢_{Δ,g_LY}` for an integer
`g_LY = g_LY(q, Δ) ≥ 3` (maximum degree `≤ Δ` and girth `≥ g_LY`).
**Formalization Note.** The thresholds are real inequalities on the natural numbers `q, Δ`
(`1.809 = 1809/1000`). Girth is Mathlib's `SimpleGraph.egirth : ℕ∞`, which is `⊤` for acyclic
graphs, matching the paper's convention `girth = +∞` (§2.1, p.7). `θ` and `g_LY` are chosen
after `q, Δ` and before the graph. The conclusion is `PolydiscZeroFree`. -/
theorem theorem_5_2 (q Δ : ℕ) (hΔ : 2 ≤ Δ) :
((11 / 6 - 1 / 84000 : ℝ) * Δ ≤ q →
∃ θ : ℝ, 0 < θ ∧ θ ≤ 1 / 2 ∧
PolydiscZeroFree q (fun {V} [Fintype V] (G : SimpleGraph V) => MaxDegLE G Δ) θ) ∧
(125 ≤ Δ ∧ (1809 / 1000 : ℝ) * Δ ≤ q →
∃ θ : ℝ, 0 < θ ∧ θ ≤ 1 / 2 ∧
PolydiscZeroFree q (fun {V} [Fintype V] (G : SimpleGraph V) => MaxDegLE G Δ) θ) ∧
(3 ≤ Δ ∧ Δ + 3 ≤ q →
∃ gLY : ℕ, 3 ≤ gLY ∧ ∃ θ : ℝ, 0 < θ ∧ θ ≤ 1 / 2 ∧
PolydiscZeroFree q
(fun {V} [Fintype V] (G : SimpleGraph V) => MaxDegLE G Δ ∧ (gLY : ℕ∞) ≤ G.egirth) θ) := by sorry
end PottsCIZeroFree.Supplement