23.2  Ideals and Quotients

Subalgebras are the parts of an algebra one can multiply inside. Ideals are the parts one can divide by. Chapter 15 §10 introduced two-sided ideals for one purpose, to cut the Clifford algebra out of the tensor algebra; here they become the tool for taking an algebra apart. Two things are new. First, in a non-commutative algebra there are three kinds of ideal, and the difference decides every statement below. Second, the main theorem of the section says that the matrix algebra has no two-sided ideals at all — which is why matrix algebras are the atoms out of which the rest of the chapter builds everything.

23.2.1. Three kinds of ideal

Section 1 left a set unexplained. In M2(F) the matrices aE11 form a subspace closed under products, but not a subalgebra: the identity is missing. What kind of object is it? Look instead at the slightly bigger set C1={X∈M2(F):column 2 of X is 0}=span(E11,E21). Multiplying on the left by anything keeps a matrix in C1, because AX has k-th column Axk (Theorem 0.9.2), so a zero column stays zero. Multiplying on the right does not: E11E12=E12∉C1. Absorption on one side is a genuine phenomenon, and it needs its own name.

An ideal is a subspace that absorbs multiplication: a left ideal from the left, a right ideal from the right, a two-sided ideal from both.

Definition 23.2.1 (Left and Right Ideals)

Let A be an algebra over F and let I⊆A be a subspace. Then I is

  • (a) a left ideal of A if ax∈I for every a∈A and every x∈I;
  • (b) a right ideal of A if xa∈I for every a∈A and every x∈I.

A two-sided ideal is a subspace that is both, which is Definition 15.10.3. When A is commutative the three notions coincide, and we say ideal.

Read the quantifiers. The multiplier a runs over the whole algebra, not over I; being closed among one’s own elements, which is clause (SA2) of a subalgebra, is a different and much weaker condition. And the definition is not symmetric: in C1 above, “every a” works on the left and fails on the right.

Example (Ideals in five algebras)
  • (a) In any algebra A: {0} and A.
  • (b) In F[x]: the sets ⟨p⟩ of Definition 6.2.1.
  • (c) In Mn(F): the column ideal Cj of matrices whose columns other than the j-th are zero.
  • (d) In Mn(F): the set RU={X:col(X)⊆U} for a subspace U⊆Fn.
  • (e) In any algebra A: the kernel of an algebra homomorphism φ:A→B.

Say in each case which of the three kinds of ideal is meant.

Solution.

  • (a) Two-sided, and these are the degenerate cases: {0} absorbs everything because a0=0, and A absorbs everything because there is nowhere else to go.

  • (b) Two-sided, because F[x] is commutative. Chapter 6’s (I1)–(I3) are exactly Definition 23.2.1 read in a commutative algebra, with (I1) and (I2) replaced by the stronger requirement that I be a subspace — which is no change, since cf=(c1)f∈I for a scalar c by (I3).

  • (c) A left ideal, by the computation above, of dimension n. Not a right ideal for n≥2: EjjEjk=Ejk∉Cj for k≠j.

  • (d) A right ideal: col(XA)⊆col(X)⊆U, because each column of XA is a combination of the columns of X (Theorem 0.9.2). Not a left ideal in general: for U=span(e1)⊆F2, E11∈RU but E21E11=E21 has column space span(e2)⊈U.

  • (e) Two-sided: this is Lemma 15.10.5 (c).

The non-example is the one Chapter 15 already gave, and it is worth repeating because it is the mistake to avoid. The diagonal matrices in M2(F) form a subspace closed under products — a subalgebra, in fact — and are not an ideal of any kind: E11 is diagonal, while E21E11=E21 and E11E12=E12 are not. Closure under one’s own products is not absorption.

Why insist on absorbing products with the whole algebra? Because that is exactly the condition under which the quotient vector space A/I inherits a multiplication, as Lemma 15.10.5 (a) shows: the computation x′y′=xy+uy+xw+uw needs uy and xw to lie in I when u,w do, with x,y arbitrary. The condition is necessary as well: taking u=0 leaves xw, which must lie in I for every x∈A and w∈I, and taking w=0 leaves uy, which must lie in I for every u∈I and y∈A. A one-sided ideal gives only half of that, and half is not enough.

