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.

Mass-angle lower bound — Lemma 4.1

PDF p. 23: Lemma 4.1

Statement

Assume countable choice. Let G=(V,E) be a finite connected undirected graph with nonempty vertex set, possibly with self-loops, and let θ be a nonsynchronized stable state whose first order parameter is real and nonnegative. A stable state is a local minimum on the phase torus of the graph energy 12∑x,y∈VAx,y(1−cos⁡(θx−θy)); nonsynchronized means that the phases are not all equal modulo 2π. The first order parameter is ∣V∣−1∑x∈Veiθx. Use the representatives θx∈(−π,π].

Let β0,…,βM and c0,…,cM be an amplification sequence: M≥0 is an integer, π/2=β0>⋯>βM≥0, c0<⋯<cM, and ∣Cβs∣≥cs for 0≤s≤M, where Cψ={x∈V:∣θx∣≥ψ} and c0=∣Cπ/2∣. For t∈(−π,π], let H(t)=sin⁡2∣t∣ if ∣t∣≤π/2, and H(t)=1 if π/2≤∣t∣≤π. Then

∑x∈VH(θx)≥cMsin⁡2(βM).

Facts & Assumptions

[F1]

The graph, phase torus, stable state, first order parameter and amplification sequence have the meanings stated above. In particular, 0≤βM≤π/2 and ∣CβM∣≥cM (Adjacency, degrees, graph Laplacian, and spectral notation, Finite phase tori, local lifts and the flat metric, Equilibria, stable states, synchronized states, and spurious minima, Daido order parameters, Angle and mass sequences in the amplification argument, The Axiom of Countable Choice (AC_ω)).

[F2]

Each principal representative lies in (−π,π], and x∈Cψ exactly when ∣θx∣≥ψ for 0≤ψ≤π (Phase tail sets for amplification).

[F3]

The displayed branches define H; it is nonnegative and nondecreasing on [0,π] (Truncated sine-square function, Elementary properties of the function H).

Proof

Given: The graph, state and amplification sequence in the statement.

Goal: Prove the stated lower bound for the sum of H.

1.1F1F2F3algebra

For each x∈CβM, [F2] gives βM≤∣θx∣≤π. By the two branches defining H, H(θx)=H(∣θx∣). Monotonicity in [F3] therefore gives H(θx)≥H(βM)=sin⁡2(βM), where the last equality uses 0≤βM≤π/2.

2.1F1F3step 1.1algebra∎

All terms outside CβM are nonnegative by [F3]. Summing step 1.1 over the finite tail set gives ∑x∈VH(θx)≥∣CβM∣sin⁡2(βM). Since the squared sine is nonnegative and ∣CβM∣≥cM by [F1], the desired inequality follows.

Source notes

The statement is attributed to Lemma 4.1 of the article cited in the frontmatter. The proof above uses monotonicity of H directly: the article's intermediate comparison of sin⁡2(θx) with sin⁡2(βM) need not hold for vertices whose absolute angle exceeds π/2.

Depends on

Used by · 1

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