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.
Kolmogorov two-series sufficiency
Statement
Let be independent square-integrable real random variables. If converges in and , then converges almost surely and in .
Facts & Assumptions
Kolmogorov convergence criterion: For independent centered square-integrable real random variables , if , then converges almost surely and in to the same finite real random variable.
Measurable coordinatewise functions preserve independence: Let be an independent family of random elements . For each , let be measurable. Then the family is independent.
Variance and covariance identities for random variables: Let be square-integrable real random variables on one probability space. Then Moreover, covariance is symmetric and bilinear on finite linear combinations. On finite full-power-set probability spaces these formulas reduce to the published finite identities.
Proof
Given: The objects and hypotheses of the statement.
Set . These are independent centered square-integrable variables, and by covariance bilinearity. The convergence criterion supplies an almost-sure and limit for their series.
Let . The identity gives pointwise convergence to on the same event. Its error is at most the centered error plus , which tends to zero. This includes zero variances and conditionally convergent deterministic means.
Depends on
Used by
- Kolmogorov three-series theorem Theorem
Dependency tree · two levels
23 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 3.11, p. 66 (standard reference, not scraped)