T1 Matrizes

Denition and Representation of a Matrix Basi
Con epts of Matri es Operations with Matri es
Linear Algebra and Analyti al Geometry

Matri es
Susana Ni ola
Jorge Mendonça
Carla Pinto
Department of Mathemati s
Instituto Superior de Engenharia do Porto
Linear Algebra and Analyti al Geometry

1 Semester 17-18
s aisep.ipp.pt; jpmisep.ipp.pt; apisep.ipp.pto DMA-ISEP
1 / 44
Denition and Representation of a Matrix Basi Con epts of Matri es Operations with Matri es
Contents
1 Denition and Representation of a Matrix
2 Basi Con epts of Matri es
3 Operations with Matri es
s aisep.ipp.pt; jpmisep.ipp.pt; apisep.ipp.pt DMA-ISEP

Linear Algebra and Analyti al Geometry 2 / 44
Introdu tion
- Many di ult problems an be handled easily on e relevant

information is organized in a ertain way.
- How to organize information in ases where ertain mathemati al
stru tures are present. - Linear algebra is the study of ve tors and
linear fun tions.
- Ve tors are things you an add and linear fun tions are fun tions
of ve tors that respe t ve tor addition.
- The goal of this subje t is to tea h you to organize information
about ve tor spa es in a way that makes problems involving linear
fun tions of many variables easy. (Or at least tra table.)

Denition of a matrix
Denition
A matrix is a re tangular array of numbers in R. The indi-
vidual numbers are alled entries, aij of the matrix and refer
to them by their row and j olumn numbers.The rows are
numbered 1, 2, ...from the top and the olumns are numbered
1, 2, ... from left to right.
The order/dimension of a matrix is determined by the produ t

of row ith and jth olumn, i.e, i × j .

Representation of a matrix
 
a11 a12 · · · a1j
 a21 a22 · · · a3j 
A = [aij ] =  .. .. . . .. 
 
 . . . . 
a1j a2j · · · aij
where aij ∈ ℜ, i = 1...m, j = 1, ...n. A matrix may also be
represented by a short form:
A = [aij ] , i = 1, 2, ...m, j = 1, 2, ...n

We dene M is the set of all matri es with m rows and n olumns,
where all the matrix elements are real numbers.
Example

1 2 3
Let A =
2 4 −1
Matrix A has dimension 2 × 3, i.e, 2 rows and 3 olumns,
thus A ∈ M2×3 . The element lo ated in the 2nd row and
3rd olumn of the matrix A is a23 = −1.

Example
Week days Monday Tuesday Wednesday Thursday Friday Saturday
ALGAN 0 1 0 0 4 1
APROG 2 3 1 3 0 0
AMATA 0 2 2 0 3 2
PRECOMP 3 0 0 2 2 0
 
0 1 0 0 4 1
 2 3 1 3 0 0 
Let A = 
 0

2 2 0 3 2 
3 0 0 2 2 0


Example
Let
 
1 2 3
1 0 3
A3×3 = −2 0 1
  B2×3 =
0 0 1
2 −3 7

1
C1×3 = 1 0 3 D3×1 = 0 
  −2
1 0 0
E3×3 = 0 1 0 
0 0 1

Row Matrix
A matrix with one row is alled a row matrix or a row ve tor,
i.e
A = [aij ] = a11 · · · a1n
Example

A1×4 = 1 2 3 4

Column Matrix
A matrix with one olumn is alled a olumn matrix or a
olumn ve tor, i.e
 
a11
A = [aij ] =  · · · 
an1

Example
 
1
 2 
A4×1 = 
 3 
4

Re tangular Matrix
A re tangular matrix is a matrix whose size is not the same
in both dimensions, i.e, m 6= n.
Square Matrix
A square matrix is a matrix with the same numbers of rows
and olumns, i.e,m = n

Main Diagonal of a Matrix

The main diagonal of a matrix onsists of those elements that
lie on the diagonal that runs from top left to bottom right.
If the matrix is A, then its main diagonal are the elements
who's row number and olumn number are equal,ajj .
 
