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.

Conjugacy of decomposition and inertia groups

Statement

In finite Galois L/K, if σP=P′ above a nonzero p, then D(P′/p)=σD(P/p)σ−1,I(P′/p)=σI(P/p)σ−1. The residue actions correspond under κ(P)→κ(P′), aˉ↦σa‾.

Facts & Assumptions

Given: The data and hypotheses of the statement.

[F1]

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.1F1

For τ∈G, the equality τP=P is equivalent to (στσ−1)P′=P′. This proves both subgroup inclusions for D.

2.1F1step 1.1∎

The displayed residue map is well-defined and invertible, with inverse induced by σ−1. For τ∈D(P/p) and a∈OL, transporting τa‾ gives στa‾, exactly the action of στσ−1 on σa‾. Therefore the residue action is identity on one side exactly when it is identity on the other. Taking kernels proves the equality for I.

Depends on

Used by

Dependency tree · two levels

3 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