Explicit open image theorems for abelian varieties with trivial endomorphism ring
Matthew Bisatt, Davide Lombardo
TL;DR
This work proves an explicit open-image theorem for abelian varieties with trivial endomorphism ring by combining an explicit isogeny bound with a detailed analysis of maximal subgroups of finite symplectic groups via Aschbacher's classification. The main result provides an explicit bound $\ell_0(A/K)$, depending on the stable Faltings height $h(A)$ and a Frobenius-residue $q_v$, such that $G_{\ell^ abla}=\operatorname{GSp}_{2g}(\mathbb{Z}_\ell)$ for all $\ell>\ell_0(A/K)$ when a suitable Frobenius polynomial at a place $v$ has Galois group $\left(\mathbb{Z}/2\mathbb{Z}\right) \wr \operatorname{Sym}_g$. The paper then develops a comprehensive, algorithmic framework to bound non-surjective primes by classifying and excluding all potential maximal subgroups (C1–C4, C6–C7 and S-type, including those of Lie type) and provides an explicit, practical example in genus $3$ where the adelic Galois action is maximal except for a pair of small primes. The results yield both explicit, uniform bounds and a concrete path to effective computations for specific abelian varieties, with broad implications for Mumford–Tate-type phenomena and open image questions in arithmetic geometry. The approach also highlights the interplay between polarisation theory, Frobenius eigenvalues, and representation theory of finite groups of Lie type.
Abstract
Let $K$ be a number field and $A/K$ be an abelian variety of dimension $g$. Assuming that the image $G_{\ell^\infty}$ of the natural Galois representation attached to the Tate module $T_\ell(A)$ is $\operatorname{GSp}_{2g}(\mathbb{Z}_\ell)$ for all sufficiently large primes $\ell$, we provide a semi-effective bound $\ell_0(A/K)$ such that $G_{\ell^\infty}=\operatorname{GSp}_{2g}(\mathbb{Z}_\ell)$ for all primes $\ell > \ell_0(A/K)$. The bound is given in terms of the Faltings height of $A$ and of the cardinality of the residue field at a suitably generic place of $K$. We also describe an algorithmic approach to obtain better bounds for abelian threefolds over $\mathbb{Q}$.