a11 a12 · · · a1n
 a21 a22 · · · a2n 
A = [aij ] =  . .. . . .. 
 
 .. . . . 
a1j a2j · · · ann

Diagonal Matrix
A square matrix
A = [aij ]
is alled a diagonal matrix, if o-diagonal elements are equal
to zero or, symboli ally, aij = 0 for all i 6= j .
 
a11 0 · · · 0
 0 a22 · · · 0 
A = [aij ] =  .. .. . . .. 
 
 . . . . 
0 0 0 ann

Upper Triangular Matrix
A ∈ Mnn
a square matrix. A square matrix has an upper triangular
form, if all its elements below the main diagonal are zero,
su h that,
 
a11 a12 · · · a1n
 0 a22 · · · a2n 
A = [aij ] =  .. .. . . .. 
 
 . . . . 
0 0 0 ann

Lower Triangular Matrix
A ∈ Mnn
a square matrix. A square matrix has a lower triangular form,
if all its elements above the main diagonal are zero, su h that,
 
a11 0 · · · 0
 a21 a22 · · · 0 
A = [aij ] =  .. .. . . .. 
 
 . . . . 
an1 an2 · · · ann

Zero/Null Matrix
A matrix is alled a zero-matrix (0-matrix), if it onsists of
only zero elements: a[ ij] = 0 for ea h i, j . In a short form, a
zero-matrix, O, is written as:
 
0 0 ··· 0
 0 0 ··· 0 
O = [Oij ] =  . . . .. 
 
 .. .. .. . 
0 0 0 0

The n × n Identity Matrix

Any identity matrix I of n dimension, denoted In , is a matrix
diagonal elements are equal to unity:
 
1 0 ··· 0
 0 1 ··· 0 
I = [In ] =  .. .. . . .. 
 
 . . . . 
0 0 ··· 1

Matri es of the same type

Two matri es with the same number of rows and olumns are
matri es of the same type.
Homologous Elements
Elements that o upy the same position in two matri es of
the same type are alled homologous elements. They are also
alled orresponding elements.
Equality of two Matri es

Two matri es, A and B, are equal, if they have the same size
and their homologous elements are equal.
Transpose of matrix AT of A
The transpose of a matrix A is obtained by writing the rows as
olumns (and/or writing the olumns as rows). More pre isely,
we an take the transpose of any m × n matrix A.If we write
the entries of the rst row a11 ; a12 ....a1n down the rst olumn
of the transpose, the entries a21 ; a22 ....a2n of the se ond row
down the se ond olumn, et . We get a new matrix, whi h
we denote AT and is an n × m matrix.
 
a11 a12 a13 ··· a1n

 a21 a22 a23 ··· a2n 


A = [Aij ] =  a31 a32 a33 ··· a3n 
.. .. .. ..

 ... 
 . . . . 
am1 am2 am3 · · · amn
Transpose of matrix AT of A
Thus:
 
a11 a21 a31 ··· am1

 a12 a22 a32 ··· am2 

AT = [Aji ] = 
 a13 a23 a33 ··· am3 
.. .. .. ..

 ... 
 . . . . 
a1n a2n a3n · · · amn

Example of a Transpose matrix AT

 
1 0 −1 4 2
A =  2 3 −2 0 4  ∈ M3×5
0 6 7 9 1
 
1 2 0

 0 3 6 

AT = [Aji ] = 
 −1 −2 7 

 4 0 9 
2 4 1

Symmetri Matrix
Let
A ∈ Mnn
a square matrix. A square matrix A is alled a symmetri
matrix, if A is equal to the transpose of AT , i.e, A = AT .
Example of Symmetri Matrix

1 2 1 2
A = [A2×2 ] = AT = AT 2×2 =
2 3 2 3


Matrix Algebra
Main points in this se tion: We denote a few on ept regarding

matri es. This would in lude
-addition of matri es,
- s alar multipli ation and
- multipli ation of matri es.

