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 nonidentical Bernoulli weak law
Example
Assume countable choice and dependent choice. Let independent be Bernoulli with for odd and for even . Then for , Thus a common distribution is not required.
Facts & Assumptions
Chebyshev weak law for uncorrelated arrays: For each , let be square-integrable real random variables on one probability space, pairwise uncorrelated within the row, where is finite. Set and let be deterministic. If then in and in probability. More precisely, its second moment is , and its probability of absolute value at least is at most . No independence between rows is required.
Coordinate random elements of a countable product are independent: Under the measure of thm-countable-product-of-probability-spaces, the coordinate maps have laws and are independent.
Assuming countable and dependent choice, countable products of arbitrary probability spaces: Assume countable choice and dependent choice. For probability spaces there is a unique probability measure on such that, for every finite , its -coordinate marginal is .
A Bernoulli variable has mean and variance ; a binomial variable has mean and variance : If is Bernoulli, then and . If is binomial, then These formulas include , , and .
Expectations factor over finite products of independent random variables: Let , let be independent real random variables on a common probability space, and let be Borel measurable for each . 1. If every is nonnegative, then in . 2. If every is integrable, then is integrable and the same factorization holds in .
Verification
Given: The construction and assumptions above.
Under countable choice and dependent choice, take the countable product of the two-point Bernoulli probability spaces with the prescribed (shift the product index by one). Its coordinates are independent with the required laws. Each has mean and variance . Independence gives zero mixed centered moments, hence zero off-diagonal covariances.
The row weak law with the first entries and normalizer gives centered second moment and convergence in probability to zero. Meanwhile for even and for odd , including . For any the deterministic error is eventually below , so the probability of is at most the probability that the centered average exceeds in absolute value, which tends to zero.
Depends on
- Chebyshev weak law for uncorrelated arrays
- Coordinate random elements of a countable product are independent
- Assuming countable and dependent choice, countable products of arbitrary probability spaces
- 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)$
- Expectations factor over finite products of independent random variables
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
32 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
- Theorem 2.2.6, p. 59, direct example (standard reference, not scraped)