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
Work on a common probability space; the independent Bernoulli variables used to represent a binomial sum are independent in the sense of Independent random elements. The original finite-space atom-independence convention is included.
If is Bernoulli, then and . If is binomial, then These formulas include , , and .
Facts & Assumptions
Given: A Bernoulli variable and a binomial variable on one common probability space, with mutually independent Bernoulli summands. All these variables and their finite sums are bounded almost surely, hence square-integrable and integrable.
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 (Linearity, monotonicity, and the modulus bound for expectation).
For square-integrable variables on one common probability space, variance of a finite sum is the sum of its individual variances plus twice the sum of the covariances over distinct unordered pairs. (Variance of a finite sum as the sum of all variances and covariances)
General independence factors inverse-image event probabilities. On an original finite probability space, attained-value independence agrees with this general notion. (Independent random elements, The general rectangle criterion agrees with the published finite random-variable definition)
The expectation of the indicator of a measurable event is its probability, and expectations of integrable variables agree under almost-sure equality. (The expectation of an indicator is the probability of the event, Expectation depends only on the almost-everywhere class)
Proof
Since is with probability and otherwise, both and agree almost surely with the indicator of the measurable event . By [L6], .
Hence .
For distinct , the independent Bernoulli variables in [L1] and [L5] have almost surely, so [L6] and independence give . Their means are by step 1.1, so [L3] gives . Linearity gives , and [L4] with these zero covariances 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
- Independent random elements
- The expectation of an indicator is the probability of the event
- Expectation depends only on the almost-everywhere class
- The general rectangle criterion agrees with the published finite random-variable definition
- Linearity, monotonicity, and the modulus bound for expectation
- Variance and covariance identities for random variables
- Variance of a finite sum as the sum of all variances and covariances
Used by
- De Moivre-Laplace central limit theorem Corollary
- A biased estimator can have lower MSE Example
- A Lindeberg array with no identically distributed row Example
- A nonidentical Bernoulli weak law Example
- Bernoulli sample frequencies Example
- Weakly close root laws can still give failed uniform coverage Example
- A Chernoff bound for sums of independent Bernoulli trials Lemma
- Bernoulli root laws are uniformly close in Levy–Prokhorov distance Lemma
- Chebyshev bounds the majority error of repeated Bernoulli trials Lemma
- m-out-of-n bootstrap and subsampling recover the uniform endpoint root Theorem
Dependency tree · two levels
30 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)