[step:Bound the bracketing entropy by a polynomial covering estimate]
For $\delta>0$, let $N(\Theta,|\cdot|,\delta)$ denote the least cardinality of a finite $\delta$-net of $\Theta$ in the Euclidean norm. For $\varepsilon>0$, let $N_{[]}(\varepsilon,\mathcal F,L^2(P))$ denote the least cardinality of a collection of brackets $[\ell,u]$ with $\ell,u\in L^2(E,\mathcal E,P)$, $\ell\le u$ $P$-a.e., and $\|u-\ell\|_{L^2(P)}\le\varepsilon$, whose union contains every $f\in\mathcal F$ up to $P$-a.e. equality. Let $\mathcal L^1$ denote one-dimensional [Lebesgue measure](/page/Lebesgue%20Measure) on $(0,1)$. The preceding step proves that, for every $\varepsilon>0$ with $\|L\|_{L^2(P)}>0$,
\begin{align*}
N_{[]}(\varepsilon,\mathcal F,L^2(P))\le N\left(\Theta,|\cdot|,\frac{\varepsilon}{2\|L\|_{L^2(P)}}\right).
\end{align*}
Since $\Theta$ is compact in $\mathbb R^d$, it is bounded. Choose $R>0$ such that $\Theta\subset \overline{B}(0,R)$. A standard grid covering of $\overline{B}(0,R)$ in $\mathbb R^d$ gives a constant $C_\Theta\ge 1$, depending only on $d$ and $R$, such that for every $0<\delta\le 1$,
\begin{align*}
N(\Theta,|\cdot|,\delta)\le C_\Theta\delta^{-d}.
\end{align*}
Consequently, for $0<\varepsilon\le 2\|L\|_{L^2(P)}$,
\begin{align*}
\log N_{[]}(\varepsilon,\mathcal F,L^2(P))\le \log C_\Theta+d\log\left(\frac{2\|L\|_{L^2(P)}}{\varepsilon}\right).
\end{align*}
The function
\begin{align*}
\varepsilon\mapsto \sqrt{\log C_\Theta+d\log\left(\frac{2\|L\|_{L^2(P)}}{\varepsilon}\right)}
\end{align*}
is integrable on every interval $(0,a]$ with $a>0$. If $2\|L\|_{L^2(P)}<1$, then on the remaining interval $(2\|L\|_{L^2(P)},1)$ the bracketing number is bounded above by its value at $2\|L\|_{L^2(P)}$, because bracketing numbers are nonincreasing in the bracket width. Hence the bracketing entropy integral required by the bracketing Donsker theorem is finite:
\begin{align*}
\int_0^1 \sqrt{\log N_{[]}(\varepsilon,\mathcal F,L^2(P))}\,d\mathcal L^1(\varepsilon)<\infty.
\end{align*}
If $\|L\|_{L^2(P)}=0$, the same conclusion holds because the bracketing number is $1$ for every $\varepsilon>0$.
[/step]