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 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 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 .
For two cliques of equal size , the set of vertices of either clique has one edge to its complement, so . Thus this globally synchronizing family has edge expansion at most , tending to zero. In particular, a uniform positive edge-expansion bound is not necessary for global synchronization.
Facts & Assumptions
The Kuramoto energy of a finite undirected graph is the sum of 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.
On any finite nonempty complete graph, every critical point of this energy with positive-semidefinite Hessian has all phases equal modulo (A complete-graph second-order landscape application).
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_ω)).
For a symmetric adjacency matrix, is the sum of its entries indexed by ; for an unweighted graph this counts crossing edges once (Ordered edge counts and centered cut vectors).
Proof
Given: The graph and countable choice as in the Statement.
Goal: Prove global synchrony and the stated cut bound.
Regard as the union of three complete graphs: the two cliques and the joining edge, the latter being a copy of . Their edge sets are disjoint; the joining edge meets each clique at exactly its endpoint. By [F1], the energy of is the sum of their energies, each depending only on differences of phases within its own vertex set.
Let be a critical point of the energy of with positive-semidefinite Hessian. Write for the disjoint clique vertex sets, and , for the joining endpoints. Fix either clique , and let be its joining endpoint. For any real variation on , set on and outside . Along the path , every difference in changes by , while the joining edge and the other clique have constant differences. Thus the whole-graph energy along this path equals the energy of along its variation , plus a constant. Its first derivative at is zero and its second derivative is nonnegative. Since was arbitrary, the restriction to each clique is critical with positive-semidefinite Hessian. This also covers a singleton clique, whose energy is constant.
For an arbitrary real variation on the joining edge , instead set for every and for every . Along , all within-clique differences remain constant, whereas the joining-edge difference changes by . Hence the whole-graph energy along this path equals the joining-edge energy along , plus a constant. Whole-graph criticality and Hessian nonnegativity therefore make the first derivative zero and the second derivative nonnegative for every . The joining-edge restriction is consequently critical with positive-semidefinite Hessian.
By [F2], each clique has a common phase and the endpoints of the joining edge have equal phases. Hence all vertices of have the same phase. Every equilibrium with Hessian nonnegative on real vectors is therefore fully synchronized. For the real symmetric Hessian , writing with real gives , so nonnegativity on real vectors is equivalent to nonnegativity on complex vectors as in [F3]. Thus [F3] gives global synchrony.
For equal clique sizes , let be one clique. Exactly the joining edge crosses from to , so [F4] gives and . Defining edge expansion as the minimum of over nonempty with , the admissible set gives the upper bound , 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
- Adjacency, degrees, graph Laplacian, and spectral notation
- Homogeneous Kuramoto energy
- Globally synchronizing graph — Definition 1.1
- A complete-graph second-order landscape application
- Ordered edge counts and centered cut vectors
- Positive-semidefinite-equilibrium criterion for global synchrony
- The Axiom of Countable Choice (AC_ω)
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. 7–8, Remark 1.7