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.
Both tractable inequalities at the regular endpoint
Statement
Assume countable choice. Let be a finite connected undirected graph, with , symmetric binary adjacency matrix , and self-loops allowed and counted once in each row sum. Suppose every row sum is , let , and assume , where and 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 . Choose representatives in after common rotation so that is real, where . Put , , and , where for and for .
For , one has and .
Facts & Assumptions
The rational bootstrap gives (Rational bootstrap through the regular endpoint).
Since , Corollary 2.4 gives (Lower bound for the second order parameter — Corollary 2.4).
Regular Lemma 2.1 gives (First and second order parameter inequality — Lemma 2.1).
Definition or convention used in the Statement: Adjacency, degrees, graph Laplacian, and spectral notation.
Definition or convention used in the Statement: Adjacency spectral expander — Definition 1.3.
Definition or convention used in the Statement: Equilibria, stable states, synchronized states, and spurious minima.
Definition or convention used in the Statement: Daido order parameters.
Definition or convention used in the Statement: Bounds, saturation, and rotation of order parameters.
Definition or convention used in the Statement: Truncated sine-square function.
Definition or convention used in the Statement: Centered graph matrices and reference degree.
Definition or convention used in the Statement: Loewner order, Hermitian inner product, and operator norm.
Definition or convention used in the Statement: Phasors, trigonometric identities and periodic derivatives.
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.
By [F1], and . Thus [F2] gives . Also , so the new right side is positive.
Square the nonnegative lower bound of step 1.1 and substitute into [F3] to obtain . Since , one has . Discard the nonnegative fourth-power term to conclude . Together with step 1.1, this proves both original Lemma 2.5 conclusions throughout the stated range.
Depends on
- Adjacency, degrees, graph Laplacian, and spectral notation
- Adjacency spectral expander — Definition 1.3
- Equilibria, stable states, synchronized states, and spurious minima
- Daido order parameters
- Bounds, saturation, and rotation of order parameters
- Truncated sine-square function
- Centered graph matrices and reference degree
- Loewner order, Hermitian inner product, and operator norm
- Phasors, trigonometric identities and periodic derivatives
- The Axiom of Countable Choice (AC_ω)
- Rational bootstrap through the regular endpoint
- Lower bound for the second order parameter — Corollary 2.4
- First and second order parameter inequality — Lemma 2.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.