Alphabeta Math
CounterexampleConstruction: AI-generatedVerification: AI-adaptedPipeline-generatedprecheck pass
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 Xi be iid Uniform[0,1] and let A be the class of all finite subsets of [0,1], with indicator class F={1A:A∈A}. For every fixed A∈A, Pn(A)→P(A)=0 almost surely, but for every n and every realized sample, sup⁡A∈A∣Pn(A)−P(A)∣=1.

Facts & Assumptions

Given: The iid Uniform[0,1] sequence and the class of all finite subsets of [0,1].

[F1]

Identical distribution and IID families: iid observations are independent and each Xi has the same law P.

[A1]

Uniform[0,1] law convention: every interval I⊆[0,1] is Borel and P(I) equals its interval length.

[F3]

Empirical, centered, and Rademacher processes: Pn(A)=n−1∑i=1n1A(Xi). 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.

[F2]

Basic identities for a probability measure: finite and countable subadditivity give the finite-union and countable-union probability bounds.

[F4]

Glivenko–Cantelli classes: a class is P-Glivenko–Cantelli if sup⁡f∈F∣Pnf−Pf∣→0 in probability.

Refutation

1.1A1F1F2F3givenalgebra

Fix a finite set A⊆[0,1]. If A=∅, then P(A)=0. Otherwise write m=∣A∣≥1. Given ϵ>0, for each x∈A let Ix={y∈[0,1]:∣y−x∣<ϵ/(2m)}. These m intervals cover A, and each has length at most ϵ/m. By [A1] and finite subadditivity [F2], 0≤P(A)≤∑x∈AP(Ix)≤ϵ. Since this holds for every ϵ>0, P(A)=0. By [F1], each event {Xi∈A} has probability zero; countable subadditivity [F2] gives P(∃i≥1:Xi∈A)=0. Hence with probability one Pn(A)=0=P(A) for every n. This proves the pointwise strong law for this fixed A, without asserting one common event for all finite sets.

2.1F2F3F4step 1.1givenalgebra∎

For any realized finite sample x1,…,xn, the set An={x1,…,xn} is finite, so An∈A, Pn(An)=1, and P(An)=0. Every indicator deviation is at most one, so the supremum over A 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