Share on Facebook Share on Twitter Email
Answers.com

Wedderburn's little theorem

 
Wikipedia: 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.

Contents

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 came 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.

Sketch of proof

Let A be a finite domain. For each nonzero x \in A, the map

a \mapsto ax: A \to A

is injective; thus, surjective. Hence, x has a left inverse. By the same argument, x has a right inverse. A is thus a skew-field. Since the center Z(A) of A is a field, A can be identified with 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 qn. For each x \in A that is not in the center, the centralizer Zx of x has order qd where d divides n. Viewing Z(A) * , {Z_x}^* and A * as groups under multiplication, we can write the class equation

q^n - 1 = q - 1 + \sum {q^n - 1 \over q^d - 1}

where the sum is taken over all representatives x that is not in Z(A) and d are the numbers discussed above. qn and qd both admit factorization in terms of cyclotomic polynomials Φf. After cancelation, we see that Φn(q) divides {q^n - 1 \over q^d - 1} and q − 1. But since | q − ζ | > | q − 1 | if | ζ | = 1 and \zeta \ne 1, we reach contradiction unless n = 1. \square

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, pp. 274–99 

External links


Search unanswered questions...
Enter a question here...
Search: All sources Community Q&A Reference topics
 
 

 

Copyrights:

Wikipedia. This article is licensed under the Creative Commons Attribution/Share-Alike License. It uses material from the Wikipedia article "Wedderburn's little theorem" Read more