Alphabeta Math
Pipeline-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.

✓ 1 result · all verified · 1 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs; all 1 also cleared it.

Concentration — Examples

1 · Prerequisites

2 · Summary

These examples apply the A-page bounds to a Rademacher sum, a perfectly dependent Gaussian maximum, and a sub-Gaussian vector. A symmetric countable distribution shows why finite variance alone cannot give a sub-Gaussian tail. Each calculation retains the parameter and degenerate-case assumptions of the theorem it uses.

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

ExampleConstruction: AI-adaptedVerification: AI-adaptedjudge pass (gpt-6-luna)Open item page →

A Rademacher sum

Example

Assume AC. Let n≥1 and let X1,…,Xn be independent Rademacher variables, meaning P(Xi=1)=P(Xi=−1)=1/2, and put Sn=∑i=1nXi. For every t>0, P(∣Sn∣≥t)≤2e−t2/(2n).

Facts & Assumptions

Given: AC, an integer n≥1, and independent real random variables X1,…,Xn with the two-point laws stated in the Example.

[A1]

Assume AC as required by the Hoeffding supplier used here (The Axiom of Choice).

[F1]

A real random variable is a measurable map to (R,B(R)) (Random elements and real random variables).

[F2]

Independence means independence of the sigma-algebras generated by the variables (Independent random elements).

[F3]

Expectation is integration against the probability law (Expectation of a nonnegative or integrable random variable).

[F4]

For independent variables in finite ranges [ai,bi], Hoeffding gives P(∣∑i(Xi−EXi)∣≥t)≤2e−2t2/∑i(bi−ai)2 when the denominator is positive (Hoeffding inequality for independent bounded sums).

Verification

1.1givenA1F1F2F3algebra

Each Xi is a real random variable by [F1], and their given independence is understood by [F2]. Their two-point laws make them integrable with mean (1/2)⋅1+(1/2)⋅(−1)=0 by [F3], and they lie in [−1,1] almost surely. Thus the Hoeffding width sum is ∑i(1−(−1))2=4n.

2.1F4step 1.1algebra∎

Apply [F4] with those endpoints. The exponent is −2t2/(4n)=−t2/(2n), yielding the stated bound.

ExampleConstruction: AI-adaptedVerification: AI-adaptedOpen item page →

A Gaussian maximum without independence

Example

Assume AC. Let σ>0, let G∼N(0,1), and set Zj=σG for every 1≤j≤m, where m≥1. These variables are perfectly dependent. For every t>0, P(max⁡1≤j≤m∣Zj∣≥t)≤2mexp⁡ ⁣(−t22σ2).

Facts & Assumptions

Given: AC, σ>0, m≥1, and a standard normal random variable G.

[A1]

Assume AC as required by the standard-normal law construction (The Axiom of Choice).

[F1]

The law N(0,1) has density ϕ(x)=e−x2/2/2π, and N(0,σ2) is the law of x↦σx applied to N(0,1) (Standard normal and normal laws).

[F2]

The standard normal density is positive and integrates to one (The standard normal density has total mass one).

[F3]

For a nonnegative measurable g, or an integrable real g, expectation of g(G) is its integral against the law of G (Change of variables for expectation). Integration against the density law satisfies ∫g dN(0,1)=∫g(x)ϕ(x) dx for nonnegative measurable g (Integrating against a density agrees with integrating the product); applying this to the positive and negative parts gives the signed formula once absolute integrability is established.

[F4]

One-dimensional substitution satisfies ∫φ(c)φ(d)h=∫cd(h∘φ)φ′ when h is continuous and the stated differentiability and integrability hypotheses hold (Substitution: if φ is differentiable on [c,d] with φ′ integrable and f is continuous on an interval containing φ([c,d]), then ∫φ(c)φ(d)f=∫cd(f∘φ) φ′).

[F5]

Increasing nonnegative measurable functions pass to their limit under the integral (Monotone convergence for the integral).

[F9]

A continuous real function is Borel measurable under AC (Continuous functions on Euclidean spaces are Borel measurable).

[F10]

A centered variable is sub-Gaussian with proxy σ2 when its moment generating function is bounded by eλ2σ2/2 for every real λ (Sub-Gaussian variables and vectors, and sub-exponential variables).

[F11]

For m possibly dependent centered sub-Gaussian variables with common proxy σ2, P(max⁡j∣Yj∣≥t)≤2me−t2/(2σ2) (Finite sub-Gaussian maxima and epsilon-net reduction).

[F12]

