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.
Truncation weak law for independent arrays
Statement
For each let be independent real random variables on one probability space, with finite . Let deterministic tend to infinity and set . If then No independence between rows is required.
Facts & Assumptions
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.
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.
Measurable coordinatewise functions preserve independence: Let be an independent family of random elements . For each , let be measurable. Then the family is independent.
Convergence in probability: For real random variables and on one probability space, write in probability when, for every , This is precisely def-convergence-in-measure for the probability measure.
Finite and countable subadditivity of measures: Let be a measure and let be measurable. Then For every one also has including , where both sides are .
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 .
Proof
Given: The objects and hypotheses of the statement.
Each truncated row is independent by measurable transformations and bounded by . Its distinct centered mixed moments vanish: independence factors expectations of bounded products, so the row is uncorrelated. The row weak law therefore makes tend to zero in probability.
Let . Outside the original and truncated sums agree. Hence for the probability of the claimed error exceeding is bounded by plus the corresponding centered truncated probability. Both tend to zero. For empty rows all sums and the union are zero or empty, so the argument includes them; equality at the cutoff is retained.
Depends on
Used by
Dependency tree · two levels
29 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.11, pp. 62–63; second-moment sufficient form (standard reference, not scraped)
- Section 2.1, Theorem 4.8 and proof, p. 4; variance form (standard reference, not scraped)