The Setting
Let and be symmetric convex bodies in . The duality conjecture for metric entropy compares, at every scale , the number of translates of needed to cover with the number of translates of needed to cover , where and are the polar bodies.
The library defines these notions in the real space of functions on an index set, together with the cube and the ball, and computes one polar, that of the cube.
The Claim
Definition 1. Let be an index set. The real space is the vector space of functions , with coordinates ; it is when has elements.✦ The cube in is the set .
Let and be subsets of . A family of points of covers by when (1)✦ The set is coverable by when some finite family of points covers it by : (2)✦ The covering number of by is the least number of points in a finite family of points of that covers by , (3)✦ and when is not coverable by .
Let now be finite. The pairing of two points and of is the number (4)✦ and the polar of a subset of is the set (5)✦ A symmetric convex body in is a compact convex subset of with nonempty interior that is symmetric about the origin: (6)✦ The norm of a point of is the number (7)✦ and the ball in is the set .✦
Theorem 1. For a finite index set , the polar of the cube is the ball: (8)✦
In the paper, the result reads: for bounded with of nonempty interior, is the least number of translates of , with centers anywhere in , that cover ; ; a convex body is compact with nonempty interior; and while is the unit ball of the norm.
What Is Checked
These definitions are stated over subsets of the real space , with any index set for the cube and for covers (1), coverability (2) and covering numbers (3), and a finite one from the pairing (4) on, and what the library records about them is the identity (8).