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.
One-vertex composition of phase-difference landscapes
Statement
Let and be finite undirected networks whose vertex sets meet exactly at . Here is nonempty and finite, and is a set of unordered pairs with ; the case denotes a loop. Thus repeated edges are excluded and loops are allowed. Equivalently, the symmetric binary matrix has exactly when , including on the diagonal; this is a finite symmetric network. The loop-free support graph has vertex set and edges . Assume it is connected: every two vertices are joined by a path, with the length-zero path allowed at a single vertex. On the phase torus , let be a real-valued energy depending only on phase differences. Thus its value is unchanged by adding one common phase to every coordinate. A configuration is synchronized when all its vertex phases agree. A critical point has all first angular partial derivatives zero; a negative Hessian direction at a critical point is a real tangent vector with . A local minimum is a point whose energy is no greater than the energy at every point in some neighborhood.
Suppose that, for each , every local minimum of is synchronized and every critical point that is not a local minimum has a negative Hessian direction. On the glued network with vertex set and edge set , define . Then every local minimum of is synchronized, and every critical point of that is not a local minimum has a negative Hessian direction. Fixing the shared phase gives independent relative-phase coordinates for the two factors. This conclusion uses the one-vertex product structure; it does not assert a general edge-addition monotonicity theorem.
Statement references
Facts & Assumptions
The phase torus has angular charts with locally translational transitions, and coordinatewise addition and subtraction of phases are represented in these charts by addition and subtraction of real lifts (Finite phase tori, local lifts and the flat metric).
Fixing one vertex gives a relative-phase coordinate for each diagonal rotation orbit; every phase-difference function is constant on these orbits (Diagonal phase rotations and relative-phase coordinates).
A local minimum of a function in Euclidean coordinates is critical and has nonnegative Hessian quadratic form (Local minima and nonnegative second variation).
A symmetric nonnegative matrix on a nonempty finite vertex set is a network; its positive off-diagonal entries define its loop-free support graph. The binary case represents the unordered edges in the Statement, with diagonal entries representing loops (Finite symmetric networks and loop removal). Connectedness of that support graph means that every two vertices are joined by a path; a one-vertex graph is connected (Connected graphs and connected components defined by the existence of vertex paths).
For composable maps between open Euclidean sets, total differentiability of the inner map at a point and of the outer map at its image gives (The chain rule for total derivatives: D(g∘ f)(a)=Dg(f(a))∘ Df(a)).
In a finite product of topological spaces, products of open factor neighborhoods form a neighborhood basis. The empty product is a one-point space (The product set ∏_i ∈ I Xᵢ of functions choosing a point in each factor, the projections, the box topology, and the product topology as the initial topology of the projections; the empty product is a one-point space).
The two networks and energies satisfy the hypotheses of the Statement.
Proof
Given: The networks, energies and hypotheses in the Statement.
Goal: Prove the two landscape properties for and establish the relative-phase product structure.
Every edge of has endpoints in , so the glued network has the same unordered-edge convention, with any common loop at occurring once in the edge union. Its energy is the displayed sum by definition. Write . The map sending to , where and , has inverse and for . The sets are disjoint and cover , so these formulas are mutually inverse. In angular charts both maps are represented locally by linear maps, hence are smooth with smooth inverses. If is empty, its factor is the one-point empty product. Thus the shared phase and the two relative-phase factors give a product diffeomorphism.
Let be evaluated with phase at and phases on . Rotation invariance gives , independently of . To transfer derivatives, take any local affine map between the angular-coordinate open sets and any scalar function . Applying [F5] gives . Applying [F5] again to each gives . Thus the composition is , and and . These formulas apply to the component sections defining and to the inverse coordinate maps in step 1.1; all domains can be restricted to angular-chart open neighborhoods. When is invertible, the gradient vanishes in one coordinate system exactly when it vanishes in the other, and the Hessian quadratic form on in the new coordinates equals the old form on . Empty relative-phase factors have no derivatives, and the same formulas use empty sums. For the displayed sum, the relative-factor derivatives are those of and the derivative is zero. Consequently a point is critical for exactly when both are critical for ; applying the invertible component coordinate map also makes this equivalent to criticality of each corresponding .
A point is a local minimum of exactly when both are local minima of their . Indeed, by [F6] a neighborhood witnessing a minimum contains a product of open neighborhoods of its coordinates. Fixing and the other relative factor in the energy inequality shows for every , proving necessity. Conversely, choose open neighborhoods witnessing the two factor minima and any open neighborhood of . Their product is a neighborhood by [F6], and adding the factor inequalities proves the minimum property for . Applying the same argument to the component coordinates shows that a minimum of is exactly a minimum of at the corresponding configuration. The diffeomorphisms in step 1.1 carry these neighborhoods to neighborhoods in the original phase tori. This also covers a one-point relative factor. Consequently every minimum of restricts to synchronized configurations on both components. Their common phase at is the same, so the whole glued configuration is synchronized.
At a critical point of that is not a local minimum, step 3.1 gives a factor that is not a local minimum. By step 2.1 its corresponding component configuration is critical, so [A1] gives a tangent direction with strictly negative component Hessian quadratic form. Let be the invertible derivative of the inverse component coordinate map , and write . The Hessian formula in step 2.1 shows that the component form in these coordinates on is the same negative number. Since is independent of , its quadratic form on equals that on . Extend to the glued product by taking zero velocity in the other relative-phase factor and in . The sum in step 2.1 has block-diagonal second derivatives, so its quadratic form on this extended direction is the same negative number. Applying the inverse glued coordinate derivative to that direction and using the same Hessian formula gives a negative direction in the original angular coordinates of . The coordinate maps are locally affine, so their second derivatives vanish and no additional term occurs. This proves the remaining assertion.
Remarks
The argument applies to the displayed sum of phase-difference energies. It makes no claim about adding an edge between vertices already in a network.
Depends on
- Finite phase tori, local lifts and the flat metric
- Diagonal phase rotations and relative-phase coordinates
- Local minima and nonnegative second variation
- Finite symmetric networks and loop removal
- Connected graphs and connected components defined by the existence of vertex paths
- The chain rule for total derivatives: D(g∘ f)(a)=Dg(f(a))∘ Df(a)
- The product set ∏_i ∈ I Xᵢ of functions choosing a point in each factor, the projections, the box topology, and the product topology as the initial topology of the projections; the empty product is a one-point space
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.