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 strong law for independent uniformly bounded variances
Statement
Independent square-integrable real with satisfy almost surely.
Facts & Assumptions
Strong law under summable normalized variances: Let be independent square-integrable real random variables. Let be deterministic and nondecreasing with . If then In particular, for IID centered square-integrable variables and any , almost surely (the displayed normalization is used for ).
Proof
Given: The objects, hypotheses and definitions in the statement. Its conclusions are to be established below.
For , . Therefore ; these nonnegative partial sums have a finite supremum, so the variance series converges.
The normalizers are positive, nondecreasing and tend to infinity. The independence and square-integrability are given, and step 1.1 verifies the summability hypothesis of F1. Its almost-sure conclusion is exactly the stated centered law.
Depends on
- Strong law under summable normalized variances
- Strong law of large numbers for a sequence
- The integral test: for $f \ge 0$ nonincreasing on $[0,\infty)$, $\sum_k f(k)$ converges if and only if the sequence $\bigl(\int_0^N f\bigr)_N$ is bounded, with $\int_0^N f \le \sum_{k<N} f(k) \le f(0) + \int_0^N f$
Used by
- Iid finite variance strong law Corollary
Dependency tree · two levels
34 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
- Durrett, §§2.4–2.5, pp. 76–87 (standard reference, not scraped)