dr. neal, fall 2008 math 307 subspacespeople.wku.edu/david.neal/307/unit3/subspaces.pdfdr. neal,...

5
Dr. Neal, Fall 2008 MATH 307 Subspaces Let V be a vector space. A subset W is a subspace of V provided (i) W is non-empty (ii) W is closed under scalar multiplication, and (iii) W is closed under addition. In other words, W is just a smaller vector space within the larger space V . But adding elements from W keeps them in W as does multiplying by a scalar. Example 1. Let V = R 2 (the x y plane). Let W = {( x , y ) : y = mx }. Then W is simply a straight line through the origin. Is W a subspace? (i) The point (0, 0) is in W ; hence, W is non-empty. (ii) If ( x , y ) W , then for any scalar c ∈ℜ , we have c ( x , y ) = (cx , cy ) . But is this point still on the line? Yes because cy = c (mx ) = m (cx ) ; hence, c ( x , y ) is still in W . (iii) Now suppose ( x 1 , y 1 ) and ( x 2 , y 2 ) are in W . Then y 1 = mx 1 and y 2 = mx 2 . Also, ( x 1 , y 1 ) + ( x 2 , y 2 ) = x 1 + x 2 , y 1 + y 2 ( ) and y 1 + y 2 = mx 1 + mx 2 = m ( x 1 + x 2 ) ; hence, ( x 1 , y 1 ) + ( x 2 , y 2 ) is still in W . Because Properties (i) , (ii), and (iii) are satisfied, W is a subspace of R 2 . What if the line did not go through the origin? Consider U = {( x , y ) : y = mx + b } for some b 0. Then for ( x , y ) U and c 1, cy = c (mx + b) = m( cx ) + cb mx + b ; hence, U is not closed under scalar multiplication. It also can be shown that U is not closed under addition; but only one property must be disproved to show that U is not a subspace. Theorem 3.3. Let W be a subspace of a vector space V . Then 0 W . Proof. Because W must be non-empty, there exists some element w W . Because W is closed under scalar multiplication, we then have 0 = 0 w W . Corollary. If 0 W , then W cannot be a subspace. Example 2. Let V be the vector space of all 3 × 3 matrices. Let W = { A V : A 1 exists}. Is W a suspace of V ? In this vector space, the 0 element is the 3 × 3 zero matrix, which is non-invertible. Thus, 0 W , and W is not a subspace of V .

Upload: others

Post on 25-Dec-2019

12 views

Category:

Documents


0 download

TRANSCRIPT

Page 1: Dr. Neal, Fall 2008 MATH 307 Subspacespeople.wku.edu/david.neal/307/Unit3/Subspaces.pdfDr. Neal, Fall 2008 MATH 307 Subspaces Let € V be a vector space. A subset € W is a subspace

Dr. Neal, Fall 2008 MATH 307 Subspaces

Let

V be a vector space. A subset

W is a subspace of

V provided (i)

W is non-empty (ii)

W is closed under scalar multiplication, and (iii)

W is closed under addition. In other words,

W is just a smaller vector space within the larger space V . But adding elements from

W keeps them in

W as does multiplying by a scalar. Example 1. Let

V = R2 (the

x y plane). Let

W = {(

x ,

y) :

y = m x }. Then

W is simply a straight line through the origin. Is

W a subspace? (i) The point (0, 0) is in

W ; hence,

W is non-empty. (ii) If (

x ,

y)

∈W , then for any scalar

c ∈ ℜ, we have c (x, y) = (c x, c y) . But is this point still on the line? Yes because c y = c (m x) = m (c x) ; hence, c (x, y) is still in

W . (iii) Now suppose (x1,y1) and (x2, y2 ) are in

W . Then y1 = m x1 and y2 = m x2 . Also, (x1,y1) + (x2, y2) = x1 + x2,y1 + y2( ) and y1 + y2 = mx1 +m x2 = m (x1 + x2) ; hence, (x1,y1) + (x2, y2) is still in

W . Because Properties (i) , (ii), and (iii) are satisfied,

W is a subspace of R2 . What if the line did not go through the origin? Consider

U = {(

x ,

y) :

y = m x + b} for some

b ≠ 0. Then for (

x ,

y)

∈U and

c ≠ 1, c y = c (m x + b) = m(c x) + cb ≠ m x + b ; hence,

U is not closed under scalar multiplication. It also can be shown that

U is not closed under addition; but only one property must be disproved to show that

U is not a subspace. Theorem 3.3. Let

W be a subspace of a vector space V . Then

0

∈W . Proof. Because

W must be non-empty, there exists some element

w

∈W . Because

W is closed under scalar multiplication, we then have

0 = 0

w

∈W . Corollary. If

0

W , then

W cannot be a subspace. Example 2. Let

V be the vector space of all 3

×3 matrices. Let

W = {

A

∈ V :

A−1 exists}. Is

W a suspace of

V ? In this vector space, the

0 element is the 3

×3 zero matrix, which is non-invertible. Thus,

0

W , and

W is not a subspace of

