Comparing Galois representations in the residually reducible case
Nuno Freitas, Ignasi Sánchez-Rodríguez
TL;DR
The paper develops and implements a practical variant of Grenié’s theorem to decide when two $p$-adic Galois representations with residually reducible images have isomorphic semisimplifications, by constructing a smaller extension $K_S$ and testing Frobenius data on a finite set of primes. It leverages Selmer-group techniques and a controlled pro-$p$ extension framework to replace large-scale field computations with a focused, algorithmic approach that is robust in the residually reducible setting. The authors demonstrate the method on a $3$-adic example related to Grenié’s work, recover Grenié’s result in an automated way, and apply it to modularity questions for abelian surfaces, including concrete examples with conductors $3^7$ and $3^{10}$, using either characteristic polynomials or traces at carefully chosen primes. They also introduce a stopping criterion to avoid GRH in many computations, increasing practicality. Overall, the work expands the applicability of the Faltings–Serre framework to residually reducible representations and provides tools for automated verification of modularity statements in low-dimensional cases via $3$-adic data.
Abstract
Let $n \geq 2$ and $p$ be a prime. Let $K$ be a number field and consider two Galois representations $ρ_1, ρ_2 : \operatorname{Gal}(\overline{K} / K) \to \operatorname{GL}_n(\mathbb{Z}_p)$ having residual image a $p$-group. We explain and implement an algorithm that makes effective a result of Loïc Grenié to decide wether the semisimplifications of $ρ_1$ and $ρ_2$ are isomorphic. As an application, we show that an irreducible representation $ρ: G_{\mathbb{Q}(\sqrt{-3})} \to \operatorname{GL}_2(\mathbb{Z}_3)$ unramified outside 3 is determined by the characteristic polynomials of Frobenius elements at five primes of small norm. As an additional check, we apply it to a 2-adic example studied by Grenié, recovering Grenié's result in a fully automated way.
