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.

Kernel bounds on three phase regions

PDF p. 24: Proof of Lemma 4.2; equations (4.3), (4.4)

Statement

Assume countable choice. Let G=(V,E) be a finite undirected graph with nonempty vertex set, possible self-loops and symmetric binary adjacency matrix A. Let θ be a stable phase configuration, meaning a local minimum on TV=RV/(2πZ)V of EG(θ)=12∑x,y∈VAx,y(1−cos⁡(θx−θy)). Choose each θx∈(−π,π] and suppose ρ1=∣V∣−1∑x∈Veiθx∈[0,1].

For 0<γ<β≤π/2, let Cψ={x∈V:∣θx∣≥ψ}, and put K(α,η)=sin⁡(∣α∣−min⁡{∣η∣,π/2}). For every y∈Cβ, the following bounds hold: K(θx,θy)≤1 if x∈Cβ; K(θx,θy)≤0 if x∈Cγ∖Cβ; and K(θx,θy)≤sin⁡(γ−β) if x∈Cγc.

With e(X,Y)=∑x∈X∑y∈YAx,y and complements relative to V, consequently e(Cβ,Cβ)+sin⁡(γ−β)e(Cβ,Cγc)≥0.

Facts & Assumptions

[F1]

The graph, phase torus, energy, stability and first order parameter have the meanings stated above; adjacency is symmetric and nonnegative (Adjacency, degrees, graph Laplacian, and spectral notation, Finite phase tori, local lifts and the flat metric, Homogeneous Kuramoto energy, Equilibria, stable states, synchronized states, and spurious minima, Daido order parameters).

[F2]

The kernel and phase tails are the functions and sets displayed in the Statement. In particular, Cβ⊆Cγ (Kernel for stability amplification, Phase tail sets for amplification).

[F3]

Sine is increasing on [−π/2,π/2] and has range contained in [−1,1] (Signs, monotonicity intervals, and ranges of sine and cosine).

[F4]

Under the graph, stability, representative, order-parameter and countable-choice hypotheses in the Statement, ∑x∈VAx,yK(θx,θy)≥0 for every y∈V (Kernel stability condition — Lemma 2.8, The Axiom of Countable Choice (AC_ω)).

[F5]

The ordered edge count is e(X,Y)=∑x∈X∑y∈YAx,y; symmetry of A gives e(X,Y)=e(Y,X) (Oriented edge count between sets, Adjacency, degrees, graph Laplacian, and spectral notation).

[F6]

For every real u, sin⁡(u+π)=−sin⁡u, and sin⁡π=0 (Quarter-turn values and shifts by pi/2 and pi).

Proof

Given: The graph, stable phase configuration, representatives and angles in the Statement.

Goal: Prove the three pointwise kernel bounds and the edge-count inequality.

1.1F2F3F6algebra

From [F6] with u=0, 0=sin⁡π=−sin⁡0, so sin⁡0=0. Fix y∈Cβ and set t=min⁡{∣θy∣,π/2}. Since ∣θy∣≥β and β≤π/2, we have β≤t≤π/2. For every x, the kernel is sin⁡(∣θx∣−t)≤1. If x∈Cγ∖Cβ, then 0≤∣θx∣<β≤t, so −π/2≤∣θx∣−t≤0. Sine monotonicity therefore gives K(θx,θy)≤sin⁡0=0.

2.1F2F3step 1.1algebra

If x∈Cγc, then 0≤∣θx∣<γ and −π/2≤∣θx∣−t<γ−β<0. Both ∣θx∣−t and γ−β lie in [−π/2,π/2], so sine monotonicity gives K(θx,θy)≤sin⁡(γ−β). Together with step 1.1 this proves all three pointwise bounds.

3.1F1F2F4F5step 1.1step 2.1algebra∎

Sum [F4] over y∈Cβ. The disjoint sets Cβ, Cγ∖Cβ and Cγc partition V. Since Ax,y≥0, the bounds from steps 1.1 and 2.1 give an upper bound for the resulting sum of e(Cβ,Cβ)+sin⁡(γ−β)e(Cγc,Cβ). By [F5] the second count equals e(Cβ,Cγc). The upper bound is therefore nonnegative, as claimed.

Source notes

The three-region bounds and their summed use are attributed to the proof of Lemma 4.2 in Expander graphs are globally synchronizing, PDF page 24. The proof above uses the stated mathematical suppliers.

Depends on

Used by · 2

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