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 be a finite connected undirected graph, possibly with loops, with and symmetric binary adjacency matrix . Connected means that every two vertices can be joined by a finite edge path. Let and , and suppose is an -expander, meaning that for the all-ones matrix and the Euclidean operator norm. Let be a stable state: a local minimum on the phase torus of . Choose phase representatives in after a common rotation for which is real and nonnegative. Define for and for . Then
Statement references
Facts & Assumptions
Under the statement’s connectedness, stability and normalization hypotheses, Lemma 2.3 gives (Order parameter control of total H mass — Lemma 2.3).
When additionally , Lemma 2.5 gives (Tractable order parameter inequalities — Lemma 2.5). Both suppliers carry countable choice (The Axiom of Countable Choice (AC_ω)).
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 , the phasor has unit modulus and is -periodic (Phasors, trigonometric identities and periodic derivatives). The definition of gives (Truncated sine-square function).
Phase classes modulo are identified bijectively with unit-circle points by (Finite phase tori, local lifts and the flat metric). Since and , equality therefore implies (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 by .
If , the nonnegative operator norm and the expander inequality imply . By [F2], . Combining this positive lower bound with [F1] and dividing by gives .
If , the expander bound gives , so is the zero matrix. Connectedness and nonemptiness then force . The normalized first order parameter is the single unit phasor , which is real and nonnegative, hence equals . By [F4], , so for an integer . The representative condition gives , forcing . Hence and . 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
- Order parameter control of total H mass — Lemma 2.3
- Tractable order parameter inequalities — Lemma 2.5
- Truncated sine-square function
- Equilibria, stable states, synchronized states, and spurious minima
- Adjacency spectral expander — Definition 1.3
- Adjacency, degrees, graph Laplacian, and spectral notation
- Daido order parameters
- Phasors, trigonometric identities and periodic derivatives
- The Axiom of Countable Choice (AC_ω)
- Finite phase tori, local lifts and the flat metric
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
- Expander graphs are globally synchronizing · PDF p. 11, Section 2.1 standing conventions; p. 16, Corollary 2.6