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

Regular-graph numerical contradiction threshold

PDF p. 29: Proof of Theorem 1.4, equation (5.1)

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 the degree. Suppose every row sum is d≥0 and ∥A−(d/n)J∥≤αd, where J is the all-ones matrix, the norm is the Euclidean operator norm, and α=0.0816. Let θ be a stable state: a local minimum on the phase torus of 12∑x,y∈VAxy(1−cos⁡(θx−θy)). Rotate all phases together so that ρ1=n−1∑xeiθx is real and nonnegative, and use representatives θx∈(−π,π]. For 0<ξ<π/2, put Cξ={x∈V:∣θx∣≥ξ}. Then the condition ∣Cξ∣≥0.00832n/sin⁡2ξ is impossible.

Facts & Assumptions

[F1]

For these graph and normalized stability hypotheses, X=ρ12≥1−2α, since α≤0.1 (Refined order estimates for regular graphs — Remark 2.7).

[F2]

Define H(t)=sin⁡2∣t∣ for ∣t∣≤π/2 and H(t)=1 for π/2≤∣t∣≤π, and put M=n−1∑xH(θx). If d>0 and X>0, then M≤α2(1−X)/X; if d=0, then M=0 (Truncated sine-square function, Refined H mass bound in a regular graph).

[F3]

The function H is nonnegative and is nondecreasing on [0,π] (Elementary properties of the function H).

[F4]

The phase-tail definition identifies Cξ with the vertices whose principal representatives have absolute value at least ξ (Phase tail sets for amplification).

[F5]

A common rotation can make ρ1 real and nonnegative, including when ρ1=0; each resulting phase has a unique representative in (−π,π] (Bounds, saturation, and rotation of order parameters).

[F6]

A common rotation Rc adds the same phase c to every coordinate and preserves the energy (Global rotation equivalence of phase configurations). A stable state is a local minimum in the phase-torus topology; common rotations preserve such local minima (Equilibria, stable states, synchronized states, and spurious minima, Justification).

Proof

Given: The graph, stable state before normalization, and angle in the Statement, with countable choice as assumed there.

Goal: Prove that the stated lower bound on ∣Cξ∣ cannot hold.

1.1F5F6givenconstruct

By [F5], choose a common rotation Rc making the first order parameter real and nonnegative; when the original ρ1=0, take c=0. Addition of a fixed phase is continuous in the torus coordinates and has the continuous inverse R−c, so Rc is a homeomorphism. If U is a neighborhood witnessing local minimality at the original state, then RcU is a neighborhood of the rotated state. For every ϕ∈RcU, energy invariance in [F6] gives EG(ϕ)=EG(R−cϕ)≥EG(θ)=EG(Rcθ). Thus the rotated state is stable. Choose its principal representatives using [F5] and denote this normalized stable state again by θ. Consequently the hypotheses of [F1] and [F2], including countable choice, apply to this state.

2.1F1F2step 1.1givenalgebra

By [F1], X≥1−2α=0.8368>0. If d>0, [F2] gives M≤α2(1−X)/X≤α2(2α)/(1−2α)<α2/4, because 4(2α)=0.6528<0.8368=1−2α. If d=0, [F2] gives M=0<α2/4. Thus in either case M<α2/4=0.00166464<0.00832.

3.1F2F3F4step 2.1givenalgebra∎

For each x∈Cξ, [F4] gives ξ≤∣θx∣≤π. By [F3] and the definition of H, H(θx)=H(∣θx∣)≥H(ξ)=sin⁡2ξ; all other summands are nonnegative. Hence nM≥∣Cξ∣sin⁡2ξ. If the asserted threshold held, this would give M≥0.00832, contradicting step 2.1. The condition is therefore impossible.

Source notes

Equation (5.1) on the cited original PDF page gives the rounded threshold retained in the Statement. The preceding prose prints a related expression without a factor of n. The proof above establishes the displayed threshold directly using the sharper refined mass estimate; it does not infer it merely by rounding 5α2/4=0.0083232 downward to 0.00832.

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.

Sources