The Concentration Phenomenon and Linear Structure of Finite-Dimensional Normed Spaces · 1986-ana-197
Functional Analysis · ICM 1986: The Concentration Phenomenon and Linear Structure of Finite-Dimensional Normed Spaces
Problem statement
Determine whether there exists a universal constant such that, for every integer and every -dimensional real normed space , there exist a linear isomorphism and orthonormal bases and of satisfying
where, for a linear operator into a normed space and an orthonormal basis of ,
and is the adjoint of , using the standard Hilbert-space identification .
Lean 4
No Lean statement or proof is attached yet. Have a formalization? Share its source to add it to this problem.
Remaining questions in this record
Remaining questions recorded by the source
These are retained within the parent record and are not counted as additional index entries.
Question 1
Determine whether there exist a universal constant and a sequence of positive integers with as such that every -dimensional real normed space admits a linear projection , meaning , for which
Source reference: Stanislaw J. Szarek and Nicole Tomczak-Jaegermann, “On the Nontrivial Projection Problem,” Advances in Mathematics 221 (2009), no. 2, 331–342, Section 1 (“The Nontrivial Projection Problem”). DOI: 10.1016/j.aim.2008.12.004. arXiv: 0805.3792.
Progress & source assessment
Source-reported assessment from the ICM catalogue snapshot. This is not an independent review by Frontier Science.
The problem is unresolved. No citable source was found that proves or disproves the universal estimate for all finite-dimensional real normed spaces.
Vitali D. Milman posed the inequality as Problem 6 in The Concentration Phenomenon and Linear Structure of Finite-Dimensional Normed Spaces, Proceedings of the International Congress of Mathematicians, Berkeley 1986, Vols. 1–2, American Mathematical Society, 1987, pp. 961–975 (direct PDF).
The strongest general estimate obtained from the standard theory is
Indeed, if , Haar averaging over orthonormal bases gives and . The estimate supplies a linear position with , after which the two bases may be selected independently. This logarithmic estimate is presented in Gilles Pisier, The Volume of Convex Bodies and Banach Space Geometry, Cambridge Tracts in Mathematics 94, Cambridge University Press, 1989, DOI 10.1017/CBO9780511662454; it combines the -position machinery of D. R. Lewis and T. Figiel–N. Tomczak-Jaegermann with Pisier's estimate for the Rademacher projection. It leaves exactly a logarithmic gap from the requested bound. The argument does yield the desired order for families whose product is uniformly bounded, but not for arbitrary .
Stanislaw J. Szarek explicitly revisited the Rademacher-product question in Problem 3.3 of Convexity, Complexity, and High Dimensions, Proceedings of the International Congress of Mathematicians, Madrid 2006, Vol. II, EMS Press, 2007, pp. 1599–1621, DOI 10.4171/022-2/76. He states that the corresponding full-space property remains open and identifies Milman's Problem 6 as a slightly weaker formulation. This rules out treating the classical estimate or proportional-subspace results as a resolution of the exact problem.
A weaker consequence also remains incomplete. Stanislaw J. Szarek and Nicole Tomczak-Jaegermann, On the Nontrivial Projection Problem, Advances in Mathematics 221 (2009), no. 2, 331–342, DOI 10.1016/j.aim.2008.12.004, arXiv:0805.3792, prove an "up to a logarithmic factor" result: every -dimensional space has a complemented subspace of one of the types , with , but with projection/isomorphism bound , not a universal constant. Timothy Gowers and Katarzyna Wyczesany, A Counterexample to a Strengthening of a Question of V. D. Milman, Annales Henri Lebesgue 6 (2023), 427–448, DOI 10.5802/ahl.168, still describe the bounded nontrivial-projection question as open; their counterexample concerns a stronger requirement involving the fixed Euclidean structure and does not disprove the Rademacher-product inequality.
Recorded progress
Add yours →Nothing recorded yet. A pointer to a paper the entry is missing counts.
Machine attempts
0 recordedAttempts run against the statement below and are recorded in full, including the failures. The point is to stop the next model — and the next person — from re-walking a road that is already known to end. Each attempt costs 25 credits.
No machine attempts recorded.
Sign in to run an attempt. New accounts start with enough credits for ten.
Discussion
0 notesNotes are for clarifying the statement, flagging a missing reference, or recording why an approach fails. Claimed solutions belong in a submission, where they can be reviewed.
No notes yet.
Sign in to add a note.