Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-10
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.

Empirical measures of iid euclidean samples converge weakly

Statement

For IID Rd-valued samples (Xi) with common law μ and finite d≥1, the empirical probabilities μ^n=n−1∑i=1nδXi converge weakly to μ almost surely on one common event.

Facts & Assumptions

[F1]

Countable compactly supported tests determine euclidean weak convergence: For each finite d≥1 there is a countable uniformly dense subset D of Cc(Rd;R) containing nonnegative compact cutoffs χm↑1. If Borel probabilities μn,μ have ∫h dμn→∫h dμ for every h∈D, then μn⇒μ.

[F2]

Measurable coordinatewise functions preserve independence: Let (Xi)i∈I be an independent family of random elements Xi:(Ω,F,P)→(Si,Σi). For each i, let gi:(Si,Σi)→(Ti,Ti) be measurable. Then the family (gi∘Xi)i∈I is independent.

[F3]

Change of variables for expectation: Let X:(Ω,F,P)→(S,Σ) be a random element, let PX be its law, and let g:(S,Σ)→R or g:(S,Σ)→C be measurable.

  1. If g≥0, then E[g(X)]=∫Sg dPX.
  2. If g(X) is integrable, then g is integrable with respect to PX and the same formula holds: E[g(X)]=∫Sg dPX.
[F4]

Kolmogorov iid l1 strong law: For IID real (Xn)n≥1 with E∣X1∣<∞, Sn/n→μ=EX1 almost surely.

[F5]

Finite and countable subadditivity of measures: Let μ be a measure and let (Ek)k∈N be measurable. Then

μ(⋃k∈NEk)≤∑k=0∞μ(Ek).

For every m∈N one also has

μ(⋃k<mEk)≤∑k<mμ(Ek),

including m=0, where both sides are 0.

Proof

Given: The objects, hypotheses and definitions in the statement. Its conclusions are to be established below.

1.1givenalgebra

For each sample outcome, μ^n is a probability: finite sums of the unit point masses are countably additive and its total mass is n/n=1. For a bounded continuous h, ∫h dμ^n=n−1∑i≤nh(Xi).

1.2F1F2F3F4

Let D be the countable class in F1. For every h in D, F2 makes h(Xi) IID; they are bounded and hence integrable. F3 gives their mean ∫h dμ. F4 yields convergence of the corresponding empirical test integrals.

2.1F1F5step 1.2∎

Each test convergence event is measurable, by the countable real convergence criterion. F5 shows that the intersection over D of the conull events in step 1.2 is conull. On it all the test integrals converge simultaneously. The determining implication in F1 gives weak convergence for each such outcome.

Depends on

Used by

Dependency tree · two levels

30 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