Warning. A two-sided ideal is almost never a subalgebra, and a subalgebra is almost never an ideal. If a left ideal I contains an invertible element u, then for every a∈A we have a=(au−1)u∈I, so I=A. In particular a proper ideal of any kind contains no invertible element, hence does not contain 1A, hence fails (SA3). The only ideal that is a subalgebra is A itself.

Quick check. In M2(F), is span(E11) a left ideal? A right ideal?

Solution. Neither. It is a subspace, but E21E11=E21∉span(E11), so it is not a left ideal, and E11E12=E12∉span(E11), so it is not a right ideal. It is closed under its own products, which is why it looked like something in the warning of Section 1; it is neither a subalgebra nor an ideal. The smallest left ideal containing it is C1, and the smallest two-sided ideal containing it is all of M2(F), by the theorem below.

23.2.2. Matrix units multiply in one line

Everything about ideals of Mn(F) follows from a single product rule. Recall that the matrix unit Eij has a 1 in position (i,j) and zeros elsewhere, and that the n2 matrix units are a basis of Mn(F) (Example (Standard Bases)).

Lemma 23.2.1 (The Matrix Unit Product Rule)

Let F be a field, n≥1, and 1≤i,j,k,l≤n. Then, in Mn(F), EijEkl=δjkEil,andEijXEkl=xjkEil  for every X=(xpq). Moreover E11+E22+⋯+Enn=In.

Proof. Write (Eij)pq=δpiδqj, which is the definition of the matrix unit. By Theorem 0.9.2 (1), (EijEkl)pq=∑rδpiδrjδrkδql=δpiδql∑rδrjδrk=δjkδpiδql, since the only surviving term of the last sum is r=j, which contributes 1 when k=j and 0 otherwise. The right-hand side is the (p,q) entry of δjkEil.

For the second identity, expand X=∑r,sxrsErs in the basis of matrix units and use bilinearity together with the first identity twice: EijXEkl=∑r,sxrsEijErsEkl=∑r,sxrsδjrδskEil=xjkEil. The last statement is the observation that ∑iEii has (p,q) entry ∑iδpiδqi=δpq. This proves the lemma.

The second identity is the one to remember: sandwiching a matrix between two matrix units extracts one entry and moves it to a chosen place. Choosing i and l freely, a single non-zero entry of X can be moved anywhere.

23.2.3. The matrix algebra is simple

An algebra whose only two-sided ideals are {0} and itself is called simple; Section 3 makes this a definition, adding the clause that the algebra be non-zero. The theorem says that matrix algebras are simple over every field.

Theorem 23.2.2 (The Matrix Algebra Has No Proper Two-Sided Ideals)

Let F be any field and n≥1. The only two-sided ideals of Mn(F) are {0} and Mn(F). Consequently, for a finite-dimensional vector space V≠{0} over F, the only two-sided ideals of L(V) are {0} and L(V).

Idea. An ideal that contains anything non-zero contains a matrix with some entry xjk≠0. Sandwich it: Lemma 23.2.1 turns that one entry into an arbitrary matrix unit, up to the non-zero scalar xjk, which we may divide out. Once the ideal has all n2 matrix units, it has their span, and it also has their sum, which is In.

Proof. Both {0} and Mn(F) are two-sided ideals. Let I be a two-sided ideal with I≠{0}, and choose X∈I with X≠0. Then some entry xjk is non-zero; fix such a pair (j,k).

Let i and l be arbitrary. Since I absorbs multiplication on both sides, EijXEkl∈I, and by Lemma 23.2.1 this element is xjkEil. As xjk≠0 it is invertible in F, and I is a subspace, so Eil=xjk−1(xjkEil)∈I. Hence I contains every matrix unit. The matrix units span Mn(F) (Example (Standard Bases)) and I is a subspace, so I=Mn(F).

For L(V), fix an ordered basis of V and use the algebra isomorphism L(V)→Mn(F) recorded after Definition 23.1.3. An algebra isomorphism carries two-sided ideals to two-sided ideals, since it is a linear bijection and φ(ax)=φ(a)φ(x) in both directions. This proves the theorem.

Nothing in the proof used anything about F beyond the existence of xjk−1, which is the field axiom. The theorem holds over Q, over C, and over F2 alike, and it is the reason matrix algebras will turn out to be the building blocks in this chapter’s structure theorem: they cannot be broken.

One consequence is worth recording; §03 proves it again for every simple algebra.

Corollary 23.2.3 (Homomorphisms out of a Matrix Algebra Are Injective)

