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 and let be independent integrable real random variables on one probability space. Suppose finite real numbers satisfy almost surely for every . Put and . For every , if then and if then . The two one-sided tails are each bounded by when .
Facts & Assumptions
Given: AC, , independent integrable real random variables , and deterministic finite intervals containing almost surely.
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.
Independence means that the sigma-algebras generated by the random variables are an independent family (Independent random elements).
Disjoint groups from an independent family generate independent sigma-algebras (Disjoint groups of an independent sigma-algebra family remain independent).
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).
Expectation is monotone: almost surely implies (Linearity, monotonicity, and the modulus bound for expectation).
If , , and finite -measurable endpoints have deterministic width , then almost surely (Conditional Hoeffding bound for bounded martingale differences).
Conditional expectation is linear, preserves constants, and preserves the unconditional expectation, so (Basic algebra and order properties of conditional expectation).
A bounded measurable factor known under can be taken outside conditional expectation (Taking out what is known).
For a nonnegative random variable and , (Markov's inequality for random variables).
The probability of a finite union of events is at most the sum of their probabilities (Basic identities for a probability measure).
The real exponential is continuous and strictly increasing, positive, and satisfies and (The exponential is positive and satisfies , The exponential function is strictly increasing, The exponential addition formula ).
Every closed bounded interval with is compact (Heine-Borel by bisection: every closed bounded interval is compact).
A continuous real function is bounded on a compact subset of (A continuous real function on a compact subset of is bounded).
Sums and differences of measurable real-valued functions are measurable (Arithmetic and lattice operations preserve measurability whenever they are defined).
Proof
Set , , , and . By [F13], is -measurable. By [F1] and [F2], is independent of ; [F3] gives , and conditional linearity and preservation of constants in [F6] therefore give almost surely.
By [F4], . Therefore lies almost surely in the finite interval , whose endpoints are -measurable, contain , and have width ; in particular .
Apply [F5] to each and the filtration from step 1.1. For every real , almost surely.
Let and . Step 1.2 gives , hence for . This closed bounded interval is compact by [F11], and is continuous by [F10] and continuity of scalar multiplication, so [F12] makes bounded. Also 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 , the preimage of under is , so this bounded factor is -measurable. By the addition formula in [F10], ; conditional expectation preservation [F6], taking out the known factor [F7], and step 2.1 give . Finite induction gives .
If , every , so each almost surely and almost surely. If and , then is nonnegative and implies by [F10]. Markov [F8] and step 3.1 give , using the reciprocal and addition formulas in [F10]. Choosing gives .
If , substitute in the all-real MGF bound from step 3.1. Since is nonnegative and implies by [F10], Markov [F8] gives ; choosing yields . The finite union bound [F9] combines the two tails; step 4.1 already handles . This lower-tail argument uses the same original variables and does not assert independence of their negatives.
Depends on
- A continuous real function on a compact subset of $\mathbb{R}$ is bounded
- Linearity, monotonicity, and the modulus bound for expectation
- Markov's inequality for random variables
- The exponential is positive and satisfies $\exp(-x)=1/\exp(x)$
- The Axiom of Choice
- The Borel sigma-algebra of a topological space
- Expectation of a nonnegative or integrable random variable
- Intervals of $\mathbb{R}$: the nine order-convex forms, nondegeneracy, and length
- Independent random elements
- The real exponential function and the number $e$ by a power series
- Conditioning a known variable and an independent variable
- Conditional Hoeffding bound for bounded martingale differences
- Basic identities for a probability measure
- Basic algebra and order properties of conditional expectation
- Arithmetic and lattice operations preserve measurability whenever they are defined
- The exponential addition formula $\exp(x+y)=\exp(x)\exp(y)$
- The exponential function is strictly increasing
- Disjoint groups of an independent sigma-algebra family remain independent
- Heine-Borel by bisection: every closed bounded interval $[a,b]$ is compact
- Taking out what is known
Used by
- A finite Bernoulli large-deviation tail Example
- A Rademacher sum Example
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
- Philippe Rigollet and Jan-Christian Hütter, High-Dimensional Statistics: Lecture Notes, Chapter 1, Hoeffding's Lemma and Theorem 1.9 (standard reference, not scraped)
- John Duchi, Lecture Notes on Statistics and Information Theory, Chapter 4, Corollary 4.1.10 (standard reference, not scraped)