second proof of Wedderburn’s theorem


We can prove Wedderburn’s theorem,without using Zsigmondy’s theorem on the conjugacy class formula of the first proof; let Gn set of n-th roots of unityMathworldPlanetmath and Pn set of n-th primitive roots of unity and Φd⁢(q) the d-th cyclotomic polynomialMathworldPlanetmath.
It results

  • •

    Φn⁢(q)=∏ξ∈Pn(q-ξ)

  • •

    p⁢(q)=qn-1=∏ξ∈Gn(q-ξ)=∏d∣nΦd⁢(q)

  • •

    Φn⁢(q)∈ℤ⁢[q], it has multiplicative identityPlanetmathPlanetmath and Φn(q)∣qn-1

  • •

    Φn(q)∣qn-1qd-1with d∣n,d<n

by conjugacy class formula, we have:

qn-1=q-1+∑xqn-1qnx-1

by last two previous properties, it results:

Φn(q)∣qn-1,Φn(q)∣qn-1qnx-1⇒Φn(q)∣q-1

because Φn⁢(q) divides the left and each addend of ∑xqn-1qnx-1 of the right member of the conjugacy class formula.
By third property

q>1,Φn(x)∈ℤ[x]⇒Φn(q)∈ℤ⇒|Φn(q)|∣q-1⇒|Φn(q)|⩽q-1

If, for n>1,we have |Φn⁢(q)|>q-1, then n=1 and the theorem is proved.
We know that

|Φn⁢(q)|=∏ξ∈Pn|q-ξ|,w⁢i⁢t⁢h⁢q-ξ∈ℂ

by the triangle inequality in ℂ

|q-ξ|⩾||q|-|ξ||=|q-1|

as ξ is a primitive root of unity, besides

|q-ξ|=|q-1|⇔ξ=1

but

n>1⇒ξ≠1

therefore, we have

|q-ξ|>|q-1|=q-1⇒|Φn⁢(q)|>q-1
Title second proof of Wedderburn’s theorem
Canonical name SecondProofOfWedderburnsTheorem
Date of creation 2013-03-22 13:34:39
Last modified on 2013-03-22 13:34:39
Owner Mathprof (13753)
Last modified by Mathprof (13753)
Numerical id 17
Author Mathprof (13753)
Entry type Proof
Classification msc 12E15