2000 character limit reached
A height gap in $GL_d(\overline{\mathbb{Q}})$ and almost laws
Published 28 Oct 2021 in math.GR and math.NT | (2110.15404v1)
Abstract: E. Breuillard showed that finite subsets $F$ of matrices in $GL_d(\overline{\mathbb{Q}})$ generating non-virtually solvable groups have normalized height $\widehat{h}(F) \ge \epsilon_d$, for some positive $\epsilon_d >0$. The normalized height $\widehat{h}(F)$ is a measure of the arithmetic size of $F$ and this result can be thought of as a non-abelian analog of Lehmer's Mahler measure problem. We give a new shorter proof of this result. Our key idea relies on the existence of particular word maps in compact Lie groups (known as almost laws) whose image lies close to the identity element.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.