Table of Contents
Fetching ...

A simple proof of the Grunbaum conjecture

Beata Deregowska, Barbara Lewandowska

Abstract

Let $λ_\mathbb{K}(m)$ denote the maximal absolute projection constant over the subspaces of dimension $m$. Apart from the trivial case for $ m=1$, the only known value of $λ_\mathbb{K}(m)$ is for $ m=2$ and $\mathbb{K}=\mathbb{R}.$ In 1960, B.Grunbaum conjectured that $λ_\mathbb{R}(2)=\frac{4}{3}$ and in 2010, B. Chalmers and G. Lewicki proved it. In 2019, G. Basso delivered the alternative proof of this conjecture. Both proofs are quite complicated, and there was a strong belief that providing an exact value for $λ_\mathbb{K}(m)$ in other cases will be a tough task. In our paper, we present an upper bound of the value $λ_\mathbb{K}(m)$, which becomes an exact value for the numerous cases. The crucial will be combining some results from the articles [B. Bukh, C. Cox, Nearly orthogonal vectors and small antipodal spherical codes, Isr. J. Math. 238, 359-388 (2020)] and [G. Basso, Computation of maximal projection constants, J. Funct. Anal. 277/10 (2019), 3560-3585.], for which simplified proofs will be given.

A simple proof of the Grunbaum conjecture

Abstract

Let denote the maximal absolute projection constant over the subspaces of dimension . Apart from the trivial case for , the only known value of is for and In 1960, B.Grunbaum conjectured that and in 2010, B. Chalmers and G. Lewicki proved it. In 2019, G. Basso delivered the alternative proof of this conjecture. Both proofs are quite complicated, and there was a strong belief that providing an exact value for in other cases will be a tough task. In our paper, we present an upper bound of the value , which becomes an exact value for the numerous cases. The crucial will be combining some results from the articles [B. Bukh, C. Cox, Nearly orthogonal vectors and small antipodal spherical codes, Isr. J. Math. 238, 359-388 (2020)] and [G. Basso, Computation of maximal projection constants, J. Funct. Anal. 277/10 (2019), 3560-3585.], for which simplified proofs will be given.
Paper Structure (2 sections, 7 theorems, 31 equations)

This paper contains 2 sections, 7 theorems, 31 equations.

Table of Contents

  1. Introduction
  2. Main Result.

Key Result

Theorem 1.1

For integers $N \ge m$, we have

Theorems & Definitions (8)

  • Theorem 1.1
  • Theorem 1.2
  • Theorem 2.1
  • Theorem 2.2
  • Theorem 2.3
  • Theorem 2.4
  • Theorem 2.5
  • Conjecture 2.1