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.

Simultaneous degree deviations on the squared logarithmic scale

Statement

Fix c>0 and let G∼G(n,p) with np=d≥c(log⁡n)2 and p≤1. Put μ=(n−1)p and t=12μlog⁡n. Eventually, with probability at least 1−2n−3, every loop-free degree di satisfies ∣di−μ∣<t≤12dlog⁡n. The statement applies along every sequence of allowed probabilities.

Facts & Assumptions

Given: The data and hypotheses in the Statement.

Goal: Establish the conclusions in the Statement.

[F1]

The exact-mean Chernoff union estimate is P(∃i:∣di−μ∣≥δμ)≤2ne−μδ2/3 for 0≤δ≤1 (Chernoff bounds with the exact degree mean); the graph law and sequence quantifiers are those of Single-vertex degree laws and the shared-edge dependence and Asymptotic quantifiers and uniform parameter ranges.

Proof

1.1F1algebra

Because μ=(1−1/n)d≥(c/2)(log⁡n)2 eventually, δ=12log⁡n/μ is eventually at most one and δμ=t.

2.1F1step 1.1algebra∎

Substitution in the union bound gives 2nexp⁡(−4log⁡n)=2n−3. Finally μ≤d gives the stated envelope.

Depends on

Used by · 2

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.