Definition of shattering: video
the VC dimension (for Vapnik–Chervonenkis dimension) is a measure of the capacity (complexity, expressive power, richness, or flexibility) of a space of functions that can be learned by a statistical classification algorithm. It is defined as the cardinality of the largest set of points that the algorithm can shatter.
In -dimensions, the VC dimension of the set of all linear classifiers is
See also Probably approximately correct, Learning theory,
VC dimension is about the following.
You have a bunch of properties, like "being a policeman", "liking pineapple toppings on pizza", etc
And you want to estimate the fraction of people with each property in large population, from a single sample.
VC dimension tells you how much larger then sample needs to be, compared to when you are only estimating the fraction of people for a single property.
If all the properties are very decorrelated, it's about {number of properties} times what you needed before, but if they are correlated it can be much less, and that's what VC dimension measures
...........
See Probably approximately correct for context.
What happens when or is infinite?
Let , define (i.e. the concept class of concepts in , but restricted to the subset of , . The size of , where is the size of .
This is used to define a measure of concept class complexity: VC dimension (Vapnik-Chervonenkis):
We say is shattered by , if
VC dimension of is the cardinality of the largest set shattered by (If shatters arbitrarily large sets, VC-dim is ).
intervals
is intervals over , where in intervals are assigned and those outside .
Can have interval that assigns anything to 1, and 2 points, but not for 3 points (+-+). This implies that the VC dimension of the class of intervals is 2.
rectangles
there is a set of 4 points that can be shattered by rectangles. However, there is no set of 5 points that is shattered by rectangles, because there is always a point within the extreme left, right, top, bottom.
Linear halfspaces or LTF (Linear threshold functions)
Like Support vector machines.
VC dimension is n+1 for n dimensional space, (in 2 dimensions, it is 3).
https://www.wikiwand.com/en/VC_dimension
https://en.wikipedia.org/wiki/Sauer%E2%80%93Shelah_lemma ; shows that for sets with finite number of elements, one can bound the cardinality of a family of sets with a finite VC dimension