Expectation is linear on integrable real random variables (Linearity, monotonicity, and the modulus bound for expectation).

[F13]

Under Countable Choice, every bounded Riemann-integrable function on a nondegenerate compact interval has the same Lebesgue and Riemann integrals (A bounded Riemann integrable function on a closed bounded interval is Lebesgue measurable and has the same integral). AC in [A1] implies Countable Choice, so this applies to the bounded continuous integrands supplied by [F8].

Verification

1.1A1F1F2F3F4F5F7F8F13algebra

Write ϕ(x)=e−x2/2/2π. By [F7] and composition, u↦e−u is continuous and integrable on compact intervals by [F8]. The map x↦x2/2 is differentiable with derivative x by [F7]; the identity x is continuous because ∣x−y∣<η whenever ∣x−y∣<δ with δ=η, so it is integrable on [0,R] by [F8]. Thus [F4] applies. By [F7], (−e−u)′=e−u, so [F8] evaluates the resulting integral: ∫0Rxϕ(x) dx=(1−e−R2/2)/2π≤1/2π. The integrand xϕ(x) is continuous and bounded on every compact interval by [F7] and [F8], so [F13] identifies these Riemann integrals with Lebesgue integrals. Reflection x=−y in [F4], followed by [F13], gives ∫−R0(−x)ϕ(x) dx=∫0Rxϕ(x) dx since ϕ is even. Letting integer R increase to infinity, [F2], [F3] for nonnegative functions, and [F5] give E∣G∣=2∫0∞xϕ(x) dx<∞. Since ϕ is even, the positive and negative parts of xϕ(x) have equal integrals, so [F3] for integrable functions gives EG=0.

1.2F3F6F7F9algebra

Put a=λσ. The function x↦eax is continuous and Borel measurable by [F7] and [F9], so [F3] and completing the square, using [F6], give EeλσG=12π∫Reax−x2/2 dx=ea2/212π∫Re−(x−a)2/2 dx.

2.1F2F4F5F7F8F13step 1.2algebra

For every positive integer R, [F4] with translation by a gives ∫−RRe−(x−a)2/2 dx=∫−R−aR−ae−y2/2 dy. The two integrands are continuous and bounded on these compact intervals by [F7] and [F8]; [F13] therefore identifies both sides with their Lebesgue integrals. Both interval families increase to R, so [F5] passes these equal integrals to the whole-line limit; [F2] identifies that limit as 2π. Step 1.2 then yields EeλσG=ea2/2=eλ2σ2/2.

3.1F1F10F11F12step 1.1step 2.1∎

By [F12] and step 1.1, EZj=σEG=0; step 2.1 gives its moment generating function. Thus each Zj is centered sub-Gaussian with proxy σ2 by [F10]. Apply [F11] to the m variables. They are all equal, but the bound requires no independence.

ExampleConstruction: AI-adaptedVerification: AI-adaptedjudge pass (gpt-6-luna)Open item page →

A sub-Gaussian vector norm bound

Example

Let d≥1 and let Z∈Rd be a centered sub-Gaussian vector with proxy σ2>0. Choosing ϵ=1/2 in the net reduction gives, for every t>0, P(∥Z∥2≥t)≤2⋅5de−t2/(8σ2). If σ2=0, the same probability is 0.

Facts & Assumptions

Given: A centered sub-Gaussian vector Z∈Rd, with d≥1 and proxy σ2≥0.

[F1]

A centered vector with proxy σ2 has each projection ⟨u,Z⟩ sub-Gaussian with proxy σ2∥u∥22 (Sub-Gaussian variables and vectors, and sub-exponential variables).

[F2]

For 0<ϵ<1, the net reduction gives P(∥Z∥2≥t)≤2(1+2/ϵ)dexp⁡(−(1−ϵ)2t2/(2σ2)) when σ2>0, and zero tail when σ2=0 (Finite sub-Gaussian maxima and epsilon-net reduction).

Verification

1.1givenalgebra

The choice ϵ=1/2 is in (0,1) and gives the finite-net factor (1+2/ϵ)d=5d.

2.1F1F2step 1.1algebra∎

By [F1], Z satisfies the centered projection condition required by [F2]. Apply [F2] with the value from step 1.1. Since (1−1/2)2/(2σ2)=1/(8σ2), the stated positive-proxy bound follows; the zero-proxy clause of [F2] gives the boundary case.

CounterexampleConstruction: AI-adaptedVerification: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

Finite variance does not imply a sub-Gaussian tail

Statement refuted