Matrix Addition
Matrix Addition
Let A = [aij ] ∈ Mm×n (R) and B = [bij ] ∈ Mmn (R). If
A and B are matri es of the same dimension, then the sum,
A + B is the matrix:
C = [cij ] ∈ Mm×n (R)
obtained by adding the homologous elements of both ma-

tri es, su h as, C = A + B, where cij = aij +
bij , i = 1, 2, ...m, j = 1, 2, ...n. To add matri es, add the or-
responding matrix elements. It is only possible to add matri-
es, if they have the same dimension.

Matrix Addition
Example of Matrix Addition

Let A and B ∈ M3×4 (∈ R).
 
−1 0 3 2
A= 2 1 7 1 
3 1 0 15
 
3 2 −1 0
 1 −2 −8 2 
B= 
 2 35 11 −1 

Matrix Addition
The addition of both matri es A + B is obtained by adding the

homologous elements of both matri es:
Example of Matrix Addition
 
3 + (−1) 0 + 2 3 + (−1) 0 + 0
A+B =  2+1 1−2 7−8 1+2 =
3+2 1 + 35 0 + 11 15 − 1
 
2 2 2 0
=  3 −1 −1 3 
5 36 11 14

Matrix Addition
Properties of Matrix Addition

Let A, B and C ∈ Mm×n (∈ R). The basi properties of
addition for real numbers are:
A + B = B + A (Commutative law for addition)
(A + B) + C = A + (B + C) (Asso iative law for
addition)
A + Om×n = Om×n + A = A (Identity for addition)
A + (−A) = (−A) + A = Om×n su h that
A = [−aij ] , i = 1, 2, ...m, j = 1, 2, ...n (Additive
inverse for addition)
(A + B)T = AT + BT (Transpose for addition)

Matrix Addition

Matrix Addition
Exer ises
   
1 1 2 1 1 4
1 Let A =  −1 3 1  and B =  2 −1 0 
3 1 0 3 1 −3
Compute A + B
 
1 1 4
1 1 2
2 Let C = and D =  2 −1 0 
−1 3 1
3 1 −3
Compute C + D

S alar Matrix Multipli ation

Let A = [aij ] ∈ Mm×n (R) and α ∈ R. For any
s alar α, the produ t αA is obtained multiplying ea h
element of the matrix A by the s alar α, i.e, αA =
α[aij ], i = 1, 2, ...m, j = 1, 2, ...n

Examples
Let α = 3 and A ∈ M4×3 (R) given by:
 
1 −2 4
 0 −1 9 
A=
 1 1 −3 

2 10 −3
Cal ulate the produ t 3A.

To obtain the produ t 3A, we must multiply every elements

aij , i = 1, 2, 3, 4, j = 1, 2, 3 of the matrix A by 3.
   
1 −2 4 3 × 1 3 × (−2) 3×4
 0 −1 9   3 × 0 3 × (−1) 3×9 
3A = 3 
 1 1 −3  =  3 × 1
  =
3×1 3 × (−3) 
2 10 −3 3 × 2 3 × 10 3 × (−3)
 
3 −6 12
 0 −3 27 
=
 3 3 −9 

6 30 −9

Properties of S alar Matrix Multipli ation

Let A, B and α, β, (∈ R).
The properties for s alar multpipli ation are as follows:
α(A + B) = αA + αB
(α + β)A = αA + βA
α(βA) = (αβ)A
1A = A
(αA)T = αAT

Exer ise
Let A ∈ M2×3 (R) given by:

1 1 2
A=
−1 −1 4
Determine de matrix B = 2A.

Matrix Multipli ation

Let A = [aij ] ∈ Mm×n (R) and B = [bij ] ∈ Mn×q (R).
The produ t, AB or A × B, will be a matrix C = [cij ] ∈
Mm×q (R) whose produ t is obtained with the ith row of the
matrix A and the jth olumn of the matrix B, i.e, AB =
hP i
n
a b
j=1 ij jl , i = 1, 2, ...m, l = 1, 2, ...q .
il

