Alphabeta Math
DefinitionDefinition: AI-adaptedProof: AI-generated
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.

Simple spinning graphs and cluster-constant equilibria

Definition

Let a weighted network mean a finite simple graph on an ordered nonempty vertex set V with positive integer edge weights wuv. Fix a positive integer k≥max⁡wuv, with maximum zero if there are no edges. Write Zk=Z/k for integers modulo k, with addition of residue classes; i+r means i+[r]k. Its spinning graph Sk has vertex set V×Zk. Each cluster {u}×Zk is a clique, meaning that every unordered pair of distinct vertices within it is an edge. For every edge with u<v, add the undirected edges {(u,i),(v,i+r)} for i∈Zk and integer offsets 0≤r<wuv. Fixing this orientation once is part of the construction; the reverse adjacency is the transpose relation. All edges have unit weight and there are no loops. For phases θu modulo 2π, the cluster-constant lift is Θu,i=θu.

For either graph, set wuv=wvu equal to its edge weight on edges and zero on nonedges and on the diagonal; in the spinning graph the edge weights are one. Indices in the following formulas run over the vertex set of the graph in question, and unordered-pair sums run over its edges. Its Kuramoto equation is θ˙u=∑vwuvsin⁡(θv−θu) and its potential is U(θ)=∑{u,v}wuv(1−cos⁡(θu−θv)). An equilibrium has zero right-hand side at every vertex. At a phase configuration its Hessian has off-diagonal entries −wuvcos⁡(θu−θv) and diagonal entries the sums of the corresponding edge coefficients. The quadratic form is ∑{u,v}wuvcos⁡(θu−θv)(xu−xv)2.

Facts & Assumptions

[F1]

Finite simple weighted networks and their adjacency conventions are supplied by Finite symmetric networks and loop removal.

[F2]

For an even, twice continuously differentiable, 2π-periodic real function and symmetric real weights, Differentiation of symmetric periodic pair potentials supplies the gradient and Hessian formulas. We apply it to v(t)=1−cos⁡t after verifying these hypotheses.

[F3]

Residue classes and their representative-independent addition are supplied by The congruence class [a]ₙ and the quotient set ℤ/n and Addition and multiplication on ℤ/n by [a]ₙ+[b]ₙ=[a+b]ₙ and [a]ₙ[b]ₙ=[ab]ₙ. Since k is positive, For n≥ 1, every class in ℤ/n has one representative r with 0≤ r<n, so |ℤ/n|=n; while ℤ/0 is in bijection with ℤ gives exactly k classes, uniquely represented by 0,…,k−1.

[F4]

For real t, sin⁡(−t)=−sin⁡t and cos⁡(−t)=cos⁡t by Parity and the Pythagorean identity for sine and cosine. Both functions are 2π-periodic by The zero sets of sine and cosine and the least positive common period 2 pi. They are differentiable with (sin⁡t)′=cos⁡t and (cos⁡t)′=−sin⁡t, and sin⁡0=0, by The derivatives of sine and cosine are cosine and minus sine.

[F5]

Differentiability implies continuity, and differentiable real functions obey the sum and product rules, by Sum, product, quotient, and chain rules from difference quotients. Constant functions have derivative zero directly from their difference quotients; the product rule therefore gives the scalar multiplication rule.

Justification

Given: The finite weighted graph, its ordering and the positive integer k in the Definition.

Goal: Verify simplicity, degree, and equilibrium lifting.

1.1 By [F3], each cluster is nonempty and has k vertices. For fixed i∈Zk, equality i+[r]k=i+[s]k implies k∣(r−s); for 0≤r,s<wuv≤k this forces r=s. Thus distinct offsets give distinct neighbours on the forward side of each cross block. On the transpose side the neighbours are indexed by j−[r]k for fixed j, and the same divisibility argument gives exactly wuv distinct neighbours there too. The orientation is fixed once per base edge, preventing accidental union with a second, reverse offset convention. Within-cluster edges join all distinct pairs and are disjoint from cross edges. Thus the construction is finite and simple. Each vertex of cluster u has k−1+∑vwuv neighbours. [F1, F3, given, construct, algebra]

1.2 By [F4], v(t)=1−cos⁡t is even and 2π-periodic. The derivative rules in [F5] and identities in [F4] give v′(t)=sin⁡t and v′′(t)=cos⁡t. Since sine and cosine are differentiable on R by [F4], they are continuous by [F5]. Thus v is twice continuously differentiable and satisfies every function hypothesis of [F2]. With the symmetric zero-extended weights from the Definition, each unordered edge appears twice in the ordered-pair sum, so its half-sum potential is exactly U. The gradient formula in [F2] and sine oddness in [F4] give the negative-gradient equations in the Definition. Differentiating the gradient component using [F5] and [F4] gives the stated off-diagonal and diagonal Hessian entries; [F2]'s quadratic-form identity, with v′′=cos⁡ and the same double counting of edges, gives the stated quadratic form. [F1, F2, F4, F5, given, algebra]

2.1 At the lifted phase, within-cluster sine terms vanish because sin⁡0=0 by [F4]. Every neighbour cluster v supplies exactly wuvsin⁡(θv−θu) at each vertex in cluster u, by step 1.1. Thus the lifted right-hand side at each vertex of cluster u equals the base right-hand side at u. Since each cluster is nonempty, the lifted configuration is an equilibrium exactly when the original one is. [F4, step 1.1, step 1.2, algebra] ∎

This gives an explicitly oriented version of Canale §II.A, p. 4, and the direct calculation of Proposition 1, p. 7. The local justification uses the declared network, residue-arithmetic, trigonometric and differentiation suppliers. It does not assert a blanket stability transfer for arbitrary k.

Source notes

This gives an explicitly oriented version of Canale §II.A, p. 4, and the direct calculation of Proposition 1, p. 7. The local justification uses the declared network, residue-arithmetic, trigonometric and differentiation suppliers. It does not assert a blanket stability transfer for arbitrary k.

Depends on

Used by · 3

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.

External dependencies

Eduardo A. Canale, From weighted to unweighted graphs in Synchronizing Graph Theory, arXiv:2209.06362v3 · Section II.A, p. 4 (spinning construction); Section II.B, pp. 5–7 (equation, potential and Hessian); Section III, Proposition 1, p. 7 (equilibrium lifting)

Section II.A defines the k-spinning of a simple graph with natural-number edge weights for a positive integer k at least the largest edge weight, using vertices V times Z_k and complete within-cluster edges. Proposition 1 states that a weighted equilibrium is equivalent to its cluster-constant lift being an equilibrium of the spinning graph.

Hypotheses: A finite simple weighted graph with positive integer edge weights and a positive integer k at least every edge weight; homogeneous Kuramoto dynamics and the cluster-constant lift. The local item fixes one orientation per base edge explicitly.

Reading limits: Read the PDF text extraction of Sections II.A–B and the statement and calculation of Proposition 1, printed pp. 4–7. These document attribution; the precise oriented construction and all claims below have a local proof from the declared suppliers. No general stability-transfer theorem is imported.

Sources