Alphabeta Math
Pipeline-generated
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.

✓ 3 results · all verified · 2 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 1 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Empirical-Process Complexity — Examples

1 · Prerequisites

2 · Summary

The finite Bernoulli example computes a one-sided empirical Rademacher complexity and its uniform deviation directly. The threshold counterexample uses finite uniform sample spaces to show why the VC entropy growth must retain its dependence on r. The uncountable-class example states its Countable Choice assumption and shows that separate measurability of every function need not make the empirical supremum measurable.

3 · Logical flowchart

4 · Definitions, theorems and proofs

CounterexampleConstruction: AI-adaptedVerification: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

An uncountable class can have a nonmeasurable empirical supremum

Statement

Assume Countable Choice. Let Ω=[0,1], let A be the countable-cocountable sigma-algebra, and define

P(A):={0,A is countable,1,Ω∖A is countable.

For U:=[0,1/2], take the uncountable class of functions F:={ft:t∈U} with ft(ω):=1{t}(ω). Every ft is measurable and Pft=0, but for one observation Z(ω)=ω,

sup⁡t∈U∣ft(Z(ω))−Pft∣=1U(ω),

which is not measurable because U is neither countable nor cocountable.

Facts & Assumptions

Given: The Axiom of Countable Choice and the stated Ω,A,P,U,F.

[A1]

Countable Choice implies that a countable union of at most countable sets is at most countable (The Axiom of Countable Choice (ACω), Countable unions of at most countable sets, assuming ACω). The sigma-algebra closure of the stated family is established locally in step 1.1.

[F1]

Every nondegenerate real interval is uncountable (Every nondegenerate interval of R is uncountable).

[F2]

Every singleton is countable and every subset of a countable set is countable (Finite, countably infinite, countable, uncountable, Every subset of an at most countable set is at most countable).

[F3]

A probability measure is a countably additive measure of total mass one (Measures on sigma-algebras, Probability measures and probability spaces).

[F4]

For one observation, the empirical average is P1f=f(Z) and Pf is the integral of f (Empirical, centered, and Rademacher processes).

[F5]

A family containing the empty set and closed under complements and countable unions is a sigma-algebra (Sigma-algebras).

Proof

Given: The Axiom of Countable Choice and the objects of the Counterexample.

1.1A1F1F2F5given

By [F1], Ω is uncountable. The empty set is at most countable, and complementation exchanges the countable and cocountable alternatives, so A contains the empty set and is complement-closed. For a sequence (An) in A, if every An is countable then [A1] makes their union countable; otherwise some Aj is cocountable, and Ω∖⋃nAn⊆Ω∖Aj is countable by [F2]. Thus the union lies in A in either case, proving all sigma-algebra axioms in [F5]. The assignment P is well-defined: a set and its complement cannot both be countable, since their union would make Ω countable.

2.1A1F2F3step 1.1givenchoose

Let (An) be pairwise disjoint members of A. If every An is countable, [A1] makes their union countable; then P(⋃nAn)=0=∑nP(An). Otherwise choose j with Aj cocountable. For n≠j, disjointness gives An⊆Ω∖Aj, a countable set, so [F2] makes An countable. The union is cocountable and its measure is 1=P(Aj)+∑n≠jP(An). Also P(Ω)=1 and P is nonnegative, so [F3] shows that P is a probability measure.

3.1F1F2F3F4givenstep 2.1

Regard (Ω,A,P) as the observation space and let Z be its identity random element, which has law P. For each t∈U, the singleton {t} is in A by [F2], so ft=1{t} is measurable and Pft=P({t})=0. If s≠t, then fs(s)=1 and ft(s)=0, so t↦ft is injective; since U is uncountable by [F1], F is uncountable.

4.1F1step 3.1given∎

For any ω∈Ω, if ω∈U then the index t=ω gives ft(ω)=1, while if ω∉U every t∈U differs from ω and all the function values are zero. Hence the displayed supremum equals 1U(ω). Both U and Ω∖U contain a nondegenerate interval and are uncountable by [F1]; therefore U∉A, so the supremum is nonmeasurable.

CounterexampleConstruction: AI-adaptedVerification: AI-adaptedprecheck passOpen item page →

Finite thresholds rule out an r-independent VC covering bound

Statement

For each positive integer m, let N:=16m be the natural number obtained by multiplying 16 by itself m times. Equip Xm:={1,…,N} with the uniform probability Qm({i})=1/N. For k=0,…,N, define the threshold function fk:=1{1,…,k}, with f0≡0. Put Fm:={f0,…,fN}.

These are nested threshold indicators. Their VC-subgraph index is V=2, while for r=m and ϵ=1/64,

N(ϵ,Fm,Lm(Qm))=N+1=16m+1.

Thus a purported entropy bound whose right side has no dependence on r is false even when the VC index is fixed.

Facts & Assumptions

Given: A positive integer m, the finite uniform probability space, and the threshold class in the Counterexample.

[F1]

A class of functions is VC-subgraph when its measurable strict subgraphs have finite VC index (VC-subgraph classes, envelopes, and the first-unshattered index); for set classes, the index is one plus the VC dimension (Shattering, VC dimension, and first-unshattered index for set classes).

[F2]

The Lr(Qm) distance is the rth-root of the integral of the absolute difference to power r, and covers use centers in the class (Covering, packing, bracketing numbers, and metric entropy).

[F4]

A finite uniform law assigns mass 1/N to each of its N points and is a probability measure by finite additivity (Probability measures and probability spaces).

[F5]

The natural powers 16m grow beyond every fixed real bound: (1+15)m≥1+15m by the binomial theorem, and the Archimedean property supplies arbitrarily large m (Integer powers am, The binomial theorem in R: (x+y)n=∑k<n+1ι ⁣(nk) xky n−k, Every complete ordered field is Archimedean).

Proof

Given: The data in the Counterexample.

1.1F3givenalgebrainduction

The real-power definition gives 161=exp⁡(log⁡16)=16. Its exponent law gives 16j+1=16j16 for every natural j, so induction identifies the real power 16m with the natural product defining N. By [F3], N−1/m=(16m)−1/m=16−1=1/16.

1.2F1given

The subgraphs Cfk={(i,t):t<fk(i)} are nested in increasing k. A point (1,1/2) belongs to CfN and not to Cf0, so a singleton is shattered. No two-point set is shattered by a nested family, since shattering would require both opposite singleton traces, which nested sets cannot realize. Therefore the VC-subgraph dimension is exactly one and its index is V=2.

2.1F2F4step 1.1algebra

For k≠ℓ, the functions differ on exactly ∣k−ℓ∣ atoms. By [F2] and [F4], ∥fk−fℓ∥Qm,m=(∣k−ℓ∣N)1/m≥N−1/m=1/16.

3.1F2step 2.1algebra

Since 1/16>2ϵ=1/32, a closed Lm(Qm) ball of radius ϵ centered at a class member cannot contain two distinct class members: the triangle inequality would make their distance at most 2ϵ. Thus every cover needs at least N+1 centers; taking each member as its own center gives a cover with N+1. This proves the exact covering number.

4.1F5step 3.1∎

Fix any proposed finite right side that depends only on ϵ, the VC index, and constants independent of r. At ϵ=1/64 and V=2 it is a fixed finite number. By [F5], choose m so large that 16m+1 exceeds that number. Step 3.1 then contradicts the proposed bound, so this family rules out a VC covering bound whose right-hand side is independent of r.

ExampleConstruction: AI-adaptedVerification: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

A two-function class on a Bernoulli sample

Example

Let X={0,1} with P({0})=P({1})=1/2. Let Z∼P, and take the two-function class F={f0,f1} with f0(x)=0 and f1(x)=x.

Facts & Assumptions

Given: The Bernoulli probability space, the observation Z, and the class F.

[F1]

Pf=∫f dP, P1f=f(Z), and the empirical Rademacher process is σf(Z) (Empirical, centered, and Rademacher processes).

[F2]

For one observation, R^(Z)(F)=Eσsup⁡f∈Fσf(Z) (One-sided empirical Rademacher complexity).

[F3]

A finite nonempty class of measurable [0,1]-valued functions satisfies P(sup⁡f∈F∣Pnf−Pf∣≥ϵ)≤2∣F∣e−2nϵ2 for every ϵ>0 (Uniform deviation bound for a finite unit-range class).

Proof

Given: The sample and class of the Example.

1.1F1givenalgebra

Direct evaluation gives Pf0=0, Pf1=1/2, P1f0=0, and P1f1=Z. Hence sup⁡f∈F∣P1f−Pf∣=∣Z−1/2∣=1/2 for both possible observations.

2.1F2step 1.1algebra

If Z=0, then sup⁡fσf(Z)=0 for either sign. If Z=1, then sup⁡fσf(Z)=max⁡(0,σ), whose uniform-sign expectation is 1/2. Thus R^(Z)(F)=Z/2 and its expectation over the sample is 1/4.

3.1F3step 1.1∎

Applying [F3] with n=1 and ∣F∣=2 gives P(sup⁡f∈F∣P1f−Pf∣≥ϵ)≤4e−2ϵ2 for every ϵ>0. At ϵ=1/2 the event has probability one by step 1.1, and the displayed estimate is the stated finite-class guarantee for this class.

5 · Examples, counterexamples and false statements

None yet.

Sources