Let F be a field, n≥1, and let φ:Mn(F)→B be an algebra homomorphism into any F-algebra B≠{0}. Then φ is injective.

Proof. By Lemma 15.10.5 (c), kerφ is a two-sided ideal of Mn(F), so by Theorem 23.2.2 it is {0} or Mn(F). If kerφ=Mn(F), then 1B=φ(In)=0, and then b=1Bb=0 for every b∈B, contradicting B≠{0}. So kerφ={0} and φ is injective (Theorem 2.2.3).

Warning. “Simple” says nothing about one-sided ideals. Mn(F) has no two-sided ideals other than the two obvious ones, and for n≥2 it has a whole lattice of left ideals, as the next result shows. Whenever a statement in this chapter says “ideal”, check which kind is meant before using it.

23.2.4. The left ideals of the matrix algebra

The left ideals are not trivial, and they are worth knowing exactly: they are indexed by subspaces of row vectors, and the smallest of them are the column ideals.

Proposition 23.2.4 (The Left Ideals of Mn(F))

Let F be a field and n≥1. For a subspace W⊆M1×n(F) of row vectors, put LW:={X∈Mn(F):row(X)⊆W}.

  • (a) LW is a left ideal of Mn(F), and dim⁡LW=ndim⁡W.
  • (b) Every left ideal L of Mn(F) equals LW for exactly one W, namely the span of the union of the row spaces of the elements of L: W=span(⋃X∈Lrow(X)).
  • (c) W↦LW is an inclusion-preserving bijection from subspaces of M1×n(F) onto left ideals of Mn(F). The minimal non-zero left ideals are the LW with dim⁡W=1.
  • (d) Taking W=span(ej⊤) gives the column ideal Cj of Example (Ideals in five algebras) (c), of dimension n, and Mn(F)=C1⊕⋯⊕Cn as a direct sum of left ideals.

Idea. Two facts drive everything. First, left multiplication can only shrink the row space: row i of AX is a combination of the rows of X. Second, left multiplication can produce every matrix whose rows lie in the row space of X, because the rows of AX are arbitrary combinations of the rows of X, one combination per row and chosen independently. So a left ideal is determined by the row vectors it can reach, and it contains every matrix built from them.

Proof. Throughout we use two consequences of Theorem 0.9.2 (3): row i of AX is (row i of A) X; and for a row vector a⊤∈M1×n(F), the product a⊤X is the combination of the rows of X with weights a1,…,an, so that (∗)row(X)={a⊤X:a⊤∈M1×n(F)}.

  • (a) LW is a subspace: every row of X+cY is the corresponding row of X plus c times that of Y, hence lies in W when both do. It is a left ideal: each row of AX lies in row(X)⊆W by the first consequence. For the dimension, the map Mn(F)→(M1×n(F))n sending X to its list of rows is a linear bijection, and it carries LW onto W×⋯×W — the rows may be chosen from W independently of one another. So dim⁡LW=ndim⁡W by Theorem 4.4.1.

  • (b) Let L be a left ideal and put W:=span(⋃X∈Lrow(X)), a subspace of M1×n(F) by Theorem 1.3.1; then L⊆LW by construction.

    For the reverse inclusion, choose X1,…,Xm∈L with W=row(X1)+⋯+row(Xm). Such a choice exists: W is a subspace of the n-dimensional space M1×n(F), so it has a finite basis; each basis vector is by Definition 1.3.2 a finite combination of row vectors drawn from the spaces row(X) with X∈L, and each such space is a subspace, so that basis vector lies in the sum of the finitely many row(X) involved. Collecting the X used across the whole basis gives X1,…,Xm∈L with W⊆row(X1)+⋯+row(Xm), and the reverse containment holds because each row(Xt)⊆W. Let Y∈LW and let y1⊤,…,yn⊤ be its rows, all in W. Each yp⊤ lies in W=row(X1)+⋯+row(Xm), hence is a sum of elements of the row(Xt), so by (∗) there are row vectors apt⊤ with yp⊤=∑t=1mapt⊤Xt(1≤p≤n). Let At∈Mn(F) be the matrix whose p-th row is apt⊤. Then row p of ∑tAtXt is ∑tapt⊤Xt=yp⊤, so Y=∑tAtXt. Each AtXt lies in L because L is a left ideal, and L is a subspace, so Y∈L. Hence L=LW.

    Uniqueness: LW determines W, because W=span(⋃X∈LWrow(X)). Indeed that span is contained in W by definition, and it contains every a⊤∈W, since the matrix e1a⊤, whose first row is a⊤ and whose other rows are zero, lies in LW.

  • (c) If W⊆W′ then LW⊆LW′; conversely LW⊆LW′ forces W⊆W′, by the description of W just given. With (b), the map is a bijection, and it preserves and reflects inclusion, so it matches minimal non-zero left ideals with minimal non-zero subspaces, which are the lines.

  • (d) A matrix has all its rows in span(ej⊤) exactly when every entry outside column j is zero, which is the description of Cj; its dimension is n⋅1=n by (a). Every X is the sum of its columns placed in the corresponding Cj, and a matrix lying in Cj and in the sum of the others is zero, so the sum is direct. This proves the proposition.

