Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Principal units of Zp\mathbb Z_pZp​ are topologically isomorphic to Zp\mathbb Z_pZp​ (ppp odd)

Proved
PadicInt.nonempty_continuousMulEquiv_principalUnits

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

galois-theoryiwasawa-theorynumber-theory

Let ppp be an odd prime and let

U1={u∈Zp×:u≡1(modp)}=ker⁡(Zp×→(Z/pZ)×)U_1=\{u\in\mathbb Z_p^\times : u\equiv 1 \pmod p\}=\ker\bigl(\mathbb Z_p^\times\to(\mathbb Z/p\mathbb Z)^\times\bigr)U1​={u∈Zp×​:u≡1(modp)}=ker(Zp×​→(Z/pZ)×)

be the group of principal units of the ppp-adic integers, with the topology induced from Zp×\mathbb Z_p^\timesZp×​. Then U1U_1U1​ is isomorphic, as a topological group, to the additive group Zp\mathbb Z_pZp​:

U1  ≅  Zp.U_1\;\cong\;\mathbb Z_p .U1​≅Zp​.

(An explicit isomorphism is a↦(1+p)aa\mapsto(1+p)^aa↦(1+p)a.)

Together with the Teichmüller splitting Zp×≅μp−1×U1\mathbb Z_p^\times\cong\mu_{p-1}\times U_1Zp×​≅μp−1​×U1​ this is the structure theorem for the unit group of Zp\mathbb Z_pZp​; it is the input needed to extract a Zp\mathbb Z_pZp​-quotient from the cyclotomic character, e.g. for the construction of the cyclotomic Zp\mathbb Z_pZp​-extension of Q\mathbb QQ.

Formalization Note U1U_1U1​ is written as the kernel of Units.map PadicInt.toZMod, and Zp\mathbb Z_pZp​ as Multiplicative ℤ_[p] so that the isomorphism is a ContinuousMulEquiv.

Preamble
import Mathlib.NumberTheory.Padics.RingHoms
import Mathlib.Topology.Algebra.ContinuousMonoidHom
Formal statement
theorem PadicInt.nonempty_continuousMulEquiv_principalUnits (p : ℕ) [Fact p.Prime] (hp : p ≠ 2) :
    Nonempty ((Units.map (PadicInt.toZMod (p := p)).toMonoidHom).ker ≃ₜ* Multiplicative ℤ_[p]) := by sorry
Source
J.-P. Serre, A Course in Arithmetic, GTM 7, Chapter II, §3.1, Proposition 8 (for p ≠ 2, U_1 ≅ Z_p via α ↦ (1+p)^α) and Theorem 2; see also Washington, Introduction to Cyclotomic Fields, 2nd ed., §5.1.

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