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.

✓ 7 results · all verified · 6 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. The 1 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Concentration

1 · Prerequisites

2 · Summary

This page turns moment-generating-function bounds into finite-sample tail guarantees. It defines scalar and vector sub-Gaussian proxies and the restricted moment-generating-function range for sub-exponential variables. It proves independent bounded-sum Hoeffding and Bernstein bounds, a finite maximum inequality, and an epsilon-net reduction with a local volume proof. McDiarmid's inequality is proved from a Doob martingale whose conditional endpoint widths are checked by product integration. The page keeps independence, boundedness, variance, measurability, and the Axiom of Choice assumptions attached to the results that use them.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Sub-Gaussian variables and vectors, and sub-exponential variables

Definition

Use the real random variable convention of Random elements and real random variables and the expectation convention of Expectation of a nonnegative or integrable random variable. A real random variable X is centered when it is integrable and EX=0. A vector random element Z=(Z1,…,Zd) in Rd, for an integer d≥1, is centered when each coordinate is integrable and EZj=0. For u,z∈Rd, write ⟨u,z⟩=∑j=1dujzj and ∥u∥2=(∑j=1duj2)1/2, using the Euclidean convention in Euclidean spheres and closed balls as subspaces of Rn.

For σ2≥0, a centered real random variable X is sub-Gaussian with proxy σ2 if EeλX≤eλ2σ2/2for every λ∈R. A centered vector random element Z∈Rd is sub-Gaussian with proxy σ2 if Eeλ⟨u,Z⟩≤eσ2λ2∥u∥22/2for every u∈Rd and λ∈R.

For ν2≥0 and b>0, a centered real random variable X is sub-exponential with parameters (ν2,b) if EeλX≤eλ2ν2/2whenever ∣λ∣≤1/b.

The parameters σ2 and ν2 are moment-generating-function upper-bound proxies; they are not asserted to equal the variance. The vector condition controls every one-dimensional projection and does not assert independence of coordinates.

TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

Hoeffding inequality for independent bounded sums

Statement

Assume AC. Let n≥1 and let X1,…,Xn be independent integrable real random variables on one probability space. Suppose finite real numbers ai≤bi satisfy ai≤Xi≤bi almost surely for every i. Put V=∑i=1n(bi−ai)2 and S=∑i=1n(Xi−EXi). For every t>0, if V>0 then P(∣S∣≥t)≤2exp⁡ ⁣(−2t2V), and if V=0 then P(∣S∣≥t)=0. The two one-sided tails are each bounded by exp⁡(−2t2/V) when V>0.

Facts & Assumptions

Given: AC, n≥1, independent integrable real random variables Xi, and deterministic finite intervals [ai,bi] containing Xi almost surely.

[A1]

Assume the Axiom of Choice, namely every family of nonempty sets has a choice function (The Axiom of Choice). AC is used by the supplied conditional-expectation and conditional-Hoeffding results.

[F1]

Independence means that the sigma-algebras generated by the random variables are an independent family (Independent random elements).

[F2]

Disjoint groups from an independent family generate independent sigma-algebras (Disjoint groups of an independent sigma-algebra family remain independent).

[F3]

If an integrable random variable is independent of a sigma-algebra, its conditional expectation given that sigma-algebra is its ordinary expectation (Conditioning a known variable and an independent variable).

[F4]

Expectation is monotone: X≤Y almost surely implies EX≤EY (Linearity, monotonicity, and the modulus bound for expectation).

[F5]

If D∈L1, E[D∣G]=0, and finite G-measurable endpoints A≤D≤B have deterministic width B−A≤c, then E[eλD∣G]≤eλ2c2/8 almost surely (Conditional Hoeffding bound for bounded martingale differences).

[F6]

Conditional expectation is linear, preserves constants, and preserves the unconditional expectation, so E[E[Y∣G]]=EY (Basic algebra and order properties of conditional expectation).

[F7]

A bounded measurable factor known under G can be taken outside conditional expectation (Taking out what is known).

[F8]

