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.
A Chernoff bound for sums of independent Bernoulli trials
Statement
Let be independent Bernoulli random variables, let , let , and let . Then
Facts & Assumptions
Given: independent Bernoulli variables , their sum , and a parameter .
Markov's inequality applies to every nonnegative random variable (Markov's inequality on a finite probability space).
Bernoulli means and (A Bernoulli variable has mean and variance ; a binomial variable has mean and variance ).
The expectation of a product factors over finite independent families (Expectation factors over a finite product of mutually independent random variables).
Proof
Fix and apply [L1] to the nonnegative variable . Because decreases with , we get .
Since , we have . The family is still independent, so [L3] and [L2] give , using with .
Combine steps 1.1 and 1.2, and choose so that . Then .
Define . Then and because for . Hence , which is exactly . Substituting this into step 2.1 gives the claimed bound.
Depends on
- Pairwise and mutual independence of finite-valued random variables
- Markov's inequality on a finite probability space
- A Bernoulli$(p)$ variable has mean $p$ and variance $p(1-p)$; a binomial$(n,p)$ variable has mean $np$ and variance $np(1-p)$
- Expectation factors over a finite product of mutually independent random variables
Used by
Dependency tree · two levels
18 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
- Sanjeev Arora and Boaz Barak, Computational Complexity: A Modern Approach (standard reference, not scraped)
- Eric Blais, Models of Computation, 14. Randomized Computation (standard reference, not scraped)