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.
Exact tail criterion for a truncated-centered IID weak law
Statement
For IID real random variables and , there exist deterministic real constants with in probability if and only if When this condition holds, works. Neither existence of an untruncated mean nor convergence of is asserted.
Facts & Assumptions
Identical distribution and IID families: Let be random elements with the same measurable target . They are identically distributed if for all and , that is, their laws in def-law-or-distribution-of-a-random-element agree. They are independent and identically distributed (IID) if, in addition, the whole family is independent in def-independent-random-elements. Independence means mutual independence, not merely pairwise independence. No moment assumption is part of either definition. The empty family satisfies these universal conditions vacuously.
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 .
Tail comparisons under independent-copy symmetrization: Let be an independent copy of a real random variable . For every , There exists a finite with ; for every such ,
One-sided maximal inequality for symmetric independent sums: For independent symmetric real random variables , , let . For every real , Consequently for every , No moment assumptions are needed.
Truncation weak law for independent arrays: 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.
Vanishing tail control bounds truncated second moments: Let be a real random variable with as positive integers . Then for real , and Moreover for every .
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 .
Largest-summand bound for independent symmetric variables: Let be independent symmetric real random variables, , and . For , The same bound holds when both inequalities inside the probabilities are strict. If the are IID and , then
Proof
Given: The objects and hypotheses of the statement.
Assume the tail condition and take row for , with . The sum of row tail probabilities is . The normalized truncated variance sum is at most by the second-moment lemma. The truncated array law yields the claimed convergence with the explicit finite .
For necessity suppose constants give the convergence. On the two-factor product take an independent copy and let , . The are IID and symmetric. The triangle and union bounds give . The deterministic center cancels exactly.
For , the largest-summand bound gives . Since the left side tends to zero and , necessarily ; otherwise a positive lower bound along a subsequence would keep the right side away from zero.
Choose finite with . The symmetrization lower bound with gives for . Multiply by and use the previous step with . This proves necessity, including atomic or deterministic laws.
An alternative check of the maximal step uses with , whence . The symmetric maximal inequality gives . Independence then gives , hence again by . Both checks retain strict events and allow atoms.
Depends on
- Identical distribution and IID families
- Independent-copy symmetrization of random series
- Tail comparisons under independent-copy symmetrization
- One-sided maximal inequality for symmetric independent sums
- Truncation weak law for independent arrays
- Vanishing tail control bounds truncated second moments
- Convergence in probability
- Finite and countable subadditivity of measures
- Largest-summand bound for independent symmetric variables
Used by
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 4.4, pp. 2–5 and Appendix A, pp. 9–11 (standard reference, not scraped)
- Theorem 2.2.12 and necessity remark, pp. 63–64 (standard reference, not scraped)
- Lemma 5.13, p. 8 (standard reference, not scraped)