☞ Note:
The produ t of two matri es A and B is only
possible when the number of olumns of the matrix
A B.
is equal to the numbers of rows of the matrix
The matrix obtained by the produ t AB has the

same numbers of rows of the matrix A and the same
number of olumns has the matrix B .

Example of Matrix Multipli ation

 
3 0 1
1 0 −1
Let A = and B =  1 −1 0  .
2 3 1
0 −1 2
Cal ulate A × B. The produ t A × B is dened, be ause the
left-hand matrix is 2 × 3 and the right-hand matrix is 3 × 3.
Therefore, the number of olumns of the matrix A is equal
to the number of rows of the matrix B. Thus,
 
3 0 1
1 0 −1
A×B= ×  1 −1 0  =
2 3 1
0 −1 2

Cont of the Example

1 × 3 + 0 × 1 + (−1) × 0 1 × 0 + 0 × (−1) + (−1) × (−1) 1 × 1 + 0 × 0 + (−1) × 2
=
2×3+3×1+1×0 2 × 0 + 3 × (−1) + 3 × (−1) 2×1+3×0+1×2

3 1 −1
= ∈ M2×3 (R)
9 −6 4
Nevertheless, the produ t B × A is not dened sin e the

matrix B is 3 × 3 and matrix A is 2 × 3, i.e, the number of
olumns of the matrix B are not equal to the number of rows
of the matrix A .

Properties of Matrix Multipli ation

Let A ∈ Mm×p (∈ R), B ∈ Mm×n (∈ R), C ∈ Mn×m (∈ R),
D ∈ Mp×n (∈ R) and E ∈ Mn×q (∈ R).
The basi properties for multipli ation of matri es with real
numbers are:
(AB)C = A(BC)
A + (B) + D) = AB + AD)
(B + D)E = BE + DE
α(AB) = (αA)B = A(αB)
AIp = Im A
(AB)T = BT AT

Commutative Exer ise

Let A ∈ Mn×n (∈ R), B ∈ Mn×n (∈ R) and
C ∈ Mn×n (∈ R),

1 2 2 1 1 2
A= B= C=
0 −1 0 1 3 4
Verify whi h matri es are ommutative.

Power of a matrix
Let A ∈ Mn×n (∈ R) and k ∈ N. The power of Ak of a
matrix A for k a non-negative number, is dened as the matrix
produ t ofk opies of A: |A × A ×{z..... × A} Note that,
ktimes
k t t k
(A ) = (A )

Exer ise of Power of a matrix

Let A ∈ M2×2 (∈ R)

1 2
A=
1 −1
Compute A3


T1 Matrizes

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

T1 Matrizes

Uploaded by

Copyright:

Available Formats

Denition and Representation of a Matrix Basi

Con epts of Matri es Operations with Matri es

Linear Algebra and Analyti al Geometry

Linear Algebra and Analyti al Geometry

1 Denition and Representation of a Matrix

2 Basi Con epts of Matri es

3 Operations with Matri es

s aisep.ipp.pt; jpmisep.ipp.pt; apisep.ipp.pt DMA-ISEP

- Many di ult problems an be handled easily on e relevant

s aisep.ipp.pt; jpmisep.ipp.pt; apisep.ipp.pt DMA-ISEP

The order/dimension of a matrix is determined by the produ t

s aisep.ipp.pt; jpmisep.ipp.pt; apisep.ipp.pt DMA-ISEP

A = [aij ] , i = 1, 2, ...m, j = 1, 2, ...n

s aisep.ipp.pt; jpmisep.ipp.pt; apisep.ipp.pt DMA-ISEP

s aisep.ipp.pt; jpmisep.ipp.pt; apisep.ipp.pt DMA-ISEP

s aisep.ipp.pt; jpmisep.ipp.pt; apisep.ipp.pt DMA-ISEP

s aisep.ipp.pt; jpmisep.ipp.pt; apisep.ipp.pt DMA-ISEP

s aisep.ipp.pt; jpmisep.ipp.pt; apisep.ipp.pt DMA-ISEP

