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.

VC dimension, growth functions, and classification sample complexity — Examples

1 · Prerequisites

2 · Logical flowchart

3 · Definitions, theorems and proofs

None yet.

4 · Examples, counterexamples and false statements

ExampleConstruction: AI-generatedVerification: AI-generatedjudge pass (gpt-6-luna)Open item page →

Thresholds on the real line have VC dimension one

Example

Equip R with its Borel sigma-algebra. Let Hth:={ht:t∈R}, where ht(x)=1 exactly when x≤t. On the ordered sample x1<x2<x3, the threshold t=x2 labels the first two points by 1 and the third by 0. The sketch is illustrative; the verification proves the dimension and growth count for every finite tuple.

diagram failed to render:
\begin{tikzpicture}[baseline=-0.4ex]
  \draw[->] (0,0) -- (5,0);
  \draw (1,0.1) -- (1,-0.1) node[below=3pt] {$x_1$};
  \draw (2,0.1) -- (2,-0.1) node[below=3pt] {$x_2=t$};
  \draw (4,0.1) -- (4,-0.1) node[below=3pt] {$x_3$};
  \draw[very thick,->] (2,0.6) -- (0.3,0.6);
  \draw[dashed] (2,0.2) -- (2,0.8);
  \node[above] at (1,0.65) {$1$};
  \node[above] at (2,0.65) {$1$};
  \node[above] at (4,0.65) {$0$};
\end{tikzpicture}

Facts & Assumptions

Given: The threshold class Hth described in the Example.

[F1]

Shattering is defined on indexed tuples; a one-point tuple is shattered when both labels occur, and VCdim⁡ is the largest shattered length. Indexed shattering and VC dimension of a binary class

[F2]

ΠH(m) counts distinct trace vectors on indexed m-tuples. Growth function of a binary hypothesis class

Verification

1.1F1givenconstruct

If s<t, the midpoint x=(s+t)/2 satisfies hs(x)=0 and ht(x)=1, so the functions ht are all distinct as t varies over R and the class is infinite. For any single x, t<x realizes label 0 and t=x realizes label 1, so every one-point tuple is shattered.

2.1F1step 1.1

For two distinct points x<y, the possible trace vectors are only (0,0), (1,0), and (1,1) as the threshold passes from left to right; (0,1) never occurs. If the two indexed points repeat, their labels always agree. Hence no two-point tuple is shattered, and VCdim⁡(Hth)=1.

3.1F2step 2.1algebra∎

For m distinct points ordered x1<⋯<xm, a threshold realizes exactly the m+1 vectors consisting of k initial ones followed by m−k zeros, for 0≤k≤m. A tuple with only r distinct points has at most r+1≤m+1 traces, while a distinct m-tuple attains m+1; for m=0 the unique empty trace is counted once. Thus ΠHth(m)=m+1.

ExampleConstruction: Literature-sourcedVerification: AI-adaptedjudge pass (gpt-6-luna)Open item page →

Intervals on the real line have VC dimension two

Example

Equip R with its Borel sigma-algebra. Let Hint be the class of indicator functions of closed bounded intervals [a,b]⊂R, where a≤b. Then VCdim⁡(Hint)=2. On any m distinct ordered sample points, its growth function has value ΠHint(m)=1+m(m+1)/2: the traces are the empty trace and all contiguous nonempty blocks of sample indices.

The sketch shows why the endpoint labeling (1,0,1) cannot be produced: an interval containing x1 and x3 also contains x2. The verification proves this for every ordered triple and counts all traces.

diagram failed to render:
\begin{tikzpicture}[baseline=-0.4ex]
  \draw[->] (0,0) -- (5,0);
  \draw (1,0.1) -- (1,-0.1) node[below=3pt] {$x_1$};
  \draw (2.5,0.1) -- (2.5,-0.1) node[below=3pt] {$x_2$};
  \draw (4,0.1) -- (4,-0.1) node[below=3pt] {$x_3$};
  \draw[very thick] (1,0.6) -- (4,0.6);
  \fill (1,0.6) circle (1.5pt);
  \fill (4,0.6) circle (1.5pt);
  \node[above] at (2.5,0.65) {middle point is included};
