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 is the function field of a curve with a finite map to the projective line. The Galois closure gives a Galois cover. Over , moving the parameter around a branch value permutes the points in a fiber; these permutations form the monodromy group.
Over , a polynomial of degree defines the cover . Its finite branch values are the critical values , where . Infinity is a branch value with ramification index , so its branch cycle is an -cycle.
References 1
- Serre2007Topics · §§4.4 and 6.1–6.3Source
Branch cycles
Choose loops around distinct branch values on the complex projective line. Their branch cycles satisfy
Conversely, the Riemann existence theorem constructs a connected degree- cover from such a tuple. Its geometric Galois group is the subgroup generated by the cycles. The cover is constructed over ; a model over requires an arithmetic descent argument.
References 1
- Serre2007Topics · Chapter 6, especially Theorem 6.3.1Source
The genus formula
For , put , counting fixed points as cycles. The Riemann–Hurwitz formula becomes
This is a necessary condition on branch-cycle data. For example, a polynomial of degree with distinct simple critical values has finite transpositions and an -cycle at infinity. The total index is , giving , as it must for .
References 1
- Serre2007Topics · §4.4 and Chapter 6Source
Rational rigidity
Let be a finite group with trivial center, and let be conjugacy classes. Consider the generating tuples
The classes are rigid if this set is nonempty and consists of one orbit under simultaneous conjugation by . A class is rational if it contains whenever it contains and .
Theorem
If the classes are rigid and rational, then for any distinct rational points there is a regular -cover of , 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
- Serre2007Topics · §7.3 and Theorem 8.1.1Source
Example
In , take to be the transposition class and the class of 3-cycles. If the transpositions are distinct, then is a 3-cycle, and
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 gives the same branch-cycle types: transpositions at and a 3-cycle at infinity. Its Galois closure is a regular -extension of . Specializing at gives , irreducible by Eisenstein at , with nonsquare discriminant , hence group .
References 2
- Serre2007Topics · §§4.4, 7.4.1 and Theorem 8.1.1Source
- ConradCubicQuartic · Theorem 2.1; S₃ tuple and discriminant computed hereSource
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 .
References 2
- Serre2007Topics · §7.2 and Chapter 8Source
- MalleMatzat2018 · Rigidity, Hurwitz spaces, and regular realizationsSource
Related topics
Connected diagrams
- Morse geometry and Hilbert specialization require two different inputs · Classical
- A complete proposed classification of reducible f(X) − g(Y) · Claimed
Critical points and polynomial monodromy
Derivatives determine branch cycles of polynomial covers.
AppliesInverse Galois theory and generic polynomials
A regular cover can be specialized to number fields.
UsesTransitivity, primitivity, and cycle criteria
Generating tuples and subgroup tests determine monodromy.
ConnectsExceptional specializations
Quotient covers detect parameters with a smaller group.
Linked from 2 articles
References
- Topics in Galois Theory
Serre, Jean-Pierre. Edition 2. A K Peters/CRC Press, Research Notes in Mathematics 1, 2007.
Read the source - Galois groups of cubics and quartics (not in characteristic 2)
Conrad, Keith. Author-hosted expository note.
Read the source - Inverse Galois Theory
Malle, Gunter and Matzat, B. Heinrich. Edition 2. Springer Monographs in Mathematics, 2018.
Read the source
Comments
Any comments are welcome. Comments appear after the site owner approves them. Privacy policy.