Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

The Zp\mathbb{Z}_pZp​-rank of Eˉ\bar EEˉ does not depend on the bound once it exceeds the unit rank

Proved
Leopoldt.zpRankBelow_unitClosure_eq_of_units_rank_le

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

leopoldtnumber-theory

Let KKK be a number field, ppp a prime, U=∏℘∣pO℘×U = \prod_{\wp \mid p} \mathcal{O}_\wp^\timesU=∏℘∣p​O℘×​ the semilocal units and Eˉ⊆U\bar E \subseteq UEˉ⊆U the ppp-adic closure of the global units. For a bound bbb, let rk⁡b(Eˉ)\operatorname{rk}_b(\bar E)rkb​(Eˉ) be the largest n≤bn \le bn≤b such that Zp n\mathbb{Z}_p^{\,n}Zpn​ embeds continuously and injectively into UUU with image in Eˉ\bar EEˉ (zpRankBelow p b (unitClosure p K)).

If b≥r=rk⁡ZOK×b \ge r = \operatorname{rk}_{\mathbb{Z}} \mathcal{O}_K^\timesb≥r=rkZ​OK×​ (Dirichlet's unit rank r1+r2−1r_1 + r_2 - 1r1​+r2​−1), then

rk⁡b(Eˉ)=rk⁡[K:Q](Eˉ).\operatorname{rk}_b(\bar E) = \operatorname{rk}_{[K:\mathbb{Q}]}(\bar E).rkb​(Eˉ)=rk[K:Q]​(Eˉ).

So the bound [K:Q][K:\mathbb{Q}][K:Q] used in the definition of the Leopoldt defect can be replaced by any bound at least the unit rank, and the Zp\mathbb{Z}_pZp​-rank of Eˉ\bar EEˉ is intrinsic.

Preamble
import Definitions.Def_LeopoldtDefect

open NumberField
Formal statement
namespace Leopoldt
theorem zpRankBelow_unitClosure_eq_of_units_rank_le (p : ℕ) [Fact p.Prime]
    (K : Type*) [Field K] [NumberField K] {b : ℕ} (hb : Units.rank K ≤ b) :
    zpRankBelow p b (unitClosure p K) =
      zpRankBelow p (Module.finrank ℚ K) (unitClosure p K) := by sorry
end Leopoldt
Source
Mission definition file Def_LeopoldtDefect (definition of zpRankBelow), after P. Mihailescu, On CM Z_p-extensions and the Leopoldt conjecture for CM fields, arXiv:1105.4544, Section 1.1 (Notations and fundamental facts); Dirichlet's unit theorem; uses Leopoldt.zpRankBelow_unitClosure_le_units_rank and Leopoldt.le_finrank_of_continuous_injective_semilocalUnits

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