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.
Self-loops do not affect Kuramoto dynamics
PDF p. 18: Footnote 7
Statement
Let be a finite undirected graph with nonempty vertex set, symmetric binary adjacency matrix , and possible self-loops. Let be the graph obtained by deleting every self-loop and retaining all other edges. A phase state is , with each represented by angles modulo . For the homogeneous Kuramoto energy
the gradient is taken in the flat angular coordinates. The homogeneous Kuramoto dynamics in the rotating frame is the differential equation . This equation is unchanged when is replaced by : self-loops contribute zero to the gradient, so the two equations have the same solutions on every common time interval. In the degree convention , a self-loop at is counted once.
Statement references
Facts & Assumptions
For the stated graph convention, exactly when has a self-loop, and (Adjacency, degrees, graph Laplacian, and spectral notation).
The energy in the Statement is well defined on phase states; angular lifts provide flat local coordinates (Homogeneous Kuramoto energy, Finite phase tori, local lifts and the flat metric).
For any such graph and phase state, in these coordinates (Gradient and Hessian formulas).
The sine function satisfies (Phasors, trigonometric identities and periodic derivatives).
Proof
Given: A graph , its loop-deleted graph , and a phase state as in the Statement.
Goal: Show equality of the two gradient vector fields and the asserted degree count.
Let be the adjacency matrix of . It agrees with off the diagonal and has zero diagonal. Apply [F3] to both graphs in the same local angular coordinates. Their -components differ only by , using [F4]. Thus their gradients agree at every phase state; [F2] identifies these coordinate expressions with the vector fields on the phase space.
The two differential equations therefore have identical right-hand sides at every state, so a differentiable phase path satisfies one exactly when it satisfies the other on the same interval. By [F1], a loop contributes the single summand to , establishing the degree convention.
Source notes
The claim and degree convention are attributed to Expander graphs are globally synchronizing, PDF page 18, opening paragraph of Section 3 and footnote 7. The argument above derives the claim from the listed mathematical suppliers.
Depends on
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. 18, opening paragraph of Section 3 and footnote 7; pp. 2–3, equations (1.1)–(1.2)