1.9  Changing the Field

Every vector space comes with its field, and we have already seen that the field matters: dimC⁡C=1 but dimR⁡C=2 (Example (Dimensions of the Running Examples)). This section explains the pattern behind that example. Shrinking the field multiplies the dimension by a fixed factor, the tower law. Going the other way, every real vector space can be enlarged to a complex one, its complexification, without changing the dimension. Both moves are used later, most of all when real matrices need complex eigenvalues.

1.9.1. Restricting the scalars

Start with the standard example. The space C2 over C has the basis (e1,e2), so its dimension is 2. But nothing stops us from multiplying vectors of C2 only by real numbers. The addition is the same, and the axioms still hold, because they hold for all complex scalars. So C2 is also a vector space over R. What is its dimension now?

Example (C2 as a Real Vector Space)

Show that (e1,ie1,e2,ie2) is a basis of C2 over R, and write (1+2i,3−i) in it.

Solution. Spanning. Let (z1,z2)∈C2 and write zk=ak+bki with ak,bk∈R. Then (z1,z2)=a1e1+b1(ie1)+a2e2+b2(ie2), a combination with real coefficients. For example, (1+2i,3−i)=1e1+2(ie1)+3e2+(−1)(ie2).

Independence. Let a1,b1,a2,b2∈R with a1e1+b1(ie1)+a2e2+b2(ie2)=0. The left side is (a1+b1i,a2+b2i). Each entry is 0, and comparing real and imaginary parts (Definition 0.6.1) gives a1=b1=a2=b2=0.

Hence dimR⁡C2=4=2dimC⁡C2.

The general setting has a big field L, a smaller field K inside it, and a vector space over L.

Definition 1.9.1 (Subfield, Restriction of Scalars, Degree)

Let L be a field. A subfield of L is a subset K⊆L that contains 0 and 1 and is closed under addition, multiplication, negatives, and inverses of non-zero elements.

Let K be a subfield of L, and let V be a vector space over L. Keeping the addition of V and using scalar multiplication only for scalars in K makes V a vector space over K. We say V is obtained by restriction of scalars.

In particular L itself, a vector space over L, is a vector space over K. If it is finite-dimensional, its dimension is the degree [L:K]:=dimK⁡L.

In words: a subfield is a field sitting inside L with the same operations. Restriction of scalars forgets how to multiply by elements of L outside K.

There are two things to check. First, K with the operations of L is a field. Closure makes the operations land in K, the elements 0,1, negatives and inverses are in K by assumption, and the remaining axioms are identities that hold for all elements of L, so in particular for those of K. Second, V over K is a vector space. Scalar multiplication K×V→V lands in V, and each axiom of Definition 1.1.1 holds for all scalars in L, so in particular for all scalars in K.

We always write dimK⁡V or dimL⁡V when both fields are in play.

Example (Degrees of Some Fields)

Find [C:R], [Q(2):Q] and [K:K] for any field K. Is [R:Q] defined?

Solution. [C:R]=2. Every z∈C is a⋅1+b⋅i with a,b∈R, and a+bi=0 forces a=b=0 by Definition 0.6.1. So (1,i) is a basis of C over R.

[Q(2):Q]=2. The set Q(2)={a+b2:a,b∈Q} is a subfield of R by Example (Q(2) Is a Field). The list (1,2) spans it over Q by definition. For independence, let a+b2=0 with a,b∈Q. If b≠0, then 2=−a/b∈Q, contradicting Theorem 0.2.3. So b=0, and then a=0.

[K:K]=1. The list (1) is a basis of K over K: every a equals a⋅1, and a⋅1=0 forces a=0. This degenerate case says that restricting to the same field changes nothing.

[R:Q] is not defined, because R is not finite-dimensional over Q (Theorem 1.8.6).

Restriction only goes down. The set R with the operations of C is not a vector space over C: everything about addition works, but scalar multiplication leaves the set, since i⋅1=i∉R. Enlarging the field needs a construction, which is the second half of this section.

1.9.2. The tower law

In Example (C2 as a Real Vector Space) we took a vector, wrote it in coordinates over C, and then split each complex coordinate into real coordinates. The same two-stage process works for any fields.

Theorem 1.9.1 (Tower Law)

