Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6-luna)
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.

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.

Depends on

Used by

Dependency tree · two levels

97 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources