A guarantee that stops being worth anything
limit▲▲△The second assumption is that is bounded away from zero. Construct a family of two-point datasets indexed by , separable for every , whose mistake bound diverges as . Give the bound at three values, and state the exact sense in which the theorem is still true when it has become useless.
Hint
Two points, one of each class, moved toward each other.
Solution
The family. In one dimension, for :
with the bias absorbed, so the augmented points are and .
Separable for every . The unit vector gives margins for both points. Positive, so separable.
The radius. , so as .
The margin. (the direction above is optimal here by symmetry).
The bound.
| Bound | ||
|---|---|---|
In what sense the theorem is still true. Precisely this: for every fixed the number of mistakes is finite, the algorithm does terminate, and the bound is correct. Nothing about the theorem weakens as shrinks. What changes is only its usefulness — a true bound of tells a practitioner nothing they can act on.
The distinction that matters. Compare two failures:
Here. The guarantee holds and is uninformative. More patience genuinely suffices.
In I.2.X07. The guarantee does not hold at all. No amount of patience suffices.
These are different situations with the same observable signature — a run that has not finished. That is the honest content of “the theorem assumes ”: not that small margins are difficult, but that the boundary case is a different mathematical object and the algorithm cannot see which side of it the data lies on.
Where this recurs. The same shape appears throughout Elementa: a bound that is true, tight, and vacuous. Positivity in causal inference (VI.7) fails the same way — the estimator remains unbiased as the propensity approaches zero while its variance diverges. Recognising “true but vacuous” as a category, distinct from “false”, is one of the habits this book is trying to build.