Remark. Everything transposes. Since (XA)⊤=A⊤X⊤, the linear bijection X↦X⊤ carries left ideals onto right ideals and back. Applying it to the proposition, and writing U={a∈Fn:a⊤∈W}, the right ideals of Mn(F) are exactly the sets RU={X:col(X)⊆U} of Example (Ideals in five algebras) (d), for subspaces U⊆Fn, with dim⁡RU=ndim⁡U. It is worth keeping the two statements apart: column spaces classify right ideals, row spaces classify left ideals.

23.2.5. Quotients, and the first isomorphism theorem

Chapter 15 §10 did the work. Lemma 15.10.5 says that the quotient space A/I of Chapter 2 (Definition 4.4.3) carries exactly one multiplication making π:A→A/I multiplicative, namely (x+I)(y+I)=xy+I, and that with it A/I is an algebra with identity 1A+I. We give the object its name.

Definition 23.2.2 (Quotient Algebra)

Let A be an algebra over F and I a two-sided ideal of A. The quotient algebra A/I is the quotient vector space A/I with the multiplication (x+I)(y+I)=xy+I of Lemma 15.10.5, and π:A→A/I, π(x)=x+I, is the quotient homomorphism.

Two facts come for free. The ideal must be two-sided: a merely one-sided ideal gives a quotient vector space, but the product of cosets is not well defined on it. And when A is finite-dimensional, dim⁡(A/I)=dim⁡A−dim⁡I by Theorem 4.4.5.

Theorem 23.2.5 (First Isomorphism Theorem for Algebras)

Let φ:A→B be a homomorphism of F-algebras. Then kerφ is a two-sided ideal of A, imφ is a subalgebra of B, and the rule φ¯:A/kerφ→B,φ¯(x+kerφ)=φ(x), defines an injective algebra homomorphism with image imφ. Hence A/kerφ≅imφ as F-algebras.

Idea. Chapter 4 already produced the linear isomorphism; all that is left is to see that it respects products, and that is one line, because the product on the quotient was defined so that π is multiplicative.

Proof. kerφ is a two-sided ideal by Lemma 15.10.5 (c). imφ is a subalgebra of B: it is a subspace (Theorem 2.2.2), it is closed under products since φ(x)φ(y)=φ(xy), and it contains 1B=φ(1A).

Write K=kerφ. By Theorem 4.4.7, φ¯ is a well-defined linear map, it is injective, its image is imφ, and φ¯∘π=φ.

It is multiplicative. Every element of A/K is π(x) for some x∈A, and by Definition 23.2.2 and the multiplicativity of φ, φ¯(π(x)π(y))=φ¯(π(xy))=φ(xy)=φ(x)φ(y)=φ¯(π(x))φ¯(π(y)). It is unital: φ¯(1A/K)=φ¯(π(1A))=φ(1A)=1B. So φ¯ is an injective algebra homomorphism onto imφ, hence an algebra isomorphism A/K→imφ. This proves the theorem.

The theorem turns every surjective homomorphism into a quotient, and that is how quotient algebras are recognized in practice: build a homomorphism, compute its kernel, and read off the answer. Here are two instances.

Example (The group algebra of a cyclic group)

Let F be a field, n≥1, and G=Z/nZ written multiplicatively as {1,g,…,gn−1} with gn=1. Show that F[G]≅F[x]/⟨xn−1⟩.

