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

Refined order estimates for regular graphs — Remark 2.7

PDF p. 16: Remark 2.7; Section 5 discussion; PDF p. 29: Remark 2.7; Section 5 discussion

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 0≤α≤0.24585, one has ρ12≥1−3α, ∣ρ2∣≥1−5α2, and M≤5α2/4. For 0≤α≤0.1, the stronger first bound ρ12≥1−2α holds. The regular version of the article's bootstrap uses, for x>0, freg(x,α)=2x+3α−1−(1−2α2/x)2; its associated polynomial is Qα(x)=x2freg(x,α)=2x3+(3α−2)x2+4α2x−4α4. The article prints the last sign as positive; the corrected algebra does not change the quantitative conclusions above.

As a separately attributed assertion, the final sentence of Remark 2.7 gives n−1∑x∈VH(θx)≤5α2/4 for a d∗-regular (n,d∗,α)-expander and a stable state θ, under the article's standing connectedness and phase-normalization conventions. That sentence states no explicit restriction on α. Its scope beyond 0≤α≤0.24585 is retained here as a source assertion; the local proof establishes the range-qualified estimates above.

Facts & Assumptions

[F1]

The endpoint extension proves X≥1−3α and r≥1−5α2 for 0≤α≤0.24585 (Both tractable inequalities at the regular endpoint).

[F2]

The regular small-alpha and mass estimates give X≥1−2α for α≤0.1 and M≤5α2/4 throughout α≤0.24585 (Small-alpha first parameter and regular H mass).

[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 the estimates on the explicitly stated parameter ranges and the corrected polynomial identity.

1.1F1F2given

All graph, stability, rotation and nonnegative-parameter hypotheses agree with those of [F1] and [F2]. Apply [F1] on 0≤α≤0.24585 to obtain both extended Lemma 2.5 inequalities. Apply [F2] on the same range for the mass estimate and on 0≤α≤0.1 for the stronger first-parameter estimate.

2.1givenstep 1.1algebra∎

For x>0, expand the square in the definition of freg and multiply by x2: x2freg=2x3+(3α−2)x2+4α2x−4α4. This proves the asserted polynomial identity. In particular the printed positive constant term is an algebraic transcription error, while the range-qualified quantitative conclusions have been established independently in step 1.1.

Source notes

Remark 2.7 on original PDF p. 16 asserts all the estimates retained here. Its printed cubic is 2x3+(3α−2)x2+4α2x+4α4. The last sign is a typo: multiplying 2x+3α−1−(1−2α2/x)2 by x2 gives the corrected Qα(x) in the Statement. This algebraic defect does not refute any order-parameter conclusion. The present proof keeps the source's regular Hessian inequality and pointwise-to-norm method, strengthens the norm step by removing the constant phase-vector component, and supplies a finite rational bootstrap in place of the source's unprovided endpoint root calculation. The source's final sentence attributes n−1∑x∈VH(θx)≤5α2/4 to the proof of Corollary 2.6 for a d∗-regular (n,d∗,α)-expander, without an explicit α restriction in that sentence. The preceding sentences discuss α≤0.1 and α≤0.24585, while Corollary 2.6 itself assumes α≤1/5. The unrestricted reading of the final sentence is therefore preserved as attributed coverage, with its intended inherited range left unspecified. The local mass estimate is established for 0≤α≤0.24585, including the later application α=0.0816. The broader reading is neither established nor refuted here, and no failure of an order-parameter or synchrony conclusion is inferred.

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