Question #17118

Let R be an n2-dimensional algebra over a field k. Show that R ∼ Mn(k) (as k-algebras) iff R is simple and has an element r whose minimal polynomial over k has the form (x − a1) • • • (x − an) where a1, . . . , an ∈ k.

Expert's answer

First, suppose R=Mn(k)R = \mathbf{M}_n(k). Then RR is simple, and the matrix with 1's on the line above the diagonal and 0's elsewhere has minimal polynomial xnx^n. Conversely, suppose RR is simple and has an element rr whose minimal polynomial over kk is (xa1)(xan)(x - a_1) \cdots (x - a_n), where a1,,anka_1, \ldots, a_n \in k. Then we have a strictly descending chain of left ideals

(#)RR(ra1)R(ra1)(ra2)R(ra1)(ran)=0.(\#) R \supset R(r - a_1) \supset R(r - a_1)(r - a_2) \supset \cdots \supset R(r - a_1) \cdots (r - a_n) = 0.

For, if R(ra)(rai)=R(ra1)(rai+1)R(r - a) \cdots (r - a_i) = R(r - a_1) \cdots (r - a_{i+1}) for some ii, right multiplication by (rai+2)(ran)(r - a_{i+2}) \cdots (r - a_n) would give (ra1)(rai)(rai+2)(ran)=0R(r - a_1) \cdots (r - a_i)(r - a_{i+2}) \cdots (r - a_n) = 0 \in R, which is impossible. Now, express RR in the form Mm(D)\mathbf{M}_m(D) where DD is a division kk-algebra of, say, dimension dd. Then n2=m2dn^2 = m^2 d, and RR{}_R R has composition length mm. Appealing to (#)(\#), we have m2n2=m2dm^2 \geq n^2 = m^2 d, so d=1d = 1, n=mn = m, and RMn(k)R \sim \mathbf{M}_n(k).

Need a fast expert's response?

Submit order

and get a quick answer at the best price

for any assignment or question with DETAILED EXPLANATIONS!

LATEST TUTORIALS
APPROVED BY CLIENTS