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

Small-alpha first parameter and regular H mass

Statement

Assume countable choice. Let G=(V,E) be a finite connected undirected graph, with n=∣V∣>0, symmetric binary adjacency matrix A, and self-loops allowed and counted once in each row sum. Suppose every row sum is d≥0, let α≥0, and assume ∥Δ∥≤αd, where Δ=A−(d/n)J and J is the all-ones matrix; the norm is the Euclidean operator norm. Let θ be a stable state, meaning a local minimum on the phase torus of EG(θ)=12∑x,yAxy(1−cos⁡(θx−θy)). Choose representatives in (−π,π] after common rotation so that ρ1≥0 is real, where ρk=n−1∑xeikθx. Put X=ρ12, r=∣ρ2∣, and M=n−1∑xH(θx), where H(t)=sin⁡2∣t∣ for ∣t∣≤π/2 and H(t)=1 for π/2≤∣t∣≤π.

For 0≤α≤0.24585 one has M≤5α2/4. If additionally α≤1/10, then X≥1−2α.

Facts & Assumptions

[F1]

The refined regular mass bound is M≤α2(1−X)/X when d>0 and X>0; when d=0, X=1 and M=0 (Refined H mass bound in a regular graph).

[F2]

In the stated range X≥451/1000 and r≥1−5α2 (Rational bootstrap through the regular endpoint, Both tractable inequalities at the regular endpoint).

[F3]

Regular Lemma 2.1 gives X≥(1+r2)/2−3α/2 (First and second order parameter inequality — Lemma 2.1).

[F10]

Definition or convention used in the Statement: Adjacency, degrees, graph Laplacian, and spectral notation.

[F11]

Definition or convention used in the Statement: Adjacency spectral expander — Definition 1.3.

[F12]

Definition or convention used in the Statement: Equilibria, stable states, synchronized states, and spurious minima.

[F13]

Definition or convention used in the Statement: Daido order parameters.

[F14]

Definition or convention used in the Statement: Bounds, saturation, and rotation of order parameters.

[F15]

Definition or convention used in the Statement: Truncated sine-square function.

[F16]

Definition or convention used in the Statement: Centered graph matrices and reference degree.

[F17]

Definition or convention used in the Statement: Loewner order, Hermitian inner product, and operator norm.

[F18]

Definition or convention used in the Statement: Phasors, trigonometric identities and periodic derivatives.

[F19]

Definition or convention used in the Statement: The Axiom of Countable Choice (AC_ω).

Proof

Given: The graph, stable normalized state, parameters and notation in the Statement.

Goal: Establish all the asserted estimates.

1.1F1F2givenalgebra

The degree-zero case is immediate from [F1]. Otherwise apply [F2] in [F1] to get M≤(549/451)α2≤(5/4)α2, since 4⋅549=2196<2255=5⋅451. This proves the mass bound through 0.24585.

2.1F2F3givenalgebra∎

If α≤1/10, then 1−5α2≥0. Substituting its square into [F3] gives X≥1−3α/2−5α2+(25/2)α4. Since 5α2≤α/2, this is at least 1−2α. This proves the additional claim.

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.