Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

A compositum of two extensions unramified at a prime is unramified there

Proved
NumberField.not_dvd_discr_sup_of_not_dvd_discr

by davidloeffler · Sep 20, 2026 · Mathlib 0df444a (Lean v4.33.1)

discriminantsnumber-fieldsnumber-theoryramification

Let K1K_1K1​ and K2K_2K2​ be number fields inside a common algebraic closure of Q\mathbf QQ. If a rational prime ℓ\ellℓ divides neither disc⁡(K1)\operatorname{disc}(K_1)disc(K1​) nor disc⁡(K2)\operatorname{disc}(K_2)disc(K2​), then it does not divide the discriminant of their compositum K1K2K_1K_2K1​K2​.

Preamble
import Definitions.Def_MTT_Arithmetic
import Mathlib.NumberTheory.NumberField.Discriminant.Different
import Mathlib.FieldTheory.IntermediateField.Adjoin.Basic

set_option autoImplicit false
noncomputable section
Formal statement
/-- If a rational prime is unramified in two number fields embedded in a
common algebraic closure, then it is unramified in their compositum. -/
theorem NumberField.not_dvd_discr_sup_of_not_dvd_discr
    (K₁ K₂ : IntermediateField ℚ MTT.Qbar)
    [NumberField K₁] [NumberField K₂]
    {l : ℤ} (hl : Prime l)
    (h₁ : ¬ l ∣ NumberField.discr K₁)
    (h₂ : ¬ l ∣ NumberField.discr K₂) :
    letI : NumberField ↥(K₁ ⊔ K₂) :=
      { to_charZero := inferInstance
        to_finiteDimensional := IntermediateField.finiteDimensional_sup K₁ K₂ }
    ¬ l ∣ NumberField.discr ↥(K₁ ⊔ K₂) := by sorry
Source
Stability of finite etale algebras under tensor product and localization; equivalently, composita of local unramified extensions are unramified.

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, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me