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 stability condition — Lemma 2.8
PDF p. 16: Lemma 2.8, equation (2.14); PDF p. 17: Lemma 2.8, proof
Statement
Assume countable choice. Let be a finite undirected graph with nonempty vertex set, self-loops allowed, and symmetric binary adjacency matrix . A phase state assigns a real angle modulo to each vertex. Let be stable, meaning a local minimum on the phase torus of , and choose representatives . Put and , and suppose . Define . Then, for every ,
Facts & Assumptions
The adjacency entries are nonnegative, and the phase torus, energy and stable-state convention are as in the Statement (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).
The first Daido order parameter and kernel are the functions displayed in the Statement (Daido order parameters, Kernel for stability amplification).
A real-valued function on an open Euclidean set has zero gradient at a local minimum (Local minima and nonnegative second variation).
Under the stated graph, stability and representative hypotheses, if then for every ; if then for every . If , the entire kernel sum is nonnegative (Pointwise comparisons used in kernel stability).
Under countable choice, an equilibrium is a critical point of the energy, and at an equilibrium for every (The Axiom of Countable Choice (AC_ω), Equilibria, stable states, synchronized states, and spurious minima, Real and complex equilibrium identities).
Sine and cosine are continuously differentiable, with and ; finite sums may be differentiated termwise (Phasors, trigonometric identities and periodic derivatives).
Proof
Given: The graph, stable state, representatives, kernel and countable choice in the Statement.
Goal: Prove the displayed inequality for every vertex .
Choose a local angular chart around as in [F1]. In this chart the energy is the finite cosine sum in the Statement, so it is a real-valued function on an open Euclidean box by [F6]. The local minimum is an interior local minimum of this coordinate function. By [F3] its gradient vanishes; the flat angular coordinates in [F1] identify this with vanishing of the energy gradient. Thus is an equilibrium by [F5], and [F5] gives for every .
Fix . If , multiply the first pointwise comparison in [F4] by the nonnegative and sum over . The right-hand side is zero by step 1.1, so the kernel sum is nonnegative.
If , the second comparison in [F4], nonnegativity of the adjacency entries and step 1.1 similarly bound the kernel sum below by zero. If , its nonnegativity follows directly from [F4]. These cases together with step 2.1 cover , including the endpoints, proving the claim. The stated condition on is retained from the article but is not needed for this deduction.
Source notes
Lemma 2.8, equation (2.14), of Expander graphs are globally synchronizing, PDF pages 16–17, attributes the claim. The deduction above uses the stated 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
- Pointwise comparisons used in kernel stability
- Real and complex equilibrium identities
- The Axiom of Countable Choice (AC_ω)
- Local minima and nonnegative second variation
- Phasors, trigonometric identities and periodic derivatives
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. 16–17, Lemma 2.8, equation (2.14) and proof