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
- Binary Operations, Monoids, Groups and Subgroups
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Countability and Uncountability
- Finite Counting, Factorials and Binomial Coefficients
- Foundations of the Real Numbers for Analysis
- Linear Algebra Methods in Combinatorics
- Linear Independence, Bases and Dimension
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Roots, Rational Powers, and Classical Inequalities
- The ZFC Axioms and the Basic Set Constructions
- VC dimension, growth functions, and classification sample complexity
- Vector Spaces, Linear Subspaces, Span and Direct Sums
2 · Logical flowchart
3 · Definitions, theorems and proofs
None yet.
4 · Examples, counterexamples and false statements
Thresholds on the real line have VC dimension one
Example
Equip with its Borel sigma-algebra. Let , where exactly when . On the ordered sample , the threshold labels the first two points by and the third by . 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 described in the Example.
Shattering is defined on indexed tuples; a one-point tuple is shattered when both labels occur, and is the largest shattered length. Indexed shattering and VC dimension of a binary class
counts distinct trace vectors on indexed -tuples. Growth function of a binary hypothesis class
Verification
If , the midpoint satisfies and , so the functions are all distinct as varies over and the class is infinite. For any single , realizes label and realizes label , so every one-point tuple is shattered.
For two distinct points , the possible trace vectors are only , , and as the threshold passes from left to right; never occurs. If the two indexed points repeat, their labels always agree. Hence no two-point tuple is shattered, and .
For distinct points ordered , a threshold realizes exactly the vectors consisting of initial ones followed by zeros, for . A tuple with only distinct points has at most traces, while a distinct -tuple attains ; for the unique empty trace is counted once. Thus .
Intervals on the real line have VC dimension two
Example
Equip with its Borel sigma-algebra. Let be the class of indicator functions of closed bounded intervals , where . Then . On any distinct ordered sample points, its growth function has value : the traces are the empty trace and all contiguous nonempty blocks of sample indices.
The sketch shows why the endpoint labeling cannot be produced: an interval containing and also contains . 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 of closed bounded intervals described in the Example.
Shattering means that every binary labeling of an indexed tuple occurs in the trace. Indexed shattering and VC dimension of a binary class
The growth function is the supremum of trace cardinalities over indexed tuples. Growth function of a binary hypothesis class
Verification
Fix and put . The patterns are realized respectively by (strictly left of both points), , , and . Thus the pair is shattered and the VC dimension is at least two.
For any three distinct ordered points, the labeling is impossible for an interval because containing and forces it to contain every point between them, including . 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.
On 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 such blocks; an interval outside the finite sample realizes the empty trace. For a tuple with distinct points there are at most traces, while a distinct tuple attains that number. At the formula gives the single empty trace. Thus .
Affine halfspaces in real p-space have VC dimension p plus one
Example
Use local coordinates on and write for the function that is one at and zero elsewhere, for . Thus these coordinates and unit vectors reindex the canonical indices by .
Equip with its Euclidean Borel sigma-algebra. For an integer , let consist of the classifiers on of the form if and only if , with and , where . The sketch illustrates one labeling for : the affine score labels by and by . The proof below handles arbitrary 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 have VC dimension .
Facts & Assumptions
Given: The class of affine halfspace classifiers described in the Example.
A finite indexed tuple is shattered exactly when every binary labeling occurs. Indexed shattering and VC dimension of a binary class
For and , reindex the supplier's basis vectors by , as in the Example. The resulting local vectors form a basis of and every vector is its coordinate linear combination. The standard list with and for is an ordered basis of ; hence , and is the zero space with basis and dimension
Every linearly independent subset of has at most elements, because the standard coordinate vectors span that space. If has a spanning set with elements, then every linearly independent subset of is finite with at most elements; in particular has no linearly independent subset equinumerous with
A finite list is linearly independent exactly when it is injective and its image is a linearly independent subset. Finite sums re-indexed along an injection, with a zero term deleted, and concatenated; and the closure properties of linear independence: an independent list is injective and never , its sublists are independent, a list is independent exactly when it is injective with linearly independent image, and every subset of a linearly independent set is linearly independent
A finite list is linearly dependent exactly when it has a scalar relation equal to zero with at least one nonzero coefficient. Linear independence: a finite list is independent when forces every , and a subset is independent when every injective finite list into is independent
Verification
The points are shattered. Given arbitrary labels , set , , and . The affine score then satisfies and ; since these values are or , the rule realizes exactly the chosen labels. Thus the VC dimension is at least .
Take any indexed points . The augmented vectors form a list of vectors. If the list were linearly independent, [F4] would make its image a linearly independent set of distinct vectors, contradicting [F3]. [F3, F4] Hence the list is dependent, and [F5] gives real coefficients , not all zero, with , equivalently and . Both positive and negative coefficients occur. Label by when and by when (choose either label when ). If an affine score realized this labeling, then for every positive coefficient and for every negative coefficient, because label means . Therefore , contradicting . No -tuple is shattered, so the VC dimension is at most .
Steps 1.1 and 1.2 give matching lower and upper bounds, proving .
An infinite singleton class has VC dimension one
Example
Let with its discrete sigma-algebra, and let , where exactly when . The sketch shows the singleton indicator on four elements of (the ambient number line continues indefinitely). The verification proves the exact trace count for every finite tuple.
Facts & Assumptions
Given: The class of the zero function and all singleton-indicator functions on .
A tuple is shattered when every binary label vector occurs; repeated coordinates stay indexed. Indexed shattering and VC dimension of a binary class
counts the distinct traces on indexed -tuples. Growth function of a binary hypothesis class
Verification
For distinct , and , so the classifiers are pairwise distinct and is infinite. For any single , the zero function realizes label and realizes label , so each one-point tuple is shattered.
For any two distinct points, no member of labels both points by , so their 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 .
On distinct natural numbers, the traces are the empty vector and the vectors with exactly one positive coordinate, so there are . If a tuple repeats values, its trace is determined by its distinct values and has at most patterns. The empty tuple has one trace. Therefore for every .