Solution. Example (Three group algebras) (b) produced an algebra homomorphism ε:F[x]→F[G] with ε(p)=∑icigi for p=∑icixi, showed that it is surjective, and identified kerε=⟨xn−1⟩. Note that ⟨xn−1⟩ is a two-sided ideal of F[x], since F[x] is commutative. By Theorem 23.2.5, F[x]/⟨xn−1⟩≅imε=F[G]. Both sides have dimension n: the left by Theorem 6.6.5, the right by Definition 23.1.5. This pays off the promise made in Section 1, and it says something the group alone does not: the group algebra of a cyclic group is a ring of polynomials with one relation.

The second instance needs a two-element algebra built from F. For F-algebras A and B, the product algebra A×B is the product vector space (Definition 4.4.1) with componentwise multiplication (a,b)(a′,b′)=(aa′,bb′). Bilinearity, associativity and the identity (1A,1B) are inherited componentwise, so A×B is an algebra, of dimension dim⁡A+dim⁡B (Theorem 4.4.1). We need only F×F, of dimension 2.

Example (Upper triangular matrices modulo their strictly upper part)

Let T2 be the upper triangular matrices in M2(F) and let N=span(E12) be the strictly upper triangular ones.

  • (a) Show that N is a two-sided ideal of T2.
  • (b) Identify T2/N.

Solution. Write a general element of T2 as U=(ab0c) and note (†)(ab0c)(pq0r)=(apaq+br0cr).

  • (a) N is the set of elements of T2 with a=c=0, a subspace. Putting a=c=0 in (†) gives a product with both diagonal entries 0, and putting p=r=0 does the same; so N absorbs multiplication on both sides.

  • (b) Define φ:T2→F×F by φ(U)=(a,c). It is linear, it sends I2 to (1,1), and by (†) it is multiplicative, since the diagonal of a product of upper triangular matrices is the product of the diagonals. It is surjective, since φ(diag(a,c))=(a,c), and its kernel is exactly N. By Theorem 23.2.5, T2/N≅F×F. A dimension check: dim⁡T2=3, dim⁡N=1, dim⁡(F×F)=2=3−1, as Theorem 4.4.5 requires.

So T2 is not simple: it has a proper non-zero two-sided ideal, and dividing by it leaves the most transparent algebra there is, a product of copies of F. Theorem 23.2.2 says M2(F) admits no such surgery. That contrast — an algebra with an ideal to divide out, against one with none — is the division the rest of the chapter runs on.

23.2.6. Exercises

A. Check your understanding

Exercise (A1)
  • (a) Define left ideal, right ideal and two-sided ideal, and say which of the three is needed to form a quotient algebra.
  • (b) State the product rule for matrix units, and say which step of the proof of Theorem 23.2.2 uses that F is a field.
  • (c) True or false, with a reason: a two-sided ideal of an algebra A is a subalgebra of A.
  • (d) Give a left ideal of M3(F) of dimension 6, and say which subspace of row vectors it corresponds to.

Solution.

  • (a) See Definition 23.2.1: a subspace absorbing multiplication from the left, from the right, or from both. Forming a quotient algebra needs a two-sided ideal, because the product of cosets is otherwise not well defined (Lemma 15.10.5 (a)).

  • (b) EijEkl=δjkEil, and EijXEkl=xjkEil (Lemma 23.2.1). The field is used when dividing by the non-zero scalar xjk to extract Eil from xjkEil.

  • (c) False, unless I=A. A proper ideal contains no invertible element, in particular not 1A, so (SA3) fails; see the warning after Example (Ideals in five algebras).

  • (d) LW with W=span(e1⊤,e2⊤), the matrices whose third column is zero; dim⁡LW=3⋅2=6 by Proposition 23.2.4 (a).

B. Practice

Exercise (B1: Determine which are ideals)

Determine, for each of the following subspaces, whether it is a left ideal, a right ideal, a two-sided ideal, or none. Justify your answer.

  • (a) {X∈M2(F):x11+x22=0}.
  • (b) {X∈M2(F):row 2 of X is 0}.
  • (c) {X∈M3(F):Xe1=0}.
  • (d) {p∈F[x]:p(0)=0} inside F[x].

