Exceptional set estimate through Brascamp-Lieb inequality

Abstract

Fix integers $1\le k<n$, and numbers $a,s$ satisfying $0<s<\min\{k,a\}$. The problem of exceptional set estimate is to determine \[T(a,s):=\sup_{A\subset \mathbb{R}^n\ \text{dim}A=a}\text{dim}(\{ V\in G(k,n): \text{dim}(π_V(A))<s \}). \] In this paper, we prove a new upper bound for $T(a,s)$ by using Brascamp-Lieb inequality. As one of the corollary, we obtain the estimate \[T(a,\frac{k}{n}a)\le k(n-k)-\min\{k,n-k\}, \] which improves a previous result $T(a,\frac{k}{n}a)\le k(n-k)-1$ of He. By constructing examples, we can determine the explicit value of $T(a,s)$ for certain $(a,s)$: When $k\le \frac{n}{2}$, $β\in(0,1]$ and $γ\in(β,\frac{k}{n}(1+β)]$, we have \[T(1+β,γ)=k(n-k)-k.\] When $k\ge \frac{n}{2}$, $β\in(0,1]$ and $γ\in (β, (1-\frac{k}{n})+\frac{k}{n}β]$, we have \[T(n-1+β,k-1+γ)=k(n-k)-(n-k).\]

Figures (2)

• Figure 1: Rescaling
• Figure 2: Projection to planes

Theorems & Definitions (49)

• Theorem 1
• Lemma 2
• proof
• Definition 3: Definition of $E(m,l)$
• Definition 4: Definition of $m(t,l)$
• Theorem 5
• Remark 6
• Theorem 7
• Remark 8
• proof : Proof of Theorem \ref{['thm']} using Theorem \ref{['mainthm']}