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 Bernoulli variable has mean and variance ; a binomial variable has mean and variance
Statement
If is Bernoulli, then and . If is binomial, then These formulas include , , and .
Facts & Assumptions
Given: A Bernoulli variable and a binomial variable .
Bernoulli and binomial variables have the distributions and independent-sum form in the Definition (Bernoulli random variables and binomial random variables as sums of independent Bernoulli trials).
Expectation is linear without independence (Expectation is linear for every finite family of random variables, without any independence hypothesis).
( and ).
Variance adds for finite pairwise-independent families (Variance adds for every finite pairwise-independent family).
Proof
Since is with probability and otherwise, and .
Hence .
Linearity gives , and pairwise-independent variance additivity gives .
At or the variance formula is zero, and at both finite sums are empty and equal zero.
Depends on
- Bernoulli random variables and binomial random variables as sums of independent Bernoulli trials
- Expectation is linear for every finite family of random variables, without any independence hypothesis
- $\operatorname{Var}(X)=\mathbb E[X^2]-\mathbb E[X]^2$ and $\operatorname{Cov}(X,Y)=\mathbb E[XY]-\mathbb E[X]\mathbb E[Y]$
- Variance adds for every finite pairwise-independent family
Used by
- De Moivre-Laplace central limit theorem Corollary
- A Lindeberg array with no identically distributed row Example
- A nonidentical Bernoulli weak law Example
- Bernoulli sample frequencies Example
- First- and second-moment bounds for a nonempty Bernoulli random subset Example
- A Chernoff bound for sums of independent Bernoulli trials Lemma
- Chebyshev bounds the majority error of repeated Bernoulli trials Lemma
Dependency tree · two levels
13 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
- C. M. Grinstead and J. L. Snell, Introduction to Probability, 2nd ed., Section 6.2 (standard reference, not scraped)
- H. Pishro-Nik, Introduction to Probability, Statistics, and Random Processes, Sections 3.1.5 and 3.2.4 (standard reference, not scraped)