Decomposition, inertia, and Frobenius elements
Relate Galois stabilizers to residue-field automorphisms and fix arithmetic versus geometric Frobenius conventions.
On this page
The question for today
What you’ll understand
- Identify decomposition and inertia groups at a chosen prime.
- Define arithmetic Frobenius through its residue action.
- Distinguish an unramified conjugacy class from a ramified quotient element or its inverse convention.
A Galois group acts not only on field elements but also on the primes above a base prime. Fixing one prime selects a decomposition subgroup, and reducing its action to the residue field reveals inertia and Frobenius. This construction depends on a chosen prime until conjugacy is taken. It also depends on a convention: arithmetic Frobenius raises residue elements to the base residue-field cardinality, while geometric Frobenius is its inverse. Keeping those choices explicit turns a collection of splitting data into a precise group-theoretic object.
Stabilize a prime, then reduce the action
Let L/K be a finite Galois extension of number fields with group G, let be a nonzero prime of , and choose above it. The decomposition group consists of automorphisms stabilizing that prime ideal. Such automorphisms act on the residue extension . The inertia group is the kernel of this residue action, not the subgroup fixing every element of L. The residue fields are finite, so their Galois group is cyclic.
The reduction map is surjective in this finite Galois setting. Its kernel has order e, the ramification index, and the residue group has order f, so the decomposition group has order ef. The full Galois group acts transitively on primes above the base prime; their number g satisfies |G|=efg. These uniform equalities use the Galois hypothesis. In a general non-Galois number-field extension one keeps separate e and f values and uses their sum-of-products identity instead.
Unramified primes give a unique arithmetic lift
Let q be the cardinality of . Arithmetic residue Frobenius is the automorphism . If the prime is unramified, inertia is trivial, so this automorphism has a unique lift to the decomposition group, the arithmetic Frobenius element at the chosen prime. It satisfies for integer elements a. Its order is the residue degree f. The convention is part of the definition rather than a universally unspoken choice.
Changing the chosen prime above the same base prime conjugates the element by the corresponding Galois automorphism. Thus a base unramified prime determines a conjugacy class in a nonabelian Galois group, not a distinguished individual element. In an abelian group conjugacy is trivial, so the dependence disappears. Geometric Frobenius is the inverse of the arithmetic element. Reversing convention reverses powers in examples and must be reflected consistently in any representation or reciprocity formula that uses it.
Ramification leaves a quotient, not a preferred lift
At a ramified prime, residue Frobenius remains a well-defined element of the quotient decomposition group modulo inertia. Its preimages in the decomposition group differ by inertia elements, so there is generally no distinguished lift without additional structure or a separate choice. Calling one arbitrary lift the unique Frobenius would erase precisely the ramification information represented by the kernel. A trivial residue extension can therefore coexist with a nontrivial inertia group and a nontrivial local field extension.
Cyclotomic extensions give explicit unramified examples: at rational primes not dividing the conductor, arithmetic Frobenius sends a root of unity to its p-th power over Q. Its order is a multiplicative order in the appropriate unit group, not the additive period of a residue class. The associated residue degree and number of primes follow from the Galois size identity. Such concrete calculations make good tests for sign and inverse conventions, but they do not justify assigning a canonical global element to every ramified prime.
Work it through
Three Gaussian primes, three group behaviors
For L=Q(i) over Q, describe decomposition, inertia, and arithmetic Frobenius above five, three, and two using the order-two Galois group {1,c}, where c is conjugation.
Five splits into two primes with e=f=1. A chosen prime has decomposition group of order one, so both decomposition and inertia are trivial and arithmetic Frobenius is the identity.
Three is inert and unramified with e=1,f=2,g=1. Its decomposition group is the full order-two group and inertia is trivial. In F9 the residue Frobenius sends i to i³=−i, so its unique lift is c.
Two has e=2,f=1,g=1. Its decomposition and inertia groups are both the full group, and the residue Galois group is trivial. The residue Frobenius is therefore the identity in D/I, but there is no unique lift in D supplied by this condition.
The same global group can yield trivial decomposition, nontrivial unramified Frobenius, or pure inertia. Unramifiedness is what makes the residue Frobenius lift unique.
The living notebook
Explore the model
Interactive lab · modular
Distinguish inverse Frobenius exponents
For the fifth-root cyclotomic example, Pause and Reset, then set both controls to modulus m=5 and additive step a=2. After one Step the residue is 2, the arithmetic exponent at p=2. Reset and set m=5 and a=3; after one Step the residue is its multiplicative inverse 3, the geometric exponent. The instrument uses addition: later residues are n times a, not powers of a. Its additive orbit period five is not the Frobenius order four.
- Residue r0
- 0
- Orbit period · m/gcd(m,a)
- 12
- Distinct residues visited
- 1 of 12
Addition modulo m starts at zero: rₙ = na mod m. Playback advances two additions per second. The orbit has period m/gcd(m,a), including period one for a = 0. This is not a cryptographic security test or a primality algorithm. Parameter changes pause playback and recompute the model at the current elapsed time. Reset restores both parameters and returns time to zero. Playback starts paused. Adjust either parameter, then choose Play or Step.
Look forArithmetic and geometric conventions use inverse automorphisms; additive and multiplicative residue dynamics must not be confused.
Pause & reason
Check your understanding
Your turn
Try it yourself
Let L=Q(zeta5), with G identified with (Z/5Z)× by a sending zeta5 to zeta5^a. At p=2, find arithmetic and geometric Frobenius, residue degree f, ramification index e, and number g of primes above two.
Take a moment to make a prediction or work it out on paper. Open a hint when you need one.
Give me a hint
Two is away from the conductor five. Compute the multiplicative order of two modulo five, and use efg=4.
Compare with the solution
Arithmetic Frobenius is exponent two: zeta5 maps to zeta5². Its inverse exponent is three because 2×3=1 modulo five, giving geometric Frobenius. The powers 2,4,3,1 show multiplicative order four, hence f=4. The prime is unramified, so e=1, and efg=4 yields g=1. Thus two is inert in this degree-four cyclotomic field; its additive order as a residue modulo five would be a different calculation.
Keep the idea
Take it with you
- Decomposition stabilizes a prime and inertia measures the invisible residue action.
- Unramified arithmetic Frobenius is a unique local lift and a global conjugacy class.
- Geometric Frobenius is the inverse, while ramified primes only give a quotient element without a preferred lift.
Read further
Original sources and deeper explanations to follow at your own pace.
Optional progress, saved in this browser when available. Revisit any lesson at any time.
Lesson not marked complete.