paper

A strong height gap theorem for

arXiv:2507.22266

Abstract

The height gap theorem states that the finite subsets of matrices generating non-virtually solvable groups have normalized height bounded below by a constant. It was first proved by Breuillard and another proof was given later by Chen, Hurtado and Lee. In this paper we show that when the set is contained in a maximal arithmetic subgroup of , , the height bound for the case when generates a Zariski dense subgroup of over is proportional to , the function of the covolume of . This result strengthens the theorem for the lattices of large covolume and has various applications including a strong version of the arithmetic Margulis lemma for .

16 pages

A strong height gap theorem for $PGL_2$ · wovepaper