On the approximation exponents for subspaces of Rn
Abstract
This paper follows the generalisation of the classical theory of Diophantine approximation to subspaces of Rn established by W. M. Schmidt in 1967. Let A and B be two subspaces of Rn of respective dimensions d and e with d+e≤slant n. The proximity between A and B is measured by t=(d,e) canonical angles 0≤slant θ1≤slant ·s≤slant θt≤slant π/2; we set j(A,B)=θj. If B is a rational subspace, his complexity is measured by its height H(B)=covol(Bn). We denote by μn(A e)j the exponent of approximation defined as the upper bound (possibly equal to +∞) of the set of β>0 such that the inequality j(A,B)≤slant H(B)-β holds for infinitely many rational subspaces B of dimension e. We are interested in the minimal value μn(d e)j taken by μn(A e)j when A ranges through the set of subspaces of dimension d of Rn such that for all rational subspaces B of dimension e one has (A B)<j. We show that μ4(2 2)1=3, μ5(3 2)1 6 and μ2d(d )1≤slant 2d2/(2d-). We also prove a lower bound in the general case, which implies that μn(d d)d[n+∞] 1/d.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.