s aisep.ipp.pt; jpmisep.ipp.pt; apisep.ipp.pt DMA-ISEP

s aisep.ipp.pt; jpmisep.ipp.pt; apisep.ipp.pt DMA-ISEP

s aisep.ipp.pt; jpmisep.ipp.pt; apisep.ipp.pt DMA-ISEP

Main Diagonal of a Matrix

s aisep.ipp.pt; jpmisep.ipp.pt; apisep.ipp.pt DMA-ISEP

s aisep.ipp.pt; jpmisep.ipp.pt; apisep.ipp.pt DMA-ISEP

Upper Triangular Matrix

s aisep.ipp.pt; jpmisep.ipp.pt; apisep.ipp.pt DMA-ISEP

Lower Triangular Matrix

s aisep.ipp.pt; jpmisep.ipp.pt; apisep.ipp.pt DMA-ISEP

s aisep.ipp.pt; jpmisep.ipp.pt; apisep.ipp.pt DMA-ISEP

The n × n Identity Matrix

s aisep.ipp.pt; jpmisep.ipp.pt; apisep.ipp.pt DMA-ISEP

Matri es of the same type

Equality of two Matri es

s aisep.ipp.pt; jpmisep.ipp.pt; apisep.ipp.pt DMA-ISEP

Example of a Transpose matrix AT

s aisep.ipp.pt; jpmisep.ipp.pt; apisep.ipp.pt DMA-ISEP

Example of Symmetri Matrix

s aisep.ipp.pt; jpmisep.ipp.pt; apisep.ipp.pt DMA-ISEP

s aisep.ipp.pt; jpmisep.ipp.pt; apisep.ipp.pt DMA-ISEP

Main points in this se tion: We denote a few on ept regarding

s aisep.ipp.pt; jpmisep.ipp.pt; apisep.ipp.pt DMA-ISEP

C = [cij ] ∈ Mm×n (R)

obtained by adding the homologous elements of both ma-

s aisep.ipp.pt; jpmisep.ipp.pt; apisep.ipp.pt DMA-ISEP

Example of Matrix Addition

s aisep.ipp.pt; jpmisep.ipp.pt; apisep.ipp.pt DMA-ISEP

The addition of both matri es A + B is obtained by adding the

s aisep.ipp.pt; jpmisep.ipp.pt; apisep.ipp.pt DMA-ISEP

Properties of Matrix Addition

s aisep.ipp.pt; jpmisep.ipp.pt; apisep.ipp.pt DMA-ISEP

s aisep.ipp.pt; jpmisep.ipp.pt; apisep.ipp.pt DMA-ISEP

s aisep.ipp.pt; jpmisep.ipp.pt; apisep.ipp.pt DMA-ISEP

S alar Matrix Multipli ation

S alar Matrix Multipli ation

s aisep.ipp.pt; jpmisep.ipp.pt; apisep.ipp.pt DMA-ISEP

S alar Matrix Multipli ation

Cal ulate the produ t 3A.

s aisep.ipp.pt; jpmisep.ipp.pt; apisep.ipp.pt DMA-ISEP

S alar Matrix Multipli ation

To obtain the produ t 3A, we must multiply every elements

s aisep.ipp.pt; jpmisep.ipp.pt; apisep.ipp.pt DMA-ISEP

S alar Matrix Multipli ation

Properties of S alar Matrix Multipli ation

Denition and Representation of a Matrix Basi

1 Denition and Representation of a Matrix

s aisep.ipp.pt; jpmisep.ipp.pt; apisep.ipp.pt DMA-ISEP

- Many di ult problems an be handled easily on e relevant

s aisep.ipp.pt; jpmisep.ipp.pt; apisep.ipp.pt DMA-ISEP

s aisep.ipp.pt; jpmisep.ipp.pt; apisep.ipp.pt DMA-ISEP

s aisep.ipp.pt; jpmisep.ipp.pt; apisep.ipp.pt DMA-ISEP

s aisep.ipp.pt; jpmisep.ipp.pt; apisep.ipp.pt DMA-ISEP

