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.
Adjacency spectral expander — Definition 1.3
PDF p. 6: Definition 1.3; PDF p. 7: Definition 1.3 and continuation
Definition
Let be a finite undirected graph with vertices and adjacency matrix . Its entries record adjacency, including any diagonal loop entries under the graph convention. Let be the all-ones matrix, and let and be real parameters. The centered adjacency matrix is . Its operator norm is , where and .
The graph is an -expander if , equivalently, if . The reference parameter need not be the degree of every vertex; this definition does not require regularity.
Definition references
Justification
The graph notation supplies the finite vertex set and adjacency matrix, with the stated diagonal convention (Adjacency, degrees, graph Laplacian, and spectral notation). Since , the centered-matrix definition supplies the uniquely defined matrix for each real (Centered graph matrices and reference degree). The operator norm is finite and well defined on this finite-dimensional vertex space (Loewner order, Hermitian inner product, and operator norm). Consequently the displayed inequality is a well-defined predicate, and its two forms agree by substitution. The inequality itself imposes any restrictions needed on the product ; no positivity assumption is needed merely to define the predicate.
Source notes
The definition is attributed to Expander graphs are globally synchronizing, Definition 1.3. The article's subsequent regular-graph spectral characterization is stated separately.
Depends on
Used by · 31
- Regular spectral characterization and notation convention
- Ramanujan graph convention used in the article
- Two-sided spectral expander — Definition 1.9
- Regular adjacency expansion supplies two-sided expansion
- Internal-edge mixing bound — Lemma 3.3
- Total incident edge bounds — Lemma 3.6
- The reported centered-adjacency estimate and its sparse-law limit
- Typical regular graphs are almost Ramanujan
- Spectral estimates for phase Fourier sums
- First and second order parameter inequality — Lemma 2.1
- Positive first order parameter — Corollary 2.2
- Quantitative synchronization speed from random initial conditions
- Order parameter control of total H mass — Lemma 2.3
- Lower bound for the second order parameter — Corollary 2.4
- Cubic estimates used for the order parameter bootstrap
- Tractable order parameter inequalities — Lemma 2.5
- Uniform bound on average H mass — Corollary 2.6
- Refined order estimates for regular graphs — Remark 2.7
- Expansion and the distribution of phases in stable states
- Contradiction threshold for amplification
- Regular-graph numerical contradiction threshold
- Numerical amplification argument for alpha 0.0816
- Regular spectral expansion implies synchronization — Theorem 1.4
- Ramanujan and typical regular graphs synchronize for degree at least 600
- Analytic versus numerical regular-expander bounds — Remark 1.5
- Mean-zero projection of the regular phase vector
- Refined H mass bound in a regular graph
- Rational bootstrap through the regular endpoint
- Both tractable inequalities at the regular endpoint
- Small-alpha first parameter and regular H mass
- All critical PSD equilibria synchronize on positive regular expanders
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. 6, Section 1.2 and Definition 1.3