Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Functoriality of the bounded ppp-adic subgroup rank

Proved
Leopoldt.zpRankBelow_le_of_continuous_injective

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

number-theoryp-adicunits

Let ppp be prime, and let HHH and H′H'H′ be subgroups of commutative topological groups GGG and G′G'G′. Suppose a continuous injective homomorphism f:G→G′f:G\to G'f:G→G′ carries HHH into H′H'H′. For bounds b≤b′b\le b'b≤b′, the bounded ppp-adic ranks obey

rank⁡p,≤b(H)≤rank⁡p,≤b′(H′).\operatorname{rank}_{p,\le b}(H)\le\operatorname{rank}_{p,\le b'}(H').rankp,≤b​(H)≤rankp,≤b′​(H′).

Here the bounded rank is the largest nnn within the stated bound for which a continuous injection of Zpn\mathbb Z_p^nZpn​ into the ambient group lands in the subgroup. This result packages the functorial principle used when unit closures are transported along field embeddings and other injective maps.

Formalization Note The topology and group structure on the targets are supplied as assumptions; the homomorphism is explicitly required to be continuous and injective.

Preamble
import Definitions.Def_LeopoldtDefect
Formal statement
namespace Leopoldt
theorem zpRankBelow_le_of_continuous_injective (p : ℕ) [Fact p.Prime]
    {G G' : Type*} [CommGroup G] [TopologicalSpace G]
    [CommGroup G'] [TopologicalSpace G'] {b b' : ℕ}
    (f : G →* G') (hf : Function.Injective f) (hc : Continuous f)
    {H : Subgroup G} {H' : Subgroup G'}
    (hmap : ∀ g ∈ H, f g ∈ H') (hb : b ≤ b') :
    zpRankBelow p b H ≤ zpRankBelow p b' H' := by sorry
end Leopoldt
Source
Formal consequence of the rank definition in LeopoldtDefect, based on Preda Mihăilescu, On CM Z_p-extensions and the Leopoldt conjecture for CM fields, arXiv:1105.4544v4, Section 1.1, p. 3 (p-adic closure and rank), and Section 1.3, Remark 1.A, p. 5 (behavior of defects under embeddings in finite extensions).

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