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.
Loop removal in the weighted Kuramoto calculus
Statement
Let be a network on a nonempty finite set , with , row degrees and , and Laplacians and , as in Finite symmetric networks and loop removal. For phases define and . Then , , and . Moreover for every real . Thus arbitrary diagonal weights affect row degrees but none of these energy or dynamical expressions.
Facts & Assumptions
The network degree and Laplacian are row sum and degree matrix minus adjacency; removing the diagonal leaves the Laplacian unchanged (Finite symmetric networks and loop removal).
The gradient and Hessian of a symmetric periodic pair potential are given by the finite pair-potential formulas (Differentiation of symmetric periodic pair potentials).
For real angles, has modulus one and satisfies . Also and ; these identities and derivatives are -periodic (Phasors, trigonometric identities and periodic derivatives).
Proof
Given: The data in the Statement.
Goal: Establish the stated conclusions.
Taking in [F3] gives , hence and . For , both and vanish. Deleting exactly those summands therefore leaves and unchanged. Also , so the identical diagonal correction in the degree matrix and in cancels in the Laplacian, giving .
Apply [F2] with , whose derivatives are and . By [F3] and step 1.1, , so equality of real parts gives . Thus is even. The derivative identities in [F3] make twice continuously differentiable, and its periodicity follows from [F3]. The resulting gradient is , and its Hessian quadratic form is the displayed formula. Every diagonal Hessian term vanishes because . This proves all assertions.
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.