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.
Pointwise comparisons used in kernel stability
PDF p. 17: Proof of Lemma 2.8, Cases 1–3
Statement
Assume countable choice. Let be a finite undirected graph with nonempty vertex set, self-loops allowed, and symmetric binary adjacency matrix . Let be a stable state, meaning a local minimum on the phase torus of the energy , and choose representatives . Define . For each , let .
For every : if , then ; if , then . If , then and .
Facts & Assumptions
The kernel has branches for and for (Kernel for stability amplification).
Sine is nonnegative on . Sine is odd, cosine is even, and (Angular order and elementary inverse-trigonometric bounds, Parity and the Pythagorean identity for sine and cosine, Quarter-turn values and shifts by pi/2 and pi).
For real , , and real parts distribute over finite sums (Phasors, trigonometric identities and periodic derivatives).
Under countable choice, for the graph and stable state in the Statement, and (The Axiom of Countable Choice (AC_ω), Second-order necessary conditions for stable states). The graph, phase, energy and stable-state conventions are those of Adjacency, degrees, graph Laplacian, and spectral notation, Finite phase tori, local lifts and the flat metric, Homogeneous Kuramoto energy and Equilibria, stable states, synchronized states, and spurious minima.
For all real , (The addition formulas for sine and cosine).
Proof
Given: The graph, stable state, representatives and kernel in the Statement, under countable choice.
Goal: Prove the two pointwise inequalities and the branch identity and nonnegative sum in the third case.
Write and . If and , [F1] gives . If instead , put . By [F1], parity and the sine addition formula in [F5], . Here by [F2], and because . This proves the first comparison.
If and , [F1] and oddness give . If , put . By [F5], , by the same sign argument as in step 1.1. This proves the second comparison, including the endpoints.
If , [F1] gives . Taking the real part of the phasor identity in [F4] and using [F3] yields . Thus the kernel sum is . Since , cosine is nonpositive there: by [F2], , and cosine is even. Together with , this proves the nonnegativity and completes the proof.
Source notes
The three comparisons are attributed to Expander graphs are globally synchronizing, PDF page 17, proof of Lemma 2.8. The proof above uses the stated mathematical suppliers.
Depends on
- Kernel for stability amplification
- 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
- Second-order necessary conditions for stable states
- Phasors, trigonometric identities and periodic derivatives
- Angular order and elementary inverse-trigonometric bounds
- 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_ω)
- The addition formulas for sine and cosine
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 p. 17, proof of Lemma 2.8, Cases 1–3