\end{tikzpicture}

Example references

Mohri et al., Example 3.11: two points are shattered by intervals, while three ordered points cannot realize the pattern (+,−,+).

Facts & Assumptions

Given: The class Hint of closed bounded intervals described in the Example.

[F1]

Shattering means that every binary labeling of an indexed tuple occurs in the trace. Indexed shattering and VC dimension of a binary class

[F2]

The growth function is the supremum of trace cardinalities over indexed tuples. Growth function of a binary hypothesis class

Verification

1.1F1givenconstruct

Fix x1<x2 and put r=x2−x1>0. The patterns (0,0),(1,0),(0,1),(1,1) are realized respectively by [x1−2r,x1−r] (strictly left of both points), [x1,x1], [x2,x2], and [x1,x2]. Thus the pair is shattered and the VC dimension is at least two.

2.1F1step 1.1

For any three distinct ordered points, the labeling (1,0,1) is impossible for an interval because containing x1 and x3 forces it to contain every point between them, including x2. A repeated coordinate also prevents a tuple of length at least three from being shattered, since repeated instances receive the same label under every classifier. Hence no three-point indexed tuple is shattered and the VC dimension is exactly two.

3.1F2step 2.1algebra∎

On m distinct ordered points, a nonempty interval has as its trace one contiguous block, and every such block is realized by the interval with those two sample endpoints. There are ∑r=1m(m−r+1)=m(m+1)/2 such blocks; an interval outside the finite sample realizes the empty trace. For a tuple with r≤m distinct points there are at most 1+r(r+1)/2≤1+m(m+1)/2 traces, while a distinct tuple attains that number. At m=0 the formula gives the single empty trace. Thus ΠHint(m)=1+m(m+1)/2.

ExampleConstruction: Literature-sourcedVerification: AI-adaptedOpen item page →

Affine halfspaces in real p-space have VC dimension p plus one

Example

Use local coordinates xi:=x(i−1) on Rk and write ei for the function that is one at i−1 and zero elsewhere, for 1≤i≤k. Thus these coordinates and unit vectors reindex the canonical indices 0,…,k−1 by 1,…,k.

Equip Rp with its Euclidean Borel sigma-algebra. For an integer p≥1, let Hp consist of the classifiers on Rp of the form hw,b(x)=1 if and only if w⋅x+b≥0, with w∈Rp and b∈R, where w⋅x:=∑j=1pwjxj. The sketch illustrates one labeling for p=2: the affine score f(x1,x2)=1−2x1−2x2 labels 0 by 1 and e1,e2 by 0. The proof below handles arbitrary p and all labelings algebraically; it does not rely on the sketch.

diagram failed to render:
\begin{tikzpicture}[baseline=-0.4ex,scale=1.1]
  \draw[->] (-0.2,0) -- (3,0) node[right] {$x_1$};
  \draw[->] (0,-0.2) -- (0,3) node[above] {$x_2$};
  \draw[thick] (1,0) -- (0,1) node[left] {$f=0$};
  \fill (0,0) circle (1.7pt) node[below left] {$0:1$};
  \fill (2,0) circle (1.7pt) node[below] {$e_1:0$};
  \fill (0,2) circle (1.7pt) node[left] {$e_2:0$};
  \node at (0.45,0.45) {$f\ge0$};
  \node at (1.8,1.8) {$f<0$};
\end{tikzpicture}

Example references

Mohri et al., Example 3.12 and Theorem 3.13: affine hyperplanes in Rp have VC dimension p+1.

Facts & Assumptions

Given: The class Hp of affine halfspace classifiers described in the Example.

[F1]

A finite indexed tuple is shattered exactly when every binary labeling occurs. Indexed shattering and VC dimension of a binary class

[F2]

