Blog Archive

Wednesday, March 13, 2024

Finite subgroup of a field is cyclic group.

This essay aims to prove that for any field F, (G,∗)⊆F,|G|<∞ is a cyclic group.

Let |G|=n, then ∀g∈G,ord(g)|n. Let ψ(d) be the cardinality of {g∈G|ord(g)=d}.

A wrong proof is here:

Now we will use some structure of arithmetic function ring, you can click this blog link here to learn the background knowledge.

Then

(1)∑d|nψ(d)=ψ∗1(n)=n=φ∗1(n)=∑d|nφ(d)

Using the cancel law of group

We get that

(2)ψ(d)=φ(d)

Hence ψ(n)=φ(n)≠0.

By definition of ψ(n)​,

(3){g∈G|ord(g)=n}≠∅

Hence G is a cyclic group.

So, why this proof is wrong?

Notice that we only get that ψ∗1(n)=φ∗1(n) for only one n, not all the n∈N.

Another issue is we only define the function for G...

A correct proof is

For fix d|n, ψ(d)=0 or ψ(d)≠0.

For ψ(d)≠0, we claim that ψ(d)=φ(d). ψ(d)≠0⟹∃g, generate a group |⟨g⟩|=d .

Every element in ⟨g⟩ is the root of xd=1, and in a field, xd=1 at most have d roots.

Hence ⟨g⟩ is all the roots. Then ψ(d)=φ(d) by the structure of the finite cyclic group( they are all isomorphic to Z/mZ) .

Hence we do not have any d|n,ψ(d)=0 .

Since

(4)∑n|dψ(d)=∑d|nφ(d)

Hence ψ(n)=φ(n)≠0. That is, G is a cyclic group.

Corollary

†.Fp∗ is a cyclic group, and Fp∗≅Z/(p−1)Z.

†. The number of primitive roots of Fp is φ(p−1).

 

 

No comments:

Post a Comment

Popular Posts