Alphabeta Math
CorollaryStatement: 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.

Uniform bound on average H mass — Corollary 2.6

PDF p. 16: Corollary 2.6

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. Connected means that every two vertices can be joined by a finite edge path. Let d∗≥0 and α≤1/5, and suppose G is an (n,d∗,α)-expander, meaning that ∥A−(d∗/n)J∥≤αd∗ for the all-ones matrix J and the Euclidean operator norm. Let θ be a stable state: a local minimum on the phase torus of EG(θ)=12∑x,y∈VAxy(1−cos⁡(θx−θy)). Choose phase representatives in (−π,π] after a common rotation for which ρ1=n−1∑x∈Veiθx is real and nonnegative. Define H(t)=sin⁡2(∣t∣) for ∣t∣≤π/2 and H(t)=1 for π/2≤∣t∣≤π. Then

1n∑x∈VH(θx)≤5α22.

Facts & Assumptions

[F1]

Under the statement’s connectedness, stability and normalization hypotheses, Lemma 2.3 gives nα2≥ρ12∑xH(θx) (Order parameter control of total H mass — Lemma 2.3).

[F2]

When additionally 0≤α≤1/5, Lemma 2.5 gives ρ12≥1−3α (Tractable order parameter inequalities — Lemma 2.5). Both suppliers carry countable choice (The Axiom of Countable Choice (AC_ω)).

[F3]

The adjacency entries record edges; the expander condition is the stated operator-norm bound (Adjacency, degrees, graph Laplacian, and spectral notation, Adjacency spectral expander — Definition 1.3). For real t, the phasor eit has unit modulus and is 2π-periodic (Phasors, trigonometric identities and periodic derivatives). The definition of H gives H(0)=0 (Truncated sine-square function).

[F4]

Phase classes modulo 2π are identified bijectively with unit-circle points by [t]↦(cos⁡t,sin⁡t) (Finite phase tori, local lifts and the flat metric). Since eit=cos⁡t+isin⁡t and ei0=1, equality eit=1 therefore implies [t]=[0] (Phasors, trigonometric identities and periodic derivatives).

Proof

Given: The connected expander, normalized stable state and parameters in the Statement, under countable choice.

Goal: Bound the average of H by 5α2/2.

1.1F1F2givenalgebra

If d∗>0, the nonnegative operator norm and the expander inequality imply α≥0. By [F2], ρ12≥1−3α≥2/5. Combining this positive lower bound with [F1] and dividing by nρ12 gives n−1∑xH(θx)≤α2/ρ12≤5α2/2.

2.1F3F4givenstep 1.1algebra∎

If d∗=0, the expander bound gives ∥A∥=0, so A is the zero matrix. Connectedness and nonemptiness then force n=1. The normalized first order parameter is the single unit phasor eiθ1, which is real and nonnegative, hence equals 1. By [F4], [θ1]=[0], so θ1=2πk for an integer k. The representative condition −π<θ1≤π gives −1/2<k≤1/2, forcing k=0. Hence θ1=0 and H(θ1)=0. Thus the claimed bound also holds in this case, regardless of the sign of α. Together with step 1.1 this proves the claim.

Source notes

The original Corollary 2.6 is attributed to the article, PDF p. 16. Section 2.1, PDF p. 11, supplies its standing connectedness and normalization conventions. The argument above uses the completed mathematical suppliers; the article citation is attribution rather than a premise.

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