Overview

  • How do permutations describe a branched cover?
  • What does the Riemann–Hurwitz formula tell us?
  • Which hypotheses make the rigidity method work over the rationals?
  • How does a cover lead to a polynomial with a prescribed group?

Covers and Galois groups

A finite separable extension of K(T)K(T) is the function field of a curve with a finite map to the projective line. The Galois closure gives a Galois cover. Over C\mathbb C, moving the parameter around a branch value permutes the points in a fiber; these permutations form the monodromy group.

Over C\mathbb C, a polynomial ff of degree n≥2n\ge2 defines the cover f:Px1→PT1f:\mathbb P^1_x\to\mathbb P^1_T. Its finite branch values are the critical values f(c)f(c), where f′(c)=0f'(c)=0. Infinity is a branch value with ramification index nn, so its branch cycle is an nn-cycle.

References 1

Branch cycles

Choose loops around distinct branch values t1,…,trt_1,\ldots,t_r on the complex projective line. Their branch cycles σ1,…,σr∈Sn\sigma_1,\ldots,\sigma_r\in S_n satisfy

σ1⋯σr=1,⟨σ1,…,σr⟩ is transitive.\sigma_1\cdots\sigma_r=1,\qquad\langle\sigma_1,\ldots,\sigma_r\rangle\text{ is transitive}.

Conversely, the Riemann existence theorem constructs a connected degree-nn cover from such a tuple. Its geometric Galois group is the subgroup generated by the cycles. The cover is constructed over C\mathbb C; a model over Q\mathbb Q requires an arithmetic descent argument.

References 1

The genus formula

For σ∈Sn\sigma\in S_n, put ind⁡(σ)=n−#{cycles of σ}\operatorname{ind}(\sigma)=n-\#\{\text{cycles of }\sigma\}, counting fixed points as cycles. The Riemann–Hurwitz formula becomes

2g(X)−2=−2n+∑i=1rind⁡(σi).2g(X)-2=-2n+\sum_{i=1}^r\operatorname{ind}(\sigma_i).

This is a necessary condition on branch-cycle data. For example, a polynomial of degree nn with n−1n-1 distinct simple critical values has n−1n-1 finite transpositions and an nn-cycle at infinity. The total index is (n−1)+(n−1)=2n−2(n-1)+(n-1)=2n-2, giving g(X)=0g(X)=0, as it must for X=P1X=\mathbb P^1.

References 1

Rational rigidity

Let GG be a finite group with trivial center, and let C1,…,CrC_1,\ldots,C_r be conjugacy classes. Consider the generating tuples

{(g1,…,gr):gi∈Ci, g1⋯gr=1, ⟨g1,…,gr⟩=G}.\{(g_1,\ldots,g_r):g_i\in C_i,\ g_1\cdots g_r=1,\ \langle g_1,\ldots,g_r\rangle=G\}.

The classes are rigid if this set is nonempty and consists of one orbit under simultaneous conjugation by GG. A class is rational if it contains gag^a whenever it contains gg and gcd⁡(a,∣g∣)=1\gcd(a,|g|)=1.

Theorem

If the classes are rigid and rational, then for any distinct rational points t1,…,trt_1,\ldots,t_r there is a regular GG-cover of PQ1\mathbb P^1_{\mathbb Q}, unramified outside those points, with inertia generators in the specified classes.

Rigidity supplies uniqueness of the geometric cover; rationality makes its branch data compatible with the action of the absolute Galois group. The trivial-center hypothesis is part of this form of the theorem.

References 1

Example

In S3S_3, take C1=C2C_1=C_2 to be the transposition class and C3C_3 the class of 3-cycles. If the transpositions a,ba,b are distinct, then abab is a 3-cycle, and

(a,b,(ab)−1)(a,b,(ab)^{-1})

is a generating tuple with product one. There are six ordered pairs of distinct transpositions. Simultaneous conjugation acts transitively on these pairs, with trivial stabilizer. Both conjugacy classes are rational, so the rigidity criterion applies.

The polynomial cover x3−3x=Tx^3-3x=T gives the same branch-cycle types: transpositions at T=−2,2T=-2,2 and a 3-cycle at infinity. Its Galois closure is a regular S3S_3-extension of Q(T)\mathbb Q(T). Specializing at T=3T=3 gives x3−3x−3x^3-3x-3, irreducible by Eisenstein at 33, with nonsquare discriminant −135-135, hence group S3S_3.

References 2

Using the method

For a proposed group, first find conjugacy classes that generate it and admit product-one tuples. Compute their genus constraints, then check rigidity and rationality. The number of tuples can often be obtained from the character table; proving that they generate the full group may require knowledge of maximal subgroups.

Rigidity is a sufficient construction method. Covers with several conjugacy orbits are studied through Hurwitz spaces, which parametrize covers with fixed branching data. Constructing rational points on those spaces is a separate arithmetic problem. A complex cover alone does not solve the regular inverse Galois problem over Q\mathbb Q.

References 2

Related topics

References

  1. Topics in Galois Theory

    Serre, Jean-Pierre. Edition 2. A K Peters/CRC Press, Research Notes in Mathematics 1, 2007.

    Read the source
  2. Galois groups of cubics and quartics (not in characteristic 2)

    Conrad, Keith. Author-hosted expository note.

    Read the source
  3. Inverse Galois Theory

    Malle, Gunter and Matzat, B. Heinrich. Edition 2. Springer Monographs in Mathematics, 2018.

    Read the source