How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Orders of decomposition and inertia groups
Statement
For finite Galois L/K and nonzero , writing e and f for its ramification index and residue degree, The prime P is unramified over p if and only if its inertia group is trivial.
Facts & Assumptions
Given: The data and hypotheses of the statement.
Decomposition inertia exact sequence: For finite Galois L/K and fixed nonzero , reduction gives the exact sequence In particular is canonically the residue Galois group.
Decomposition group and completion: Let L/K be finite Galois and nonzero primes. Then is finite Galois of degree . Continuous extension gives a canonical isomorphism whose inverse restricts an automorphism to the embedded copy of L.
A finite extension of a finite field of order is Galois with cyclic Galois group generated by : Let be a finite field of order and let be a finite field having as a subfield, with (def-extension-degree-and-finite-extension). Then is a finite Galois extension (def-finite-galois-extension-and-galois-group) and is cyclic of order , generated by the relative Frobenius (def-relative-frobenius-of-a-finite-field-extension).
Proof
The local correspondence gives . The residue extension has cyclic Galois group of order f, so the exact sequence gives and .
Finite residue extensions are separable. Thus here unramified means e=1, which implies and I trivial. Conversely trivial I has order one, so e=1 and the prime is unramified.
Depends on
Used by
Dependency tree · two levels
18 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- §9.3.2, Corollary 9.3.7, p.106 (standard reference, not scraped)