On the Quantitative Subspace Theorem

TL;DR

This survey reviews recent advances in the Quantitative Subspace Theorem, highlighting new bounds, proof techniques, and ongoing challenges in estimating solutions outside specific subspaces.

Contribution

It introduces a new upper bound for the number of large solutions, sketches a proof for it, and presents a new gap principle for small solutions, advancing the understanding of the theorem.

Findings

New upper bound for solutions containing large solutions

A gap principle for handling small solutions

Refinement of the Subspace Theorem by Faltings and Wuestholz

Abstract

In this survey we give an overview of recent developments on the Quantitative Subspace Theorem. In particular, we discuss a new upper bound for the number of subspaces containing the "large" solutions, obtained jointly with Roberto Ferretti, and sketch the proof of the latter. Further, we prove a new gap principle to handle the "small" solutions in the system of inequalities considered in the Subspace Theorem. Finally, we go into the refinement of the Subspace Theorem by Faltings and Wuestholz, which states that the system of inequalities considered has only finitely many solutions outside some effectively determinable proper linear subspace of the ambient solution space. Estimating the number of these solutions is still an open problem. We give some motivation that this problem is very hard.