An exact hierarchy for Lebesgue's universal covering constant and a certified 0.834 lower bound

Abstract: Posed by Lebesgue in 1914, the universal covering problem asks for the smallest-area planar convex set containing a congruent copy of every set of diameter at most one. We introduce an exact Reuleaux-type variational hierarchy for this constant: its monotone finite-arc values $Λ<em>M$ satisfy $a</em>{\mathrm{Leb}}=\lim_{M\to\infty}Λ<em>M$, and each level is a continuous finite-dimensional problem. We prove $0\le a</em>{\mathrm{Leb}}-Λ<em>M\le C M<sup>{-2}$, giving a controlled finite-arc route to the constant itself. As a certified low-order realization, an outward-rounded interval certificate for a regular finite Reuleaux subtest proves $a</em>{\mathrm{Leb}}\ge0.834$, improving the lower-bound benchmark established by Brass and Sharifi in 2005.