Scribd
Upload
154 views14 pages

MATH 304 Linear Algebra Vector Spaces

This document discusses linear algebra concepts including: - Vector spaces are sets with operations of vector addition and scalar multiplication that satisfy certain properties. - Examples of vector spaces include Rn, matrices, and functional spaces. - Linear operations on vectors and matrices include addition, subtraction, and scalar multiplication. These operations must satisfy properties like commutativity, associativity, and distributivity.

Uploaded by

Hamid
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
154 views14 pages

MATH 304 Linear Algebra Vector Spaces

This document discusses linear algebra concepts including: - Vector spaces are sets with operations of vector addition and scalar multiplication that satisfy certain properties. - Examples of vector spaces include Rn, matrices, and functional spaces. - Linear operations on vectors and matrices include addition, subtraction, and scalar multiplication. These operations must satisfy properties like commutativity, associativity, and distributivity.

Uploaded by

Hamid
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 14

MATH 304

Linear Algebra
Lecture 11:
Vector spaces.
Linear operations on vectors

Let x = (x1 , x2 , . . . , xn ) and y = (y1 , y2 , . . . , yn ) be


n-dimensional vectors, and r R be a scalar.

Vector sum: x + y = (x1 + y1 , x2 + y2 , . . . , xn + yn )


Scalar multiple: r x = (rx1 , rx2 , . . . , rxn )
Zero vector: 0 = (0, 0, . . . , 0)
Negative of a vector: y = (y1 , y2 , . . . , yn )
Vector difference:
x y = x + (y) = (x1 y1 , x2 y2 , . . . , xn yn )
Properties of linear operations
x+y =y+x
(x + y) + z = x + (y + z)
x+0=0+x=x
x + (x) = (x) + x = 0
r (x + y) = r x + r y
(r + s)x = r x + sx
(rs)x = r (sx)
1x = x
0x = 0
(1)x = x
Linear operations on matrices
Let A = (aij ) and B = (bij ) be mn matrices,
and r R be a scalar.
Matrix sum: A + B = (aij + bij )1im, 1jn

Scalar multiple: rA = (raij )1im, 1jn

Zero matrix O: all entries are zeros


Negative of a matrix: A = (aij )1im, 1jn

Matrix difference: A B = (aij bij )1im, 1jn

As far as the linear operations are concerned,


the mn matrices have the same properties as
mn-dimensional vectors.
Vector space: informal description

Vector space = linear space = a set V of objects


(called vectors) that can be added and scaled.
That is, for any u, v V and r R expressions
u + v and r u
should make sense.
Certain restrictions apply. For instance,
u + v = v + u,
2u + 3u = 5u.
That is, addition and scalar multiplication in V
should be like those of n-dimensional vectors.
Vector space: definition

Vector space is a set V equipped with two


operations : V V V and : R V V
that have certain properties (listed below).

The operation is called addition. For any


u, v V , the element (u, v) is denoted u + v.

The operation is called scalar multiplication. For


any r R and u V , the element (r , u) is
denoted r u.
Properties of addition and scalar multiplication
(brief)

A1. a+b=b+a
A2. (a + b) + c = a + (b + c)
A3. a+0=0+a=a
A4. a + (a) = (a) + a = 0
A5. r (a + b) = r a + r b
A6. (r + s)a = r a + sa
A7. (rs)a = r (sa)
A8. 1a = a
Properties of addition and scalar multiplication (detailed)

A1. a + b = b + a for all a, b V .


A2. (a + b) + c = a + (b + c) for all a, b, c V .
A3. There exists an element of V , called the zero
vector and denoted 0, such that a + 0 = 0 + a = a
for all a V .
A4. For any a V there exists an element of V ,
denoted a, such that a + (a) = (a) + a = 0.
A5. r (a + b) = r a + r b for all r R and a, b V .
A6. (r + s)a = r a + sa for all r , s R and a V .
A7. (rs)a = r (sa) for all r , s R and a V .
A8. 1a = a for all a V .
Associativity of addition implies that a multiple
sum u1 + u2 + + uk is well defined for any
u1 , u2 , . . . , uk V .

Subtraction in V is defined as usual:


a b = a + (b).

Addition and scalar multiplication are called


linear operations.
Given u1 , u2 , . . . , uk V and r1 , r2 , . . . , rk R,
r1 u1 + r2 u2 + + rk uk
is called a linear combination of u1 , u2 , . . . , uk .
Examples of vector spaces

In most examples, addition and scalar multiplication


are natural operations so that properties A1A8 are
easy to verify.
Rn : n-dimensional coordinate vectors
Mm,n (R): mn matrices with real entries
R : infinite sequences (x1 , x2 , . . . ), xi R
For any x = (x1 , x2 , . . . ), y = (y1 , y2 , . . . ) R and r R
let x + y = (x1 + y1 , x2 + y2 , . . . ), r x = (rx1 , rx2 , . . . ).
Then 0 = (0, 0, . . . ) and x = (x1 , x2 , . . . ).

{0}: the trivial vector space


0 + 0 = 0, r 0 = 0, 0 = 0.
Functional vector spaces

F (R): the set of all functions f : R R


Given functions f , g F (R) and a scalar r R, let
(f + g )(x) = f (x) + g (x) and (rf )(x) = rf (x) for all x R.
Zero vector: o(x) = 0. Negative: (f )(x) = f (x).

C (R): all continuous functions f : R R


Linear operations are inherited from F (R). We only need to
check that f , g C (R) = f +g , rf C (R), the zero
function is continuous, and f C (R) = f C (R).

C 1 (R): all continuously differentiable functions


f :RR
C (R): all smooth functions f : R R
P: all polynomials p(x) = a0 + a1 x + + an x n
Some general observations

The zero is unique.


If z1 and z2 are zeros then z1 = z1 + z2 = z2 .

For any a V , the negative a is unique.


Suppose b and b are negatives of a. Then
b = b + 0 = b + (a + b) = (b + a) + b = 0 + b = b.

0a = 0 for any a V .
Indeed, 0a + a = 0a + 1a = (0 + 1)a = 1a = a.
Then 0a + a = a = 0a + a a = a a = 0a = 0.

(1)a = a for any a V .


Indeed, a + (1)a = (1)a + a = (1)a + 1a = (1 + 1)a
= 0a = 0.
Counterexample: dumb scaling
Consider the set V = Rn with the standard
addition and a nonstandard scalar multiplication:
r a = 0 for any a Rn and r R.

Properties A1A4 hold because they do not involve


scalar multiplication.
A5. r (a + b) = r a + r b 0 = 0 + 0
A6. (r + s) a = r a + s a 0 = 0 + 0
A7. (rs) a = r (s a) 0 = 0
A8. 1 a = a 0 = a
A8 is the only property that fails. As a consequence,
property A8 does not follow from properties A1A7.
Counterexample: lazy scaling

Consider the set V = Rn with the standard


addition and a nonstandard scalar multiplication:
r a = a for any a Rn and r R.

Properties A1A4 hold because they do not involve


scalar multiplication.
A5. r (a + b) = r a + r b a + b = a + b
A6. (r + s) a = r a + s a a = a + a
A7. (rs) a = r (s a) a = a
A8. 1 a = a a = a
The only property that fails is A6.

You might also like