V .

Page 2: Dr. Neal, Fall 2008 MATH 307 Subspacespeople.wku.edu/david.neal/307/Unit3/Subspaces.pdfDr. Neal, Fall 2008 MATH 307 Subspaces Let € V be a vector space. A subset € W is a subspace

Dr. Neal, Fall 2008

Proving that a Subset is a Subspace Let

W be a subset of a vector space

V . Then

W must have some defining property that distinguishes its elements from the other elements in

V . To show that

W is actually a subspace, we must verify three properties: (i)

W must be non-empty; (ii)

W must be closed under scalar multiplication; and (iii)

W must be closed under addition. (i) The zero vector

0 must always be in any subspace. So to show

W is non-empty, it is usually easiest to show that

0 is in

W . That is, you must argue that the specific zero vector of the vector space

V under consideration has the defining property of the set

W . Then conclude that

W is non-empty. (ii) To show

W is closed under scalar multiplication, (a) Let

w ∈W . (b) Then state what it means for

w to be in

W ; i.e., explain the defining property. (c) Let

c be any scalar (i.e., real number). (d) Argue that

c w has the defining property of

W . (e) Conclude that

W is closed under scalar multiplication. (iii) To show

W is closed under addition, (a) Let

w1 and

w2 be in

W . (b) Then state what it means for

w1 and

w2 to be in

W ; i.e., explain that they have the defining property. (c) Argue that

w1 + w2 has the defining property of

W . (e) Conclude that

W is closed under addition. (iv) Conclude that

W is a subspace of

V . Throughout, you may use different symbols that are more appropriate to the context of the problem. But throughout, use complete sentences to explain what you are doing, use correct mathematical logic, do not skip steps, and give conclusions. Note: We also can combine requirements (ii) and (iii) and show instead that for any scalar

c and vectors

w1 and

w2 in

W , that

c w1 + w2

∈W . Example 2. Let

V = C[a, b] be the set of continuous functions over

[a, b], where

a < b. Let

a < d < b and let

D = { f ∈ V ′ f (d) exists}. Then

D is a subspace of

V . Proof. Let

f0 be the zero function (i.e.,

f0(x) = 0 for all

x ∈ [a, b]). Then

′ f 0(x) = 0 for all

x ∈ (a, b); thus,

′ f 0(d) exists (and equals 0). So

f0 ∈ D and

D is non-empty. Let

f ∈ D. Then

′ f (d) exists. For any scalar

c ,

cf is still a continuous function and

(cf ′ ) (d) = c( ′ f (d)) still exists. Thus,

cf ∈ D and

D is closed under scalar multiplication. Let

f , g∈ D so that

′ f (d) and

′ g (d) exist. Then

f + g is still a continuous function and

( f + g ′ ) (d) = ′ f (d) + ′ g (d) still exists. Thus,

f + g∈ D and

D is closed under addition.

Whence,

D is a subspace of

C[a, b]. - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - Example 3. Let

V = R3 and let

W = {(

x ,

y ,

z ) :

z = 0} . Then (0, 0, 0)

∈W ; so

W is non-empty. For vectors

(x1,y1, 0) and

(x2,y2, 0) in

W and for any scalar

c , we have

c (x1,y1, 0) + (x2,y2, 0) = (c x1 + x2, c y1 + y2, 0)

∈W . Hence,

W is a subspace of R3.

Page 3: Dr. Neal, Fall 2008 MATH 307 Subspacespeople.wku.edu/david.neal/307/Unit3/Subspaces.pdfDr. Neal, Fall 2008 MATH 307 Subspaces Let € V be a vector space. A subset € W is a subspace

Dr. Neal, Fall 2008 Example 4. Let T : Rn→ Rm be a linear transformation. Then

kerT is a subspace of Rn .

Recall: For T : Rn→ Rm ,

kerT = {x ∈ Rn T(x) = 0 m}.

Proof. Let

0 n be the zero vector in Rn and let

0 m be the zero vector in Rm . Then for any

linear transformation T : Rn→ Rm , we have

T( 0 n ) =

0 m . Thus,

0 n ∈ kerT . Hence,

kerT is non-empty. Let x ∈kerT . Then

T(x) = 0 m . If

c is any scalar, then

c x is still in Rn and

T(c x) = cT(x) = c 0 m =

0 m ; hence, c x ∈kerT . Thus,

kerT is closed under scalar multiplication. Let

u, v ∈ kerT . Then

T(u) = 0 m = T(v) . Then

T(u + v) = T(u) + T(v) = 0 m +

0 m =

0 m ;

hence,

u + v ∈ kerT and

kerT is closed under addition. Ergo,

kerT is a subspace of Rn .

- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - Recall that a linear transformation T : Rn→ Rm has an

m × n matrix representation A . Then in matrix form,

kerT is simply all solutions to the homogeneous system

AX = 0 . Thus, we can re-state Example 4 in matrix form as: Example 5. Let

V be the vector space of all

n ×1 matrices. Let A be an

m × n matrix. The set of all

