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.
Half-circle lemma — Lemma 2.9
PDF p. 17: Lemma 2.9 and proof; PDF p. 18: Lemma 2.9 and proof
Statement
Assume countable choice. Let be a finite connected undirected graph with nonempty vertex set and possible self-loops. Connected means that any two vertices are joined by a finite path of edges. Let be its binary adjacency matrix, and let be a stable state: a local minimum on of . Choose real representatives , and put . If , then for every .
Statement references
Facts & Assumptions
The adjacency matrix is symmetric and has entries or ; exactly when and are joined by an edge. A self-loop is allowed (Adjacency, degrees, graph Laplacian, and spectral notation).
The phase torus has angular charts with open Euclidean coordinate domains, and a stable state is a local minimum of the displayed smooth energy. A differentiable function at an interior Euclidean local minimum has zero gradient (Finite phase tori, local lifts and the flat metric, Equilibria, stable states, synchronized states, and spurious minima, Fermat's theorem: an interior differentiable local extremum has zero gradient).
Under countable choice, an energy critical point satisfies for every (The Axiom of Countable Choice (AC_ω), Real and complex equilibrium identities).
Under the hypotheses in the Statement, for every vertex , , where (Kernel stability condition — Lemma 2.8).
Sine is positive on . For real , , , and (Pi is the first positive zero of sine, Phasors, trigonometric identities and periodic derivatives).
Proof
Given: The graph, state, representatives, order parameter and countable choice in the Statement.
Goal: Prove that every representative is zero.
Because is finite and nonempty, choose maximizing and put . Then . At any vertex with , [F4] gives . Every difference lies in ; by [F5] its sine is nonpositive and is strictly negative unless . Since the coefficients are nonnegative, every neighbor of has . Repeating this along a finite path from to any vertex shows for all . Self-loops cause no exception.
By [F2], the local minimum is a critical point: apply the Euclidean extremum theorem in an angular chart. Thus [F3] gives the sine equilibrium identity at every vertex. If and both and are nonempty, connectedness gives an edge between them: a path between the two sets has a first crossing edge. Summing the equilibrium identities over , terms with vanish and the remaining terms give . The double sum is positive and , contradicting [F5]. Hence, if , all representatives have one common value .
In the common-value case, the definition of gives . Its being real makes by [F5]. If , then , so [F5] gives and oddness gives , a contradiction. Therefore is impossible. With , step 1.1 gives for every vertex, as required.
Source notes
Lemma 2.9 and its maximal-absolute-phase argument are attributed to Expander graphs are globally synchronizing, PDF pages 17–18. The proof above separately handles the case in which one of the two phase classes is empty.
Depends on
- Kernel stability condition — Lemma 2.8
- Real and complex equilibrium identities
- Adjacency, degrees, graph Laplacian, and spectral notation
- Equilibria, stable states, synchronized states, and spurious minima
- Daido order parameters
- Finite phase tori, local lifts and the flat metric
- Phasors, trigonometric identities and periodic derivatives
- Fermat's theorem: an interior differentiable local extremum has zero gradient
- Pi is the first positive zero of sine
- The Axiom of Countable Choice (AC_ω)
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 pp. 17–18, Lemma 2.9 and proof