For k=p and k=p+1, reindex the supplier's basis vectors by i↦i−1, as in the Example. The resulting local vectors e1,…,ek form a basis of Rk and every vector is its coordinate linear combination. The standard list e:n→Fn with ei(i)=1F and ei(j)=0F for j≠i is an ordered basis of Fn; hence dim⁡FFn=n, and F0 is the zero space with basis ∅ and dimension 0

[F3]

Every linearly independent subset of Rp+1 has at most p+1 elements, because the p+1 standard coordinate vectors span that space. If V has a spanning set with n elements, then every linearly independent subset of V is finite with at most n elements; in particular V has no linearly independent subset equinumerous with N

Verification

1.1F1F2givenconstruct

The p+1 points 0,e1,…,ep are shattered. Given arbitrary labels y0,…,yp∈{0,1}, set si=2yi−1, b=s0, and wi=si−s0. The affine score f(x)=w⋅x+b then satisfies f(0)=s0 and f(ei)=si; since these values are +1 or −1, the rule h(x)=1{f(x)≥0} realizes exactly the chosen labels. Thus the VC dimension is at least p+1.

1.2F1F3F4F5givenchooseconstructalgebra

Take any p+2 indexed points x1,…,xp+2∈Rp. The augmented vectors (xi,1)∈Rp+1 form a list of p+2 vectors. If the list were linearly independent, [F4] would make its image a linearly independent set of p+2 distinct vectors, contradicting [F3]. [F3, F4] Hence the list is dependent, and [F5] gives real coefficients ai, not all zero, with ∑iai(xi,1)=0, equivalently ∑iaixi=0 and ∑iai=0. Both positive and negative coefficients occur. Label xi by 1 when ai>0 and by 0 when ai<0 (choose either label when ai=0). If an affine score f(x)=w⋅x+b realized this labeling, then aif(xi)≥0 for every positive coefficient and aif(xi)>0 for every negative coefficient, because label 0 means f(xi)<0. Therefore ∑iaif(xi)>0, contradicting ∑iaif(xi)=w⋅∑iaixi+b∑iai=0. No p+2-tuple is shattered, so the VC dimension is at most p+1.

2.1step 1.1step 1.2∎

Steps 1.1 and 1.2 give matching lower and upper bounds, proving VCdim⁡(Hp)=p+1.

ExampleConstruction: AI-generatedVerification: AI-generatedjudge pass (gpt-6-luna)Open item page →

An infinite singleton class has VC dimension one

Example

Let X=N with its discrete sigma-algebra, and let H={0}∪{ha:a∈N}, where ha(n)=1 exactly when n=a. The sketch shows the singleton indicator h2 on four elements of N (the ambient number line continues indefinitely). The verification proves the exact trace count for every finite tuple.

0123h2=1000

Facts & Assumptions

Given: The class H of the zero function and all singleton-indicator functions on N.

[F1]

A tuple is shattered when every binary label vector occurs; repeated coordinates stay indexed. Indexed shattering and VC dimension of a binary class

[F2]

ΠH(m) counts the distinct traces on indexed m-tuples. Growth function of a binary hypothesis class

Verification

1.1F1givenconstruct

For distinct a,b∈N, ha(a)=1 and hb(a)=0, so the classifiers ha are pairwise distinct and H is infinite. For any single a, the zero function realizes label 0 and ha realizes label 1, so each one-point tuple is shattered.

2.1F1step 1.1

For any two distinct points, no member of H labels both points by 1, so their (1,1) pattern is absent; a repeated two-point tuple also cannot be shattered because both coordinates always agree. Thus no two-point tuple is shattered and VCdim⁡(H)=1.

3.1F2step 2.1algebra∎

On m distinct natural numbers, the traces are the empty vector and the m vectors with exactly one positive coordinate, so there are m+1. If a tuple repeats values, its trace is determined by its r≤m distinct values and has at most r+1≤m+1 patterns. The empty tuple has one trace. Therefore ΠH(m)=m+1 for every m≥0.

Sources