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.
Refined order estimates for regular graphs — Remark 2.7
PDF p. 16: Remark 2.7; Section 5 discussion; PDF p. 29: Remark 2.7; Section 5 discussion
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 . For , the stronger first bound holds. The regular version of the article's bootstrap uses, for , ; its associated polynomial is . The article prints the last sign as positive; the corrected algebra does not change the quantitative conclusions above.
As a separately attributed assertion, the final sentence of Remark 2.7 gives for a -regular -expander and a stable state , under the article's standing connectedness and phase-normalization conventions. That sentence states no explicit restriction on . Its scope beyond is retained here as a source assertion; the local proof establishes the range-qualified estimates above.
Facts & Assumptions
The endpoint extension proves and for (Both tractable inequalities at the regular endpoint).
The regular small-alpha and mass estimates give for and throughout (Small-alpha first parameter and regular H mass).
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 the estimates on the explicitly stated parameter ranges and the corrected polynomial identity.
All graph, stability, rotation and nonnegative-parameter hypotheses agree with those of [F1] and [F2]. Apply [F1] on to obtain both extended Lemma 2.5 inequalities. Apply [F2] on the same range for the mass estimate and on for the stronger first-parameter estimate.
For , expand the square in the definition of and multiply by : . This proves the asserted polynomial identity. In particular the printed positive constant term is an algebraic transcription error, while the range-qualified quantitative conclusions have been established independently in step 1.1.
Source notes
Remark 2.7 on original PDF p. 16 asserts all the estimates retained here. Its printed cubic is . The last sign is a typo: multiplying by gives the corrected in the Statement. This algebraic defect does not refute any order-parameter conclusion. The present proof keeps the source's regular Hessian inequality and pointwise-to-norm method, strengthens the norm step by removing the constant phase-vector component, and supplies a finite rational bootstrap in place of the source's unprovided endpoint root calculation. The source's final sentence attributes to the proof of Corollary 2.6 for a -regular -expander, without an explicit restriction in that sentence. The preceding sentences discuss and , while Corollary 2.6 itself assumes . The unrestricted reading of the final sentence is therefore preserved as attributed coverage, with its intended inherited range left unspecified. The local mass estimate is established for , including the later application . The broader reading is neither established nor refuted here, and no failure of an order-parameter or synchrony conclusion is inferred.
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_ω)
- Both tractable inequalities at the regular endpoint
- Small-alpha first parameter and regular H mass
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; pp. 12–16, equations (2.8)–(2.12) and Remark 2.7; p. 29, Section 5 opening