Id: palomar/PALOMAR-2026-08-23-000001 Url: https://github.com/geoconuk/lean-misc-math/tree/4a1b0c422b6b4e0fd98b04b31a5c41b33fcea123 Json: https://data.palomar-registry.org/entries/PALOMAR-2026-08-23-000001-v1.json Repo: https://github.com/geoconuk/lean-misc-math Tags: math.MG, cs.IT, msc:52C17, msc:41A46, msc:94B65, covering-numbers, high-dimensional-geometry, information-theory Score: 0 Title: geoconuk/lean-misc-math Trust: high Domain: math.MG Source: palomar Authors: George A. Constantinides Reviews: 0 Subject: math.MG Category: research Comments: 0 Disputed: false Division: math Mentions: 0 Verified: true Discussed: 0 Published: 2026-08-23 Formalized: true Formalizes: title=Random packings and coverings of the unit n-sphere identifier=doi:10.1002/j.1538-7305.1967.tb04246.x relationship=formalizes Page: https://delphi.science/r/palomar/PALOMAR-2026-08-23-000001 For a fixed angular radius theta in (0, pi/2), the least number M(n, theta) of spherical caps of angular radius theta, centred at points of the unit sphere of R^n, whose union is that whole sphere satisfies (1/n) log M(n, theta) -> -log sin theta as n -> infinity. This is the covering half of Wyner (1967): the elementary volume bound gives the lower bound on the covering number and a random-covering argument gives the upper bound. The statement is given in Mathlib's own vocabulary, as an asymptotic for Metric.coveringNumber of Metric.sphere 0 1 in EuclideanSpace R (Fin n) at chordal radius 2…