Solution.

  • (a) None. It is a subspace, but E12 lies in it while E21E12=E22 does not, so it is not a left ideal; and E12E21=E11 is not in it, so it is not a right ideal. (One may also argue from Theorem 23.2.2: a two-sided ideal of dimension 3 is impossible.)

  • (b) A right ideal, not a left ideal. The set is a subspace, and right multiplication keeps the condition: by Theorem 0.9.2 (3), row 2 of XA is (row 2 of X) A=0. Left multiplication does not: E11 has second row 0, while E21E11=E21 does not.

  • (c) A left ideal, not a right ideal. It is LW for W=span(e2⊤,e3⊤): a matrix kills e1 exactly when its first column is zero, that is, when every row lies in W. Left multiplication keeps the condition since (AX)e1=A(Xe1)=0. Right multiplication does not: E12e1=0, while (E12E21)e1=E11e1=e1≠0.

  • (d) A two-sided ideal, since F[x] is commutative: it is ⟨x⟩ by Theorem 6.1.3, and (hp)(0)=h(0)p(0)=0.

Exercise (B2: A quotient computed)

Let A=F[x]/⟨x2⟩.

  • (a) Write down a basis of A and its multiplication table.
  • (b) Show that I=span(x+⟨x2⟩) is a two-sided ideal of A and identify A/I.
  • (c) Show that A is not isomorphic to F×F.

Solution.

  • (a) By Theorem 6.6.5, dim⁡A=2, with basis (1+⟨x2⟩, x+⟨x2⟩). Write 1 and t for these. The table is 1⋅1=1, 1⋅t=t⋅1=t, and t2=x2+⟨x2⟩=0.

  • (b) I=span(t) is a subspace, and (a+bt)t=at∈I, t(a+bt)=at∈I, so it absorbs on both sides. The map φ:A→F, a+bt↦a, is linear, sends 1 to 1, and is multiplicative because (a+bt)(a′+b′t)=aa′+(ab′+a′b)t. Its kernel is I, so A/I≅F by Theorem 23.2.5.

  • (c) In F×F the equation y2=0 forces y=0, since a product of scalars vanishes only when a factor does. In A the non-zero element t satisfies t2=0. An algebra isomorphism preserves squares and sends 0 to 0, so no isomorphism exists.

Exercise (B3: An ideal generated)

Inside M3(F), let I=⟨E23⟩ be the two-sided ideal generated by E23 in the sense of Definition 15.10.3. Compute I, and do the same for the left ideal generated by E23, that is, span{AE23:A∈M3(F)}.

Solution. By Definition 15.10.3, I is spanned by the elements AE23B. Taking A=Ei2 and B=E3l gives Ei2E23E3l=Eil by Lemma 23.2.1, for all i and l. So I contains every matrix unit and I=M3(F), of dimension 9. This is Theorem 23.2.2 in a single instance.

The left ideal is different. By (∗) in the proof of Proposition 23.2.4, row(E23)=span(e3⊤), so {AE23} is exactly the set of matrices all of whose rows are multiples of e3⊤, that is, the column ideal C3, of dimension 3. Generating on one side and on two sides give a three-dimensional and a nine-dimensional answer.

C. Going deeper

Exercise (C1: All the ideals of the upper triangular algebra)

Let T2 be the upper triangular matrices in M2(F), with basis (E11,E12,E22).

  • (a) Prove that J1=span(E11,E12) and J2=span(E12,E22) are two-sided ideals.
  • (b) Prove that {0}, span(E12), J1, J2 and T2 are the only two-sided ideals of T2.
  • (c) Identify T2/J1 and T2/J2.

Hint for (b): if an ideal contains an element with a≠0, multiply it by E11 on both sides.

Solution. Throughout write U=(ab0c) and use (†) of Example (Upper triangular matrices modulo their strictly upper part).

  • (a) J1 is the set of U with c=0. Putting c=0 in (†) gives a product with lower right entry cr=0; putting r=0 does the same. So J1 absorbs on both sides. Symmetrically, J2 is the set with a=0, and (†) gives upper left entry ap, which vanishes if a=0 or p=0.

  • (b) Let I be a two-sided ideal and take U∈I. By (†), E11UE11=aE11 and E22UE22=cE22, both in I. Also E11UE22=bE12∈I.

    Case 1: some element of I has a≠0. Then E11∈I, hence E12=E11E12∈I, so J1⊆I. If in addition some element has c≠0, then E22∈I and I=T2; otherwise every element has c=0 and I=J1.

    Case 2: every element of I has a=0. If some element has c≠0, then E22∈I, hence E12=E12E22∈I, so J2⊆I⊆J2 and I=J2. Otherwise every element has a=c=0, so I⊆span(E12), and I is {0} or span(E12).

    These five exhaust the possibilities.

  • (c) U↦c is a surjective algebra homomorphism T2→F by (†), with kernel J1; so T2/J1≅F by Theorem 23.2.5. Symmetrically U↦a gives T2/J2≅F.