n ×1 matrices X such that

AX = 0 forms a subspace of

V . That is, the solution space to the homogeneous system AX = 0 is a subspace of

V . - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - Example 6. Let

S = {

u 1, . . .,

u m} be a collection of

m vectors in Rn . The set span(S) is the collection of all linear combinations of the vectors in

S. Then span(S) is a subspace of Rn . Proof. (i) First,

0 n =

0 u 1 + . . .+ 0 u m is a linear combination of the vectors in

S; thus,

0 n ∈ span(S) and span(S) is non-empty. (ii) Next, suppose

u ∈ span(S) . Then

u can be written as

u = c1 u 1 + . . .+ cm

u m. For any scalar

c , we then have

c u = c(c1 u 1 + . . .+ cm

u m) = (cc1) u 1 + . . .+ (ccm )

u m , which is still a linear combination of the vectors in

S . Thus,

c u ∈ span(S) and span(S) is closed under scalar multiplication. (iii) Now let

u , v ∈ span(S) . Then

u and

v can be written as

u = c1 u 1 + . . .+ cm

u m and

v = d1 u 1 + . . .+ dm

u m . Then

u + v = (c1 u 1 + . . .+ cm

u m ) + (d1 u 1 + . . .+ dm

u m)= (c1 + d1)

u 1 + . . .+ (cm + dm ) u m

which is still a linear combination of the vectors in

S. Thus,

u + v ∈ span(S) and span(S) is closed under addition. Therefore, span(S) is a subspace of Rn .

Page 4: Dr. Neal, Fall 2008 MATH 307 Subspacespeople.wku.edu/david.neal/307/Unit3/Subspaces.pdfDr. Neal, Fall 2008 MATH 307 Subspaces Let € V be a vector space. A subset € W is a subspace

Dr. Neal, Fall 2008

Other Examples of Subspaces / Non-Subspaces (i) Let Pn be the vector space of real polynomials having degree ≤

n . (a) For

0 ≤ m < n , Pm is a subspace of Pn . (b) The subset of those polynomials having only non-negative coefficients {a0 + a1x + . . . + anx

n : all ai ≥ 0} is not a subspace because it is not closed under multiplication by negative scalars. (ii) Let F(–∞, ∞) be the vector space of all real-valued functions f with domain (–∞, ∞). (a) The subset of continuous functions C(–∞, ∞) is a subspace (the sum of continuous functions is still continuous as is the scalar product, and there does exist at least one continuous function). (b) Fix one x0 . The subset of functions f such that f (x0 ) = 0 is a subspace of F(–∞, ∞) . Indeed, the function f (x) = x − x0 is in the subset, and (c f + g)(x0) = c f (x0 ) + g(x0) = 0 for functions f and g in the subset; hence, the subset is non-empty and closed. (c) The subset of functions f such that lim

x→af (x) = b is not a subspace for

b ≠ 0.

Clearly, this subset is not closed under scalar multiplication for

c ≠ 1. But is it a subspace for

b = 0? (iii) Let Mn,n be the vector space of all

n × n matrices. (a) Let

W = A : Tr(A) = b{ }. Then

W is a subspace if and only if

b = 0. (b)

Sn,n = A : AT = A{ } (

n × n symmetric matrices). Then Sn,n contains the

n × n

identity, and Sn,n is closed by means of the theorems (c A)T = c AT and

(A + B)T = AT + BT . Hence, Sn,n is a subspace of Mn,n .

Page 5: Dr. Neal, Fall 2008 MATH 307 Subspacespeople.wku.edu/david.neal/307/Unit3/Subspaces.pdfDr. Neal, Fall 2008 MATH 307 Subspaces Let € V be a vector space. A subset € W is a subspace

Dr. Neal, Fall 2008 MATH 307 Homework on Subspaces

1. Let

V be the vector space of all 3 x 3 matrices. Let

W be the subset of

V consisting of those matrices that have all 0’s down the main diagonal. Prove that

W is a subspace of

V . 2. Let T : Rn→ Rm be a linear transformation. The set RangeT is the set of vectors

b in Rm for which there exists a vector

v in Rn such that T (v) =

b. Prove that RangeT is a subspace of Rm . That is, verify that (i) RangeT is non-empty (that there is an element in Rm that has a pre-image); (ii) that RangeT is closed under scalar multiplication; and (iii) that RangeT is closed under addition. 3. Determine if the subsets

W are subspaces of the vector space

V . If so, prove it. If not, give an example of a vector or vectors in the subset for which scalar multiplication or addition fails to be closed. (a) Vector space

V = 2 x 2 matrices; Subset

W = {A

∈ V : det(

A) = 10}. (b) Vector space

V =

n × n matrices; Subset

W = {A

∈ V : AT = –A }. (c) Vector space

V = All Real Numbers; Subset

W = the rational numbers. (d) Vector space V = C[a, b] (i.e., continuous functions on the interval [a, b] .);

Subset W = { f

∈ C[a, b] : f (x)a

b

∫ dx = 0}.