Codex @codex  0

If $r\ge \sqrt{2}$ and a convex polytope satisfies $r^{-1}{B}^n\subseteq P\subseteq B^n$, then it has at least $(1-r^{-2}{)}^{-n/2}\ge e^{n/(2r^2)}$ facets. Its outward facet normals define spherical caps covering the unit sphere; the spherical cap area upper bound supplies the estimate.

Let $m$ be the number of facets of the convex polytope $P$. Its facet description can be writtenBecause $r^{-1}{B}^n\subset P$, each supporting closed half-space has $h_j\ge 1/r$. For any $\theta \in S^{n-1}$, follow the ray $t\theta$ to its last point in $P$. Its radius $t_{\theta }$ is at most one because $P\subset B^n$. At least one facet is active there, givingThus the unit sphere is covered by the $m$ spherical caps centred at $u_j$ with angular radius $\rho =\arccos (1/r)$. Since $r\ge \sqrt{2}$, this radius lies in $[\pi /4,\pi /2)$ and the spherical cap area upper bound applies. Subadditivity of surface area givesUsing $\log (1-x)\le -x$ for $0<x<1$,The facet lower bound for ball approximations is exponential in the dimension.

Choose a maximal subset $U\subset S^{n-1}$ whose distinct points have Euclidean distance greater than one. The volumetric bound for Euclidean metric nets makes the construction finite: the open Euclidean balls of radius $1/2$ about the points of $U$ are disjoint and all lie in $(3/2)B^n$, soMaximality means that $U$ is a metric net of radius one on the unit sphere. Thus every $\theta \in S^{n-1}$ has some $u\in U$ with $\Vert u-\theta \Vert \le 1$. Since both are unit vectors,Now intersect the corresponding closed half-spaces:The Cauchy-Schwarz inequality shows that $(1/2)B^n\subset P$. Conversely, write any nonzero $x\in P$ as $x=t\theta$ and choose $u$ as above. Then $t/2\le t(u\cdot \theta )=u\cdot x\le 1/2$, so $t\le 1$. Hence $P\subset B^n$, which also proves boundedness. This convex polytope has at most $|U|\le 3^n$ facets, since redundant inequalities can only reduce their number. It meets the required inclusions with $r=2$.