Alphabeta Math
LemmaStatement: AI-generatedProof: 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.

Mean-zero projection of the regular phase vector

Statement

Assume countable choice. Let G=(V,E) be a finite connected undirected graph, with n=∣V∣>0, symmetric binary adjacency matrix A, and self-loops allowed and counted once in each row sum. Suppose every row sum is d≥0, let α≥0, and assume ∥Δ∥≤αd, where Δ=A−(d/n)J and J is the all-ones matrix; the norm is the Euclidean operator norm. Let θ be a stable state, meaning a local minimum on the phase torus of EG(θ)=12∑x,yAxy(1−cos⁡(θx−θy)). Choose representatives in (−π,π] after common rotation so that ρ1≥0 is real, where ρk=n−1∑xeikθx. Put X=ρ12, r=∣ρ2∣, and M=n−1∑xH(θx), where H(t)=sin⁡2∣t∣ for ∣t∣≤π/2 and H(t)=1 for π/2≤∣t∣≤π.

For fx=eiθx and g=f−ρ11, one has Δf=Δg, ∥g∥22=n(1−X), and ∥Δf∥22≤α2d2n(1−X).

Facts & Assumptions

[F1]

A real symmetric matrix of positive order, with nonnegative entries and constant row sum d>0, has centered matrix zero on constants; the centered matrix has equal real and complex Euclidean operator norms (Regular adjacency spectra and normalized expansion).

[F10]

Definition or convention used in the Statement: Adjacency, degrees, graph Laplacian, and spectral notation.

[F11]

Definition or convention used in the Statement: Adjacency spectral expander — Definition 1.3.

[F12]

Definition or convention used in the Statement: Equilibria, stable states, synchronized states, and spurious minima.

[F13]

Definition or convention used in the Statement: Daido order parameters.

[F14]

Definition or convention used in the Statement: Bounds, saturation, and rotation of order parameters.

[F15]

Definition or convention used in the Statement: Truncated sine-square function.

[F16]

Definition or convention used in the Statement: Centered graph matrices and reference degree.

[F17]

Definition or convention used in the Statement: Loewner order, Hermitian inner product, and operator norm.

[F18]

Definition or convention used in the Statement: Phasors, trigonometric identities and periodic derivatives.

[F19]

Definition or convention used in the Statement: The Axiom of Countable Choice (AC_ω).

Proof

Given: The graph, stable normalized state, parameters and notation in the Statement.

Goal: Establish all the asserted estimates.

1.1F1F10F13F14F16F17F18givenalgebra

For d>0, [F1] applies to A because its binary entries are nonnegative, and gives Δ1=0. Directly for every d≥0, the row sums give A1=d1 and J1=n1, hence Δ1=0, including d=0. Therefore Δf=Δ(f−ρ11)=Δg. Since ∑xfx=nρ1, ρ1 is real, and ∣fx∣=1, expansion of the squared norm gives ∑x∣fx−ρ1∣2=n−2nρ12+nρ12=n(1−X).

2.1F11F16F17step 1.1givenalgebra∎

Apply the Euclidean norm inequality to g and square the nonnegative sides: ∥Δf∥22=∥Δg∥22≤∥Δ∥2∥g∥22≤α2d2n(1−X). This proves all three claims.

Depends on

Used by · 1

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.