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.
A second proof of Sauer–Shelah, from the multilinear polynomial space
Statement
If has VC dimension at most , then
Facts & Assumptions
Given: a family with .
Over , if is not shattered, then on the incidence vectors of the monomial is a linear combination of the monomials for (If does not shatter then agrees on with a combination of the for ).
For , the multilinear monomials of degree at most span a space of dimension on the cube (The functions obtained from with are linearly independent, so they span a space of dimension ).
Proof
Let be the vector space of all functions . For , put At an incidence vector , this polynomial is when and otherwise. Therefore every is represented on the incidence vectors of by the multilinear polynomial , so the restrictions of all squarefree monomials span .
If , then is not shattered. Hence [L1] expresses the restriction of on as a combination of the restrictions of the monomials with . Inducting on shows that every monomial restriction is in the span of those with degree at most .
Therefore the restrictions of the monomials with already span . Put ; no subset of has size above , so this is the same spanning family as the one with . By [L2], there are at most of them. If this is already ; if , then for , so the same sum is also . Hence is at most . This is the same numerical bound as Sauer–Shelah: a family on of VC dimension at most has at most members, proved by a genuinely different route.
Remarks
- The shifting proof works with families of sets; this proof works with a span of monomial functions. The shared bound is the conclusion, not the method.
Depends on
- Sauer–Shelah: a family on $[n]$ of VC dimension at most $d$ has at most $\sum_{i=0}^{d}\binom{n}{i}$ members
- If $\mathcal{F}$ does not shatter $T$ then $x_T$ agrees on $\{v_F:F\in\mathcal{F}\}$ with a combination of the $x_S$ for $S\subsetneq T$
- $\widetilde f$ is multilinear, agrees with $f$ at every point of $\{0,1\}^{n}$, is degree-nonincreasing when nonzero, and is the unique multilinear polynomial with that agreement
- The functions $\{0,1\}^{n}\to F$ obtained from $x_T$ with $\lvert T\rvert\le s$ are linearly independent, so they span a space of dimension $\sum_{i=0}^{s}\binom{n}{i}$
- Shattering and the Vapnik–Chervonenkis dimension of a set family
- The incidence vector $v_A\in F^{n}$ of a subset $A\subseteq[n]$ over a stated field
- Finite-dimensional vector space, and its dimension $\dim_F V$; infinite-dimensional means having no finite basis
- Linear combination of a finite list, and the span $\operatorname{span}(S)$ as the smallest linear subspace containing $S$
- The set $[A]^{k}$ of $k$-element subsets and the binomial coefficient $\binom{n}{k} := \lvert [n]^{k}\rvert$
- Vector space over a field
Used by
Dependency tree · two levels
50 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
- L. Babai and P. Frankl, Linear Algebra Methods in Combinatorics, §7.4 (standard reference, not scraped)