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.
Growth function of a binary hypothesis class
Definition
Let be a nonempty measurable space and let be a nonempty class of measurable binary functions on . For each integer , the growth function of is
The supremum is a maximum because each trace size is an integer between and and is nonempty. In particular, . A finite indexed tuple is shattered exactly when its trace has size , so .
Definition references
Indexed shattering and VC dimension of a binary class: is the set of binary label vectors on the indexed tuple , and shattering means that this trace is all of .
Mohri et al., Definition 3.6 and equation (3.19): the growth function counts distinct dichotomies on a sample.
Bartlett and Mendelson, Theorem 6: restriction of a class to a fixed sample and its empirical VC dimension.
Depends on
Used by
- Affine halfspaces in real p-space have VC dimension p plus one Example
- An infinite singleton class has VC dimension one Example
- Intervals on the real line have VC dimension two Example
- Thresholds on the real line have VC dimension one Example
- One-sided VC uniform convergence and the finite-class branch Theorem
- Realizable sample complexity for finite-VC classes Theorem
- Sauer–Shelah growth bound for indexed samples Theorem
Dependency tree · two levels
2 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
- Mehryar Mohri, Afshin Rostamizadeh, and Ameet Talwalkar, Foundations of Machine Learning, 2nd ed., Definition 3.6 and equation (3.19) (standard reference, not scraped)
- Peter L. Bartlett and Shahar Mendelson, Rademacher and Gaussian Complexities: Risk Bounds and Structural Results, Theorem 6 (standard reference, not scraped)