Explicit construction of the p-adic numbers

Jordan Bell
March 17, 2016

1 Zp

Let p be prime, let Np={0,…,p-1}, and let ℤp be the set of maps x:ℤ→Np such that x⁢(k)=0 for all k<0.

1.1 Addition

For x,y∈ℤp, we define x+y∈ℤp by induction. Define

(x+y)⁢(0)≡x⁢(0)+y⁢(0)(modp),(x+y)⁢(0)∈Np.

Assume for k≥0 that there is some Ak∈ℤ such that

∑j=0k(x+y)⁢(j)⁢pj=Ak⁢pk+1+∑j=0k(x⁢(j)+y⁢(j))⁢pj.

Define

(x+y)⁢(k+1)≡-Ak+x⁢(k+1)+y⁢(k+1)(modp),(x+y)⁢(k+1)∈Np,

and then define Ak+1∈ℤ by

(x+y)⁢(k+1)=Ak+1⁢p-Ak+x⁢(k+1)+y⁢(k+1).

Then

∑j=0k+1(x+y)⁢(j)⁢pj =(x+y)⁢(k+1)⁢pk+1+∑j=0k(x+y)⁢(j)⁢pj
=Ak+1⁢pk+2-Ak⁢pk+1+(x⁢(k+1)+y⁢(k+1))⁢pk+1
+Ak⁢pk+1+∑j=0k(x⁢(j)+y⁢(j))⁢pj
=Ak+1⁢pk+2+∑j=0k+1(x⁢(j)+y⁢(j))⁢pj.

Thus, for each k≥0, (x+y)⁢(k)∈Np and

∑j=0k(x+y)⁢(j)⁢pj≡∑j=0k(x⁢(j)+y⁢(j))⁢pj(modpk+1). (1)

It is immediate that x+y=y+x.

Lemma 1.

If x,y∈ℤp and for each k≥0,

∑j=0kx⁢(j)⁢pj≡∑j=0ky⁢(j)⁢pj(modpk+1),

then x=y.

Proof.

Suppose by contradiction that x≠y. Now, x⁢(0)≡y⁢(0)(modp) and x⁢(0),y⁢(0)∈Np so x⁢(0)=y⁢(0). As x≠y, there is a minimal k≥0 such that x⁢(k+1)≠y⁢(k+1). On the one hand,

∑j=0k+1x⁢(j)⁢pj=x⁢(k+1)⁢pk+1+∑j=0ky⁢(j)⁢pj,

and on the other hand,

∑j=0k+1x⁢(j)⁢pj≡∑j=0k+1y⁢(j)⁢pj(modpk+2).

Then there is some B such that

x⁢(k+1)⁢pk+1=C⁢pk+2+y⁢(k+1)⁢pk+1.

so x⁢(k+1)-y⁢(k+1)=B⁢p. But -p+1≤x⁢(k+1)-y⁢(k+1)≤p-1, so B=0 and hence x⁢(k+1)=y⁢(k+1), a contradiction and thus x=y. ∎

Therefore, if t∈ℤp satisfies, for all k≥0,

∑j=0kt⁢(j)⁢pj≡∑j=0k(x⁢(j)+y⁢(j))⁢pj(modpk+1).

then t=x+y. Now let x,y,z∈ℤp. For k≥0,

∑j=0k(x+(y+z))⁢(j)⁢pj ≡∑j=0k(x⁢(j)+(y+z)⁢(j))⁢pj(modpk+1)
=∑j=0k(x⁢(j)+y⁢(j)+z⁢(j))⁢pj(modpk+1)
≡∑j=0k((x+y)⁢(j)+z⁢(j))⁢pj(modpk+1),

which shows that x+(y+z)=(x+y)+z.

Define t∈ℤp by t⁢(k)=0 for all k≥0. It is immediate that for x∈ℤp, x+t=x, t+x=x. If x≠0, let m≥0 be minimal such that x⁢(m)≠0, and define y∈ℤp by

