Chapter one :Vectors and matrices

1.1. Vectors, basis and Components

 if a matrix has only one row or one column is called a vector.
 A matrix having only one row is called a row vector example the 1x3 matrix
A= is a row matrix b/c it has only one row .
 A matrix having only one column is called a column vector example the 2x1
matrix
A= is column vector b/c it has only one column .
 A matrix having only one row and one column is called scalar
example the 1x1 matrix A= is a scalar. in other words scalar is a single
number.
Algebra of vectors
 Vector algebra is defined as types of algebra where the elements are
in vector form and their algebraic operation follow the vector laws.
 What are the laws of vector addition? The main law of vector
addition are : commutative :- A+B=B+A
Associative :- A+(B+C)=(A+B)+C
 What are the types of vector multiplication ?
The main law of vector multiplication are:
Dot product :- P.Q=|P||Q| cos
cross product :-PxQ=|P||Q| sin
Basis Vectors and Components
A vector is an arrow with a length and a direction .just like positions
 To describe vector mathematically we write them as a combination of
basis vectors.
 Any other vector can be written as linear combination of the basis
vectors .
 Components of a vectors

The numbers , and are called the components of in i , j and k, basis .if
we are 2D then will only have two components for a vector.
 1.2 General Vector Spaces

Definition
A vector space is a set V of elements called vectors, having operations of
addition and scalar multiplication defined on it that satisfy the following
conditions.
Let u, v, and w be arbitrary elements of V, and c and d are scalars.
• Closure Axioms
1. The sum u + v exists and is an element of V. (V is closed under addition.)
2. cu is an element of V. (V is closed under scalar multiplication.)
 Definition of Vector Space (continued)
• Addition Axioms
3. u + v = v + u (commutative property)
4. u + (v + w) = (u + v) + w (associative property)
5. There exists an element of V, called the zero vector, denoted 0, such
that u + 0 = u.
6. For every element u of V there exists an element called the negative of
u, denoted -u, such that u + (-u) = 0.
• Scalar Multiplication Axioms
7. c(u + v) = cu + cv
8. (c + d)u = cu + du
9. c(du) = (cd)u
10. 1u = u
 1.3 Linear Combinations of Vectors
W={(a, a, b) | a,b R}  R3

(a, a, b) = a (1,1,0) + b (0,0,1)

W is generated by (1,1,0) and (0,0,1).
e.g., (2, 2, 3) = 2 (1,1,0) + 3 (0,0,1)
(-1, -1, 7) = -1 (1,1,0) + 7 (0,0,1).

Definition
Let v1, v2, …, vm be vectors in a vector space V.
We say that v, a vector of V, is a linear combination of
v1, v2, …, vm , if there exist scalars c1, c2, …, cm such that
v can be written v = c1v1 + c2v2 + … + cmvm .
 Example 1
Determine whether or not the vector (-1, 1, 5) is a linear
combination of the vectors (1, 2, 3), (0, 1, 4), and (2, 3, 6).
Solution
Suppose c1 (1, 2, 3)  c2 (0, 1, 4)  c3 (2, 3, 6)  (1, 1, 5)
(c1 , 2c1 , 3c1 )  (0, c2 , 4c2 )  (2c3 , 3c3 , 6c3 )  (1, 1, 5)
(c1  2c3 , 2c1  c2  3c3 , 3c1  4c2  6c3 )  (1, 1, 5)
 c1  2c3  1

  2c1  c2  3c3  1  c1  1, c2  2, c3  1
 3c  4c  6c  5
 1 2 3

Thus (-1, 1, 5) is a linear combination of (1, 2, 3), (0, 1, 4),

(1, 1, 5)  (1, 2, 3)  2(0, 1, 4)  1(2, 3, 6).
and (2, 3, 6), where
 Example 2
Show that the vector (3, -4, -6) cannot be expressed as a linear
combination of the vectors (1, 2, 3), (-1, -1, -2), and (1, 4, 5).
Solution
Suppose
c1 (1, 2, 3)  c2 (1,  1,  2)  c3 (1, 4, 5)  (3,  4,  6)

 c1  c2  c3  3

 2c1  c2  4c3  4
3c  2c  5c   6
 1 2 3

This system has no solution.

Thus (3, -4, -6) is not a linear combination of the vectors
(1, 2, 3), (-1, -1, -2), and (1, 4, 5).
 Example 3
 1 7
Determine whether the matrix   is a linear combination
 8  1
of the matrices 
1 0 2  3
, and 
0 1 in the vector space
,
2 1 0 2  2 0
M22 of 2  2 matrices.
Solution
Suppose  1 0  2  3  0 1  1 7 
c1 c c 
2 1 2 0 2  3 2 0  8  1

Then
 c1  2c2  3c2  c3   1 7 
2c  2c  
 1 3 c1  2c2   8  1
  c1  2c2  1

 3c2  c3  7

 2c1  2c3  8
 c1  2c2  1
This system has the unique solution c1 = 3, c2 = -2, c3 = 1.
Therefore
 1 7   31 0  2 2  3  0 1
 8  1 2 1 0 2  2 0