Wedderburn's little theorem

In mathematics, Wedderburn's little theorem states that every finite domain is a field. In other words, for finite rings, there is no distinction between domains, skew-fields and fields. The Artin–Zorn theorem generalizes the theorem to alternative rings: every finite alternative division ring is a field.

History

The original proof was given by Joseph Wedderburn in 1905, who went on to prove it two other ways. Another proof was given by Leonard Eugene Dickson shortly after Wedderburn's original proof, and Dickson acknowledged Wedderburn's priority. However, as noted in (Parshall 1983), Wedderburn's first proof was incorrect – it had a gap – and his subsequent proofs appeared only after he had read Dickson's correct proof. On this basis, Parshall argues that Dickson should be credited with the first correct proof.

A simplified version of the proof was later given by Ernst Witt. Witt's proof is sketched below. Alternatively, the theorem is a consequence of the Skolem–Noether theorem by the following argument. Let D be a finite division algebra with center k. Let [D : k] = n² and q denote the cardinality of k. Every maximal subfield of D has qⁿ elements; so they are isomorphic and thus are conjugate by Skolem–Noether. But a finite group (the multiplicative group of D in our case) cannot be a union of conjugates of a proper subgroup; hence, n = 1.

A later "group-theoretic" proof was given by Theodore Kaczynski. This proof, Kaczynski's first published piece of mathematical writing, was a short, two-page note which also acknowledged the earlier historical proofs.

Relationship to the Brauer group of a finite field

The theorem is essentially equivalent to saying that the Brauer group of a finite field is trivial. In fact, this characterization immediately yields a proof of the theorem as follows: let k be a finite field. Since the Herbrand quotient vanishes by finiteness, [math]\displaystyle{ \operatorname{Br}(k) = H^2(k^{\text{al}}/k) }[/math] coincides with [math]\displaystyle{ H^1(k^{\text{al}}/k) }[/math], which in turn vanishes by Hilbert 90.

Proof

Let A be a finite domain. For each nonzero x in A, the two maps

[math]\displaystyle{ a \mapsto ax, a \mapsto xa: A \to A }[/math]

are injective by the cancellation property, and thus, surjective by counting. It follows from the elementary group theory that the nonzero elements of A form a group under multiplication. Thus, A is a skew-field.

To prove that every finite skew-field is a field, we use strong induction on the size of the skew-field. Thus, let A be a skew-field, and assume that all skew-fields that are proper subsets of A are fields. Since the center Z(A) of A is a field, A is a vector space over Z(A) with finite dimension n. Our objective is then to show n = 1. If q is the order of Z(A), then A has order qⁿ. Note that because Z(A) contains the distinct elements 0 and 1, q>1. For each x in A that is not in the center, the centralizer Z_x of x is clearly a skew-field and thus a field, by the induction hypothesis, and because Z_x can be viewed as a vector space over Z(A) and A can be viewed as a vector space over Z_x, we have that Z_x has order q^d where d divides n and is less than n. Viewing Z(A)*, A*, and the Z*_x as groups under multiplication, we can write the class equation

[math]\displaystyle{ q^n - 1 = q - 1 + \sum {q^n - 1 \over q^d - 1} }[/math]

where the sum is taken over the conjugacy classes not contained within Z(A)*, and the d are defined so that for each conjugacy class, the order of Z*_x for any x in the class is q^d-1. qⁿ−1 and q^d−1 both admit polynomial factorization in terms of cyclotomic polynomials

[math]\displaystyle{ \Phi_f(q) }[/math].

In the polynomial identities

[math]\displaystyle{ x^n-1 = \prod_{m|n} \Phi_m(x) }[/math] and [math]\displaystyle{ x^d-1 = \prod_{m|d} \Phi_m(x) }[/math],

we set x = q. Because each d is a proper divisor of n,

[math]\displaystyle{ \Phi_n(q) }[/math] divides both qⁿ−1 and each [math]\displaystyle{ {q^n - 1 \over q^d - 1} }[/math],

so by the above class equation [math]\displaystyle{ \Phi_n(q) }[/math] must divide q−1, and therefore

[math]\displaystyle{ |\Phi_n(q)| \leq q-1 }[/math].

To see that this forces n to be 1, we will show

[math]\displaystyle{ |\Phi_n(q)| \gt q-1 }[/math]

for n > 1 using factorization over the complex numbers. In the polynomial identity

[math]\displaystyle{ \Phi_n(x) = \prod (x - \zeta) }[/math],

where ζ runs over the primitive n-th roots of unity, set x to be q and then take absolute values

[math]\displaystyle{ |\Phi_n(q)| = \prod |q - \zeta| }[/math].

For n > 1, we see that for each primitive n-th root of unity ζ,

[math]\displaystyle{ |q-\zeta| \gt |q-1| }[/math]

because of the location of q, 1, and ζ in the complex plane. Thus

[math]\displaystyle{ |\Phi_n(q)| \gt q-1 }[/math].

References

• Parshall, K. H. (1983). "In pursuit of the finite division algebra theorem and beyond: Joseph H M Wedderburn, Leonard Dickson, and Oswald Veblen". Archives of International History of Science 33: 274–99. 
• Lam, Tsit-Yuen (2001). A first course in noncommutative rings. Graduate Texts in Mathematics. 131 (2 ed.). Springer. ISBN 0-387-95183-0. 

External links

• Proof of Wedderburn's Theorem at Planet Math
• Mizar system proof: http://mizar.org/version/current/html/weddwitt.html#T38