An extension of a Bourgain--Lindenstrauss--Milman inequality
Omer Friedland, Sasha Sodin

TL;DR
This paper extends a known inequality by demonstrating that averaging over any number of random sign choices greater than the dimension yields a norm isomorphic to the unconditional norm, broadening the scope of the original result.
Contribution
It generalizes the Bourgain--Lindenstrauss--Milman inequality to include any averaging parameter ta > 1, not just large constants.
Findings
Averaging over ta > 1 random signs produces an isomorphic unconditional norm.
The result applies to all ta > 1, not only large constants.
The extension broadens the applicability of the original inequality.
Abstract
Let || . || be a norm on R^n. Averaging || (\eps_1 x_1, ..., \eps_n x_n) || over all the 2^n choices of \eps = (\eps_1, ..., \eps_n) in {-1, +1}^n, we obtain an expression ||| . ||| which is an unconditional norm on R^n. Bourgain, Lindenstrauss and Milman showed that, for a certain (large) constant \eta > 1, one may average over (\eta n) (random) choices of \eps and obtain a norm that is isomorphic to ||| . |||. We show that this is the case for any \eta > 1.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsPoint processes and geometric inequalities
