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.
Necessity of the truncated mean and variance conditions
Statement
Let independent real random variables have convergent almost surely. For every fixed , set . Then and the real numerical series converges.
Facts & Assumptions
Independent-copy symmetrization of random series: Given an independent sequence on , form the product probability space . Write , , and . Then and are independent copies of the whole sequence, and the are independent symmetric real random variables. Almost-sure convergence of implies almost-sure convergence of . If almost surely for every , with , then almost surely, , and .
Bounded centered convergent series have summable variances: Let be independent centered real random variables with almost surely for one finite constant . If converges almost surely, then . The bound is two-sided and uniform in .
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.
Zero truncation at a positive level: For a real random variable and a deterministic level , its zero truncation is The threshold event is measurable because is measurable and is Borel; its indicator and the product are measurable by thm-arithmetic-and-lattice-operations-preserve-measurability. Thus is a real random variable as in def-random-element-and-real-random-variable. It equals at both cutoff endpoints and is zero outside the interval. Since , for every its absolute th moment is at most . This is not clipping to the endpoints.
First Borel-Cantelli lemma for events: Let be events in a probability space. If then No independence hypothesis is needed.
Second Borel-Cantelli lemma under pairwise independence: Let be pairwise independent events with Then
Measurable coordinatewise functions preserve independence: Let be an independent family of random elements . For each , let be measurable. Then the family is independent.
A series converges iff each of its tail series converges, and the sum splits as plus the -th tail: Let be a sequence of reals with partial sums , let , and let be the partial sums of the -th tail series (def-series). Then: 1. for every ; 2. converges if and only if its -th tail series converges, and in that case 3. hence the following are equivalent: converges; every tail series of converges; some tail series of converges. In words: convergence of a series is a property of its terms from any index on, and changing finitely many terms changes the sum but not the fact of convergence.
Proof
Given: The objects and hypotheses of the statement.
Convergence of partial sums implies on its probability-one event. Therefore occurs only finitely often almost surely. These events are independent, by measurable transformations. If their probability sum were infinite, the second Borel–Cantelli lemma would instead make their infinitely-often event have probability one. Hence the sum is finite.
The are independent and bounded by . By the first Borel–Cantelli lemma, eventually almost surely. Finite-change invariance, with the real-series indices shifted by one, gives almost-sure convergence of .
Symmetrize this bounded sequence on the two-factor product. The differences are independent, centered, bounded by , and their series converges almost surely. The bounded-centered lemma gives . Since , the variance sum for is finite.
The independent centered variables now satisfy the convergence criterion. On the intersection of its probability-one event with that from the truncations, subtract the two convergent partial sums: their difference is the deterministic sequence . That sequence therefore converges in . A probability-one event is nonempty, and this argument selects only one path to establish a deterministic conclusion. All truncated expectations are finite, including when .
Depends on
- Independent-copy symmetrization of random series
- Bounded centered convergent series have summable variances
- Kolmogorov convergence criterion
- Zero truncation at a positive level
- First Borel-Cantelli lemma for events
- Second Borel-Cantelli lemma under pairwise independence
- Measurable coordinatewise functions preserve independence
- A series converges iff each of its tail series converges, and the sum splits as $s_N$ plus the $N$-th tail
Used by
- Kolmogorov three-series theorem Theorem
Dependency tree · two levels
39 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.12 necessity and Lemma 3.13, pp. 67–68 (standard reference, not scraped)