Let K be a subfield of L, and let V be a vector space over L. Suppose (a1,…,am) is a basis of L over K and (v1,…,vn) is a basis of V over L. Then the list of the mn vectors (a1v1,…,amv1,a1v2,…,amv2,…,a1vn,…,amvn) is a basis of V over K. In particular, dimK⁡V=[L:K]⋅dimL⁡V.

Idea. Coordinates in two stages. A vector is an L-combination of the vj; each L-coefficient is a K-combination of the ai. Substituting gives a double sum ∑j∑ibijaivj with bij∈K. For independence, run the same two stages backwards: regroup the double sum by j, use independence over L, then independence over K.

Proof. Throughout we use two axioms of Definition 1.1.1 for scalars in L: (c+c′)x=cx+c′x and c(c′x)=(cc′)x.

Spanning. Let x∈V. Since (v1,…,vn) spans V over L, there are c1,…,cn∈L with x=∑j=1ncjvj. Since (a1,…,am) spans L over K, for each j there are b1j,…,bmj∈K with cj=∑i=1mbijai. Therefore x=∑j=1n(∑i=1mbijai)vj=∑j=1n∑i=1m(bijai)vj=∑j=1n∑i=1mbij(aivj), where the second equality uses (c+c′)x=cx+c′x and the third uses c(c′x)=(cc′)x. This is a K-linear combination of the vectors aivj.

Independence. Let bij∈K with ∑j=1n∑i=1mbij(aivj)=0. Reading the display above from right to left, ∑j=1n(∑i=1mbijai)vj=0. Each coefficient ∑ibijai lies in L, and (v1,…,vn) is independent over L. Hence ∑i=1mbijai=0 for every j. For each fixed j, this is a K-combination of (a1,…,am) equal to 0, and that list is independent over K. Hence bij=0 for all i and j.

So the mn vectors aivj form a basis of V over K, and dimK⁡V=mn=[L:K]dimL⁡V.

The name comes from the picture of fields stacked in a tower, K⊆L, with V on top: dimensions multiply as you go down. The most important case is R⊆C.

Theorem 1.9.2 (Complex Spaces as Real Spaces)

Let V be a vector space over C with basis (v1,…,vn). Then (v1,iv1,…,vn,ivn) is a basis of V over R. In particular dimR⁡V=2dimC⁡V.

Proof. By Example (Degrees of Some Fields), (1,i) is a basis of C over R. By Theorem 1.9.1 with a1=1 and a2=i, the list (1v1,iv1,…,1vn,ivn) is a basis of V over R, and 1vj=vj by Definition 1.1.1. The dimension is 2n.

This is the result of Exercise (C2: A complex space viewed over the reals), now as a case of the tower law. For example, dimR⁡Cn=2n, and dimR⁡C[x]≤n=2(n+1), with basis (1,i,x,ix,…,xn,ixn).

Warning. A subset of Cn can be a subspace over R without being a subspace over C. The real vectors Rn⊆Cn contain 0 and are closed under addition and under multiplication by real scalars, so they form an R-subspace of dimension n. But e1∈Rn and ie1∉Rn, so Rn is not a C-subspace. Always ask: a subspace over which field?

Quick check. What is dimR⁡M2×3(C)? What is dimQ⁡Q(2)2?

Solution. M2×3(C) has dimension 6 over C (Example (Dimensions of the Running Examples)), so dimR=2⋅6=12 by Theorem 1.9.2. The space Q(2)2 has dimension 2 over the field Q(2), and [Q(2):Q]=2 by Example (Degrees of Some Fields), so dimQ=2⋅2=4 by Theorem 1.9.1.

1.9.3. Complexification

Now go up. A real matrix such as the rotation (0−110) moves every non-zero vector of R2 off its own line. In C2, however, it sends (1,−i) to (i,1)=i(1,−i). To use such complex vectors for an arbitrary real space V, not just Rn, we need a complex space that contains V the way Cn contains Rn.

The model is Cn itself. Every z∈Cn splits as z=x+iy with x,y∈Rn, its real and imaginary parts, taken entry by entry. Multiplying by a+bi with a,b∈R gives (a+bi)(x+iy)=(ax−by)+i(ay+bx). The right side only uses real scalars acting on real vectors. So we can copy it for any real space, exactly as C was built from pairs of real numbers in Definition 0.6.1.

The complexification of V is the space of formal expressions u+iv with u,v∈V, multiplied by complex numbers the way the rules of algebra dictate.

Definition 1.9.2 (Complexification)

