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.
Independent-copy symmetrization of random series
Statement
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 .
Facts & Assumptions
Independent random elements: Let be random elements on a common probability space. For each , write The family is independent when the sigma-algebras are independent in the sense of def-independent-sigma-algebras-and-events. When is a Borel sigma-algebra, this agrees with the notation from def-sigma-algebra-generated-by-a-function.
Symmetric real random variables: A real random variable is symmetric if its law as defined in def-law-or-distribution-of-a-random-element equals the law of . Equivalently, for every Borel , where . No existence of an expectation is assumed in this definition. In particular atoms, including an atom at zero, are allowed.
Almost-sure convergence of a random series: For real random variables , the series converges almost surely if its partial sums converge to a finite real limit on an event of probability one, as in def-almost-sure-convergence-of-random-variables. With from def-partial-sums-and-sample-means, its convergence event is This is exactly the real Cauchy condition, with the indexing of thm-series-cauchy-criterion shifted by one. Measurable arithmetic makes every event in this countable expression measurable. For any fixed , the union over may be restricted to ; then each difference uses only . Thus is in the tail sigma-algebra, without assuming independence. Under independence, cor-almost-sure-convergence-of-an-independent-series-is-a-zero-one-event gives . Set on and off . The functions converge everywhere to , so thm-sequential-suprema-infima-limsup-liminf-and-pointwise-limits-are-measurable and thm-arithmetic-and-lattice-operations-preserve-measurability make measurable. For Borel sets , the event is likewise tail measurable. Changing finitely many summands adds an eventually constant finite difference to ; divided by deterministic tending to infinity that difference tends to zero, so the normalized limsup is unchanged. The sign of the unnormalized limsup need not be unchanged: the all-zero sequence has limsup zero, while changing its first term to makes the limsup of partial sums equal to .
For sigma-finite factors, the product measure exists, has the rectangle formula, is sigma-finite, and is unique: Let and be sigma-finite measure spaces. Then: 1. the set function of def-product-measure-on-sigma-finite-spaces is a measure on ; 2. for measurable rectangles, 3. the measure is sigma-finite; and 4. it is the unique measure on with the rectangle formula.
Disjoint groups of an independent sigma-algebra family remain independent: Let be an independent family of sigma-algebras on a probability space, and let be pairwise disjoint index sets. For each , define Then the sigma-algebras are independent.
Measurable coordinatewise functions preserve independence: Let be an independent family of random elements . For each , let be measurable. Then the family is independent.
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 .
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.
Probability measures are finite and hence sigma-finite, so the two-factor product theorem applies. Its rectangle formula gives independent coordinate sigma-algebras with the original marginals. For any finite list of restrictions on the and , the rectangle formula followed by independence of the original factors its probability into all the individual probabilities. Thus the combined family is independent.
Group each pair : distinct pair sigma-algebras are independent, so their measurable differences are independent. The pair law is the product of two equal marginal laws, invariant under exchanging coordinates (first on rectangles, then by product-measure uniqueness). Its difference therefore has the same law as its negative.
If is the original probability-one convergence event, then has probability one. On it the partial sums of are differences of two convergent real sequences, hence converge finitely. This is almost-sure series convergence.
Under the boundedness hypothesis, and , so . Factorization gives . Expanding the square gives . This includes and deterministic laws.
Depends on
- Independent random elements
- Symmetric real random variables
- Almost-sure convergence of a random series
- For sigma-finite factors, the product measure exists, has the rectangle formula, is sigma-finite, and is unique
- Disjoint groups of an independent sigma-algebra family remain independent
- Measurable coordinatewise functions preserve independence
- Expectations factor over finite products of independent random variables
- Variance and covariance identities for random variables
Used by
Dependency tree · two levels
37 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, p. 67 (standard reference, not scraped)
- Appendix A, Example 4.17, p. 9 (standard reference, not scraped)