Every centered real random variable with finite variance is sub-Gaussian with some finite proxy.

Facts & Assumptions

Given: A countable atomic probability space, the real random variable defined below, and the meanings of expectation, variance, and sub-Gaussian proxy.

[F1]

A measure is nonnegative and countably additive, and a probability measure has total mass 1 (Measures on sigma-algebras, Probability measures and probability spaces).

[F2]

A real random variable is a measurable map to (R,B(R)) (Random elements and real random variables).

[F3]

Expectation is integration against the probability measure, and the variance of a square-integrable real variable is E[(X−EX)2] (Expectation of a nonnegative or integrable random variable, Moments, variance, and covariance on a probability space).

[F4]

A series is the limit of its partial sums when those partial sums converge; a nonnegative series with bounded partial sums converges to their supremum (Series, partial sums, convergence and the sum, divergence, and the tail series, A series of nonnegative terms converges iff its partial sums are bounded, and then the sum is their supremum).

[F5]

Increasing nonnegative functions pass to their limit under the integral (Monotone convergence for the integral).

[F6]

A centered variable with sub-Gaussian proxy σ2 satisfies P(∣X∣≥t)≤2e−t2/(2σ2) for σ2>0, and its positive-threshold tail is zero for σ2=0 (Finite sub-Gaussian maxima and epsilon-net reduction).

[F7]

For every positive a and natural m, xm/eax→0 as x→+∞ (The exponential dominates every fixed nonnegative integer power at +∞).

Counterexample

1.1givenF4algebra

Let S=∑k=1∞k−4. Its partial sums are increasing, and for k≥2, k−4≤k−2≤1/[k(k−1)]=1/(k−1)−1/k; hence 1≤S≤2 and S is finite by [F4]. Set c=(2S)−1>0.

1.2givenF1F4algebra

Enumerate Ω={(k,s):k≥1, s∈{−1,1}} by ω2k−1=(k,1), ω2k=(k,−1), and assign each atom weight w2k−1=w2k=ck−4. Define P(A)=∑j≥1wj1A(ωj) for A⊆Ω. The weights are nonnegative and sum to 2cS=1, so all subseries converge by [F4]. For pairwise disjoint Ar, put arj=wj1Ar(ωj) and qj=∑rarj; at most one term in each qj is nonzero. For every finite atom prefix J, only finitely many Ar meet that prefix, so finite regrouping gives ∑j=1Jqj=∑r∑j=1Jarj≤∑rP(Ar). Taking the supremum over J yields P(⋃rAr)≤∑rP(Ar). Conversely, for each finite event prefix R and each δ>0, convergence of the finitely many subseries lets us choose one atom prefix J for which ∑r=1RP(Ar)−δ≤∑r=1R∑j=1Jarj≤∑j=1Jqj≤P(⋃rAr). Letting δ↓0 and then taking the supremum over R proves the reverse inequality. Thus [F1] makes P a probability measure.

1.3F1F2given

Define X(k,s)=sk on (Ω,P(Ω),P). It is a real random variable by [F2], since every preimage is a subset of the full-power-set sample space.

1.4F3F5algebra

By [F5] applied to finite atom prefixes, E∣X∣=2c∑k≥1k−3 and EX2=2c∑k≥1k−2. For k≥2, k−3≤k−2≤1/[k(k−1)], whose partial sums telescope to at most 1; hence both moments are finite, so X is integrable and square-integrable. The two atoms at each k have equal mass and opposite values; since E∣X∣<∞, their absolutely convergent contributions cancel and EX=0. By [F3], X is centered with finite variance Var⁡(X)=EX2.

2.1givenstep 1.2step 1.3

For every integer n≥1, the atoms (n,1) and (n,−1) give P(∣X∣≥n)≥2cn−4>0.

3.1F6step 2.1assume-contra

Suppose for contradiction that X has a finite sub-Gaussian proxy σ2. If σ2=0, [F6] contradicts the positive tail in step 2.1.

4.1F6F7F8step 2.1assume-contraalgebradischarge-contradiction: no finite proxy can satisfy the assumed bound∎

If σ2>0, [F6] gives 2cn−4≤P(∣X∣≥n)≤2e−n2/(2σ2). By [F8], n4e−n2/(2σ2)=(n2)2/en2/(2σ2), which tends to 0 by [F7] with x=n2, m=2, and a=1/(2σ2). It is eventually smaller than c, so the upper tail is eventually smaller than 2cn−4, contradicting step 2.1. Thus this centered finite-variance variable is not sub-Gaussian for any finite proxy.

Sources