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.
Bernstein inequality for bounded independent sums
Statement
Let and let be independent centered square-integrable real random variables. Suppose is finite and almost surely for each . Put . For , if then and if then this probability is .
Facts & Assumptions
Given: Independent centered square-integrable real random variables , a finite deterministic bound , and almost surely.
For centered , (Moments, variance, and covariance on a probability space).
For independent real random variables and nonnegative Borel functions , the expectation of their product factors as the product of their expectations (Expectations factor over finite products of independent random variables).
If and , then (Markov's inequality for random variables).
, and this series converges absolutely for every real (The real exponential function and the number by a power series, The exponential series converges absolutely for every real argument).
for every real ( for every real , hence ).
A nonnegative measurable function with integral vanishes almost everywhere (A nonnegative measurable function has integral exactly when it vanishes almost everywhere).
The probability of a finite union of events is at most the sum of their probabilities (Basic identities for a probability measure).
Independence means independence of the sigma-algebras generated by the random variables (Independent random elements).
Expectation is linear, monotone, and bounded in modulus by the expectation of the absolute value (Linearity, monotonicity, and the modulus bound for expectation).
The real exponential is continuous and strictly increasing, is positive, satisfies , and obeys (The exponential function is strictly increasing, The exponential is positive and satisfies , The exponential addition formula ).
Finite sums of real-valued measurable functions are measurable (Arithmetic and lattice operations preserve measurability whenever they are defined).
Proof
Let . If , then every because . By [F6], almost surely for every , so the finite sum is almost surely and the stated tail probability is .
Suppose . If , every almost surely and , a contradiction; hence . For each fixed real , is continuous: when , continuity of follows from , and continuity of its composition with follows from [F10]; when it is constant. Thus is Borel: the Borel sets whose inverse images under 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 , is measurable. Now fix and with . For , the exponential series tail on is uniformly bounded by . Each partial sum at is integrable; the uniform bound and [F9] give , so expectation passes to the series limit. Centering removes the linear term, and for every , by [F1] and monotonicity. Also for : equality holds at , and each subsequent factorial factor is at least . Hence the geometric-series bound and from [F5] give .
Let , a measurable real random variable by [F11]. By the addition formula [F10], ; independence [F8] and factorization [F2], applied to the nonnegative Borel functions established in step 1.2, give for . Since is positive and increasing [F10], implies , so [F3] and the reciprocal and addition formulas in [F10] give . Choose ; then and direct simplification gives .
For , the bound in step 1.2 also holds at parameter . By [F10], ; the original variables remain independent by [F8], and [F2] factors these nonnegative Borel functions, giving . Since implies , Markov [F3] and the same optimizing choice as in step 2.1 yield . By [F7], the two one-sided bounds imply the displayed two-sided bound without asserting independence of the transformed variables .
Depends on
- Markov's inequality for random variables
- Linearity, monotonicity, and the modulus bound for expectation
- The exponential is positive and satisfies $\exp(-x)=1/\exp(x)$
- The Borel sigma-algebra of a topological space
- Expectation of a nonnegative or integrable random variable
- Independent random elements
- Moments, variance, and covariance on a probability space
- The real exponential function and the number $e$ by a power series
- $1+x\le\exp(x)$ for every real $x$, hence $(1-p)^m\le\exp(-mp)$
- The exponential series converges absolutely for every real argument
- Basic identities for a probability measure
- Expectations factor over finite products of independent random variables
- Arithmetic and lattice operations preserve measurability whenever they are defined
- A nonnegative measurable function has integral $0$ exactly when it vanishes almost everywhere
- The exponential addition formula $\exp(x+y)=\exp(x)\exp(y)$
- The exponential function is strictly increasing
Used by
Dependency tree · two levels
78 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
- John Duchi, Lecture Notes on Statistics and Information Theory, Chapter 4, Proposition 4.1.20 and equation (4.1.8) (standard reference, not scraped)
- Jon A. Wellner, Empirical Processes: Theory and Applications, Chapter 1, §3, Lemma 3.3 (standard reference, not scraped)