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.
Decomposition inertia exact sequence
Statement
For finite Galois L/K and fixed nonzero , reduction gives the exact sequence In particular is canonically the residue Galois group.
Facts & Assumptions
Given: The data and hypotheses of the statement.
Lifting residue frobenius by galois conjugates: Let L/K be finite Galois and nonzero primes. Put . Some induces the arithmetic power map on .
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).
Inertia group of a prime: For finite Galois L/K and a chosen nonzero prime , set and . Each induces a -automorphism of : the rule is independent of the representative because . The inertia group is Equivalently, exactly when and for every . It is a normal subgroup of D.
Proof
Reduction is a homomorphism with kernel I, and inclusion of I is injective. This proves exactness at I and D.
The finite residue Galois group is cyclic generated by . That generator lifts to D, so the reduction map is onto. Its fibers are precisely cosets of I: two elements have the same image exactly when their quotient is in the kernel. This proves the quotient identification and exactness at the right.
Depends on
Used by
- Orders of decomposition and inertia groups Corollary
- Arithmetic frobenius coset Definition
- Decomposition and inertia fixed fields Theorem
Dependency tree · two levels
15 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, Theorem 9.3.5 (not design locator 9.3.2), p.106 (standard reference, not scraped)