Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-07
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 P∣p, reduction gives the exact sequence 1⟶I(P/p)⟶D(P/p)⟶Gal⁡(κ(P)/κ(p))⟶1. In particular D(P/p)/I(P/p) is canonically the residue Galois group.

Facts & Assumptions

Given: The data and hypotheses of the statement.

[F1]

Lifting residue frobenius by galois conjugates: Let L/K be finite Galois and P∣p nonzero primes. Put q=∣κ(p)∣. Some σ∈D(P/p) induces the arithmetic power map x↦xq on κ(P).

[F2]

A finite extension of a finite field of order q is Galois with cyclic Galois group generated by x↦xq: Let Fq be a finite field of order q and let E be a finite field having Fq as a subfield, with [E:Fq]=n (def-extension-degree-and-finite-extension). Then E/Fq is a finite Galois extension (def-finite-galois-extension-and-galois-group) and Gal⁡(E/Fq)=⟨σq⟩ is cyclic of order n, generated by the relative Frobenius σq ⁣:x↦xq (def-relative-frobenius-of-a-finite-field-extension).

[F3]

Inertia group of a prime: For finite Galois L/K and a chosen nonzero prime P∣p, set κ(P)=OL/P and κ(p)=OK/p. Each σ∈D(P/p) induces a κ(p)-automorphism σˉ of κ(P): the rule aˉ↦σa‾ is independent of the representative because σP=P. The inertia group is I(P/p)=ker⁡ ⁣(D(P/p)⟶Gal⁡(κ(P)/κ(p))). Equivalently, σ∈I(P/p) exactly when σ∈D(P/p) and σ(a)−a∈P for every a∈OL. It is a normal subgroup of D.

Proof

1.1F3

Reduction is a homomorphism with kernel I, and inclusion of I is injective. This proves exactness at I and D.

2.1F1F2step 1.1∎

The finite residue Galois group is cyclic generated by x↦x∣κ(p)∣. 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

Dependency tree · two levels

14 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