The inverse problem for arboreal Galois representations of index two

Abstract

This paper introduces a systematic approach towards the inverse problem for arboreal Galois representations of finite index attached to quadratic polynomials. Let F be a field of characteristic ≠ 2, f∈ F[x] be monic and quadratic and f be the arboreal Galois representation associated to f, taking values in the group ∞ of automorphisms of the infinite binary tree. We give a complete description of the maximal closed subgroups of each closed subgroup of index at most two of ∞ in terms of linear relations modulo squares among certain universal functions evaluated in elements of the critical orbit of f. We use such description in order to derive necessary and sufficient criteria for the image of f to be a given subgroup of index two of ∞. These depend exclusively on the arithmetic of the critical orbit of f. Afterwards, we prove that if φ=x2+t∈ Q(t)[x], then there exist exactly five distinct subgroups of index two of ∞ that can appear as images of φt0 for infinitely many t0∈ Q, where φt0 is the specialized polynomial. We show that two of them appear infinitely often, and if Vojta's conjecture over Q holds true, then so do the remaining ones. Finally, we give an explicit description of the derived series of each subgroup of index two. Using this, we introduce a sequence of combinatorial invariants for subgroups of index two of ∞. With a delicate use of these invariants we are able to establish that such subgroups are pairwise non-isomorphic as topological groups, a result of independent interest. This implies, in particular, that the five aforementioned groups are pairwise distinct topological groups, and therefore yield five genuinely different instances of the infinite inverse Galois problem over Q.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…