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.
Good polynomial reduction kills inertia
Statement
Let be monic separable with splitting field L. If a rational prime p does not divide , the integral roots of F have distinct reductions at every . The inertia group I(P/p) is trivial, so p is unramified in L.
Facts & Assumptions
Given: The data and hypotheses of the statement.
The discriminant of a monic polynomial as the coefficient expression of : By prop-vandermonde-square-is-symmetric and thm-fundamental-theorem-of-symmetric-polynomials, there is a unique polynomial such that For a monic polynomial over a commutative ring, its discriminant is Equivalently, in any algebra in which splits with roots , this coefficient expression evaluates to . The definition therefore depends only on the coefficients and not on a choice or ordering of roots. For a monic constant polynomial, .
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.
Orders of decomposition and inertia groups: 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.
Proof
List the distinct roots in L. They are integral because F is monic. The discriminant is . Its integer value is not in P, since its contraction is (p). Therefore no difference is in P, giving distinct reductions. The constant and linear cases have an empty product equal to one.
Every inertia element permutes the roots and fixes each of their residue classes. Distinctness of those classes forces it to fix each root itself. Since these roots generate L over the rationals, the element is identity. Thus I=1 and the inertia order formula gives e=1, at every prime above p.
Depends on
Used by
Dependency tree · two levels
11 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
- Chapter 8, Proposition 8.21 and Theorem 8.23 proof, pp.144–145 (standard reference, not scraped)