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.

Almost antisymmetry and summed kernel bounds

PDF p. 25: Proof of Lemma 4.3; PDF p. 26: Proof of Lemma 4.3

Statement

For a,b∈(−π,π], let K(a,b)=sin⁡(∣a∣−min⁡{∣b∣,π/2}). Then K(a,b)+K(b,a)≤1{∣a∣≥π/2}+1{∣b∣≥π/2}, where each indicator is 1 when its condition holds and 0 otherwise.

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 RV/(2πZ)V of EG(θ)=12∑x,y∈VAx,y(1−cos⁡(θx−θy)). Choose principal representatives θx∈(−π,π] and suppose ∣V∣−1∑xeiθx∈[0,1]. For 0<γ<β≤π/2, write Cψ={x∈V:∣θx∣≥ψ} and e(X,Y)=∑x∈X∑y∈YAx,y, with Xc=V∖X. Then

sin⁡(β−γ)e(Cβ,Cγc)≤∑x,y∈CβAx,yK(θx,θy)≤e(Cπ/2,Cβ)≤e(Cπ/2,V).

If additionally G is an (n,d∗,α,c−,c+)-expander, then e(Cπ/2,V)≤(1+c++α)d∗∣Cπ/2∣.

Facts & Assumptions

[F1]

The kernel has the formula in the Statement and, when ∣b∣≥π/2, K(a,b)=−cos⁡a (Kernel for stability amplification).

[F2]

Sine is odd and bounded above by 1; cosine is even and nonnegative on [−π/2,π/2] (Parity and the Pythagorean identity for sine and cosine, Signs, monotonicity intervals, and ranges of sine and cosine). The quarter-turn identity gives sin⁡(t−π/2)=−cos⁡t (Quarter-turn values and shifts by pi/2 and pi).

[F3]

The phase tails and ordered edge counts are as defined in the Statement; A is symmetric and nonnegative, and Cπ/2⊆Cβ⊆Cγ (Phase tail sets for amplification, Oriented edge count between sets).

[F4]

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

[F5]

For y∈Cβ, the kernel is at most 0 on Cγ∖Cβ and at most sin⁡(γ−β) on Cγc (Kernel bounds on three phase regions).

[F6]

For the stated expander and any X⊆V, the maximum-degree consequence of the incident-edge bound gives e(X,V)≤(1+c++α)d∗∣X∣ (Two-sided spectral expander — Definition 1.9, Total incident edge bounds — Lemma 3.6).

Proof

Given: The angles a,b, and, for the summed bounds, the graph, stable configuration and angles γ,β in the Statement.

Goal: Prove the pointwise inequality, the chain of summed bounds and the expander consequence.

1.1F1F2algebra

Put u=∣a∣ and v=∣b∣. If both are below π/2, [F1] and oddness give K(a,b)+K(b,a)=sin⁡(u−v)+sin⁡(v−u)=0. If u≥π/2>v, then K(a,b)≤1 and K(b,a)=sin⁡(v−π/2)=−cos⁡v≤0. The reversed case is symmetric. If both are at least π/2, each kernel value is at most 1. These cases include equality at π/2 and give the stated indicator bound.

2.1F3step 1.1algebra

Let S=∑x,y∈CβAx,yK(θx,θy). Interchanging the finite summation indices and using symmetry of A yields twice S as the sum of Ax,y(K(θx,θy)+K(θy,θx)). Apply step 1.1 termwise. The two indicator sums are equal by symmetry, and the first counts precisely e(Cπ/2,Cβ) because Cπ/2⊆Cβ. Thus S≤e(Cπ/2,Cβ)≤e(Cπ/2,V), the last inequality using nonnegative entries.

3.1F2F3F4F5F6step 2.1algebra∎

Sum [F4] over y∈Cβ and split the x-sum into Cβ, Cγ∖Cβ, and Cγc. By [F5] and nonnegativity of A, the total is at most S+sin⁡(γ−β)e(Cγc,Cβ). Symmetry of A and oddness of sine therefore give S≥sin⁡(β−γ)e(Cβ,Cγc). Apply [F6] with X=Cπ/2 for the final expander bound. Together with step 2.1 this proves the chain.

Source notes

The pointwise inequality and its use in the proof of Lemma 4.3 are attributed to the cited article. The line on PDF page 25 omits d∗ from the incident-edge bound; the following page displays it. The expander bound stated here follows from the separately declared incident-edge supplier.

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