Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

The Leopoldt defect does not decrease in finite extensions

Proved
Leopoldt.defect_le_defect_of_finite

by xuanji · Sep 27, 2026 · Mathlib 0df444a (Lean v4.33.1)

leopoldtnumber-theory

Let ppp be a prime and let K/FK/FK/F be a finite extension of number fields. Then the Leopoldt defect does not decrease:

DL(F)≤DL(K),\mathcal{D}_L(F) \le \mathcal{D}_L(K),DL​(F)≤DL​(K),

where DL(K)=Z-rk(EK)−Zp-rk(E‾K)\mathcal{D}_L(K) = \mathbb{Z}\text{-rk}(E_K) - \mathbb{Z}_p\text{-rk}(\overline{E}_K)DL​(K)=Z-rk(EK​)−Zp​-rk(EK​) is the difference between the Dirichlet unit rank and the Zp\mathbb{Z}_pZp​-rank of the ppp-adic closure of the global units in the semilocal units at ppp. Equivalently: if Leopoldt's conjecture fails for FFF, it fails for every finite extension KKK of FFF (the numerical form of Remark 1.A of Mihăilescu).

Preamble
import Definitions.Def_LeopoldtDefect

open NumberField
Formal statement
namespace Leopoldt
theorem defect_le_defect_of_finite (p : ℕ) [Fact p.Prime]
    (F K : Type*) [Field F] [NumberField F] [Field K] [NumberField K]
    [Algebra F K] [FiniteDimensional F K] :
    defect p F ≤ defect p K := by sorry
end Leopoldt
Source
P. Mihăilescu, On CM Z_p-extensions and the Leopoldt conjecture for CM fields, arXiv:1105.4544, §1, Remark 1.A (Leopoldt defect does not decrease in finite extensions); M. Laurent, Rang p-adique d'unités et action de groupes, J. reine angew. Math. 399 (1989), 81–108, Introduction.

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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me