For a nonnegative random variable Y and r>0, P(Y≥r)≤E[Y]/r (Markov's inequality for random variables).

[F9]

The probability of a finite union of events is at most the sum of their probabilities (Basic identities for a probability measure).

[F11]

Every closed bounded interval [a,b] with a≤b is compact (Heine-Borel by bisection: every closed bounded interval [a,b] is compact).

[F12]

A continuous real function is bounded on a compact subset of R (A continuous real function on a compact subset of R is bounded).

[F13]

Sums and differences of measurable real-valued functions are measurable (Arithmetic and lattice operations preserve measurability whenever they are defined).

Proof

1.1givenA1F1F2F3F6F13

Set F0={∅,Ω}, Fi=σ(X1,…,Xi), Di=Xi−EXi, and ci=bi−ai. By [F13], Di is Fi-measurable. By [F1] and [F2], Xi is independent of Fi−1; [F3] gives E[Xi∣Fi−1]=EXi, and conditional linearity and preservation of constants in [F6] therefore give E[Di∣Fi−1]=0 almost surely.

1.2givenF4

By [F4], ai≤EXi≤bi. Therefore Di lies almost surely in the finite interval [ai−EXi,bi−EXi], whose endpoints are Fi−1-measurable, contain 0, and have width ci; in particular ∣Di∣≤ci.

2.1A1F5step 1.1step 1.2

Apply [F5] to each Di and the filtration Fi−1 from step 1.1. For every real λ, E[eλDi∣Fi−1]≤eλ2ci2/8 almost surely.

3.1F6F7F10F11F12F13step 1.2step 2.1algebraconstruct

Let Sk=∑i=1kDi and S0=0. Step 1.2 gives ∣Di∣≤ci, hence Sk−1∈[−C,C] for C:=∑i<kci. This closed bounded interval is compact by [F11], and x↦eλx is continuous by [F10] and continuity of scalar multiplication, so [F12] makes eλSk−1 bounded. Also x↦eλx is Borel: its open-set preimages are open, and the class of Borel sets whose preimages are Borel is a sigma-algebra containing the opens, hence contains the Borel sigma-algebra (The Borel sigma-algebra of a topological space). For each Borel B, the preimage of B under eλSk−1 is Sk−1−1((x↦eλx)−1(B)), so this bounded factor is Fk−1-measurable. By the addition formula in [F10], eλSk=eλSk−1eλDk; conditional expectation preservation [F6], taking out the known factor [F7], and step 2.1 give EeλSk≤eλ2ck2/8EeλSk−1. Finite induction gives EeλSn≤eλ2V/8.

4.1givenF8F10step 3.1algebra

If V=0, every ci=0, so each Xi=ai=bi almost surely and S=0 almost surely. If V>0 and λ>0, then eλS is nonnegative and S≥t implies eλS≥eλt>0 by [F10]. Markov [F8] and step 3.1 give P(S≥t)≤eλ2V/8/eλt=exp⁡(−λt+λ2V/8), using the reciprocal and addition formulas in [F10]. Choosing λ=4t/V gives P(S≥t)≤e−2t2/V.

5.1F8F9F10step 3.1step 4.1algebra∎

If V>0, substitute −λ in the all-real MGF bound from step 3.1. Since e−λS is nonnegative and S≤−t implies e−λS≥eλt>0 by [F10], Markov [F8] gives P(S≤−t)≤eλ2V/8/eλt; choosing λ=4t/V yields e−2t2/V. The finite union bound [F9] combines the two tails; step 4.1 already handles V=0. This lower-tail argument uses the same original variables and does not assert independence of their negatives.

TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

Bernstein inequality for bounded independent sums

Statement

Let n≥1 and let X1,…,Xn be independent centered square-integrable real random variables. Suppose b≥0 is finite and ∣Xi∣≤b almost surely for each i. Put v=∑i=1nVar⁡(Xi). For t>0, if v>0 then P(∣∑i=1nXi∣≥t)≤2exp⁡ ⁣(−t22(v+bt/3)), and if v=0 then this probability is 0.

Facts & Assumptions

Given: Independent centered square-integrable real random variables X1,…,Xn, a finite deterministic bound b≥0, and ∣Xi∣≤b almost surely.

[F1]

For centered Xi, Var⁡(Xi)=E[Xi2] (Moments, variance, and covariance on a probability space).

[F2]

For independent real random variables and nonnegative Borel functions gi, the expectation of their product factors as the product of their expectations (Expectations factor over finite products of independent random variables).

[F3]

If Y≥0 and r>0, then P(Y≥r)≤E[Y]/r (Markov's inequality for random variables).

[F4]

ex=∑k=0∞xk/k!, and this series converges absolutely for every real x (The real exponential function and the number e by a power series, The exponential series converges absolutely for every real argument).

[F6]

A nonnegative measurable function with integral 0 vanishes almost everywhere (A nonnegative measurable function has integral 0 exactly when it vanishes almost everywhere).

[F7]

The probability of a finite union of events is at most the sum of their probabilities (Basic identities for a probability measure).

[F8]

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

[F9]

Expectation is linear, monotone, and bounded in modulus by the expectation of the absolute value (Linearity, monotonicity, and the modulus bound for expectation).

[F10]
[F11]

Finite sums of real-valued measurable functions are measurable (Arithmetic and lattice operations preserve measurability whenever they are defined).

Proof

1.1givenF1F6F11

Let vi=E[Xi2]. If v=0, then every vi=0 because vi≥0. By [F6], Xi2=0 almost surely for every i, so the finite sum is 0 almost surely and the stated tail probability is 0.

1.2givenF1F4F5F9F10algebraconstruct

Suppose v>0. If b=0, every Xi=0 almost surely and v=0, a contradiction; hence b>0. For each fixed real θ, gθ(x)=eθx is continuous: when θ≠0, continuity of x↦θx follows from ∣θx−θy∣=∣θ∣∣x−y∣, and continuity of its composition with ex follows from [F10]; when θ=0 it is constant. Thus gθ is Borel: the Borel sets whose inverse images under gθ are Borel form a sigma-algebra containing every open set, hence contain the sigma-algebra generated by opens (The Borel sigma-algebra of a topological space). For each Borel B, {gθ(Xi)∈B}=Xi−1(gθ−1(B)) is measurable. Now fix i and λ with 0<∣λ∣<3/b. For N≥2, the exponential series tail on [−b,b] is uniformly bounded by rN=∑k>N(∣λ∣b)k/k!→0. Each partial sum at Xi is integrable; the uniform bound and [F9] give ∣E[eλXi]−E[∑k=0N(λXi)k/k!]∣≤rN, so expectation passes to the series limit. Centering removes the linear term, and for every k≥2, ∣E[Xik]∣≤bk−2vi by [F1] and monotonicity. Also k!≥2⋅3k−2 for k≥2: equality holds at k=2,3, and each subsequent factorial factor is at least 3. Hence the geometric-series bound and 1+x≤ex from [F5] give EeλXi≤1+λ2vi/[2(1−∣λ∣b/3)]≤exp⁡(λ2vi/[2(1−∣λ∣b/3)]).

2.1F2F3F8F10F11step 1.2algebra

Let S=∑i=1nXi, a measurable real random variable by [F11]. By the addition formula [F10], eλS=∏ieλXi; independence [F8] and factorization [F2], applied to the nonnegative Borel functions established in step 1.2, give EeλS≤exp⁡(λ2v/[2(1−λb/3)]) for 0<λ<3/b. Since ex is positive and increasing [F10], S≥t implies eλS≥eλt>0, so [F3] and the reciprocal and addition formulas in [F10] give P(S≥t)≤exp⁡(−λt+λ2v/[2(1−λb/3)]). Choose λ=t/(v+bt/3); then λb/3<1 and direct simplification gives P(S≥t)≤exp⁡(−t2/[2(v+bt/3)]).

3.1F2F3F7F8F10F11step 1.2step 2.1algebra∎

For 0<λ<3/b, the bound in step 1.2 also holds at parameter −λ. By [F10], e−λS=∏ie−λXi; the original variables remain independent by [F8], and [F2] factors these nonnegative Borel functions, giving Ee−λS≤exp⁡(λ2v/[2(1−λb/3)]). Since S≤−t implies e−λS≥eλt>0, Markov [F3] and the same optimizing choice as in step 2.1 yield P(S≤−t)≤exp⁡(−t2/[2(v+bt/3)]). By [F7], the two one-sided bounds imply the displayed two-sided bound without asserting independence of the transformed variables −Xi.

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

Finite epsilon nets of the Euclidean sphere

Statement

Let d≥1 be an integer and 0<ϵ<1. There is a finite set N⊆Sd−1 such that every u∈Sd−1 has some v∈N with ∥u−v∥2≤ϵ, and ∣N∣≤(1+2/ϵ)d. Here Sd−1={u∈Rd:∥u∥2=1} by Euclidean spheres and closed balls as subspaces of Rn. Such a set is called an ϵ-net of the sphere.

Facts & Assumptions

Given: An integer d≥1 and 0<ϵ<1.

[F1]

The closed Euclidean ball and sphere are B‾2(c,r)={x:∥x−c∥2≤r} and S2(c,r)={x:∥x−c∥2=r}; the unit sphere is Sd−1=S2(0,1) (Euclidean spheres and closed balls as subspaces of Rn).

[F2]

d2(x,y)=∥x−y∥2 is a metric, so it satisfies the triangle inequality (Rn as the set of functions n→R, and d1, d2, d∞ are metrics on it).

[F3]

Closed Euclidean balls are Jordan measurable, with V1(r)=2r and the stated slicing recursion for Vd(r) (Closed Euclidean balls are Jordan measurable and their volumes satisfy the slicing recursion).

[F4]

An invertible linear map scales Jordan content by the absolute determinant; in particular cont⁡(rB‾2(0,1))=rdcont⁡(B‾2(0,1)) for r>0 (A linear endomorphism of Rn sends bounded Jordan sets to bounded Jordan sets and scales their content by the absolute determinant).

[F6]

Jordan content is additive on finite disjoint families of bounded Jordan sets (Jordan content is finitely additive when the overlap has content zero).

[F7]

Jordan outer content is the infimum of volumes of finite rectangle covers, and the content of a Jordan set is its common inner/outer value (Jordan inner and outer content and Jordan measurable bounded sets in Rm).

[F8]

The natural numbers are unbounded in R (Every complete ordered field is Archimedean).

[F9]

Every nonempty finite set of real numbers has a maximum (Every nonempty finite set of reals has a maximum and a minimum).

[F10]

For rational α>0, rational powers preserve order on positive bases, and 0α=0 (Monotonicity of r↦ar and of a↦ar, Rational powers ar of a positive base).

[F11]

The Riemann integral is monotone and additive across a cut, and the integral of a constant c on an interval [a,b] is c(b−a) (Linearity, monotonicity, the absolute-value estimate and coordinate-slice additivity for the Riemann integral in Rm, The lower and upper Darboux integrals over a nondegenerate rectangle in Rm).

Proof

1.1givenF3F10F11algebra

Put Vd=cont⁡(B‾2(0,1)). This number is finite by [F3] and positive by induction on d: V1=2, and for d≥2 set α=(d−1)/2>0. On [−1/2,1/2], 1−t2≥3/4, so [F10] gives (1−t2)α≥(3/4)α>0; on all of [−1,1] this integrand is nonnegative. By [F11], splitting the integral at −1/2 and 1/2 and comparing the middle part with the constant (3/4)α shows ∫−11(1−t2)α dt≥(3/4)α>0. The volume recursion [F3] then gives Vd>0 from Vd−1>0.

1.2givenF1F2

Let E={x1,…,xN}⊆Sd−1 have pairwise distances greater than ϵ, and put r=ϵ/2. The closed balls B‾2(xj,r) are pairwise disjoint: a point in two of them would, by the triangle inequality [F2], put the corresponding centers at distance at most 2r=ϵ, contrary to the separation. Each small ball lies in B‾2(0,1+r), since ∥xj∥2=1 and [F2] gives ∥y∥2≤∥y−xj∥2+∥xj∥2≤r+1.

2.1F4F5F6F7step 1.1step 1.2algebra

By scaling and translation invariance [F4, F5], every small ball in step 1.2 has content rdVd and the large ball has content (1+r)dVd. Finite additivity [F6] and monotonicity of outer content from [F7] give NrdVd≤(1+r)dVd. Step 1.1 gives Vd>0, so cancellation and r=ϵ/2 yield N≤((1+r)/r)d=(1+2/ϵ)d. This also holds when E is empty, for which N=0.

3.1givenF1F8F9step 2.1choose

Choose an integer M>(1+2/ϵ)d using [F8]. Let K be the set of cardinalities of finite subsets of Sd−1 whose distinct points are more than ϵ apart. The first coordinate unit vector shows K is nonempty, and step 2.1 shows every member of K is at most (1+2/ϵ)d<M. Thus K is a nonempty subset of {0,1,…,M}; [F9] gives a largest member k∈K, attained by a finite set N by the definition of K.

4.1step 2.1step 3.1contradiction∎

If some u∈Sd−1 were farther than ϵ from every point of N, adjoining u would produce a finite set with pairwise distances greater than ϵ and cardinality k+1, contradicting maximality in step 3.1. Thus N is an ϵ-net; step 2.1 gives its stated cardinality bound. This construction uses only a maximum in a finite set of possible cardinalities, not an axiom of choice.

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passOpen item page →

Doob differences inherit coordinate oscillation widths

Statement

Let n≥1, let Z1,…,Zn be independent random elements with laws μi on measurable spaces (Si,Σi), and let μ=⨂i=1nμi. Let f:∏i=1nSi→R be measurable with ∫∣f∣ dμ<∞. Suppose finite deterministic ci≥0 satisfy ∣f(x1,…,xi−1,xi,xi+1,…,xn)−f(x1,…,xi−1,xi′,xi+1,…,xn)∣≤ci for every i, every fixed choice of the other coordinates, and every xi,xi′∈Si. For each i, define Mi by integrating f over the unrevealed product coordinates, using the measurable finite versions given by Fubini; set M0=∫f dμ and Mn=f(Z1,…,Zn). Put Fi=σ(Z1,…,Zi) and Di=Mi−Mi−1. Then Mi is integrable and Fi-measurable, and for every A∈Fi−1, ∫ADi dP=0. Moreover, there are finite Fi−1-measurable endpoints Ai,Bi such that Ai≤0≤Bi, Ai≤Di≤Bi almost surely, and Bi−Ai≤ci almost surely. No choice axiom is used in this product-integral construction.

Facts & Assumptions

Given: The independent random elements, their marginal laws, the product-measurable integrable function, and the deterministic coordinate oscillation bounds in the Statement.

[F1]

Independence of random elements means independence of their generated sigma-algebras (Independent random elements).

[F2]

Independent random elements have joint law equal to the finite product of their marginal laws (Independent random elements have product joint law).

[F3]

Integrating a measurable function against a random element's law gives its expectation (Change of variables for expectation).

[F4]

Fubini for an L1 function on a sigma-finite product gives integrable sections almost everywhere, measurable section-integral functions, and equality of iterated and product integrals (Fubini's theorem for L^1 functions on a sigma-finite product).

[F5]

The finite product sigma-algebra is generated by measurable rectangles (The product sigma-algebra and its finite iterates).

[F6]

Expectation of an integrable real random variable is its Lebesgue integral (Expectation of a nonnegative or integrable random variable).

[F7]

Each marginal law μi is a probability measure: the law definition is by preimages, so disjoint measurable sets have disjoint preimages and countable additivity and total mass one pass from P (Law or distribution of a random element).

Proof

1.1givenF1F2F3F4F5F6

By [F1] and [F2], the joint law of (Z1,…,Zn) is μ. For 1≤i<n, repeated application of [F4] gives a measurable version Hi of the integral over the unrevealed coordinates; clause 3 of [F4] makes each such section-integral function integrable after assigning 0 on its exceptional set. Set H0=∫f dμ and Hn=f, which are integrable by the hypothesis. Let Mi=Hi(Z1,…,Zi). Then Mi is integrable and Fi-measurable by [F3], [F5], and the product-integral construction; [F6] identifies the expectation of each integrable Mi with its Lebesgue integral.

1.2givenF4algebra

Fix i. Fubini applied to ∣f∣ gives a measurable full-measure set of prefixes p=(x1,…,xi−1) for which the integral of ∣f(p,xi,y)∣ over μi⊗μi+1:n is finite. For such a prefix there is a coordinate value xi0 whose future-section integral is finite. The coordinate oscillation assumption gives ∣f(p,xi,y)∣≤∣f(p,xi0,y)∣+ci for every xi,y, so every future section is integrable and gp(xi):=∫f(p,xi,y) dμi+1:n(y) is finite. Integrating the same pointwise oscillation bound shows ∣gp(xi)−gp(xi′)∣≤ci for all xi,xi′.

2.1F2F3F4F5step 1.1

If A∈Fi−1, the definition of the sigma-algebra generated by the prefix writes A={(Z1,…,Zi−1)∈C} for a product-measurable C. By [F2], [F3], and [F4], integrating Hi first over coordinate i gives the same integral over A as integrating Hi−1. Hence ∫A(Mi−Mi−1) dP=0.

2.2step 1.2F4F7

On the full-measure prefix set from step 1.2, define ui(p):=inf⁡{r∈R:μi(gp>r)=0} and ℓi(p):=sup⁡{r∈R:μi(gp<r)=0}. They are finite because gp has finite range diameter at most ci. The definitions and [F7] imply gp≤ui(p) and gp≥ℓi(p) almost everywhere: the set of almost-everywhere upper bounds is upward closed, so ui(p)+1/m belongs to it for every integer m≥1 by the defining infimum; similarly ℓi(p)−1/m is an almost-everywhere lower bound. Thus the explicitly defined sets {gp>ui(p)+1/m} and {gp<ℓi(p)−1/m} are null. Their countable union is null by [F7], and outside it letting m→∞ gives both endpoint inequalities. These sequences and exceptional sets are specified by formulas, with no choice axiom. Also ui(p)−ℓi(p)≤ci: otherwise choose δ>0 with ui(p)−ℓi(p)>ci+2δ. The sets {gp>ui(p)−δ} and {gp<ℓi(p)+δ} then both have positive μi-measure by the definitions, so a point from each would violate the oscillation bound in step 1.2. For each q∈R, ui(p)>q iff μi(gp>q)>0: if the latter holds, {gp>q}=⋃m≥1{gp>q+1/m} and [F7] give a positive-measure higher level, while q<ui(p) means q is not an almost-everywhere upper bound. Similarly, ℓi(p)<q iff μi(gp<q)>0, using {gp<q}=⋃m≥1{gp<q−1/m} and [F7]. Repeated Fubini in [F4] makes (p,xi)↦gp(xi) measurable on this set; applying [F4] to the indicators of these level sets makes p↦μi(gp>q) and p↦μi(gp<q) measurable. Thus both endpoints are measurable.

3.1step 2.1step 2.2givenF2F3F4∎

Fubini gives Hi−1(p)=∫gp(xi) dμi(xi) for almost every prefix, so ℓi(p)≤Hi−1(p)≤ui(p). Set Ai(p)=ℓi(p)−Hi−1(p) and Bi(p)=ui(p)−Hi−1(p) there, and set both to 0 on the exceptional prefix set. These are finite measurable endpoints, contain 0, and have width at most ci. For μi-almost every xi, gp(xi)−Hi−1(p) lies between them; by the product law this is Di almost surely. Together with step 2.1 this proves the asserted endpoint and event-integral properties for every i.

TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

Sub-exponential concentration for independent sums

Statement

Let X1,…,Xn be independent centered real random variables, with Xi sub-exponential with parameters (νi2,bi) as defined in Sub-Gaussian variables and vectors, and sub-exponential variables, where n≥1 and bi>0. Put v=∑i=1nνi2, b=max⁡1≤i≤nbi, and S=∑i=1nXi. For t>0, if v>0 then P(∣S∣≥t)≤2exp⁡ ⁣(−12min⁡ ⁣{t2v,tb}), and if v=0 then P(∣S∣≥t)=0.

Facts & Assumptions

Given: Independent centered real random variables Xi with sub-exponential parameters (νi2,bi), where νi2≥0 and bi>0.

[F1]

Sub-exponentiality means EeλXi≤eλ2νi2/2 whenever ∣λ∣≤1/bi (Sub-Gaussian variables and vectors, and sub-exponential variables).

[F2]

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

[F3]

For independent real variables and nonnegative Borel functions, the expectation of the product factors (Expectations factor over finite products of independent random variables).

[F4]

Markov's inequality gives P(Y≥r)≤E[Y]/r for Y≥0 and r>0 (Markov's inequality for random variables).

[F5]

The exponential is continuous and strictly increasing, positive, satisfies e−x=1/ex and ex+y=exey, and has e0=1; these imply ex+e−x−2=e−x(ex−1)2≥0, with equality only at x=0 (The real exponential function and the number e by a power series, The exponential addition formula exp⁡(x+y)=exp⁡(x)exp⁡(y), The exponential is positive and satisfies exp⁡(−x)=1/exp⁡(x), The exponential function is strictly increasing).

[F6]

A nonnegative integrable function with integral 0 vanishes almost everywhere (A nonnegative measurable function has integral 0 exactly when it vanishes almost everywhere).

[F7]

Probability is subadditive on finite unions (Basic identities for a probability measure).

[F8]
[F9]

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

[F10]

Finite sums of real-valued measurable functions are measurable (Arithmetic and lattice operations preserve measurability whenever they are defined).

Proof

1.1givenF1F5F6F7F9F10algebra

If v=0, then every νi2=0. Fix i and choose λi=1/(2bi)>0. By [F1], both EeλiXi and Ee−λiXi are at most 1. The nonnegative random variable Qi=eλiXi+e−λiXi−2 therefore has expectation at most 0 by [F9]. By [F5], Qi=0 only when Xi=0; [F6] gives Xi=0 almost surely. The finite sum S is consequently 0 almost surely by [F7].

1.2F1F2F3F5F8givenconstruct

Suppose v>0. By [F8], b=max⁡ibi exists and is positive. For each real θ, the map gθ(x)=eθx is continuous: scalar multiplication is continuous since ∣θx−θy∣=∣θ∣∣x−y∣, and the exponential is continuous by [F5]. Its inverse images of open sets are open, so the collection of Borel sets with Borel preimage is a sigma-algebra containing the opens; hence gθ is Borel by The Borel sigma-algebra of a topological space, For each Borel B, {gθ(Xi)∈B}=Xi−1(gθ−1(B)) is measurable. For 0≤λ≤1/b, [F1] applies to every Xi. By [F5], eλS=∏ieλXi; independence [F2] and factorization [F3] give EeλS=∏iEeλXi≤eλ2v/2.

2.1F4F5F10step 1.2algebra

For t>0 and 0<λ≤1/b, [F10] makes S a measurable real random variable, and S≥t implies eλS≥eλt>0 by [F5]. Markov [F4], step 1.2, and the reciprocal and addition formulas in [F5] yield P(S≥t)≤exp⁡(−λt+λ2v/2). Choose λ=min⁡{t/v,1/b}. If t≤v/b, the exponent is −t2/(2v). If t>v/b, it is −t/b+v/(2b2)≤−t/(2b). Hence P(S≥t)≤exp⁡[−12min⁡{t2/v,t/b}].

3.1F1F2F3F4F5F7F10step 1.1step 1.2step 2.1algebra∎

For 0<λ≤1/b, [F1] applies at parameter −λ to every original Xi. By [F5], e−λS=∏ie−λXi; the original variables are independent by [F2], the functions x↦e−λx are nonnegative Borel by step 1.2, and factorization [F3] gives Ee−λS≤eλ2v/2. Markov [F4] and the same optimizing choice as in step 2.1 yield the stated lower-tail bound. The finite union bound [F7] combines the tails; step 1.1 handles v=0. No independence assertion about the transformed variables is needed.

TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

Finite sub-Gaussian maxima and epsilon-net reduction

Statement

Let Y1,…,Ym be centered sub-Gaussian real random variables with a common proxy σ2≥0, where m≥1. No independence is assumed. For t>0, if σ2>0 then P(max⁡1≤j≤m∣Yj∣≥t)≤2mexp⁡ ⁣(−t22σ2), and if σ2=0 the probability is 0.

Let Z be a centered sub-Gaussian vector in Rd with proxy σ2, where d≥1. For 0<ϵ<1, let N be the sphere net supplied by Finite epsilon nets of the Euclidean sphere. Then for t>0, if σ2>0, P(∥Z∥2≥t)≤2(1+2/ϵ)dexp⁡ ⁣(−(1−ϵ)2t22σ2), and if σ2=0 this probability is 0. The deterministic reduction is ∥z∥2≤(1−ϵ)−1max⁡u∈N∣⟨u,z⟩∣ for every z∈Rd.

Facts & Assumptions

Given: Centered scalar or vector random elements satisfying the sub-Gaussian proxy bounds; a finite integer m≥1; and, in the vector clause, d≥1 and 0<ϵ<1.

[F1]

A centered scalar X is sub-Gaussian with proxy σ2 when EeλX≤eλ2σ2/2 for every real λ; the vector condition bounds each projection (Sub-Gaussian variables and vectors, and sub-exponential variables).

[F2]

For W≥0 and r>0, Markov gives P(W≥r)≤E[W]/r (Markov's inequality for random variables).

[F3]

Finite unions satisfy P(⋃jAj)≤∑jP(Aj) (Basic identities for a probability measure).

[F4]

For d≥1 and 0<ϵ<1, there is a finite ϵ-net N⊆Sd−1 with ∣N∣≤(1+2/ϵ)d (Finite epsilon nets of the Euclidean sphere).

[F5]

Sd−1={u∈Rd:∥u∥2=1} and ∥⋅∥2 is the Euclidean norm (Euclidean spheres and closed balls as subspaces of Rn).

[F6]

The Euclidean inner product satisfies ∣⟨u,z⟩∣≤∥u∥2∥z∥2 (The Cauchy-Schwarz inequality for finite sums).

[F7]

Every nonempty finite set of real numbers has a maximum (Every nonempty finite set of reals has a maximum and a minimum, Maximum and minimum of a set).

[F9]

For every a>0 and natural m, xm/eax→0 as x→+∞; use m=0 to get 1/eax→0 (The exponential dominates every fixed nonnegative integer power at +∞).

Proof

1.1F1F2F8F9algebraconstruct

For each λ>0, hλ(x)=eλx is continuous by [F8] and continuity of scalar multiplication, hence Borel: the Borel sets with Borel preimage form a sigma-algebra containing all opens, so contain the sigma-algebra generated by opens (The Borel sigma-algebra of a topological space). For each Borel B, {hλ(Yj)∈B}=Yj−1(hλ−1(B)) is measurable, and hλ(Yj)≥0 by [F8]. If σ2>0, then Yj≥t implies eλYj≥eλt>0 by [F8]; Markov [F2], the MGF bound [F1], and the reciprocal and addition formulas in [F8] give P(Yj≥t)≤exp⁡(−λt+λ2σ2/2). Choosing λ=t/σ2 gives P(Yj≥t)≤e−t2/(2σ2); Using parameter −λ, Yj≤−t implies e−λYj≥eλt>0; the same Markov calculation gives P(Yj≤−t)≤exp⁡(−λt+λ2σ2/2), and λ=t/σ2 gives the same lower-tail bound. If σ2=0, Markov gives P(Yj≥t)≤1/eλt=e−λt for every λ>0. By [F9] with m=0 and a=t, the right side tends to 0 as λ→∞, so the tail is zero, and at parameter −λ the same calculation gives P(Yj≤−t)≤e−λt→0.

1.2givenF4F5F6algebra

Fix z≠0 and put u=z/∥z∥2∈Sd−1 by [F5]. By [F4], some v∈N satisfies ∥u−v∥2≤ϵ. Then [F6] gives ∣⟨v,z⟩∣≥⟨u,z⟩−∣⟨u−v,z⟩∣≥(1−ϵ)∥z∥2. For z=0 the claimed reduction is immediate. Thus the deterministic net inequality holds.

2.1F3F7step 1.1

By the finite maximum convention in [F7], the event {max⁡j∣Yj∣≥t} is the union of the 2m upper- and lower-tail events from step 1.1. Applying [F3] gives the stated finite-maximum bounds, without any independence assumption.

3.1F1F4step 2.1step 1.2algebra∎

Apply step 1.2 to Z. If ∥Z∥2≥t, then at least one of the ∣N∣ projections has absolute value at least (1−ϵ)t. Each projection is centered sub-Gaussian with proxy σ2 by [F1] because its direction is a unit vector. Step 2.1 and [F4] therefore give the displayed vector tail bound; when σ2=0, step 2.1 gives probability zero.

TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

McDiarmid bounded-differences inequality

Statement

Assume AC. Let n≥1, let Zi:(Ω,F,P)→(Si,Σi) be independent random elements, meaning measurable maps (Random elements and real random variables), with laws μi given by pushforward (Law or distribution of a random element). Put μ=⨂i=1nμi on the finite product sigma-algebra (The product sigma-algebra and its finite iterates). Let f:∏i=1nSi→R be product-measurable with ∫∣f∣ dμ<∞. Suppose finite deterministic constants ci≥0 satisfy ∣f(z1,…,zi,…,zn)−f(z1,…,zi′,…,zn)∣≤ci for every fixed setting of the other coordinates and every zi,zi′. The independent product-law theorem identifies the law of Z=(Z1,…,Zn) as μ. Applying change of variables for expectation first to ∣f∣ and then to f makes f(Z) integrable and gives Ef(Z)=∫f dμ. Put V=∑i=1nci2. For t>0, if V>0 then P(f(Z1,…,Zn)−Ef(Z1,…,Zn)≥t)≤exp⁡ ⁣(−2t2V), and if V=0 this probability is 0. The same bound holds for the lower tail, so the two-sided probability is at most 2e−2t2/V when V>0.

Facts & Assumptions

Given: AC, independent random elements Zi, an integrable measurable real function of them, and the deterministic coordinate oscillation bounds in the Statement.

[A1]

Assume AC, the Axiom of Choice. It is used for the conditional-expectation and conditional-Hoeffding suppliers (The Axiom of Choice).

[F1]

The product-integral construction gives integrable adapted Mi, with Mn=f(Z), M0=∫f dμ, event-integral-zero differences, and predictable endpoints of width at most ci (Doob differences inherit coordinate oscillation widths).

[F2]

Conditional expectation is the almost-sure class of integrable measurable versions satisfying all event-integral identities (Conditional expectation as an ae class).

[F3]

Under AC, an integrable adapted process is a martingale when E[Mi∣Fi−1]=Mi−1 almost surely (Martingale submartingale and supermartingale).

[F4]

If a martingale difference has predictable finite endpoints of deterministic width ci, its conditional exponential moment is at most eλ2ci2/8 (Conditional Hoeffding bound for bounded martingale differences).

[F5]

Conditional expectation preserves the unconditional expectation (Basic algebra and order properties of conditional expectation).

[F6]

A bounded measurable factor known under Fi−1 can be taken outside conditional expectation (Taking out what is known).

[F7]

For Y≥0 and r>0, P(Y≥r)≤E[Y]/r (Markov's inequality for random variables).

[F8]

Probability is subadditive on finite unions (Basic identities for a probability measure).

[F9]

The joint law of independent random elements is the product of their marginal laws; for measurable f with ∫∣f∣ dμ<∞, change of variables applied to ∣f∣ gives f(Z)∈L1 and applied to f gives Ef(Z)=∫f dμ (Independent random elements have product joint law, Change of variables for expectation).

[F11]

Every closed bounded interval [a,b] with a≤b is compact (Heine-Borel by bisection: every closed bounded interval [a,b] is compact).

[F12]

A continuous real function is bounded on a compact subset of R (A continuous real function on a compact subset of R is bounded).

Proof

1.1A1F1F2F3F9given

By [F9], the joint law of Z=(Z1,…,Zn) is μ, so the product integral in the statement is Ef(Z). By [F1], take the product-integral sequence Mi and its differences Di=Mi−Mi−1. For every A∈Fi−1, [F1] gives ∫AMi dP=∫AMi−1 dP. By [F2] and AC, Mi−1 is a version of E[Mi∣Fi−1], so [F3] makes (Mi,Fi) a martingale. The same lemma gives finite predictable endpoints Ai≤Di≤Bi with Ai≤0≤Bi and Bi−Ai≤ci.

2.1A1F1F2F4step 1.1

The event-integral identity of [F1] and [F2] give E[Di∣Fi−1]=0. Applying [F4] to these martingale differences and their endpoints gives E[eλDi∣Fi−1]≤eλ2ci2/8 for every real λ. Since the endpoints contain zero and have width at most ci, ∣Di∣≤ci almost surely.

3.1F5F6F10F11F12step 2.1algebraconstruct

Put Sk=Mk−M0=∑i=1kDi and S0=0. Step 2.1 bounds each difference by ci, hence Sk−1∈[−C,C] for C:=∑i<kci. This closed bounded interval is compact by [F11], and x↦eλx is continuous by [F10] and continuity of scalar multiplication, so [F12] makes eλSk−1 bounded. Also x↦eλx is Borel: its open-set preimages are open, and the class of Borel sets whose preimages are Borel is a sigma-algebra containing the opens, hence contains the Borel sigma-algebra (The Borel sigma-algebra of a topological space). For each Borel B, the preimage of B under eλSk−1 is Sk−1−1((x↦eλx)−1(B)), so this factor is Fk−1-measurable. By the addition formula in [F10], eλSk=eλSk−1eλDk; conditional expectation preservation [F5] and taking out the known factor [F6] give EeλSk≤eλ2ck2/8EeλSk−1. Finite induction yields EeλSn≤eλ2V/8.

4.1F7F10step 2.1step 3.1algebra

If V=0, all ci=0, so step 2.1 gives Di=0 almost surely and Sn=0. If V>0 and λ>0, then eλSn is nonnegative and Sn≥t implies eλSn≥eλt>0 by [F10]. Markov [F7] and step 3.1 give P(Sn≥t)≤eλ2V/8/eλt=e−λt+λ2V/8 by the reciprocal and addition formulas in [F10]. Choosing λ=4t/V gives the stated upper-tail bound.

5.1A1F8step 4.1algebra∎

Apply the same argument to −f for the lower-tail bound. For V>0, [F8] combines the two tails; step 4.1 handles V=0.

5 · Examples, counterexamples and false statements

None yet.

Sources