Suppose the unit ball of a -dimensional normed vector space has metric covering number at , where . Cover by at most balls of radius . Discard every ball missing the unit sphere, and select one point of the unit sphere from each remaining ball. These selected points form a radius- metric net of the unit sphere, with
Indeed, a unit sphere point and the selected point from the same covering ball each lie within of its center, so the triangle inequality bounds their distance by . The selection ensures that all centers of the new metric net have unit norm; the original covering centers need not. For Euclidean balls, the volumetric bound for Euclidean metric nets supplies the initial metric covering number estimate.

Articles by others on the same topic (0)

There are currently no matching articles.