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.

Uniform two-sided expansion sufficient for global synchrony

Statement

Fix γ0>1, and let a,b,η be the constants in the positive-degree-envelope lemma. For all sufficiently large n, uniformly over p∈[0,1] with d=np≥γ0log⁡n, the graph G(n,p) is an (n,d,α,c−,c+)-expander with probability at least 1−Kd−1/4−n−η−n−2, where K is the constant of the uniform-centered-adjacency lemma, α=d−1/4, c−=a/2−1>−1 and c+=b. In particular d>0, 1+c−=a/2>0 is fixed, and c+ is bounded independently of n,p.

Facts & Assumptions

[F1]

The norm failure probability is at most Kd−1/4 (Uniform small centered adjacency above logarithmic mean degree); the degree-envelope failure probability is at most n−η+n−2 (A positive minimum degree envelope at every fixed supercritical ratio). Their union obeys The finite union bound.

[F2]

The exact centered matrices and expander predicate are those of Two-sided spectral expander — Definition 1.9; in particular, ΔA=A−pJ is real symmetric. For real t≥0, a real symmetric matrix of norm at most t lies between −tI and tI in Loewner order (Self-adjoint order, norm bounds and diagonal tests).

[F3]

The graph law G(n,p) is the labelled loop-free independent-edge model of Erdős–Rényi random graph and high probability. Both probability estimates in [F1] apply to this same law.

[F4]

The integral logarithm L is unbounded above (The integral logarithm is unbounded above and below) and strictly increasing on (0,∞) (The integral logarithm is continuous and strictly increasing on (0,∞)), and L(x)=log⁡x for every x>0 (The integral logarithm L is the published natural logarithm).

Proof

Given: The graph parameters and constants in the Statement.

Goal: Establish the stated expander event and probability.

1.1F1F2F3F4given

For any M∈R, [F4] gives an x>0 with L(x)>M. For every positive integer n≥x, monotonicity and identification give log⁡n=L(n)≥L(x)>M. Thus log⁡n→∞. Since d≥γ0log⁡n and γ0>1 is fixed, d→∞ uniformly over the admissible p. Eventually n≥3, d≥log⁡n>0 and α=d−1/4≤min⁡{a/2,1}, so both estimates in [F1] apply to [F3]. Outside the union of their failure events, all degrees are in [ad,bd] and ∥ΔA∥<d3/4=αd.

2.1F2step 1.1

Write D for the degree matrix. The definition yields the exact identity ΔL=L−dI+pJ=D−dI−ΔA. The diagonal bounds and [F2] therefore imply (a−1−α)dI⪯ΔL⪯(b−1+α)dI. By step 1.1 these imply (a/2−1)dI⪯ΔL⪯bdI, as required. This uses the actual loop-free degrees and centering, including the −pI shift in ΔA.

3.1F1F2step 1.1step 2.1∎

Combining the adjacency and Laplacian conditions gives the declared expander event. The union bound in [F1] supplies its probability lower bound. The constants depend only on the fixed lower density ratio and not on the chosen sequence p(n).

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.