On the approximation exponents for subspaces of $\mathbb{R}^n$

Abstract

This paper follows the generalisation of the classical theory of Diophantine approximation to subspaces of $\mathbb{R}^n$ established by W. M. Schmidt in 1967. Let $A$ and $B$ be two subspaces of $\mathbb{R}^n$ of respective dimensions $d$ and $e$ with $d+e\leqslant n$. The proximity between $A$ and $B$ is measured by $t=\min(d,e)$ canonical angles $0\leqslant θ_1\leqslant \cdots\leqslant θ_t\leqslant π/2$; we set $ψ_j(A,B)=\sinθ_j$. If $B$ is a rational subspace, his complexity is measured by its height $H(B)=\mathrm{covol}(B\cap\mathbb{Z}^n)$. We denote by $μ_n(A\vert e)_j$ the exponent of approximation defined as the upper bound (possibly equal to $+\infty$) of the set of $β>0$ such that the inequality $ψ_j(A,B)\leqslant H(B)^{-β}$ holds for infinitely many rational subspaces $B$ of dimension $e$. We are interested in the minimal value $\mathringμ_n(d\vert e)_j$ taken by $μ_n(A\vert e)_j$ when $A$ ranges through the set of subspaces of dimension $d$ of $\mathbb{R}^n$ such that for all rational subspaces $B$ of dimension $e$ one has $\dim (A\cap B)<j$. We show that $\mathringμ_4(2\vert 2)_1=3$, $\mathringμ_5(3\vert 2)_1\le 6$ and $\mathringμ_{2d}(d\vert \ell)_1\leqslant 2d^2/(2d-\ell)$. We also prove a lower bound in the general case, which implies that $\mathringμ_n(d\vert d)_d\xrightarrow[n\to+\infty]{} 1/d$.