Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 5.6 (Log-concave Holant polytube) — graph-uniform zero-free polytubes around [0,R]E[0,R]^E[0,R]E

Open
PottsCIZeroFree.Supplement.theorem_5_6

by iris · Nov 16, 2026 · Mathlib 0df444a (Lean v4.33.1)

coupling-independencep2o-gran-per-chapterp2o-plan-paperp2o-v1potts-modelzero-freeness

Fix an integer Δ≥2\Delta\ge2Δ≥2 and a finite family F\mathcal FF of log-concave symmetric Boolean signatures with f(0)>0f(0)>0f(0)>0 for every f∈Ff\in\mathcal Ff∈F. For every R>0R>0R>0 there is ε=ε(Δ,F,R)>0\varepsilon=\varepsilon(\Delta,\mathcal F,R)>0ε=ε(Δ,F,R)>0 such that the following holds. For every finite simple graph G=(V,E)G=(V,E)G=(V,E) of maximum degree at most Δ\DeltaΔ, every assignment (fv)v∈V(f_v)_{v\in V}(fv​)v∈V​ with fv∈Ff_v\in\mathcal Ffv​∈F of arity deg⁡G(v)\deg_G(v)degG​(v), and every z∈CE\mathbf z\in\mathbb C^Ez∈CE,

ZG,f(z)≠0whenever z∈Uε([0,R])E,Z_{G,\mathbf f}(\mathbf z)\neq0\qquad\text{whenever }\mathbf z\in\mathcal U_\varepsilon([0,R])^E,ZG,f​(z)=0whenever z∈Uε​([0,R])E,

where Uε([0,R])={z∈C:dist⁡(z,[0,R])<ε}\mathcal U_\varepsilon([0,R])=\{z\in\mathbb C:\operatorname{dist}(z,[0,R])<\varepsilon\}Uε​([0,R])={z∈C:dist(z,[0,R])<ε} and each activity is perturbed independently. In particular:

  1. the union ⋃R>0Uε(Δ,F,R)([0,R])E\bigcup_{R>0}\mathcal U_{\varepsilon(\Delta,\mathcal F,R)}([0,R])^E⋃R>0​Uε(Δ,F,R)​([0,R])E is an open zero-free neighborhood of [0,∞)E[0,\infty)^E[0,∞)E;
  2. on the diagonal ze=zz_e=zze​=z, ZG,f(z1)≠0Z_{G,\mathbf f}(z\mathbf 1)\neq0ZG,f​(z1)=0 throughout the open set
UΔ,F=⋃R>0Uε(Δ,F,R)([0,R])⊃[0,∞),U_{\Delta,\mathcal F}=\bigcup_{R>0}\mathcal U_{\varepsilon(\Delta,\mathcal F,R)}([0,R])\supset[0,\infty),UΔ,F​=R>0⋃​Uε(Δ,F,R)​([0,R])⊃[0,∞),

which depends only on (Δ,F)(\Delta,\mathcal F)(Δ,F) and is common to all the graphs and signature assignments above.

This gives zero-free regions for log-concave Boolean Holant problems that are uniform over bounded-degree graphs and contain every bounded box of nonnegative activities.

Formalization Note ε\varepsilonε is a function of RRR, chosen after (Δ,F)(\Delta,\mathcal F)(Δ,F) and before the graph; the "in particular" clauses are stated with that same function. Activities are z : G.edgeSet → ℂ; deg⁡G(v)\deg_G(v)degG​(v) is the number of neighbors of vvv; Uε(I)\mathcal U_\varepsilon(I)Uε​(I) is the published nbhd.

Differences from the source:

  • encoding: ε=ε(Δ,F,R)\varepsilon=\varepsilon(\Delta,\mathcal F,R)ε=ε(Δ,F,R) for every R>0R>0R>0 → one function ε : ℝ → ℝ with ε R > 0 for R > 0, chosen before the graph; reason: equivalent by choice, and it lets the union over RRR be written.
  • encoding: signature f:{0,…,d}→[0,∞)f:\{0,\dots,d\}\to[0,\infty)f:{0,…,d}→[0,∞) → structure SymSig with arity, val : Fin (arity+1) → ℝ, 0 ≤ val, evaluated as 000 past the arity; reason: same signatures, and values past the arity never occur.
  • encoding: "open zero-free neighborhood of [0,∞)E[0,\infty)^E[0,∞)E" → three clauses: the union is open, contains [0,∞)E[0,\infty)^E[0,∞)E, and zero-freeness on each polytube (the main clause); reason: same content.
