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 , let . Then , where each indicator is when its condition holds and otherwise.
Assume countable choice. Let be a finite undirected graph with nonempty vertex set, possible self-loops, and symmetric binary adjacency matrix . Let be a stable phase configuration, meaning a local minimum on of . Choose principal representatives and suppose . For , write and , with . Then
If additionally is an -expander, then .
Statement references
Facts & Assumptions
The kernel has the formula in the Statement and, when , (Kernel for stability amplification).
Sine is odd and bounded above by ; cosine is even and nonnegative on (Parity and the Pythagorean identity for sine and cosine, Signs, monotonicity intervals, and ranges of sine and cosine). The quarter-turn identity gives (Quarter-turn values and shifts by pi/2 and pi).
The phase tails and ordered edge counts are as defined in the Statement; is symmetric and nonnegative, and (Phase tail sets for amplification, Oriented edge count between sets).
Under the graph, stability, representative, order-parameter and countable-choice hypotheses in the Statement, for every (Kernel stability condition — Lemma 2.8, The Axiom of Countable Choice (AC_ω)).
For , the kernel is at most on and at most on (Kernel bounds on three phase regions).
For the stated expander and any , the maximum-degree consequence of the incident-edge bound gives (Two-sided spectral expander — Definition 1.9, Total incident edge bounds — Lemma 3.6).
Proof
Given: The angles , 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.
Put and . If both are below , [F1] and oddness give . If , then and . The reversed case is symmetric. If both are at least , each kernel value is at most . These cases include equality at and give the stated indicator bound.
Let . Interchanging the finite summation indices and using symmetry of yields twice as the sum of . Apply step 1.1 termwise. The two indicator sums are equal by symmetry, and the first counts precisely because . Thus , the last inequality using nonnegative entries.
Sum [F4] over and split the -sum into , , and . By [F5] and nonnegativity of , the total is at most . Symmetry of and oddness of sine therefore give . Apply [F6] with 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 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
- Kernel for stability amplification
- Phase tail sets for amplification
- Oriented edge count between sets
- Two-sided spectral expander — Definition 1.9
- Kernel stability condition — Lemma 2.8
- Kernel bounds on three phase regions
- Total incident edge bounds — Lemma 3.6
- Signs, monotonicity intervals, and ranges of sine and cosine
- Parity and the Pythagorean identity for sine and cosine
- Quarter-turn values and shifts by pi/2 and pi
- The Axiom of Countable Choice (AC_ω)
- Finite phase tori, local lifts and the flat metric
- Homogeneous Kuramoto energy
- Phasors, trigonometric identities and periodic derivatives
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
- Expander graphs are globally synchronizing · PDF pp. 25–26, proof of Lemma 4.3