Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedverified 2026-10-22 (gpt-6.1-sol)
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

A strict polymer majorant gives a zero-free finite partition function

Statement

Let Γ be an at most countable set (finite or in bijection with N) and let ∼ be a reflexive symmetric relation on Γ (γ∼γ and γ∼η implies η∼γ). Let V⊆Γ be finite, and fix maps w:V→C and a:V→[0,∞) and a radius r>0. Call X⊆V compatible when no two distinct elements of X are related by ∼. Suppose there is ε∈(0,1] such that

∑η∈Vη∼γr∣wη∣eaη≤(1−ε)aγ(γ∈V).

For t∈C, define ZV(t):=∑X⊆Vand X is compatible∏γ∈X(twγ). Define the connected series

LV(t):=∑n=1∞tnn!∑γ1,…,γn∈VUn(γ1,…,γn)∏i=1nwγi.

Then LV converges absolutely and uniformly on every closed subdisc strictly inside ∣t∣<r, may be differentiated there term by term, and satisfies ZV(t)=exp⁡(LV(t)) for ∣t∣<r. Thus ZV has no zero in this disc. Here an analytic logarithm of ZV on the disc means a holomorphic function L with exp⁡(L(t))=ZV(t) there; the logarithm LV is normalized by LV(0)=0.

Facts & Assumptions

Given: The finite polymer model, weights, radius, and strict majorant in the Statement.

[F1]

Abstract polymer model and connected coefficients: for finite V, ZV sums products of activities over compatible subsets, and Un is a real-valued sum of connected graph products with edge weight −1{γi∼γj}∈{−1,0}.

[F2]

Rooted connected polymer sums obey the tree majorant: if ∑η∼γ∣zη∣eaη≤aγ, then the rooted connected-cluster sum with root γ is at most eaγ.

[F3]

The complex exponential by its power series and exp⁡(z+w)=exp⁡z exp⁡w, and the complex exponential extends the real exponential: the complex exponential is defined by its everywhere convergent power series and satisfies exp⁡(u+v)=exp⁡(u)exp⁡(v).

[F4]

Inside its disc of convergence a complex power series is holomorphic and may be differentiated term by term: a complex power series differentiates term by term at every point strictly inside its radius of convergence.

[F5]

Real and imaginary parts, complex conjugation, and modulus and Conjugation is an involutive real-field automorphism, zz‾=∣z∣2, and modulus is definite, multiplicative, and subadditive: for z=x+iy, ∣z∣=x2+y2; complex modulus is nonnegative, multiplicative and subadditive. The canonical real-embedding identity is stated in Complex modulus restricts to real absolute value. Its current imported carrier is marked published and has provenance.proof: ai-generated, but records only verification.precheck: pass, with no verification.audited or verification.verified; the format pass does not evidence proof acceptance. Repeated subadditivity gives the finite-sum triangle inequality.

[F6]

The sum ∑i∈Sai over a finite index set, and its product form: real and natural sums and products over finite sets are defined by any enumeration, independently of the enumeration; finite complex sums and products use the same enumeration-independent recursion specified in Abstract polymer model and connected coefficients.

[A1]

For every γ∈V, ∑η∈V, η∼γr∣wη∣eaη≤(1−ε)aγ.

Proof

Given: The definitions [F1], the rooted estimate [F2], and [A1].

1.1F1F6algebra

Write fij=−1{γi∼γj}. Reflexivity makes ∏i<j(1+fij) zero when a tuple repeats a polymer, and otherwise this product is one exactly for a compatible subset. Hence ZV(t)=∑n≥0tnn!∑γ⃗∈Vn(∏iwγi)∏i<j(1+fij) as a formal series. Expanding the pair product gives all simple graphs. A set partition of [n] is a finite family of nonempty pairwise-disjoint blocks whose union is [n]; write Πn for the set of such partitions. This set is finite since it is contained in P(P([n])). The connected components of each finite graph give its unique partition into connected graph blocks. Each graph's edge weight factors over these blocks. The coefficient of tn in exp⁡(LV(t)) is 1n!∑π∈Πn∑γ⃗∈Vn(∏B∈πU∣B∣(γ⃗B))(∏i=1nwγi): for ordered block sizes m1,…,mk, assigning the n labels to those blocks contributes n!/(m1!⋯mk!), and the exponential's factor 1/k! removes the ordering of the k blocks. These factors leave exactly the connected-component expansion of the all-graph coefficient. Thus ZV and exp⁡(LV) have identical formal coefficients.

1.2A1F2F5F6algebra

Let dn be the coefficient of tn in LV, and apply [F2] to the finite polymer set V with activities rwη. Since r>0, [F5] gives ∣rwη∣=r∣wη∣, so [A1] implies the rooted criterion. For each fixed root γ1, the nth nonnegative term of that rooted sum is at most eaγ1. The finite-sum triangle inequality, multiplicativity in [F5], and agreement of the complex modulus with real absolute value give rn∣dn∣≤1n!∑γ1∈Vr∣wγ1∣∑γ2,…,γn∈V∣Un(γ1,…,γn)∣∏j=2n∣rwγj∣≤1n∑γ∈Vr∣wγ∣eaγ. Thus on ∣t∣≤s<r, the series is dominated by a constant times ∑n≥1(s/r)n/n, and its derivative series by a constant times ∑n≥1(s/r)n−1. Both converge uniformly on every such closed subdisc.

2.1F3F4step 1.1step 1.2∎

By [F4], LV differentiates term by term throughout ∣t∣<r. For each fixed t with ∣t∣<r, step 1.2 gives ∑n≥1∣dn∣∣t∣n<∞, so the total absolute sum after expanding exp⁡(LV(t)) is at most ∑k≥0(∑n≥1∣dn∣∣t∣n)k/k!<∞. The products may therefore be regrouped by total degree; their coefficients are the formal coefficients identified in step 1.1, so ZV(t)=exp⁡(LV(t)) on the disc. By [F3], exp⁡(LV(t))exp⁡(−LV(t))=1, so ZV(t) is nonzero and LV is its analytic logarithm with LV(0)=0.

Depends on

Dependency tree · 2 levels

Sources