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.
Pointwise strong laws need not give a uniform law
Statement refuted
The assertion that pointwise strong laws for every member of a class imply a uniform law of large numbers is false without a class-separability or entropy hypothesis.
Witness
Let be iid Uniform and let be the class of all finite subsets of , with indicator class . For every fixed , almost surely, but for every and every realized sample,
Facts & Assumptions
Given: The iid Uniform sequence and the class of all finite subsets of .
Identical distribution and IID families: iid observations are independent and each has the same law .
Uniform law convention: every interval is Borel and equals its interval length.
Empirical, centered, and Rademacher processes: . Its current carrier and batch-15 manifest entry agree, and its current owner Step 1 record marks it construction-ready; that status is not independent mathematical approval.
Basic identities for a probability measure: finite and countable subadditivity give the finite-union and countable-union probability bounds.
Glivenko–Cantelli classes: a class is -Glivenko–Cantelli if in probability.
Refutation
Fix a finite set . If , then . Otherwise write . Given , for each let . These intervals cover , and each has length at most . By [A1] and finite subadditivity [F2], . Since this holds for every , . By [F1], each event has probability zero; countable subadditivity [F2] gives . Hence with probability one for every . This proves the pointwise strong law for this fixed , without asserting one common event for all finite sets.
For any realized finite sample , the set is finite, so , , and . Every indicator deviation is at most one, so the supremum over equals one for every sample. This supremum is the constant measurable function one; by [F4] it does not converge to zero in probability.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
19 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
- Jon A. Wellner, Empirical Processes: Theory and Applications, Chapter 1, §§1 and 6 (standard reference, not scraped)
- David Pollard, Empirical Processes: Theory and Applications, Sections 1 and 8 (standard reference, not scraped)