Alphabeta Math
ExampleConstruction: AI-adaptedVerification: 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.

Two cliques joined by one edge synchronize despite poor expansion

PDF p. 7: Remark 1.7; PDF p. 8: Remark 1.7

Statement

Assume countable choice. Let G consist of two disjoint finite nonempty cliques, with exactly one additional edge joining a vertex of one clique to a vertex of the other. A clique here is an unweighted graph with one edge between each pair of distinct vertices and no loops. Then G is globally synchronizing: for normalized phase-volume almost every initial state, the rotating-frame homogeneous Kuramoto trajectory converges to a state whose phases are all equal modulo 2π.

For two cliques of equal size m≥2, the set X of vertices of either clique has one edge to its complement, so e(X,Xc)/∣X∣=1/m. Thus this globally synchronizing family has edge expansion at most 1/m, tending to zero. In particular, a uniform positive edge-expansion bound is not necessary for global synchronization.

Facts & Assumptions

[F1]

The Kuramoto energy of a finite undirected graph is the sum of 1−cos⁡(θx−θy) over its edges. Its equilibrium states are its critical points. Its Hessian is positive semidefinite when its real quadratic form is nonnegative on every real vector. See Adjacency, degrees, graph Laplacian, and spectral notation and Homogeneous Kuramoto energy.

[F2]

On any finite nonempty complete graph, every critical point of this energy with positive-semidefinite Hessian has all phases equal modulo 2π (A complete-graph second-order landscape application).

[F3]

Under countable choice, if every equilibrium with positive-semidefinite energy Hessian is fully synchronized, the graph is globally synchronizing in the sense stated above (Positive-semidefinite-equilibrium criterion for global synchrony, Globally synchronizing graph — Definition 1.1, The Axiom of Countable Choice (AC_ω)).

[F4]

For a symmetric adjacency matrix, e(X,Xc) is the sum of its entries indexed by X×Xc; for an unweighted graph this counts crossing edges once (Ordered edge counts and centered cut vectors).

Proof

Given: The graph G and countable choice as in the Statement.

Goal: Prove global synchrony and the stated cut bound.

1.1givenF1

Regard G as the union of three complete graphs: the two cliques and the joining edge, the latter being a copy of K2. Their edge sets are disjoint; the joining edge meets each clique at exactly its endpoint. By [F1], the energy of G is the sum of their energies, each depending only on differences of phases within its own vertex set.

2.1givenF1step 1.1

Let θ be a critical point of the energy of G with positive-semidefinite Hessian. Write V1,V2 for the disjoint clique vertex sets, and a∈V1, b∈V2 for the joining endpoints. Fix either clique C, and let c be its joining endpoint. For any real variation h on C, set kx=hx−hc on C and kx=0 outside C. Along the path θ+tk, every difference in C changes by t(hx−hy), while the joining edge and the other clique have constant differences. Thus the whole-graph energy along this path equals the energy of C along its variation h, plus a constant. Its first derivative at t=0 is zero and its second derivative is nonnegative. Since h was arbitrary, the restriction to each clique is critical with positive-semidefinite Hessian. This also covers a singleton clique, whose energy is constant.

3.1givenF1step 1.1step 2.1

For an arbitrary real variation h on the joining edge {a,b}, instead set kx=ha for every x∈V1 and kx=hb for every x∈V2. Along θ+tk, all within-clique differences remain constant, whereas the joining-edge difference changes by t(ha−hb). Hence the whole-graph energy along this path equals the joining-edge energy along h, plus a constant. Whole-graph criticality and Hessian nonnegativity therefore make the first derivative zero and the second derivative nonnegative for every h. The joining-edge restriction is consequently critical with positive-semidefinite Hessian.

4.1F2F3step 2.1step 3.1algebra

By [F2], each clique has a common phase and the endpoints of the joining edge have equal phases. Hence all vertices of G have the same phase. Every equilibrium with Hessian nonnegative on real vectors is therefore fully synchronized. For the real symmetric Hessian H, writing z=u+iv with real u,v gives z∗Hz=uTHu+vTHv, so nonnegativity on real vectors is equivalent to nonnegativity on complex vectors as in [F3]. Thus [F3] gives global synchrony.

5.1F4step 4.1algebra∎

For equal clique sizes m≥2, let X be one clique. Exactly the joining edge crosses from X to Xc, so [F4] gives e(X,Xc)=1 and ∣X∣=m. Defining edge expansion as the minimum of e(S,Sc)/∣S∣ over nonempty S with ∣S∣≤∣V∣/2, the admissible set X gives the upper bound 1/m, which tends to zero. This proves the stated contrast between global synchrony and a uniform positive edge-expansion bound.

Source notes

The example and its qualitative conclusion are attributed to Expander graphs are globally synchronizing, Remark 1.7, PDF pp. 7–8. The proof above uses the declared mathematical suppliers; the article is attribution, not a premise of the proof.

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