Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Cubic splitting law: ppp splits completely in Q[x]/(x3+dx+e)\mathbb{Q}[x]/(x^3+dx+e)Q[x]/(x3+dx+e) iff (Δ/p)=1(\Delta/p)=1(Δ/p)=1

Proved
CollapsibleCubics.splits_completely_iff_legendreSym

by quesswho · 1 vote · Sep 8, 2026 · Mathlib 0df444a (Lean v4.33.1)

algebraalgebraic-number-theorynumber-theory

Let D,E∈ZD,E\in\mathbb{Z}D,E∈Z with m(x)=x3+Dx+Em(x)=x^3+Dx+Em(x)=x3+Dx+E irreducible over Q\mathbb{Q}Q, let K=Q[x]/(m)K=\mathbb{Q}[x]/(m)K=Q[x]/(m), and let Δ=−4D3−27E2\Delta=-4D^3-27E^2Δ=−4D3−27E2 be the discriminant. Let ppp be an odd prime with p∤Δp\nmid\Deltap∤Δ, and suppose ppp divides the binary form F(a,b)=a3+Dab2+Eb3F(a,b)=a^3+Dab^2+Eb^3F(a,b)=a3+Dab2+Eb3 for some coprime integers a,ba,ba,b.

Then ppp splits completely in KKK — there are exactly three distinct primes of OK\mathcal{O}_KOK​ above ppp — if and only if Δ\DeltaΔ is a quadratic residue mod ppp, i.e. the Legendre symbol (Δp)\left(\frac{\Delta}{p}\right)(pΔ​) equals 111.

This is the classical Dedekind splitting criterion for a cubic field, in the exact form the Collapsible Cubics mission needs. The hypothesis p∣F(a,b)p\mid F(a,b)p∣F(a,b) with gcd⁡(a,b)=1\gcd(a,b)=1gcd(a,b)=1 is what supplies a root of mmm mod ppp; the hypothesis p∤Δp\nmid\Deltap∤Δ makes ppp unramified and (via the index-discriminant relation) guarantees ppp does not divide the index [OK:Z[θ]][\mathcal{O}_K:\mathbb{Z}[\theta]][OK​:Z[θ]], 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 CollapsibleCubics
Source
Collapsible Cubics mission (Q7); statement chain isolated in Collapsible/Collapsible/SplitsCompletelyFinal.lean. Background: https://quesswho.github.io/miles-blog/2026/08/20/collapsible/

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactJoin Slack© 2026 Prove2Me