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.

A maximum-degree tail with an explicit logarithmic exponent

Statement

For G(n,p) with 0<p<1, put μ=np>0. Its maximum degree satisfies P(dmax⁡≥8μ)≤nexp⁡(−6μ). If μ=γlog⁡n and γ>1, this is at most n−γ.

Facts & Assumptions

[F1]

Since μ=np>0 and 0<p<1, n≥1, so the vertex set [n] is nonempty. Vertex degree counts incident edges and dmax⁡ is the maximum of those degrees (Adjacency, incidence, open and closed neighbourhoods, vertex degree, minimum degree and maximum degree). Thus a vertex degree is the sum of its n−1 independent Bernoulli edge indicators (The Erdős-Rényi finite random graph G(n,p)). Each Bernoulli indicator is 1 with probability p and 0 with probability 1−p (Bernoulli random variables and binomial random variables as sums of independent Bernoulli trials).

[F2]

Finite product weights factor over independent edge coordinates (The finite product of finite probability spaces).

[F3]

For outcome weights w(ω)≥0, expectation is EX=∑ω∈ΩX(ω)w(ω) (Expectation of a real random variable on a finite probability space), while an event E⊆Ω has probability P(E)=∑ω∈Ew(ω) (Finite probability spaces, outcome weights, events, and event probabilities).

[F4]

The exponential has series exp⁡(x)=∑j≥0xj/j!, and e=exp⁡(1) (The real exponential function and the number e by a power series).

[F5]

The exponential satisfies its addition formula (The exponential addition formula exp(x+y)=exp(x)exp(y)).

[F6]

The bound 1+x≤exp⁡(x) holds for every real x (1+x≤exp(x) for every real x, hence (1-p)ᵐ≤exp(-mp)).

[F7]

Real powers obey na=exp⁡(alog⁡n) (Real powers for positive bases, with the zero-base positive-exponent convention).

[F8]

For x>0, log⁡x is the unique real number with exp⁡(log⁡x)=x (The natural logarithm as the inverse of the exponential function).

[F9]

The exponential is strictly increasing on the real line (The exponential function is strictly increasing).

[F10]

For real r with ∣r∣<1, the geometric series satisfies ∑k=0∞rk=1/(1−r). At r=1/2 this gives ∑k=1∞2−k=1 (For |r| < 1, ∑_k ≥ 0 rᵏ = 1/(1-r), and for |r| ≥ 1 the series diverges).

Proof

Given: The objects and hypotheses in the Statement.

Goal: Prove its conclusions.

1.1F1F2F3F4F5F6F9F10givenalgebra

By [F10] at r=1/2, the series gives e<3: for j≥2, j!≥2j−1, with strict inequality for j≥3, so e<2+∑j≥22−(j−1)=3. For any vertex degree D, independence gives Eexp⁡(D)=(1−p+pe)n−1≤exp⁡((e−1)(n−1)p)≤exp⁡(2μ). By [F9], on D≥8μ the random variable exp⁡(D) is at least exp⁡(8μ), and exp⁡(8μ)>0 by [F4]. Hence the nonnegative finite expectation sum gives P(D≥8μ)≤exp⁡(−6μ).

2.1F1F3F4F5F7F8F9step 1.1algebra∎

The indicator of a union of the n vertex events is at most the sum of their indicators. Sum their probabilities to get the displayed maximum-degree bound. For μ=γlog⁡n, [F5], [F7] and [F8] give nexp⁡(−6μ)=exp⁡((1−6γ)log⁡n)=n1−6γ. Since n≥1=exp⁡(0), [F8] and [F9] imply log⁡n≥0. Now γ>1 gives 1−6γ<−γ, so [F9] yields n1−6γ≤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.