Theorem 5.6 (Log-concave Holant polytube) — graph-uniform zero-free polytubes around
OpenPottsCIZeroFree.Supplement.theorem_5_6Fix an integer and a finite family of log-concave symmetric Boolean signatures with for every . For every there is such that the following holds. For every finite simple graph of maximum degree at most , every assignment with of arity , and every ,
where and each activity is perturbed independently. In particular:
- the union is an open zero-free neighborhood of ;
- on the diagonal , throughout the open set
which depends only on 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 is a function of , chosen after and before the graph; the "in particular" clauses are stated with that same function. Activities are z : G.edgeSet → ℂ; is the number of neighbors of ; is the published nbhd.
Differences from the source:
- encoding: for every → one function
ε : ℝ → ℝwithε R > 0forR > 0, chosen before the graph; reason: equivalent by choice, and it lets the union over be written. - encoding: signature → structure
SymSigwitharity,val : Fin (arity+1) → ℝ,0 ≤ val, evaluated as past the arity; reason: same signatures, and values past the arity never occur. - encoding: "open zero-free neighborhood of " → three clauses: the union is open, contains , and zero-freeness on each polytube (the main clause); reason: same content.
import Mathlib import Definitions.Def_PottsCIZeroFree_normPinnedPoly import Definitions.Def_PottsCIZeroFree_Supplement_holantPoly open Classical
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