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.
Tail bound for finite sums of independent signs
Statement
Let be independent random variables with values in , let , and put and . For every , if then If , then almost surely and all three tail probabilities are zero. The empty sum is included with .
Statement references
Facts & Assumptions
Given: A finite independent family of sign-valued random variables, real coefficients, and .
No choice axiom is used; every construction and product is finite.
Independence means independence of the sigma-algebras generated by the random variables. Independent random elements.
Expectations are Lebesgue integrals against the probability law. Expectation of a nonnegative or integrable random variable.
For a nonnegative random variable and , . Markov's inequality for random variables.
The natural logarithm differentiates as , and . The natural logarithm has derivative 1/x and equals the integral from 1 to x of 1/t, The exponential addition formula , The exponential function is smooth and .
A finite union of events has probability at most the sum of its event probabilities. The finite union bound.
For independent real random variables and nonnegative Borel functions, the expectation of their finite product factors, including extended-valued expectations. Expectations factor over finite products of independent random variables.
Proof
For one sign variable with and , put . The two-point formula gives , so and . The inequality follows from with and . Integrating the second-derivative bound twice from to , in either direction, gives for every real ; if or , is identically zero and the same bound holds.
Apply step 1.1 to each with . The functions are nonnegative Borel functions, so [F6] factors their expectations; [F4] combines the exponentials. Thus for every real .
Suppose and choose . Markov's inequality [F3] applied to and the MGF bound in step 2.1 give . Applying the same argument to gives .
By [F5], , which gives the stated two-sided bound from step 3.1. If , every , so almost surely; the empty-sum case is the same.
References
Markov's inequality for random variables: the MGF bound is converted to a tail by Markov's inequality.
Expectations factor over finite products of independent random variables: factors the expectations of the nonnegative exponential functions of the independent signs.
The finite union bound: combines the two one-sided tails.
Depends on
- Independent random elements
- Expectations factor over finite products of independent random variables
- Expectation of a nonnegative or integrable random variable
- Markov's inequality for random variables
- The natural logarithm as the inverse of the exponential function
- The natural logarithm has derivative 1/x and equals the integral from 1 to x of 1/t
- 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 function is smooth and $(\exp)'=\exp$
- The finite union bound
Used by
Dependency tree · two levels
50 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.