Cubic splitting law: splits completely in iff
ProvedCollapsibleCubics.splits_completely_iff_legendreSymalgebraalgebraic-number-theorynumber-theory
Let with irreducible over , let , and let be the discriminant. Let be an odd prime with , and suppose divides the binary form for some coprime integers .
Then splits completely in — there are exactly three distinct primes of above — if and only if is a quadratic residue mod , i.e. the Legendre symbol equals .
This is the classical Dedekind splitting criterion for a cubic field, in the exact form the Collapsible Cubics mission needs. The hypothesis with is what supplies a root of mod ; the hypothesis makes unramified and (via the index-discriminant relation) guarantees does not divide the index , so Kummer-Dedekind applies. The count is stated with Nat.card so that no finiteness instance is needed in the statement.
Preamble
import Mathlib import Definitions.Def_CollapsibleCubics_q7
Formal statement
namespace CollapsibleCubics
open Polynomial NumberField Ideal RingOfIntegers UniqueFactorizationMonoid
theorem splits_completely_iff_legendreSym
(D E a b : ℤ) [Fact (Irreducible (cubicPoly (D : ℚ) (E : ℚ)))]
{p : ℕ} [Fact p.Prime] (hodd : Odd p) (hab : IsCoprime a b)
(hd : ¬ (p : ℤ) ∣ (-4 * D ^ 3 - 27 * E ^ 2))
(hF : (p : ℤ) ∣ a ^ 3 + D * a * b ^ 2 + E * b ^ 3) :
Nat.card (primesOver (span {(p : ℤ)}) (𝓞 (CubicField (D : ℚ) (E : ℚ)))) = 3 ↔
legendreSym p (-4 * D ^ 3 - 27 * E ^ 2) = 1 := by sorry
end CollapsibleCubicsSource
Collapsible Cubics mission (Q7); statement chain isolated in Collapsible/Collapsible/SplitsCompletelyFinal.lean. Background: https://quesswho.github.io/miles-blog/2026/08/20/collapsible/