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 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 each and suppose .
For , let , and put . For every , the following bounds hold: if ; if ; and if .
With and complements relative to , consequently .
Facts & Assumptions
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).
The kernel and phase tails are the functions and sets displayed in the Statement. In particular, (Kernel for stability amplification, Phase tail sets for amplification).
Sine is increasing on and has range contained in (Signs, monotonicity intervals, and ranges of sine and cosine).
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_ω)).
The ordered edge count is ; symmetry of gives (Oriented edge count between sets, Adjacency, degrees, graph Laplacian, and spectral notation).
For every real , , and (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.
From [F6] with , , so . Fix and set . Since and , we have . For every , the kernel is . If , then , so . Sine monotonicity therefore gives .
If , then and . Both and lie in , so sine monotonicity gives . Together with step 1.1 this proves all three pointwise bounds.
Sum [F4] over . The disjoint sets , and partition . Since , the bounds from steps 1.1 and 2.1 give an upper bound for the resulting sum of . By [F5] the second count equals . 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
- 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
- Kernel for stability amplification
- Phase tail sets for amplification
- Kernel stability condition — Lemma 2.8
- Oriented edge count between sets
- Signs, monotonicity intervals, and ranges of sine and cosine
- The Axiom of Countable Choice (AC_ω)
- Quarter-turn values and shifts by pi/2 and pi
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 p. 24, proof of Lemma 4.2, equations (4.3)–(4.4)