For a precompact subset K of a metric space and ε > 0, the covering number N(K,ε) is defined as the smallest number of balls of radius ε whose union covers K. Knowledge of the metric entropy, i.e., the asymptotic behaviour of covering numbers for (familie
No takes yet. Share an insight, caveat, or question.
Stanisław J. Szarek (1998) studied this question.