Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generated
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.

Cubic estimates used for the order parameter bootstrap

PDF p. 15: Proof of Lemma 2.5, equation (2.11); PDF p. 16: Proof of Lemma 2.5, equation (2.12)

Statement

Assume countable choice. Let G=(V,E) be a finite connected undirected graph, possibly with loops, with n=∣V∣>0 and symmetric binary adjacency matrix A. Let d∗≥0 and 0≤α≤1/5, and suppose ∥A−(d∗/n)J∥≤αd∗, where J is the all-ones matrix and the norm is the Euclidean operator norm. Let θ be a stable state, meaning a local minimum on the phase torus of 12∑x,yAxy(1−cos⁡(θx−θy)). Put ρk=n−1∑xeikθx and rotate all phases together so that ρ1 is real and nonnegative. Set X=ρ12 and, for x>0, f(x,α)=2x+4α−1−(1−2α2/x)2.

Then X>0, 2α2/X<1, f(X,α)≥0, and X>0.431. For x>0, f(x,α)=0 is equivalent to Pα(x)=0, where Pα(x)=x3+(2α−1)x2+2α2x−2α4. Its discriminant, defined by the coefficient formula in Root and sign certificates for parameter-dependent polynomials, is −4α4(27α4+20α3+10α2−8α+1). It is negative for 0<α≤0.2055 and zero at α=0. For 0<α≤1/5, the cubic has exactly one real root; at α=0 its distinct real roots are 0 and 1, while f(⋅,0) has the unique positive root 1. Also f(0.431,α)<0 throughout 0≤α≤1/5.

Facts & Assumptions

[F1]

Under the stated graph and stability hypotheses, X≥(1+∣ρ2∣2)/2−2α; the phase rotation preserves the moduli of the order parameters (First and second order parameter inequality — Lemma 2.1, Bounds, saturation, and rotation of order parameters).

[F2]

For α<1/4, the normalized ρ1 is positive; when it is positive, ∣ρ2∣≥1−2α2/X (Positive first order parameter — Corollary 2.2, Lower bound for the second order parameter — Corollary 2.4).

Proof

Given: The graph, stable state, normalization, and parameter range in the Statement, under countable choice.

Goal: Establish the order-parameter estimates and the stated polynomial assertions.

1.1F1F2givenalgebra

By [F2], X>0. If X≤2α2, then [F1] gives 2α2≥X≥1/2−2α. But 2α2+2α≤2/25+2/5=12/25<1/2, a contradiction. Thus 1−2α2/X>0. Squaring the lower bound in [F2] is therefore valid; substituting it in [F1] gives 2X+4α−1≥(1−2α2/X)2, or f(X,α)≥0.

1.2F3givenalgebra

Multiplication by x2/2>0 gives x2f(x,α)/2=Pα(x) for x>0. Substitution of the coefficients of Pα into the discriminant formula in [F3] gives the displayed expression. Write q(a)=27a4+20a3+10a2−8a+1. For 0≤a≤411/2000<21/100, q′(a)≤108(21/100)3+60(21/100)2+20(21/100)−8<0. Hence q(a)≥q(411/2000)=327454507/16000000000000>0 by [F3]. The discriminant therefore has the asserted signs.

2.1F3step 1.2givenalgebra

For 0<α≤1/5, Pα(0)=−2α4<0 and Pα(x)→+∞ as x→+∞, so [F3] gives a positive real root r. Divide by x−r to write Pα(x)=(x−r)(x2+bx+c) with real b,c. Direct expansion of the discriminant formula gives Δ=(b2−4c)(r2+br+c)2. Since step 1.2 gives Δ<0, b2−4c<0, so the quadratic has no real root by completing the square. Thus r is the unique real root. At α=0, P0(x)=x2(x−1) and f(x,0)=2x−2 for x>0, giving the stated endpoint roots.

3.1F3step 1.1step 1.2step 2.1givenalgebra∎

Put u=431/1000. For 0≤a≤1/5, 1−2a2/u≥1−(2/25)/u>0, so ∂f(u,a)/∂a=4+(8a/u)(1−2a2/u)>0. By [F3], f(u,a)≤f(u,1/5)=2P1/5(u)/u2<0, because P1/5(u)=−113609/1000000000. For a>0, step 2.1 and the intermediate value theorem imply that Pa is negative to the left of its unique root: otherwise continuity would produce another root between that point and u or between u and the existing root. Since f(X,a)≥0 and f(u,a)<0, X lies to the right of u. For a=0, step 1.1 gives f(X,0)=2X−2≥0, so X≥1>u. This proves all claims.

Source notes

The cited article states that the discriminant is strictly negative for α<0.2055. At the allowed endpoint α=0 the displayed discriminant is zero. The proof above treats that endpoint separately; this correction does not by itself refute the order-parameter conclusion.

Depends on

Used by · 1

Dependency tree · 2 levels

Each result is drawn at its shortest distance from this item. Arrows run from prerequisites to the items that use them; this item has a heavier outline. External source nodes link directly to the cited text. The view shows up to two dependency steps; open a prerequisite to continue.

Sources