The Setting
Let be a finite index set. On the dual side of the duality conjecture for metric entropy one covers the polar of the cube , the unit ball, by translates of a dilate , with scale , of the polar of a set , and counts the translates. The question here is how that count moves with the scale: can covering by translates of a larger dilate of ever take more of them?
The library states the answer for every subset of , convex or not, symmetric or not, and for every pair of scales .
Polars, Cubes and Covers
The real space over an index set is the vector space of all functions from to , a point being the family of its coordinates.✦ For a finite , the pairing of two points and of is their standard inner product (1)✦
The polar of a subset of is the set of points whose pairing with every point of is at most , (2)✦ and for a real number , the dilate of is the set .
The cube of is the unit ball of the sup norm, (3)✦
For subsets and of and points of , the translates cover when every point of has for some .✦ A pair of subsets of is finitely coverable when finitely many translates of cover .✦
The covering number of a subset of by a subset is the least number of translates of , with centers anywhere in , that cover , (4)✦ and it is when no finite family of translates of covers .
The Claim
Theorem 1. Let be a finite set, a subset of , and and real numbers with . Then (5)✦ If moreover the pair is finitely coverable, then the pair is finitely coverable and (6)✦
What Is Checked
The claim is stated over the real space of a finite index set with the pairing (1), the polar (2) of an arbitrary subset and its dilates, the cube (3), and the covering number (4) together with finite coverability by translates.