A numerical proof of the Grunbaum conjecture
Abstract
The Hahn-Banach theorem states that onto each line in every normed space, there is a unitary projection, and Kadec and Snobar proved (using John's ellipsoid) that onto each n-dimensional subspace of any real normed space, there is a projection with norm at most λn ≤ n. Grunbaum conjectured that λ2=4/3<2 and several attempts have been made to prove this conjecture: Konig and Tomczak-Jaegermann published a proof that was shown incomplete by Chalmers and Lewicki, who gave their own (a bit intricate) proof. Here is a simpler proof, mostly based on their works, and partially on a few numerical studies of extrema of functions of 3 variables.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.