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

Contradiction threshold for amplification

PDF p. 23: Equation (4.2)

Statement

Assume countable choice. Let G=(V,E) be a finite connected undirected graph, possibly with loops, with n=∣V∣>0 and symmetric binary adjacency matrix A. Connected means that every two vertices are joined by a finite edge path. Let d∗≥0 and α≤1/5, and suppose G is an (n,d∗,α)-expander: ∥A−(d∗/n)J∥≤αd∗, where J is the all-ones matrix and the norm is the Euclidean operator norm.

Let θ be a nonsynchronized stable state: the phases are not all equal modulo 2π, and θ is a local minimum on the phase torus (R/2πZ)V of EG(θ)=12∑x,y∈VAxy(1−cos⁡(θx−θy)). Choose representatives θx∈(−π,π] after a common rotation for which the first order parameter ρ1=n−1∑xeiθx is real and nonnegative. For 0≤ψ≤π, put Cψ={x∈V:∣θx∣≥ψ}. Let M≥0 be an integer and let π/2=β0>⋯>βM≥0 and c0<⋯<cM be real numbers with c0=∣Cπ/2∣ and ∣Cβs∣≥cs for 0≤s≤M; these are an amplification sequence.

For t∈(−π,π], define H(t)=sin⁡2∣t∣ when ∣t∣≤π/2 and H(t)=1 when π/2≤∣t∣≤π. Then cMsin⁡2βM≤5α2n/2. Consequently the additional inequality cMsin⁡2βM>5α2n/2 is incompatible with these hypotheses.

Facts & Assumptions

[F1]

For the connected expander and normalized stable state in the statement, the total mass satisfies ∑x∈VH(θx)≤5α2n/2 (Uniform bound on average H mass — Corollary 2.6).

[F2]

For the nonsynchronized stable state and amplification sequence in the statement, ∑x∈VH(θx)≥cMsin⁡2βM (Mass-angle lower bound — Lemma 4.1).

Proof

Given: The graph, parameters, normalized nonsynchronized stable state and amplification sequence in the statement, under countable choice.

Goal: Establish the threshold inequality and its contradiction consequence.

1.1F1given

The graph is connected and nonempty, the expander condition and α≤1/5 hold, and the stable state is normalized as required by [F1]. Hence its total H mass is at most 5α2n/2.

2.1F2givenstep 1.1algebra∎

The same state is nonsynchronized and the displayed angles and bounds form the sequence required by [F2], so its total H mass is at least cMsin⁡2βM. Combining this with step 1.1 gives cMsin⁡2βM≤5α2n/2. A strict reverse inequality would contradict this bound.

Source notes

Equation (4.2) on PDF page 23 of the cited article states the contradiction threshold. The article citation is attribution; the proof above uses the two declared mathematical results.

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