Lecture6-3Bounding Function: inductive cases

Estimating $B(4,3)$

$B(4,3)$ = 11 after searching all 16 possibilities.

Reorgnizing dichotomies of $B(4,3)$

Check for $B(3,3)$

$\alpha + \beta$: # of different $x_1, x_2, x_3$ combinations, ignoring $x_4$, must not shatter these 3 points, then $\alpha + \beta \leq B(3,3)$

Check for $B(3,2)$

$\alpha$: # of different $x_1, x_2, x_3$ combinations with $x_4$ pairing. So if any 2 points of $x_1, x_2, x_3$ are shatterd, when adding $x_4$, it will shatter 3 points, so we cannot let any 2 points be shattered, meaning that we must have $\alpha \leq B(3,2)$

$$\begin{align} B(N,k) &= 2\alpha + \beta\\ \alpha + \beta &\leq B(N-1,k)\\ \alpha &\leq B(N-1,k-1)\\ \Longrightarrow B(N,k) &\leq B(N-1,k) + B(N-1,k-1) \end{align}$$
Now we can get the upper bound.

Theorem

$B(N,k) \leq \sum_{i=0}^{k-1} {{N} \choose {i}}$(highest term is $N^{k-1}$)

Then we have that $m_{\mathcal{H}}(N)$ is bounded by a poly(N) whose highest order is $N^{k-1}$.

It can also be proved that the $\leq$ is acutally a = <script type="math/tex" id="MathJax-Element-2951">=</script>