s aisep.ipp.pt; jpmisep.ipp.pt; apisep.ipp.pt DMA-ISEP

s aisep.ipp.pt; jpmisep.ipp.pt; apisep.ipp.pt DMA-ISEP

s aisep.ipp.pt; jpmisep.ipp.pt; apisep.ipp.pt DMA-ISEP

s aisep.ipp.pt; jpmisep.ipp.pt; apisep.ipp.pt DMA-ISEP

s aisep.ipp.pt; jpmisep.ipp.pt; apisep.ipp.pt DMA-ISEP

s aisep.ipp.pt; jpmisep.ipp.pt; apisep.ipp.pt DMA-ISEP

s aisep.ipp.pt; jpmisep.ipp.pt; apisep.ipp.pt DMA-ISEP

s aisep.ipp.pt; jpmisep.ipp.pt; apisep.ipp.pt DMA-ISEP

s aisep.ipp.pt; jpmisep.ipp.pt; apisep.ipp.pt DMA-ISEP

s aisep.ipp.pt; jpmisep.ipp.pt; apisep.ipp.pt DMA-ISEP

s aisep.ipp.pt; jpmisep.ipp.pt; apisep.ipp.pt DMA-ISEP

s aisep.ipp.pt; jpmisep.ipp.pt; apisep.ipp.pt DMA-ISEP

s aisep.ipp.pt; jpmisep.ipp.pt; apisep.ipp.pt DMA-ISEP

s aisep.ipp.pt; jpmisep.ipp.pt; apisep.ipp.pt DMA-ISEP

s aisep.ipp.pt; jpmisep.ipp.pt; apisep.ipp.pt DMA-ISEP

s aisep.ipp.pt; jpmisep.ipp.pt; apisep.ipp.pt DMA-ISEP

s aisep.ipp.pt; jpmisep.ipp.pt; apisep.ipp.pt DMA-ISEP

s aisep.ipp.pt; jpmisep.ipp.pt; apisep.ipp.pt DMA-ISEP

s aisep.ipp.pt; jpmisep.ipp.pt; apisep.ipp.pt DMA-ISEP

s aisep.ipp.pt; jpmisep.ipp.pt; apisep.ipp.pt DMA-ISEP

s aisep.ipp.pt; jpmisep.ipp.pt; apisep.ipp.pt DMA-ISEP

s aisep.ipp.pt; jpmisep.ipp.pt; apisep.ipp.pt DMA-ISEP

s aisep.ipp.pt; jpmisep.ipp.pt; apisep.ipp.pt DMA-ISEP

s aisep.ipp.pt; jpmisep.ipp.pt; apisep.ipp.pt DMA-ISEP

s aisep.ipp.pt; jpmisep.ipp.pt; apisep.ipp.pt DMA-ISEP

s aisep.ipp.pt; jpmisep.ipp.pt; apisep.ipp.pt DMA-ISEP

s aisep.ipp.pt; jpmisep.ipp.pt; apisep.ipp.pt DMA-ISEP

s aisep.ipp.pt; jpmisep.ipp.pt; apisep.ipp.pt DMA-ISEP

s aisep.ipp.pt; jpmisep.ipp.pt; apisep.ipp.pt DMA-ISEP

s aisep.ipp.pt; jpmisep.ipp.pt; apisep.ipp.pt DMA-ISEP

s aisep.ipp.pt; jpmisep.ipp.pt; apisep.ipp.pt DMA-ISEP

Nevertheless, the produ t B × A is not dened sin e the

s aisep.ipp.pt; jpmisep.ipp.pt; apisep.ipp.pt DMA-ISEP

s aisep.ipp.pt; jpmisep.ipp.pt; apisep.ipp.pt DMA-ISEP

s aisep.ipp.pt; jpmisep.ipp.pt; apisep.ipp.pt DMA-ISEP

s aisep.ipp.pt; jpmisep.ipp.pt; apisep.ipp.pt DMA-ISEP

s aisep.ipp.pt; jpmisep.ipp.pt; apisep.ipp.pt DMA-ISEP