Badly approximable systems of linear forms over a field of formal series (Q873840): Difference between revisions

Let \(\mathcal{L}\) be the field of formal power series with coefficients taken from the finite field \(\mathbb{F}\) of \(p^r\) elements for some fixed prime \(p\). The author's main result is a proof of the analogue of Schmidt's generalisation of Jarnik's theorem on systems of badly approximable numbers. That is the Author proves that the Hausdorff dimension of the set \(B(m,n)\) of all matrices \(A\in\mathcal{L}^{mn}\) for which there is a strictly positive \(K\), dependent on \(A\), such that \[ |\langle qA \rangle|^n > K/\| q \|_\infty^m \] holds for all non-zero \(q\in\mathbb{F}[X]^m\) is full, {\textit{i.e.}} \(\dim_H(B(m,n)=mn\). The main technical concept used in the matter is the notion of a two player, White and Black, \((\alpha,\beta)\)-games as introduced by Schmidt to prove the analogous one dimensional result for real numbers and then subsequently higher dimensional results. The idea behind the proof is that for sufficiently small \(\alpha\) the point at which the game terminates is an element of \(B(m,n)\). The proof relies on transference principle allowing the author to use the approximation properties of suitably chosen matrices to consider related properties of the transpose, followed by a reduction of the statement of the game to one which terminates after a finite number of steps. The paper begins with an introduction to the problem including setting up the appropriate notation. There then follows a section containing the definition of \((\alpha,\beta)\)-games including the crucial idea of a \textit{winning} set. Section 2 also includes a proof of a variant of Dirichlet's Theorem (to be used later) that utilises ideas of Mahler's. Section 3 contains the main substance of the paper where the author proves the relevant technical results. the paper then concludes with a short section where the author completes the proof of main theorem by applying the final theorem proved in the preceding section of the paper.