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.

Factorial moments of isolated vertices at the connectivity window

Statement

Let G∼G(n,p), let X count isolated vertices (vertices incident to no edges), and write (x)r=x(x−1)⋯(x−r+1), with (x)0=1. For 0≤r≤n, E(X)r=(n)r(1−p)rn−r(r+1)/2. Here a power with exponent zero is the empty product 1, including 00=1 in this formula. If p=(log⁡n+cn)/n and cn→c∈R, then for each fixed integer r≥0, E(X)r→e−cr.

Facts & Assumptions

Given: The objects and hypotheses of the Statement.

Goal: Prove the Statement.

[F1]

Distinct possible edges are independent and each is absent with probability 1−p (The Erdős-Rényi finite random graph G(n,p)).

[F2]

For a finite probability space expectation is the outcome-weighted sum; finite sums can therefore be interchanged (Expectation of a real random variable on a finite probability space).

[F3]

The falling factorial (x)r counts ordered selections of r distinct elements from a set of size x, by successive selection (The factorial n! and the falling factorial n^k̲, defined by recursion in ℕ).

[F4]

Limits and the symbols O and o have their sequence meanings (Asymptotic quantifiers and uniform parameter ranges).

[F5]

The logarithm satisfies log⁡x=∫1xdt/t (The natural logarithm has derivative 1/x and equals the integral from 1 to x of 1/t).

[F6]

For every a>0, log⁡n/na→0 (The logarithm grows more slowly than every positive real power).

[F7]

For an event A in a finite probability space, 1A equals 1 on A and 0 elsewhere (The indicator random variable of an event).

[F8]

The logarithm is the inverse of the exponential: exp⁡(log⁡x)=x for x>0 and log⁡(exp⁡y)=y for real y (The natural logarithm as the inverse of the exponential function).

[F9]

The exponential is continuous on R and is a bijection onto (0,∞) (The exponential is a continuous bijection from ℝ onto (0,∞), its first fact and Statement).

[F10]

Limits of real sequences respect sums, differences, scalar multiples, finite products and quotients with nonzero limiting denominator (Algebra of limits: sums, scalar multiples, products and quotients).

[F11]

On positive reals, the logarithm is continuous, strictly increasing and onto R, log⁡1=0, log⁡(xy)=log⁡x+log⁡y and log⁡(x/y)=log⁡x−log⁡y (Order, continuity, range, and the product, quotient, and reciprocal laws for the natural logarithm).

[F12]
[F13]

Continuous real functions on a compact interval are Riemann integrable. Their oriented integrals reverse sign on reversing endpoints and vanish on zero-length intervals. Integrals preserve pointwise order, and the integral of a constant d over [a,b] is d(b−a), by the constant bounds in the Statement (Continuous functions have an oriented Riemann integral).

[F14]

The oriented Riemann integral is linear in continuous integrands (The oriented Riemann integral is linear in continuous integrands).

[F15]

If ϕ:[c,d]→[a,b] is a monotone surjection, differentiable with one-sided endpoint derivatives and Riemann-integrable derivative, and f is bounded and Riemann integrable on [a,b], then ∫abf(x) dx=∫cdf(ϕ(t))∣ϕ′(t)∣ dt (Monotone change of variable for Riemann-integrable functions).

Proof

technique · direct
1.1F1F2F3F7algebra

For each ordered tuple t of r distinct vertices, let At be the event that every vertex in t is isolated. In each graph, the number of such tuples is (X)r, so (X)r=∑t1At. By the finite expectation formula, E1At=∑ω∈Atw(ω)=P(At), and the two finite sums can be interchanged. The edges required absent consist of r(n−r) edges to the complement and r(r−1)/2 internal pairs, for a total of mn,r=rn−r(r+1)/2. Independence gives P(At)=(1−p)mn,r. There are (n)r tuples, proving the exact formula. When mn,r=0 the absent-edge product is 1, even at p=1; for r=0 there is one empty tuple and its event is the whole probability space.

1.2F5F11F12F13F14F15algebra

Fix 0<u<1. The rational integrands below are continuous by [F12], since x≥1−u>0 on [1−u,1] and 1−t≥1−u>0 on [0,u]; hence they are bounded and integrable by [F13]. The decreasing affine surjection ϕ(t)=1−t from [0,u] onto [1−u,1] has derivative −1 at every point, including the one-sided endpoints (its difference quotient is identically −1), so its derivative is integrable. Applying [F15], then [F5], [F13] and [F14], gives log⁡(1−u)=−∫1−u1dx/x=−∫0udt/(1−t) and log⁡(1−u)+u=−∫0ut/(1−t) dt. To evaluate I:=∫0ut dt, use the affine surjection ψ(t)=u−t from [0,u] onto itself, with the same derivative −1 and the continuous bounded integrand f(x)=x. By [F15] and [F14], I=∫0u(u−t) dt=u2−I, using the constant-integral rule in [F13]; hence I=u2/2. On [0,u] we have 0≤t/(1−t)≤t/(1−u), so [F13] and [F14] give ∣log⁡(1−u)+u∣=∫0ut/(1−t) dt≤u2/[2(1−u)]. At u=0 the identity and bound follow from the zero-length integral rule and log⁡1=0.

2.1step 1.1step 1.2F3F4F6F10F11algebra

Since cn→c, eventually ∣cn∣≤∣c∣+1. The logarithm is unbounded above by [F11], so p=O(log⁡n/n)→0, and np2=O((log⁡n)2/n)→0 by [F6] with a=1/2. For fixed r, therefore mn,rlog⁡(1−p)=−mn,rp+o(1)=−r(log⁡n+cn)+o(1). Also qn:=(n)r/nr=∏j=0r−1(1−j/n)→1 by the finite product limit rule, and qn>0 eventually.

3.1step 1.1step 2.1F4F8F9F10F11algebra∎

Fix r≥1. Eventually n≥r and 0≤p<1, so the exact moment in step 1.1 is positive. The product and quotient laws for logarithms, applied repeatedly to its integer powers, give log⁡(E(X)r)=log⁡qn+rlog⁡n+mn,rlog⁡(1−p)=−rcn+o(1)→−rc, since log⁡qn→log⁡1=0. Apply the inverse relation and continuity of the exponential to conclude E(X)r→exp⁡(−rc)=e−cr. For r=0 the moment is identically 1=e0.

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.