Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generated
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 G=(V,E) 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 A be its binary adjacency matrix, and let θ be a stable state: a local minimum on TV=RV/(2πZ)V of EG(θ)=12∑x,y∈VAx,y(1−cos⁡(θx−θy)). Choose real representatives θx∈(−π/2,π/2), and put ρ1=∣V∣−1∑x∈Veiθx. If ρ1∈[0,1], then θx=0 for every x∈V.

Facts & Assumptions

[F1]

The adjacency matrix is symmetric and has entries 0 or 1; Ax,y=1 exactly when x and y are joined by an edge. A self-loop is allowed (Adjacency, degrees, graph Laplacian, and spectral notation).

[F2]

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).

[F3]

Under countable choice, an energy critical point satisfies ∑x∈VAx,ysin⁡(θx−θy)=0 for every y (The Axiom of Countable Choice (AC_ω), Real and complex equilibrium identities).

[F4]

Under the hypotheses in the Statement, for every vertex y, ∑x∈VAx,yK(θx,θy)≥0, where K(a,b)=sin⁡(∣a∣−min⁡{∣b∣,π/2}) (Kernel stability condition — Lemma 2.8).

[F5]

Sine is positive on (0,π). For real t, eit=cos⁡t+isin⁡t, eite−it=1, and sin⁡(−t)=−sin⁡t (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.

1.1F1F4F5givenalgebra

Because V is finite and nonempty, choose z maximizing ∣θz∣ and put c=∣θz∣. Then 0≤c<π/2. At any vertex y with ∣θy∣=c, [F4] gives 0≤∑xAx,ysin⁡(∣θx∣−c). Every difference ∣θx∣−c lies in (−π,0]; by [F5] its sine is nonpositive and is strictly negative unless ∣θx∣=c. Since the coefficients are nonnegative, every neighbor x of y has ∣θx∣=c. Repeating this along a finite path from z to any vertex shows ∣θx∣=c for all x∈V. Self-loops cause no exception.

2.1F1F2F3F5step 1.1algebra

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 c>0 and both S={x:θx=c} and V∖S={x:θx=−c} are nonempty, connectedness gives an edge between them: a path between the two sets has a first crossing edge. Summing the equilibrium identities over y∈V∖S, terms with x∈V∖S vanish and the remaining terms give 0=sin⁡(2c)∑y∈V∖S∑x∈SAx,y. The double sum is positive and 0<2c<π, contradicting [F5]. Hence, if c>0, all representatives have one common value t∈{c,−c}.

3.1F5step 1.1step 2.1algebra∎

In the common-value case, the definition of ρ1 gives ρ1=eit. Its being real makes sin⁡t=0 by [F5]. If t≠0, then 0<∣t∣<π/2, so [F5] gives sin⁡∣t∣>0 and oddness gives sin⁡t≠0, a contradiction. Therefore c>0 is impossible. With c=0, step 1.1 gives θx=0 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

Used by · 3

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