Linear Algebra 2.1.

1: Matrix Operations
 Addition and subtraction of matrices are only defined if and only if the matrices have the same size. The resulting matrix will
have the same size as the matrices being operated upon.
 Matrix addition involve adding entries based on corresponding entries.
 A+ B=B+ A
 ( A+ B ) +C= A+( B+C)
 A+0= A
 r ( A+ B )=rA+ rB
 ( r +5 ) A=rA +5 A
 r ( sA ) =( rs ) A

Example

A=
[ 12
3 5
4 6
∧B=
] [
−4 −3 −2
2 4 6
∧C=
0
1 ] []

[
A+ B= (−4+1) (−3+3) (−2+5) = −3 0 3
(2+2) ( 4+ 4) (6+6) ][
4 8 12 ]
 A+C is not valid due to dimensional differences.
 A−B=
[
(1−(−4 ) ) (3−(−3)) (5−(−2)) 5 6 7
(2−2) (4−4 ) (6−6)
=
][
0 0 0 ]
 2 A=2
[
1 3 5
2 4 6
=
][ 2 6 10
4 8 12 ]
 3 A−2 B=3
[
1 3 5
2 4 6 ]+ (−2 )
2[
−4 −3 −2
4 6
=
][
3 9 15
+
8 6 4
6 12 18 −4 −8 −12][
=
11 15 19
2 4 6 ][ ]
Linear Algebra 2.1.2: Multiplication and Transpose
 Matrix Multiplication: If A is an m∗n matrix and B is an n∗p matrix with columns b 1 , b2 , … , b p . Then the product AB is
the m∗p matrix whose columns are Ab1 , A b2 , … , A b p. That is AB= A [ b1 , b2 , … , b p ] =[ A b1 , A b 2 , … , A b p ].
 A is an m∗n matrix and B is an n∗p matrix, the n is the same for both matrix therefore the dimensions are
consistent for the matrix multiplication.
 If the columns of A is equal to the rows of B then the dimensions are consistent for multiplication.
 The new matrix will have the same dimensions of an m∗p matrix.
 Transpose: Given an m∗n matrix A is the transpose denoted AT , is an n∗m matrix whose columns are formed by the rows
of A .
 In general, AB≠ BA .
 If AB= AC , it is not required that B=C .
 If AB=0 , you cannot conclude that A=0 or B=0 .
 Matrices have the following properties:
 A(BC )=( AB) C
 A ( B+C )=AB+ AC
 ( B+C ) A=BA +CA
 r ( AB )=( rA ) B=A (rB )
 I m A= A I n= A
 Matrix transposes have the following properties:
T
 ( AT ) =A
 ( A+ B )T = AT + BT
 ( rA )T =r ( A T )
 ( AB )T =BT A T
Example
  A=
4 1
5 2[ ]
and B=
0 1 3
−2 2 0 [ ]
 A is a 2∗2 and B is a 2∗3 and because the columns of A is equal to the rows of B the dimensions works.
4 1 0
5 2 −2 [ ][ ] [
=
( 4∗0 ) +(1∗−2) −2
( 5∗0 ) +(2∗−2) −4
=
][ ]
4 1 1
5 2 2 [ ][ ] [
=
( 4∗1 ) +(1∗2) 6
=
( 5∗1 ) +(2∗2) 9 ][]
[ 45 12][30 ]=[ (( 4∗3
5∗3 ) +(2∗0) ] [ 15 ]
) +(1∗0) 12
=

AB=
[−4 9 15 ]
−2 6 12

[ ] [ ]
1 5 9
1 2 3 4
T 2 6 10
 A3∗4= 5 6 7 8 therefore A 4∗3=
3 7 11
9 10 11 12
4 8 12

Linear Algebra 2.2.1: The Inverse of a 2∗2Matrix

 If a 2∗2 matrix is invertible the following must be true. Consider the matrix [ ac bd ] , and if ad −bc ≠ 0. Then the matrix is