y⁢(k)={00≤k<mp-x⁢(m)k=mp-1-x⁢(k)k>m.

This makes sense because 1≤x⁢(m)≤p-1. Then x⁢(k)+y⁢(k)=0 for 0≤k<m, x⁢(m)+y⁢(m)=p, and x⁢(k)+y⁢(k)=p-1 for k>m. For k>m,

∑j=0k(x⁢(j)+y⁢(j))⁢pj =p⋅pm+∑j=m+1k(p-1)⁢pj
=pm+1+(p-1)⋅pk+1-pm+1p-1
=pk+1,

so

∑j=0k(x⁢(j)+y⁢(j))⁢pj≡∑j=0k0⋅pj(modpk+1),

and it follows that x+y=0, y+x=0, namely y=-x.

We have established that (ℤp,+) is an abelian group whose identity is k↦0, k≥0.

Lemma 2.

For x∈ℤp and m≥1,

(pm⁢x)⁢(k)={00≤k<mx⁢(k-m)k≥m.
Proof.

For x∈ℤp and m≥1 define y⁢(j)=0 for 0≤j<m and y⁢(j)=x⁢(j-m) for j≥m. By (1), for k≥m,

∑j=0k(pm⁢x)⁢(j)⁢pj ≡∑j=0kpm⁢x⁢(j)⁢pj(modpk+1)
≡∑j=0kx⁢(j)⁢pj+m(modpk+1)
≡∑j=mm+kx⁢(j-m)⁢pj(modpk+1)
≡∑j=mkx⁢(j-m)⁢pj(modpk+1)
≡∑j=0ky⁢(j)⁢pj(modpk+1).

∎

The following lemma shows that if x⁢(k)=0 for k<m then it makes sense to talk about p-m⁢x∈ℤp. That is, if x⁢(k)=0 for k<m then there is a unique y∈ℤp such that pm⁢y=x. (For comparison, it is false that for any z∈ℂ there is a unique z1/2∈ℂ, or that for any n∈ℤ there is a unique p-1⁢n∈ℤ.)

Lemma 3.

Let x∈ℤp with x⁢(0)=0. If y∈ℤp and p⁢y=x then y⁢(k)=x⁢(k+1) for k≥0.

Proof.

By Lemma 2, (p⁢y)⁢(0)=0 and (p⁢y)⁢(k)=y⁢(k-1) for k≥1, and as p⁢y=x this means x⁢(0)=0 and x⁢(k)=y⁢(k-1) for k≥1, i.e. x⁢(k+1)=y⁢(k) for k≥0. ∎

1.2 Multiplication

For x,y∈ℤp, we define x⁢y∈ℤp by induction. Define

(x⁢y)⁢(0)≡x⁢(0)⁢y⁢(0)(modp),(x⁢y)⁢(0)∈Np.

Assume for k≥0 that there is some Ak∈ℤ such that

∑j=0k(x⁢y)⁢(j)⁢pj=Ak⁢pk+1+(∑j=0kx⁢(j)⁢pj)⁢(∑j=0ky⁢(j)⁢pj).

There is some B∈ℤ such that

(∑j=0k+1x⁢(j)⁢pj)⁢(∑j=0k+1y⁢(j)⁢pj)=(x⁢(k+1)⁢pk+1+∑j=0kx⁢(j)⁢pj)⁢(y⁢(k+1)⁢pk+1+∑j=0ky⁢(j)⁢pj)=B⁢pk+2+x⁢(k+1)⁢y⁢(0)⁢pk+1+x⁢(0)⁢y⁢(k+1)⁢pk+1+(∑j=0kx⁢(j)⁢pj)⁢(∑j=0ky⁢(j)⁢pj).

Hence

(∑j=0k+1x⁢(j)⁢pj)⁢(∑j=0k+1y⁢(j)⁢pj) =B⁢pk+2+x⁢(k+1)⁢y⁢(0)⁢pk+1+x⁢(0)⁢y⁢(k+1)⁢pk+1
+∑j=0k(x⁢y)⁢(j)⁢pj-Ak⁢pk+1.

Now define

(x⁢y)⁢(k+1)≡x⁢(k+1)⁢y⁢(0)+x⁢(0)⁢y⁢(k+1)-Ak(modp),(x⁢y)⁢(k+1)∈Np,

and let C∈ℤ such that

(x⁢y)⁢(k+1)=C⁢p+x⁢(k+1)⁢y⁢(0)+x⁢(0)⁢y⁢(k+1)-Ak,

whence, taking Ak+1=B-C,

(∑j=0k+1x⁢(j)⁢pj)⁢(∑j=0k+1y⁢(j)⁢pj) =B⁢pk+2+(x⁢y)⁢(k+1)⁢pk+1-C⁢pk+2+Ak⁢pk+1
+∑j=0k(x⁢y)⁢(j)⁢pj-Ak⁢pk+1
=Ak+1⁢pk+2+∑j=0k+1(x⁢y)⁢(j)⁢pj.

Thus, for each k≥0, (x⁢y)⁢(k)∈Np and

∑j=0k(x⁢y)⁢(j)⁢pj≡(∑j=0kx⁢(j)⁢pj)⁢(∑j=0ky⁢(j)⁢pj)(modpk+1). (2)

It is immediate that x⁢y=y⁢z.

For t∈ℤp, if for each k≥0,

∑j=0kt⁢(j)⁢pj≡(∑j=0kx⁢(j)⁢pj)⁢(∑j=0ky⁢(j)⁢pj)(modpk+1).

then t=x⁢y. Now let x,y,z∈ℤp. For k≥0,

∑j=0k(x⁢(y⁢z))⁢(j)⁢pj ≡(∑j=0kx⁢(j)⁢pj)⁢(∑j=0k(y⁢z)⁢(j)⁢pj)(modpk+1)
≡(∑j=0kx⁢(j)⁢pj)⁢(∑j=0ky⁢(j)⁢pj)⁢(∑j=0kz⁢(j)⁢pj)(modpk+1)
≡(∑j=0k(x⁢y)⁢(j)⁢pj)⁢(∑j=0kz⁢(j)⁢pj)(modpk+1)
≡∑j=0k((x⁢y)⁢z)⁢(j)⁢pj(modpk+1),

which shows that x⁢(y⁢z)=(x⁢y)⁢z.

Define u∈ℤp by u⁢(0)=1, u⁢(k)=0 for k≥1. It is apparent that for x∈ℤp, x⁢u=x and u⁢x=x.

1.3 Ring

For x,y,z∈ℤp and for k≥0, using (1) and (2),

∑j=0k(x⁢(y+z))⁢(j)⁢pj ≡(∑j=0kx⁢(j)⁢pj)⁢(∑j=0k(y+z)⁢(j)⁢pj)(modpk+1)
≡(∑j=0kx⁢(j)⁢pj)⁢(∑j=0k(y⁢(j)+z⁢(j))⁢pj)(modpk+1)
≡(∑j=0kx⁢(j)⁢pj)⁢(∑j=0ky⁢(j)⁢pj)
+(∑j=0kx⁢(j)⁢pj)⁢(∑j=0kz⁢(j)⁢pj)(modpk+1)
≡∑j=0k(x⁢y)⁢(j)⁢pj+∑j=0k(x⁢z)⁢(j)⁢pj(modpk+1)
≡∑j=0k(x⁢y+x⁢z)⁢(j)⁢pj(modpk+1),

which shows that x⁢(y+z)=x⁢y+x⁢z. Therefore ℤp is a commutative ring with unity 0↦1, k↦0 for k≥1.

1.4 Integral domain

Let ℤp* be the set of those x∈ℤp for which there is some y∈ℤp such that x⁢y=1, namely the set of invertible elements of ℤp.

Lemma 4.

Let x∈ℤp. x∈ℤp* if and only if x⁢(0)≠0.

Proof.

If x⁢(0)=0 and y∈ℤp then (x⁢y)⁢(0)≡x⁢(0)⁢y⁢(0)≡0(modp) while 1⁢(0)≡1(modp), so x⁢y≠1 and therefore x∉ℤp*.

If x⁢(0)≠0, we define y∈ℤp by induction. As x⁢(0)≠0, it makes sense to define

y⁢(0)⁢x⁢(0)≡1(modp),y⁢(0)∈Np.

We use (2) and the fact that 1⁢(0)=1, 1⁢(k)=0 for k≥1. Suppose for k≥0 that there is some Ak∈ℤ such that

(∑j=0kx⁢(j)⁢pj)⁢(∑j=0ky⁢(j)⁢pj)=Ak⁢pk+1+1.

Because x⁢(0)≠0, it makes sense to define

y⁢(k+1)⁢x⁢(0)+x⁢(k+1)⁢y⁢(0)≡-Ak(modp).

Then

(∑j=0k+1x⁢(j)⁢pj)⁢(∑j=0k+1y⁢(j)⁢pj) ≡x⁢(k+1)⁢y⁢(0)⁢pk+1+y⁢(k+1)⁢x⁢(0)⁢pk+1
(∑j=0kx⁢(j)⁢pj)⁢(∑j=0ky⁢(j)⁢pj)(modpk+2)
≡-Ak⁢pk+1+Ak⁢pk+1+1(modpk+2)
≡1(modpk+2).

This shows that x⁢y=1, thus x∈ℤp* and y=x-1. ∎

Theorem 5.

ℤp is an integral domain.

Proof.

Let x,y∈ℤp be nonzero. Let m≥0 be minimal such that x⁢(m)≠0 and let n≥0 be minimal such that y⁢(n)≠0. Then (p-m⁢x)⁢(0)≠0 and (p-n⁢y)⁢(0)≠0, and using p-m-n⁢(x⁢y)=p-m⁢x⋅p-n⁢y,

(x⁢y)⁢(m+n) ≡(p-m-n⁢(x⁢y))⁢(0)(modp)
≡(p-m⁢x)⁢(0)⋅(p-n⁢y)⁢(0)(modp)
≢0(modp),

thus x⁢y≠0. ∎

1.5 p-adic valuation

For x∈ℤp, let

vp⁢(x)=inf⁡{k≥0:x⁢(k)≠0}.

x⁢(k)=0 for 0≤k<vp⁢(x). vp⁢(x)=∞ if and only if x=0.

Lemma 6.

For x,y∈ℤp,

vp⁢(x⁢y)=vp⁢(x)+vp⁢(y)

and

vp⁢(x+y)≥min⁡(vp⁢(x),vp⁢(y)).

Lemma 4 says that for x∈ℤp, x∈ℤp* if and only if x⁢(0)≠0. In other words,

ℤp*={x∈ℤp:vp⁢(x)=0}={x∈ℤp:|x|p=1}.

For n≥1, define πn:ℤp→ℤ/pn⁢ℤ by

πn⁢(x)=∑k=0n-1x⁢(k)⁢pk+pn⁢ℤ.

It is apparent that πn is onto.

Lemma 7.

πn:ℤp→ℤ/pn⁢ℤ is a ring homomorphism, and

ker⁡πn={x∈ℤp:vp⁢(x)≥n}=pn⁢ℤp.
Proof.

Let x,y∈ℤp. By (1),

∑k=0n-1(x+y)⁢(k)⁢pk+pn⁢ℤ=∑k=0n-1x⁢(k)⁢pk+∑k=0n-1y⁢(k)⁢pk+pn⁢ℤ,

i.e.

πn⁢(x+y)=πn⁢(x)+πn⁢(y).

By (2),

∑k=0n-1(x⁢y)⁢(k)⁢pk+pn⁢ℤ=(∑k=0n-1x⁢(k)⁢pk+pn⁢ℤ)⁢(∑k=0n-1y⁢(k)⁢pk+pn⁢ℤ),

i.e.

πn⁢(x⁢y)=πn⁢(x)⁢πn⁢(y).

For 1∈ℤp, 1⁢(0)=1, 1⁢(k)=0 for k≥1, so

πn⁢(1)=1+pn⁢ℤ,

which is the unity of ℤ/pn⁢ℤ. Therefore πn is a ring homomorphism.

πn⁢(x)=0 means

∑k=0n-1x⁢(k)⁢pk∈pn⁢ℤ.

But 0≤∑k=0n-1x⁢(k)⁢pk<∑k=0n-1(p-1)⁢pk=pn-1, so πn⁢(x)=0 if and only if x⁢(k)=0 for 0≤k≤n-1. ∎

Then for n≥1,

ℤp =⋃j=0pn-1(j+pn⁢ℤp)
=⋃j=0pn-1{x∈ℤp:vp⁢(x-j)≥n}
=⋃j=0pn-1{x∈ℤp:|x-j|p≤p-n}
=⋃j=0pn-1{x∈ℤp:|x-j|p<p-n+1}.

Because ℤ/p⁢ℤ is a field and π1:ℤp→ℤ/p⁢ℤ is an onto ring homomorphism,

ker⁡π1=p⁢ℤp

is a maximal ideal in ℤp.

Theorem 8.

If I is an ideal in ℤp and I≠{0}, then there is some n≥0 such that I=pn⁢ℤp.

Proof.

There is some a∈I with minimal vp⁢(a)≥0, and as I≠{0}, vp⁢(a)≠∞. Then (p-vp⁢(a)⁢a)⁢(0)=a⁢(vp⁢(a))≠0, so by Lemma 4, p-vp⁢(a)⁢a∈ℤp*. Hence there is some u∈ℤp* such that p-vp⁢(a)⁢a=u, i.e. pvp⁢(a)=u-1⁢a. But I is an ideal and a∈I, so pvp⁢(a)∈I, which shows that pvp⁢(a)⁢ℤp⊂I. Let x∈I, x≠0. Then there is some v∈ℤp* such that p-vp⁢(x)⁢x=v, i.e. x=pvp⁢(x)⁢v. Because vp⁢(a) is minimal, vp⁢(x)≥vp⁢(a) and so

x=pvp⁢(x)⁢v=pvp⁢(a)⋅pvp⁢(x)-vp⁢(a)∈pvp⁢(a)⁢ℤp.

Therefore I=pvp⁢(a)⁢ℤp. ∎

2 Qp

Let ℚp be the set of maps x:ℤ→Np such that for some m∈ℤ, x⁢(k)=0 for all k<m. For x∈ℚp define

vp⁢(x)=inf⁡{k∈ℤ:x⁢(k)≠0}.

x⁢(k)=0 for k<vp⁢(x), k∈ℤ. vp⁢(x)=∞ if and only if x=0.

ℤp={x∈ℚp:vp⁢(x)≥0}.

For m∈ℤ and x∈ℚp, define

(Tm⁢x)⁢(k)=x⁢(k+m),k∈ℤ.

For x∈ℚp with x⁢(k)=0 for k<m, if k<0 then k+m<m and so

(Tm⁢x)⁢(k)=x⁢(k+m)=0,

which means that Tm⁢x∈ℤp. For x,y∈ℚp with x⁢(k)=0 and y⁢(k)=0 for k<m, Tm⁢x,Tm⁢y∈ℤp and Tm⁢x+Tm⁢y∈ℤp. Define

x+y=T-m⁢(Tm⁢x+Tm⁢y)∈ℚp.

Check that this makes sense. Likewise, Tm⁢x⋅Tm⁢y∈ℤp, and define

x⁢y=T-m⁢(Tm⁢x⋅Tm⁢y)∈ℚp.

Check that this makes sense. Check that ℚp is a commutative ring with additive identity k↦0 for k∈ℤ. and unity 0↦1, k↦0 for k≠0. Finally,11 1 For a ring R with x∈R, p⁢x=∑k=1px. It does not make sense to talk about p⁢x before we have x+y, and it is nonsense to talk about p-m⁢x for x∈ℚp before have defined addition on ℚp. This is why I defined Tm rather than initially using x↦p-m⁢x; it is incorrect and a sloppy habit to use properties of an object before showing that it exists.

Tm⁢x=p-m⁢x.
Theorem 9.

ℚp is a field, of characteristic 0.

3 Metric

For x∈ℚp define

|x|p=p-vp⁢(x).

|x|p=0 if and only if x=0. For x,y∈ℚp define

dp⁢(x,y)=|x-y|p.

dp is an ultrametric:

dp⁢(x,z)≤max⁡(dp⁢(x,y),dp⁢(y,z)).
Theorem 10.

ℚp is a topological field.

Proof.

For (x,y),(u,v)∈ℚp×ℚp let

ρ⁢((x,y),(u,v))=max⁡(dp⁢(x,u),dp⁢(y,v)).
dp⁢(x+y,u+v)=|(x-u)+(y-v)|p=max⁡(|x-u|p,|y-v|p)=ρ⁢((x,y),(u,v)),

which shows that (x,y)↦x+y is continuous ℚp×ℚp→ℚp. And

dp⁢(-x,-y)=|-x-y|p=|-1|p⁢|x+y|p=|x+y|p=dp⁢(x,y),

which shows that x↦-x is continuous ℚp→ℚp. For ρ⁢((x,y),(u,v))≤δ, |x-u|p≤δ so |u|p≤|x|p+δ and

dp⁢(x⁢y,u⁢v) =|x⁢y-u⁢v|p
=|x⁢y-u⁢y+u⁢y-u⁢v|p
=max⁡(|x⁢y-u⁢y|p,|u⁢y-u⁢v|p)
=max⁡(|y|p⁢|x-u|p,|u|p⁢|y-v|p)
≤max⁡(|y|p⁢δ,(|x|p+δ)⁢δ),

which shows that (x,y)↦x⁢y is continuous ℚp×ℚp→ℚp. Finally, for x,y≠0,

dp⁢(x-1,y-1)=|x-1-y-1|p=|x⁢y|p-1⁢|y-x|p,

which shows that x↦x-1 is continuous ℚp∖{0}→ℚp∖{0}. ∎

For x∈ℚp and r>0, write

B<r⁢(x)={y∈ℚp:|y-x|p<r},B≤r⁢(x)={y∈ℚp:|y-x|p<r}.

Thus, for x∈ℚp and n≥0,

x+pn⁢ℤ=B≤p-n⁢(x).
Lemma 11.

For x∈ℚp,

{x+pn⁢ℤp:n≥0}

is a local base at x.

Proof.

For ϵ>0, let p-n<ϵ, n≥0, namely n>1log⁡p⁢log⁡1ϵ. For this n,

x+pn⁢ℤp=B≤p-n⁢(x)⊂B<ϵ⁢(x).

∎

Theorem 12.

ℤp is a compact subspace of ℚp.

Proof.

Let xn∈ℤp be a sequence. Because xn⁢(0)∈Np, n≥0, there is some a⁢(0)∈Np and an infinite subset I0 of {n≥0} such that xn⁢(0)=a⁢(0) for n∈I0. Suppose by induction that for some N≥0 there are a⁢(0),…,a⁢(N)∈Np and an infinite set IN⊂{n≥0} such that

xn⁢(k)=a⁢(k),0≤k≤N,n∈IN.

But for each x∈IN, xn⁢(N+1) belongs to the finite set Np, and because IN is infinite there is some a⁢(N+1)∈Np and an infinite set IN+1⊂IN such that xn⁢(N+1)=a⁢(N+1) for n∈IN+1. We have thus defined a∈ℤp.

Let α0∈I0, and by induction let αn>αn-1, αn∈In; in particular as α0≥0 we have αn≥n. Then for any n≥0, xαn⁢(k)=a⁢(k) for 0≤k≤n. Take ϵ>0 and let p-m-1<ϵ. For n≥m,

|xαn-a|p≤p-n-1≤p-m-1<ϵ,

which shows that the sequence xαn tends to a. This means that ℤp is sequentially compact and therefore compact. ∎

For x,y∈ℚp,

dp⁢(p⁢x,p⁢y)=|p⁢x-p⁢y|p=|p|p⁢|x-y|p=p-1⁢|x-y|p,

which shows that x↦p⁢x is continuous ℚp→ℚp. Therefore, the fact that ℤp is compact implies that for n≥0, pn⁢ℤp is compact. Then by Lemma 11 we get the following.

Theorem 13.

ℚp is locally compact.

Theorem 14.

ℚp is a complete metric space.

A topological space X is zero-dimensional if there is a base for its topology each element of which is clopen. In a Hausdorff space, a compact set is closed, and because the sets pn⁢ℤp are compact, n≥0, from Lemma 11 we get the following.

Lemma 15.

ℚp is zero-dimensional.

It is a fact that if a Hausdorff space is zero-dimensional then it is totally disconnected, so by the above, ℚp is totally disconnected.

4 p-adic fractional part

For x∈ℚp, let

[x]p=∑k≥0x⁢(k)⁢pk∈ℤp

and

{x}p=∑k<0x⁢(k)⁢pk∈ℤ⁢[1/p]⊂ℚ.

We call {x}p the p-adic fractional part of x. Then

x=[x]p+{x}p∈ℚp.

Furthermore, as x⁢(k)→0 as k→-∞,

0≤{x}p<∑k<0(p-1)⁢pk=(p-1)⁢∑k=1∞p-k=1,

therefore for x∈ℚp,

{x}p∈[0,1)∩ℤ⁢[1/p].

Define the Prüfer p-group

ℤ⁢(p∞)={e2⁢π⁢i⁢m⁢p-n:m,n≥0}.

We assign the Prüfer p-group the discrete topology.

Define ψp:ℚp→S1 by

ψp⁢(x)=e2⁢π⁢i⁢{x}p.

We prove that this is a homomorphism from the locally compact group ℚp whose image is the Prüfer p-group and whose kernel is ℤp.22 2 Alain M. Robert, A Course in p-adic Analysis, p. 42, Proposition 5.4.

Theorem 16.

ψp:ℚp→S1 is a homomorphism of locally compact groups. ψp⁢(ℚp)=ℤ⁢(p∞), and ker⁡ψp=ℤp.

Proof.

For x,y∈ℚp,

{x+y}p-{x}p-{y}p =x+y-[x+y]p-x+[x]p-y+[y]p
=[x]p+[y]p-[x+y]p∈ℤp.

Check that ℤ⁢[1/p]∩ℤp=ℤ. It then follows that

{x+y}p-{x}p-{y}p∈ℤ,

therefore e2⁢π⁢i⁢({x+y}p-{x}p-{y}p)=1, i.e.

ψp⁢(x+y)=e2⁢π⁢i⁢{x+y}p=e2⁢π⁢i⁢{x}p⁢e2⁢π⁢i⁢{y}p=ψp⁢(x)⁢ψp⁢(y),x,y∈ℚp,

namely ψp is a homomorphism.

ψp⁢(x)=1 if and only if e2⁢π⁢i⁢{x}p=1 if and only if {x}p∈ℤ. But {x}p∈[0,1), so ψp⁢(x)=1 if and only if {x}p=0, hence ψp⁢(x)=1 if and only if x∈ℤp, namely

ker⁡ψp=ℤp.

Let x∈ℚp. As {x}p∈ℤ⁢[1/p], there is some n≥0 such that pn⁢{x}p∈ℤ, so ψp⁢(x)pn=1, which means that ψp⁢(x)∈ℤ⁢[p∞]. Let e2⁢π⁢i⁢m⁢p-n∈ℤ⁢[p∞], n,m≥0. But p-n∈ℚp and, whether or not n>0,

ψp⁢(p-n)=e2⁢π⁢i⁢{p-n}p=e2⁢π⁢i⁢p-n,

and m⁢p-n∈ℚp, and using that ψp is a homomorphism,

ψp⁢(m⁢p-n)=ψp⁢(p-n)m=e2⁢π⁢i⁢m⁢p-n.

This shows that ψp⁢(ℚp)=ℤ⁢[p∞].

Finally, let x∈ℚp. For y∈B≤1⁢(x)=x+ℤp, so there is some w∈ℤp such that y=x+w. But ψp⁢(x+w)=ψp⁢(x)⁢ψp⁢(w)=ψp⁢(x), so

|ψp⁢(y)-ψp⁢(x)|=|ψp⁢(x)-ψp⁢(x)|=0,

showing that ψp is continuous at x. ∎

Because ℤ⁢[p∞] is discrete, it is immediate that ψp is an open map. The first isomorphism theorem for topological groups states that if G and H are locally compact groups, f:G→H is a homomorphism of topological groups that is onto and open, then G/ker⁡f and H are isomorphic as topological groups. Therefore the quotient group ℚp/ℤp and the Prüfer group ℤ⁢[p∞] are isomorphic as topological groups.