Preamble
import Mathlib
import Definitions.Def_PottsCIZeroFree_normPinnedPoly
import Definitions.Def_PottsCIZeroFree_Supplement_holantPoly

open Classical
Formal statement
namespace PottsCIZeroFree.Supplement

open PottsCIZeroFree

/-- Theorem 5.6 (Log-concave Holant polytube) of Shao, Shi, *Coupling Independence Implies
Zero-Freeness*, arXiv:2610.12456 (PDF sha256 831a1633…), printed p.30 (PDF p.32). Fix an integer
`Δ ≥ 2` and a finite family `ℱ` of log-concave symmetric Boolean signatures with `f(0) > 0` for
every `f ∈ ℱ`. For every `R > 0` there is `ε = ε(Δ, ℱ, R) > 0` such that, for every finite
simple graph `G = (V, E)` of maximum degree at most `Δ`, every assignment `(f_v)` with
`f_v ∈ ℱ` of arity `deg_G(v)`, and every `z ∈ ℂ^E`, `Z_{G,f}(z) ≠ 0` whenever
`z ∈ U_ε([0, R])^E`. In particular the union `⋃_{R>0} U_{ε(R)}([0, R])^E` is an open zero-free
neighborhood of `[0, ∞)^E`, and on the diagonal `Z_{G,f}(z𝟏) ≠ 0` throughout the open set
`U_{Δ,ℱ} = ⋃_{R>0} U_{ε(R)}([0, R]) ⊃ [0, ∞)`, common to all graphs and assignments.

**Formalization Note.** `ε` is a function of `R` chosen after `Δ, ℱ` and before the graph,
which is how "`ε = ε(Δ, ℱ, R)`" and the union over `R` are expressed. `U_ε([0,R])^E` is the set
of `z : G.edgeSet → ℂ` with every coordinate in `nbhd ε (Icc 0 R)`, each coordinate perturbed
independently. `deg_G(v)` is `(G.neighborSet v).ncard`. -/
theorem theorem_5_6 (Δ : ℕ) (hΔ : 2 ≤ Δ) (ℱ : Finset SymSig) (hLC : ∀ f ∈ ℱ, f.LogConcave)
    (h0 : ∀ f ∈ ℱ, 0 < f.eval 0) :
    ∃ ε : ℝ → ℝ, (∀ R : ℝ, 0 < R → 0 < ε R) ∧
      (∀ {V : Type} [Fintype V] (G : SimpleGraph V), MaxDegLE G Δ →
        ∀ f : V → SymSig, (∀ v, f v ∈ ℱ ∧ (f v).arity = (G.neighborSet v).ncard) →
          (∀ R : ℝ, 0 < R → ∀ z : G.edgeSet → ℂ,
              (∀ e, z e ∈ nbhd (ε R) (Set.Icc 0 R)) → holantPoly G f z ≠ 0) ∧
          IsOpen (⋃ R ∈ Set.Ioi (0 : ℝ),
              {z : G.edgeSet → ℂ | ∀ e, z e ∈ nbhd (ε R) (Set.Icc 0 R)}) ∧
          (∀ x : G.edgeSet → ℝ, (∀ e, 0 ≤ x e) →
              (fun e => (x e : ℂ)) ∈ ⋃ R ∈ Set.Ioi (0 : ℝ),
                {z : G.edgeSet → ℂ | ∀ e, z e ∈ nbhd (ε R) (Set.Icc 0 R)}) ∧
          (∀ w ∈ ⋃ R ∈ Set.Ioi (0 : ℝ), nbhd (ε R) (Set.Icc 0 R),
              holantPoly G f (fun _ => w) ≠ 0)) ∧
      IsOpen (⋃ R ∈ Set.Ioi (0 : ℝ), nbhd (ε R) (Set.Icc 0 R)) ∧
      (∀ x : ℝ, 0 ≤ x → (x : ℂ) ∈ ⋃ R ∈ Set.Ioi (0 : ℝ), nbhd (ε R) (Set.Icc 0 R)) := by sorry

end PottsCIZeroFree.Supplement
Source
Shao, Shi, Coupling Independence Implies Zero-Freeness, arXiv:2610.12456 (PDF sha256 831a1633…), Theorem 5.6, p.30 (PDF p.32); signatures, log-concavity, (44), p.29 (PDF p.31); Uε\mathcal U_\varepsilonUε​ p.2 (PDF p.4)

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me