invertible.
1
 ad −bc ≠ 0 is the determent or more accurately is the determinant.
ad−bc
 For a 2∗2 matrix the inverse can be found using the following formula.

 A=
[ ac bd ] and ad −bc ≠ 0 then the matrix is invertible.

 A =
−1 1 d −b
ad−bc −c a [ ]
Example:

A=
[ 20 14 ]
det=ad−bc=8

[ ]
1 −1
A =
[
−1 1 4 −1
8 0 2
→
2
0
]8
−1
4

Linear Algebra 2.2.2: Solving 2∗2 Systems With the Inverse and Inverse Properties
 If A is an inveratble n∗m matrix, then for each b in Rn . The equation Ax=b has the unique solution x= A−1 b .
−1
 If A is invertible, then A−1 is invertible and ( A−1 ) = A .
−1 −1 −1
 If A and B are n∗n matricies, then so is AB, and ( AB ) =B A .
−1 T
 If A is an inveratbel matrix, then so is AT , and ( AT ) =( A−1 ) .

Example
3 x 1+ 4 x 2=3
5 x 1+6 x 2=7
A=
[ ]
3 4
5 6
 −1
A =
1 d −b
ad−bc −c a [ ]
[ ]
−3 −2
−1
A =
1 −6 −4
( 3∗6 )−(4∗5) −5 −3 [ → −5
2
] −3
2
−1
A b=x

[ [
][ ] ( ) ( ]
−3 −2 (−3∗3 ) +(2∗7)

) 3]
[
3 5
−5 −3 = 5 −3 →
7 ∗3 + ∗7
2 2 2 2
x 1=5∧x 2=3

Linear Algebra 2.2.3: Elementary Matrices and An Algorithm for Finding A Inverse
 Only square matrices are invertible.
 An n∗m matrix A is invertable if and only if A is row equlivent to I n and any sequence of elementary row operation that
reduces A to I n is also transforms I n to A−1.
 Assuming A is invertable. Since Ax=b has a unique solution. For every b, then A has a pivot position in every row. Since
A is a square, the pivots are in the diagonal, which implies RREF of A is I n or A I n.
 To find the inverse of matrix, just make the augmented matrix the identity matrix, and whatever changes done to the
augmented matrix is reflected in the identity matrix.

Example

[ ]
1 0 0 ¿8 3 1

[ ]
−1 −0 −2 ¿ 1 0 0
0 1 0 ¿ 10 4 1
A= −3 −1 −4 ¿ 0 1 0 → RREF →
7 3 1
−2 −3 −4 ¿ 0 0 1 0 0 1 ¿
2 2 2

[ ]
8 3 1
−110 4 1
A =
7 3 1
2 2 2

Linear Algebra 2.3.1: Characterization of Invertible Matrices

 If A is an n∗n (square matrix) the following are equivalent:
 A is an invertible matrix.
 A has n pivot positions.
 Ax=0 has only the trivial solution.
 The columns of A form a linearly independent set.
 The linear transformation x → Ax is one to one.
 The equation Ax=b has at least one solution in each b Rn .
 The linear transformation x → Ax maps to Rn to Rn .
 There is an n∗m matrix C such that CA=I n .
 There is an n∗n matrix such that AD=I n,
 I In
 The columns of span Rn .
 AT is an invertible matrix.

Example

[ ]
1 2 3
 Determine if A= 4 5 6 is invertible without finding A−1.
7 8 9
 [ ][ ][ ]
1 2 3 1 2 3 1 2 3
4 5 6 0 −3 −6 0 1 2
7 8 9 0 −6 −12 0 0 0
 We cannot find A−1 since there is not a pivot in every row.

[ ]
1 0 −2
 Determine if A= 3 1 −2 is invertible without finding −1
A .
−5 −1 9

[ ][ ][ ]
1 0 −2 1 0 −2 1 0 −2
3 1 −2 0 1 4 0 1 4
−5 −1 9 0 −1 −1 0 0 3
−1
 We cannot find A since there is a pivot in every row.