Let V be a vector space over R. The complexification of V is the set VC:=V×V with addition and scalar multiplication by C defined, for all (u,v),(u′,v′)∈VC and a,b∈R, by (u,v)+(u′,v′):=(u+u′,v+v′),(a+bi)(u,v):=(au−bv,av+bu). We write u+iv for (u,v), and u for (u,0).

In words: addition is entry by entry. Multiplication by a+bi is the formula forced by i2=−1. The notation is honest: i(v,0)=(0v−10,00+1v)=(0,v), by Theorem 1.1.5 and Theorem 1.1.6, so (u,0)+i(v,0)=(u,v). Also a real scalar acts entrywise: a(u,v)=(au,av). So VC, restricted to real scalars, is just two copies of V.

Why VC is a vector space over C. The operations land in V×V. Addition is entrywise, so (commutativity, associativity, zero, negatives) follow from the same axioms in each entry of V, with zero (0,0) and negative (−u,−v). We check the scalar axioms that involve the multiplication of C; below, au−bv means au+(−b)v, which is the same by Theorem 1.1.8. Let α=a+bi and β=c+di with a,b,c,d∈R, and z=(u,v).

  • 1z=z: we get (1u−0v,1v+0u)=(u,v), since 0v=0 by Theorem 1.1.5.
  • α(βz)=(αβ)z: since βz=(cu−dv,cv+du), the axioms of V give α(βz)=(a(cu−dv)−b(cv+du),a(cv+du)+b(cu−dv))=((ac−bd)u−(ad+bc)v,(ac−bd)v+(ad+bc)u). Since αβ=(ac−bd)+(ad+bc)i, this is (αβ)z.
  • (α+β)z=αz+βz: with α+β=(a+c)+(b+d)i, (α+β)z=((a+c)u−(b+d)v,(a+c)v+(b+d)u)=(au−bv,av+bu)+(cu−dv,cv+du)=αz+βz.

The remaining axiom, α(z+w)=αz+αw, is Exercise (B3: Working in a Complexification).

Here is the payoff: complexifying keeps the dimension, and even keeps the basis.

Theorem 1.9.3 (A Real Basis Is a Complex Basis of the Complexification)

Let V be a vector space over R with basis (v1,…,vn). Then (v1,…,vn), that is, ((v1,0),…,(vn,0)), is a basis of VC over C. In particular dimC⁡VC=dimR⁡V.

Idea. A complex coefficient aj+bji on vj puts ajvj into the real part and bjvj into the imaginary part. So one complex combination of the vj is the same as two real combinations, one for each part, and both questions (spanning, independence) split into two real questions about (v1,…,vn).

Proof. For a,b∈R and x∈V, Definition 1.9.2 and Theorem 1.1.6 give (a+bi)(x,0)=(ax−b0,a0+bx)=(ax,bx). Call this identity (∗).

Spanning. Let (u,v)∈VC. Since (v1,…,vn) spans V, there are aj,bj∈R with u=∑jajvj and v=∑jbjvj. By (∗) and entrywise addition, ∑j=1n(aj+bji)(vj,0)=∑j=1n(ajvj,bjvj)=(∑j=1najvj,∑j=1nbjvj)=(u,v).

Independence. Let α1,…,αn∈C with ∑jαj(vj,0)=(0,0), and write αj=aj+bji with aj,bj∈R. By the same computation, (∑jajvj,∑jbjvj)=(0,0). Since (v1,…,vn) is independent over R, all aj=0 and all bj=0. Hence every αj=0.

Therefore (v1,…,vn) is a basis of VC, and dimC⁡VC=n.

As a consistency check, restricting VC back to R gives dimR⁡VC=2n by Theorem 1.9.2, which matches the fact that VC over R is two copies of V. The same proof works word for word for an infinite basis set, since every combination involves finitely many vectors.

Example (The Complexification of Rn Is Cn)

Show that the map (x,y)↦x+iy, from (Rn)C to Cn, is a bijection that respects addition and multiplication by complex scalars.

Solution. Here x+iy is computed in Cn: its k-th entry is xk+yki. Every z∈Cn has unique real and imaginary parts entry by entry (Definition 0.6.1), so exactly one pair (x,y) of real vectors maps to z. Hence the map is a bijection.

