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.
Regular-graph numerical contradiction threshold
PDF p. 29: Proof of Theorem 1.4, equation (5.1)
Statement
Assume countable choice. Let be a finite connected undirected graph with , symmetric binary adjacency matrix , and self-loops allowed and counted once in the degree. Suppose every row sum is and , where is the all-ones matrix, the norm is the Euclidean operator norm, and . Let be a stable state: a local minimum on the phase torus of . Rotate all phases together so that is real and nonnegative, and use representatives . For , put . Then the condition is impossible.
Statement references
Adjacency, degrees, graph Laplacian, and spectral notation
Adjacency spectral expander — Definition 1.3
Equilibria, stable states, synchronized states, and spurious minima
Bounds, saturation, and rotation of order parameters
Global rotation equivalence of phase configurations
Facts & Assumptions
For these graph and normalized stability hypotheses, , since (Refined order estimates for regular graphs — Remark 2.7).
Define for and for , and put . If and , then ; if , then (Truncated sine-square function, Refined H mass bound in a regular graph).
The function is nonnegative and is nondecreasing on (Elementary properties of the function H).
The phase-tail definition identifies with the vertices whose principal representatives have absolute value at least (Phase tail sets for amplification).
A common rotation can make real and nonnegative, including when ; each resulting phase has a unique representative in (Bounds, saturation, and rotation of order parameters).
A common rotation adds the same phase to every coordinate and preserves the energy (Global rotation equivalence of phase configurations). A stable state is a local minimum in the phase-torus topology; common rotations preserve such local minima (Equilibria, stable states, synchronized states, and spurious minima, Justification).
Proof
Given: The graph, stable state before normalization, and angle in the Statement, with countable choice as assumed there.
Goal: Prove that the stated lower bound on cannot hold.
By [F5], choose a common rotation making the first order parameter real and nonnegative; when the original , take . Addition of a fixed phase is continuous in the torus coordinates and has the continuous inverse , so is a homeomorphism. If is a neighborhood witnessing local minimality at the original state, then is a neighborhood of the rotated state. For every , energy invariance in [F6] gives . Thus the rotated state is stable. Choose its principal representatives using [F5] and denote this normalized stable state again by . Consequently the hypotheses of [F1] and [F2], including countable choice, apply to this state.
By [F1], . If , [F2] gives , because . If , [F2] gives . Thus in either case .
For each , [F4] gives . By [F3] and the definition of , ; all other summands are nonnegative. Hence . If the asserted threshold held, this would give , contradicting step 2.1. The condition is therefore impossible.
Source notes
Equation (5.1) on the cited original PDF page gives the rounded threshold retained in the Statement. The preceding prose prints a related expression without a factor of . The proof above establishes the displayed threshold directly using the sharper refined mass estimate; it does not infer it merely by rounding downward to .
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
- Truncated sine-square function
- Phase tail sets for amplification
- Elementary properties of the function H
- Refined order estimates for regular graphs — Remark 2.7
- Refined H mass bound in a regular graph
- The Axiom of Countable Choice (AC_ω)
- Bounds, saturation, and rotation of order parameters
- Global rotation equivalence of phase configurations
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. 29, proof of Theorem 1.4, equation (5.1)