Exercise (C2: Simplicity over a small field, and a failure)
  • (a) Verify Theorem 23.2.2 by hand for M2(F2), starting from the ideal generated by E12+E21.
  • (b) Let A=F×F. Show that A has exactly four two-sided ideals, and conclude that a commutative algebra of dimension 2 can fail to be simple.
  • (c) Deduce that M2(F) and F4=F×F×F×F are not isomorphic as F-algebras, although they have the same dimension.

Solution.

  • (a) Let X=E12+E21 and let I be the two-sided ideal it generates. Its (1,2) entry is 1≠0, so by Lemma 23.2.1, Ei1XE2l=x12Eil=Eil for all i,l∈{1,2}. Hence I contains E11,E12,E21,E22 and so all of M2(F2). Over F2 no division was needed, because the non-zero entry was already 1.

  • (b) Let I⊆F×F be an ideal and put e1=(1,0), e2=(0,1). For (u,v)∈I we get (u,0)=e1(u,v)∈I and (0,v)∈I. So I is determined by whether it contains a pair with u≠0 and whether it contains a pair with v≠0, giving {0}, F×{0}, {0}×F and F×F. Each of these four is indeed an ideal, by componentwise multiplication. The two middle ones are proper and non-zero, so F×F is not simple.

  • (c) M2(F) has exactly two two-sided ideals (Theorem 23.2.2), while F4 has more: the same argument as in (b) shows that F×{0}×{0}×{0} is a proper non-zero ideal. An algebra isomorphism carries two-sided ideals bijectively to two-sided ideals, so no isomorphism can exist. Both algebras have dimension 4, so dimension alone classifies nothing.

Exercise (C3: Left ideals and null spaces)

Let F be a field and n≥1.

  • (a) For a subspace U⊆Fn, prove that NU={X∈Mn(F):Xu=0 for every u∈U} is a left ideal of Mn(F).
  • (b) Prove that dim⁡NU=n(n−dim⁡U).
  • (c) Prove that U↦NU is an inclusion-reversing bijection from subspaces of Fn onto left ideals of Mn(F), and describe NU in the language of Proposition 23.2.4.

Hint for (b): a matrix kills every vector of U exactly when each of its rows annihilates U.

Solution.

  • (a) NU is the intersection over u∈U of the null spaces of the linear maps X↦Xu, hence a subspace. If X∈NU and A∈Mn(F), then (AX)u=A(Xu)=0, so AX∈NU.

  • (b) Let a⊤ be a row of X. The entries of Xu are the numbers a⊤u as a⊤ runs over the rows, so Xu=0 for every u∈U exactly when every row of X annihilates U, that is, when row(X)⊆WU, where WU is the space of row vectors annihilating U. Identifying a row vector a⊤ with the functional u↦a⊤u, which is a linear bijection M1×n(F)→(Fn)∗ by Theorem 5.1.1, the space WU corresponds to U0, so dim⁡WU=n−dim⁡U by Theorem 5.2.2. Hence NU=LWU, and Proposition 23.2.4 (a) gives dim⁡NU=n(n−dim⁡U).

  • (c) It is enough to show that U↦WU, which under the identification of (b) is U↦U0, is an inclusion-reversing bijection from subspaces of Fn onto subspaces of M1×n(F); composing with the inclusion-preserving bijection W↦LW of Proposition 23.2.4 (c) then gives the claim, since NU=LWU by (b).

It reverses inclusions by Theorem 5.2.3 (a), and it is injective by Corollary 5.3.5. For surjectivity, let W be a subspace of (Fn)∗ of dimension k, with basis φ1,…,φk, and put U=kerφ1∩⋯∩kerφk. By Theorem 5.6.7, U has codimension k, so dim⁡U=n−k and dim⁡U0=k by Theorem 5.2.2. Every φi vanishes on U, so W⊆U0; equal dimensions give W=U0.

Found a typo or a mistake? Report it, or read this page’s source

The text of this book is licensed under CC BY-NC-SA 4.0.