Addition is entrywise on both sides, so it is respected. For scaling, let a,b∈R. In (Rn)C, (a+bi)(x,y)=(ax−by,ay+bx), which maps to the vector with entries (axk−byk)+(ayk+bxk)i. In Cn, the k-th entry of (a+bi)(x+iy) is (a+bi)(xk+yki)=(axk−byk)+(ayk+bxk)i. The two agree, so the map respects scalar multiplication. It sends the basis (e1,…,en) of (Rn)C from Theorem 1.9.3 to the standard basis of Cn.

So (Rn)C is Cn in disguise; in Chapter 2 such a bijection will be called an isomorphism. In the same way (Mn(R))C is Mn(C), and (R[x]≤n)C is C[x]≤n. The construction earns its keep in Chapter 9, where real matrices without real eigenvalues, like the rotation above, get complex ones, and in Chapter 12, in the spectral theory of real operators.

1.9.4. Exercises

A. Check your understanding

Exercise (A1)
  • (a) Define the degree [L:K] of a subfield K⊆L.
  • (b) State the Tower Law.
  • (c) What is dimR⁡C3? Give a basis.
  • (d) True or false: every C-subspace of Cn is an R-subspace. Justify your answer.
  • (e) What is dimC⁡(M2(R))C?

Solution.

  • (a) [L:K]=dimK⁡L, where L is regarded as a vector space over K by restriction of scalars (Definition 1.9.1), when this dimension is finite.

  • (b) See Theorem 1.9.1: if (ai) is a basis of L over K and (vj) is a basis of V over L, then (aivj) is a basis of V over K, so dimK⁡V=[L:K]dimL⁡V.

  • (c) 6, with basis (e1,ie1,e2,ie2,e3,ie3), by Theorem 1.9.2.

  • (d) True. A C-subspace contains 0, is closed under addition, and is closed under multiplication by every complex number, in particular by every real number.

  • (e) 4: dimR⁡M2(R)=4 (Example (Dimensions of the Running Examples)), and Theorem 1.9.3 keeps the dimension.

B. Practice

Exercise (B1: A Tower over Q)

Find dimQ⁡Q(2)3 and a basis of Q(2)3 over Q.

Solution. By Example (Q(2) Is a Field), Q(2) is a field, so Q(2)3 is a vector space over it with basis (e1,e2,e3) and dimension 3 (Example (Dimensions of the Running Examples)). By Example (Degrees of Some Fields), (1,2) is a basis of Q(2) over the subfield Q. By Theorem 1.9.1, (e1,2e1,e2,2e2,e3,2e3) is a basis of Q(2)3 over Q. Hence dimQ⁡Q(2)3=2⋅3=6.

Exercise (B2: Complex Matrices over R)

Let E11,E12,E21,E22 be the matrix units of M2(C). Find a basis of M2(C) over R, and write A=(1+i2−i3i) in it.

Solution. The matrix units form a basis of M2(C) over C (Example (Standard Bases)). By Theorem 1.9.2, (E11,iE11,E12,iE12,E21,iE21,E22,iE22) is a basis of M2(C) over R, so dimR⁡M2(C)=8. Splitting each entry of A into real and imaginary parts, A=1E11+1(iE11)+2E12+0(iE12)+0E21+(−1)(iE21)+0E22+3(iE22).

Exercise (B3: Working in a Complexification)

Let V be a vector space over R.

  • (a) Verify that α(z+w)=αz+αw for all α∈C and z,w∈VC.
  • (b) In (R[x]≤1)C, compute (2−i)((1+x)+ix) from Definition 1.9.2, and compare with the product (2−i)(1+x+ix) computed in C[x].

Solution.

  • (a) Let α=a+bi with a,b∈R, z=(u,v) and w=(u′,v′). Then z+w=(u+u′,v+v′), and by the distributive law in V and Theorem 1.1.8, α(z+w)=(a(u+u′)−b(v+v′),a(v+v′)+b(u+u′))=((au−bv)+(au′−bv′),(av+bu)+(av′+bu′)), where we also rearranged the sums using commutativity and associativity of addition in V. The right side is (au−bv,av+bu)+(au′−bv′,av′+bu′)=αz+αw.

  • (b) Here a=2, b=−1, u=1+x and v=x. Then au−bv=2+2x+x=2+3x and av+bu=2x−(1+x)=−1+x. So the product is (2+3x)+i(−1+x). In C[x], (2−i)(1+x+ix)=2+2x+2ix−i−ix−i2x=(2+3x)+i(−1+x), the same answer.

C. Going deeper

Exercise (C1: When Is a Real Subspace Complex?)

Let W⊆Cn be a subspace over R.

  • (a) Prove that W is a subspace over C if and only if iw∈W for every w∈W.
  • (b) Deduce that if W is a subspace over C, then dimR⁡W is even.
  • (c) Show that W0={(z,z―):z∈C}⊆C2 is a subspace over R of even real dimension that is not a subspace over C. So the converse of (b) fails.

Solution.

  • (a) (⇒) If W is a C-subspace, it is closed under multiplication by i.

    (⇐) Suppose iw∈W for every w∈W. We use Theorem 1.2.1 over C. Since W is an R-subspace, 0∈W and W is closed under addition. Let w∈W and a+bi∈C with a,b∈R. Then aw∈W and b(iw)∈W, because W is closed under real scalars, and (a+bi)w=aw+b(iw) by the axioms of Cn. This lies in W by closure under addition. Hence W is a C-subspace.

  • (b) W is a subspace of the finite-dimensional C-space Cn, so by Theorem 1.6.7 it is finite-dimensional over C, and by Corollary 1.5.5 it has a basis over C, of some length k. Restricting the scalars of W to R gives the same real space as before, so dimR⁡W=2k by Theorem 1.9.2.

  • (c) Write z=a+bi with a,b∈R. Then (z,z―)=(a+bi,a−bi)=a(1,1)+b(i,−i), so W0 is the R-span of ((1,1),(i,−i)) and is an R-subspace by Theorem 1.3.1. The list is independent over R: a(1,1)+b(i,−i)=0 gives a+bi=0, so a=b=0. Hence dimR⁡W0=2. But (1,1)∈W0 while i(1,1)=(i,i)∉W0, because i―=−i≠i. By (a), W0 is not a C-subspace.

Exercise (C2: A Tower of Degree Four)

Let V={x+y3:x,y∈Q(2)}⊆R.

  • (a) Prove that 3∉Q(2).
  • (b) Regard R as a vector space over its subfield Q(2). Prove that V is a subspace with basis (1,3).
  • (c) Deduce that dimQ⁡V=4, with basis (1,2,3,6).

Hint for (a): square both sides, and argue with remainders on division by 3.

Solution.

  • (a) First, there are no integers p,q with q≠0, not both divisible by 3, and cp2=3q2 for c∈{1,2}. Indeed, if 3∤p, then p=3t±1 and cp2=c(9t2±6t+1) leaves remainder c∈{1,2} on division by 3, while 3q2 leaves remainder 0. So 3∣p, say p=3s. Then 9cs2=3q2, so q2=3cs2, and the same remainder argument (a square not divisible by 3 leaves remainder 1) gives 3∣q, a contradiction.

    Now suppose 3=a+b2 with a,b∈Q. Squaring, 3=a2+2b2+2ab2. If ab≠0, then 2=(3−a2−2b2)/(2ab)∈Q, contradicting Theorem 0.2.3. If b=0, then a2=3; writing a=p/q in lowest terms gives p2=3q2 with p,q not both divisible by 3, which is impossible. If a=0, then 2b2=3, and b=p/q in lowest terms gives 2p2=3q2, also impossible. Hence 3∉Q(2).

  • (b) Q(2) is a subfield of R by Example (Q(2) Is a Field), so R is a vector space over it by restriction of scalars. We use Theorem 1.2.1. (1) 0=0+03∈V. (2) (x+y3)+(x′+y′3)=(x+x′)+(y+y′)3∈V, since Q(2) is closed under addition. (3) For c∈Q(2), c(x+y3)=cx+(cy)3∈V, since Q(2) is closed under multiplication. So V is a subspace.

    The list (1,3) spans V by the definition of V. For independence, let x+y3=0 with x,y∈Q(2). If y≠0, then y−1∈Q(2) and 3=−xy−1∈Q(2), contradicting (a). So y=0, and then x=0. Hence (1,3) is a basis and dimQ(2)⁡V=2.

  • (c) By Example (Degrees of Some Fields), (1,2) is a basis of Q(2) over Q. By Theorem 1.9.1 applied to Q⊆Q(2) and the Q(2)-space V, the list (1⋅1,2⋅1,1⋅3,2⋅3)=(1,2,3,6) is a basis of V over Q. Hence dimQ⁡V=2⋅2=4.

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.