MAA101 Chapter 2

Advanced Mathematics 2 - Linear Algebra
Chapter 2: Matrix algebra

Department of Mathematics
The FPT university
TrungDT (FUHN) MAA101 Chapter 2 1 / 29
Chapter 2 Introduction
Topics:
2.1 Matrix operations: Addition, Scalar multiplication, Transposition
2.2 Matrix multiplication
2.3 Matrix inverses
2.5 Matrix transformations
2.7 Applications
Topics:
2.3 Matrix inverses
2.7 Applications
Topics:
2.3 Matrix inverses
2.7 Applications
Topics:
2.3 Matrix inverses
2.7 Applications
Topics:
2.3 Matrix inverses
2.7 Applications
Topics:
2.3 Matrix inverses
2.7 Applications
Topics:
2.3 Matrix inverses
2.7 Applications
2.1 Matrix addition, Scalar multiplication, and
Transposition
A matrix is an array consisting of m rows and n columns:
A =
_
_
a
11
a
12
a
1n
a
21
a
22
a
2n
a
ij

a
m1
a
m2
a
mn
_
_
We say A is an m n matrix, or A is a matrix of size m n. We
usually write A = [a
ij
], i = 1, . . . , m, j = 1, . . . , n.
The number a
ij
is called the (i , j )-entry of the matrix.
If m = n then we say A is a square matrix.
Transposition
A =
_
_
a
11
a
12
a
1n
a
21
a
22
a
2n
a
ij

a
m1
a
m2
a
mn
_
_
ij
], i = 1, . . . , m, j = 1, . . . , n.
The number a
ij
Transposition
A =
_
_
a
11
a
12
a
1n
a
21
a
22
a
2n
a
ij

a
m1
a
m2
a
mn
_
_
We say A is an m n matrix, or A is a matrix of size m n.
We
ij
], i = 1, . . . , m, j = 1, . . . , n.
The number a
ij
Transposition
A =
_
_
a
11
a
12
a
1n
a
21
a
22
a
2n
a
ij

a
m1
a
m2
a
mn
_
_
ij
], i = 1, . . . , m, j = 1, . . . , n.
The number a
ij
Transposition
A =
_
_
a
11
a
12
a
1n
a
21
a
22
a
2n
a
ij

a
m1
a
m2
a
mn
_
_
ij
], i = 1, . . . , m, j = 1, . . . , n.
The number a
ij
Transposition
A =
_
_
a
11
a
12
a
1n
a
21
a
22
a
2n
a
ij

a
m1
a
m2
a
mn
_
_
ij
], i = 1, . . . , m, j = 1, . . . , n.
The number a
ij
Matrix Addition and Scalar multiplication
Addition and Subtraction
_
a b c
x y z
_

_
A B C
X Y Z
_
=
_
a A b B c C
x X y Y z Z
_
_
a b c
x y z
_
+
_
A B
X Y
_
= Undened
Scalar multiplication
k
_
a b c
x y z
_
=
_
ka kb kc
kx ky kz
_
, where k is a real number
Example. Find X: 2X +
_
1 2
3 4
_
=
_
1 0
3 1
_
_
a b c
x y z
_

_
A B C
X Y Z
_
=
_
a A b B c C
x X y Y z Z
_
_
a b c
x y z
_
+
_
A B
X Y
_
= Undened
k
_
a b c
x y z
_
=
_
ka kb kc
kx ky kz
_
_
1 2
3 4
_
=
_
1 0
3 1
_
_
a b c
x y z
_

_
A B C
X Y Z
_
=
_
a A b B c C
x X y Y z Z
_
_
a b c
x y z
_
+
_
A B
X Y
_
= Undened
k
_
a b c
x y z
_
=
_
ka kb kc
kx ky kz
_
_
1 2
3 4
_
=
_
1 0
3 1
_
_
a b c
x y z
_

_
A B C
X Y Z
_
=
_
a A b B c C
x X y Y z Z
_
_
a b c
x y z
_
+
_
A B
X Y
_
= Undened
k
_
a b c
x y z
_
=
_
ka kb kc
kx ky kz
_
_
1 2
3 4
_
=
_
1 0
3 1
_
_
a b c
x y z
_

_
A B C
X Y Z
_
=
_
a A b B c C
x X y Y z Z
_
_
a b c
x y z
_
+
_
A B
X Y
_
= Undened
k
_
a b c
x y z
_
=
_
ka kb kc
kx ky kz
_
_
1 2
3 4
_
=
_
1 0
3 1
_
_
a b c
x y z
_

_
A B C
X Y Z
_
=
_
a A b B c C
x X y Y z Z
_
_
a b c
x y z
_
+
_
A B
X Y
_
= Undened
k
_
a b c
x y z
_
=
_
ka kb kc
kx ky kz
_
Example.
Find X: 2X +
_
1 2
3 4
_
=
_
1 0
3 1
_
_
a b c
x y z
_

_
A B C
X Y Z
_
=
_
a A b B c C
x X y Y z Z
_
_
a b c
x y z
_
+
_
A B
X Y
_
= Undened
k
_
a b c
x y z
_
=
_
ka kb kc
kx ky kz
_
_
1 2
3 4
_
=
_
1 0
3 1
_
_
a b c
x y z
_

_
A B C
X Y Z
_
=
_
a A b B c C
x X y Y z Z
_
_
a b c
x y z
_
+
_
A B
X Y
_
= Undened
k
_
a b c
x y z
_
=
_
ka kb kc
kx ky kz
_
_
1 2
3 4
_
=
_
1 0
3 1
_
Let A, B, C be m n matrices. Let 0 denote the m n matrix whose
entries are 0. Let k, p be real numbers.
Theorem
A + B = B + A
A + 0 = 0 + A = A
A + (B + C) = (A + B) + C
k(A + B) = kA + kB
kA + pA = (k + p)A
k(pA) = (kp)A
1.A = A
Theorem
A + B = B + A
A + 0 = 0 + A = A
A + (B + C) = (A + B) + C
k(A + B) = kA + kB
kA + pA = (k + p)A
k(pA) = (kp)A
1.A = A
Theorem
A + B = B + A
A + 0 = 0 + A = A
A + (B + C) = (A + B) + C
k(A + B) = kA + kB
kA + pA = (k + p)A
k(pA) = (kp)A
1.A = A
Transpose
The transpose of the matrix A, denoted by A
T
, is the matrix whose
i th-row is the i th-column of A.
Example.
_
1 2 3
x y z
_
T
=
_
_
1 x
2 y
3 z
_
_
Properties
(A
T
)
T
= A
(A + B)
T
= A
T
+ B
T
(kA)
T
= kA
T
Example. Find A such that:
_
2A
T
+
_
1 2
3 4
_
_
T
=
_
1 1
2 3
_
Transpose
T
Example.
_
1 2 3
x y z
_
T
=
_
_
1 x
2 y
3 z
_
_
Properties
(A
T
)
T
= A
(A + B)
T
= A
T
+ B
T
(kA)
T
= kA
T
_
2A
T
+
_
1 2
3 4
_
_
T
=
_
1 1
2 3
_
Transpose
T
Example.
_
1 2 3
x y z
_
T
=
_
_
1 x
2 y
3 z
_
_
Properties
(A
T
)
T
= A
(A + B)
T
= A
T
+ B
T
(kA)
T
= kA
T
_
2A
T
+
_
1 2
3 4
_
_
T
=
_
1 1
2 3
_
Transpose
T
Example.
_
1 2 3
x y z
_
T
=
_
_
1 x
2 y
3 z
_
_
Properties
(A
T
)
T
= A
(A + B)
T
= A
T
+ B
T
(kA)
T
= kA
T
_
2A
T
+
_
1 2
3 4
_
_
T
=
_
1 1
2 3
_
Transpose
T
Example.
_
1 2 3
x y z
_
T
=
_
_
1 x
2 y
3 z
_
_
Properties
(A
T
)
T
= A
(A + B)
T
= A
T
+ B
T
(kA)
T
= kA
T
_
2A
T
+
_
1 2
3 4
_
_
T
=
_
1 1
2 3
_
Transpose
T
Example.
_
1 2 3
x y z
_
T
=
_
_
1 x
2 y
3 z
_
_
Properties
(A
T
)
T
= A
(A + B)
T
= A
T
+ B
T
(kA)
T
= kA
T
_
2A
T
+
_
1 2
3 4
_
_
T
=
_
1 1
2 3
_
Transpose
T
Example.
_
1 2 3
x y z
_
T
=
_
_
1 x
2 y
3 z
_
_
Properties
(A
T
)
T
= A
(A + B)
T
= A
T
+ B
T
(kA)
T
= kA
T
_
2A
T
+
_
1 2
3 4
_
_
T
=
_
1 1
2 3
_
Transpose
T
Example.
_
1 2 3
x y z
_
T
=
_
_
1 x
2 y
3 z
_
_
Properties
(A
T
)
T
= A
(A + B)
T
= A
T
+ B
T
(kA)
T
= kA
T
_
2A
T
+
_
1 2
3 4
_
_
T
=
_
1 1
2 3
_
Transpose
T
Example.
_
1 2 3
x y z
_
T
=
_
_
1 x
2 y
3 z
_
_
Properties
(A
T
)
T
= A
(A + B)
T
= A
T
+ B
T
(kA)
T
= kA
T
_
2A
T
+
_
1 2
3 4
_
_
T
=
_
1 1
2 3
_
Transpose
T
Example.
_
1 2 3
x y z
_
T
=
_
_
1 x
2 y
3 z
_
_
Properties
(A
T
)
T
= A
(A + B)
T
= A
T
+ B
T
(kA)
T
= kA
T
_
2A
T
+
_
1 2
3 4
_
_
T
=
_
1 1
2 3
_
Transpose
T
Example.
_
1 2 3
x y z
_
T
=
_
_
1 x
2 y
3 z
_
_
Properties
(A
T
)
T
= A
(A + B)
T
= A
T
+ B
T
(kA)
T
= kA
T
_
2A
T
+
_
1 2
3 4
_
_
T
=
_
1 1
2 3
_
Symmetric matrices
A square matrix A is symmetric if A = A
T
.
Equivalently, a square matrix A is symmetric if and only if the entries that
are symmetric across the main diagonal are equal.
Example. The matrix
_
1 3
3 5
_
is symmetric, but
_
1 3
2 5
_
is not.
Question. Is the sum of two symmetric matrices symmetric?
Symmetric matrices
T
.
Example. The matrix
_
1 3
3 5
_
is symmetric, but
_
1 3
2 5
_
is not.
Symmetric matrices
T
.
Example. The matrix
_
1 3
3 5
_
is symmetric, but
_
1 3
2 5
_
is not.
Symmetric matrices
T
.
Example. The matrix
_
1 3
3 5
_
is symmetric, but
_
1 3
2 5
_
is not.
Symmetric matrices
T
.
Example.
The matrix
_
1 3
3 5
_
is symmetric, but
_
1 3
2 5
_
is not.
Symmetric matrices
T
.
Example. The matrix
_
1 3
3 5
_
is symmetric,
but
_
1 3
2 5
_
is not.
Symmetric matrices
T
.
Example. The matrix
_
1 3
3 5
_
is symmetric, but
_
1 3
2 5
_
is not.
Symmetric matrices
T
.
Example. The matrix
_
1 3
3 5
_
is symmetric, but
_
1 3
2 5
_
is not.
Question.
Is the sum of two symmetric matrices symmetric?
Symmetric matrices
T
.
Example. The matrix
_
1 3
3 5
_
is symmetric, but
_
1 3
2 5
_
is not.
Let A be a m n matrix. Let B be an n p matrix. Then the product of
A and B, denoted by AB, is a matrix of size m p.
Examples.
_
a b c
x y z
_
_
_
M N
P Q
U V
_
_
=
_
aM + bP + cU aN + bQ + cV
xM + yP + zU xN + yQ + zV
_
_
2 3 4
_
_
a
b
c
_
_
=
_
2a + 3b + 4c
_
_
2
3
4
_
_
_
a b c
=
_
_
2a 2b 2c
3a 3b 3c
4a 4b 4c
_
_
Examples.
_
a b c
x y z
_
_
_
M N
P Q
U V
_
_
=
_
_
_
2 3 4
_
_
a
b
c
_
_
=
_
2a + 3b + 4c
_
_
2
3
4
_
_
_
a b c
=
_
_
2a 2b 2c
3a 3b 3c
4a 4b 4c
_
_
Examples.
_
a b c
x y z
_
_
_
M N
P Q
U V
_
_
=
_
_
_
2 3 4
_
_
a
b
c
_
_
=
_
2a + 3b + 4c
_
_
2
3
4
_
_
_
a b c
=
_
_
2a 2b 2c
3a 3b 3c
4a 4b 4c
_
_
Examples.
_
a b c
x y z
_
_
_
M N
P Q
U V
_
_
=
_
_
_
2 3 4
_
_
a
b
c
_
_
=
_
2a + 3b + 4c
_
_
2
3
4
_
_
_
a b c
=
_
_
2a 2b 2c
3a 3b 3c
4a 4b 4c
_
_
Examples.
_
a b c
x y z
_
_
_
M N
P Q
U V
_
_
=
_
_
_
2 3 4
_
_
a
b
c
_
_
=
_
2a + 3b + 4c
_
_
2
3
4
_
_
_
a b c
=
_
_
2a 2b 2c
3a 3b 3c
4a 4b 4c
_
_
The identity matrix I
n
is the n n matrix with 1 on the diagonal and 0
everywhere else.
Theorem
Let A, B, C be matrices of sizes such that the indicated operations can be
performed. I denotes an identity matrix, and k a real number.
AI = IA = A
AB = BA, in general
A(BC) = (AB)C
A(B + C) = AB + AC
(B + C)A = BA + CA
k(AB) = (kA)B = A(kB)
(AB)
T
= B
T
A
T
n
everywhere else.
Theorem
AI = IA = A
AB = BA, in general
A(BC) = (AB)C
A(B + C) = AB + AC
(B + C)A = BA + CA
(AB)
T
= B
T
A
T
n
everywhere else.
Theorem
AI = IA = A
AB = BA, in general
A(BC) = (AB)C
A(B + C) = AB + AC
(B + C)A = BA + CA
(AB)
T
= B
T
A
T
Block multiplication
To multiply two matrices of large sizes, we can divide each matrix into
blocks and treat these as entries.
Example 1.
_
_
1 2 0 0
3 4 0 0
1 0 5 6
0 1 7 8
_
_
_
_
9 10
11 12
0 0
0 0
_
_
=
_
_
1 2 0 0
3 4 0 0
1 0 5 6
0 1 7 8
_
_
_
_
9 10
11 12
0 0
0 0
_
_
=
_
A 0
I B
_ _
C
0
_
=
_
AC
C
_
=
_
_
31 34
71 78
9 10
11 12
_
_
Example 1.
_
_
1 2 0 0
3 4 0 0
1 0 5 6
0 1 7 8
_
_
_
_
9 10
11 12
0 0
0 0
_
_
=
_
_
1 2 0 0
3 4 0 0
1 0 5 6
0 1 7 8
_
_
_
_
9 10
11 12
0 0
0 0
_
_
=
_
A 0
I B
_ _
C
0
_
=
_
AC
C
_
=
_
_
31 34
71 78
9 10
11 12
_
_
Example 1.
_
_
1 2 0 0
3 4 0 0
1 0 5 6
0 1 7 8
_
_
_
_
9 10
11 12
0 0
0 0
_
_
=
_
_
1 2 0 0
3 4 0 0
1 0 5 6
0 1 7 8
_
_
_
_
9 10
11 12
0 0
0 0
_
_
=
_
A 0
I B
_ _
C
0
_
=
_
AC
C
_
=
_
_
31 34
71 78
9 10
11 12
_
_
Example 1.
_
_
1 2 0 0
3 4 0 0
1 0 5 6
0 1 7 8
_
_
_
_
9 10
11 12
0 0
0 0
_
_
=
_
_
1 2 0 0
3 4 0 0
1 0 5 6
0 1 7 8
_
_
_
_
9 10
11 12
0 0
0 0
_
_
=
_
A 0
I B
_ _
C
0
_
=
_
AC
C
_
=
_
_
31 34
71 78
9 10
11 12
_
_
Example 1.
_
_
1 2 0 0
3 4 0 0
1 0 5 6
0 1 7 8
_
_
_
_
9 10
11 12
0 0
0 0
_
_
=
_
_
1 2 0 0
3 4 0 0
1 0 5 6
0 1 7 8
_
_
_
_
9 10
11 12
0 0
0 0
_
_
=
_
A 0
I B
_ _
C
0
_
=
_
AC
C
_
=
_
_
31 34
71 78
9 10
11 12
_
_
Example 1.
_
_
1 2 0 0
3 4 0 0
1 0 5 6
0 1 7 8
_
_
_
_
9 10
11 12
0 0
0 0
_
_
=
_
_
1 2 0 0
3 4 0 0
1 0 5 6
0 1 7 8
_
_
_
_
9 10
11 12
0 0
0 0
_
_
=
_
A 0
I B
_ _
C
0
_
=
_
AC
C
_
=
_
_
31 34
71 78
9 10
11 12
_
_
Example 1.
_
_
1 2 0 0
3 4 0 0
1 0 5 6
0 1 7 8
_
_
_
_
9 10
11 12
0 0
0 0
_
_
=
_
_
1 2 0 0
3 4 0 0
1 0 5 6
0 1 7 8
_
_
_
_
9 10
11 12
0 0
0 0
_
_
=
_
A 0
I B
_ _
C
0
_
=
_
AC
C
_
=
_
_
31 34
71 78
9 10
11 12
_
_
Example 1.
_
_
1 2 0 0
3 4 0 0
1 0 5 6
0 1 7 8
_
_
_
_
9 10
11 12
0 0
0 0
_
_
=
_
_
1 2 0 0
3 4 0 0
1 0 5 6
0 1 7 8
_
_
_
_
9 10
11 12
0 0
0 0
_
_
=
_
A 0
I B
_ _
C
0
_
=
_
AC
C
_
=
_
_
31 34
71 78
9 10
11 12
_
_
Example 2.
_
_
1 0 1 2
0 1 3 4
0 0 1 0
0 0 0 1
_
_
10
=
_
I A
0 I
_
10
=
_
I 10A
0 I
_
=
_
_
1 0 10 20
0 1 30 40
0 0 1 0
0 0 0 1
_
_
Example 2.
_
_
1 0 1 2
0 1 3 4
0 0 1 0
0 0 0 1
_
_
10
=
_
I A
0 I
_
10
=
_
I 10A
0 I
_
=
_
_
1 0 10 20
0 1 30 40
0 0 1 0
0 0 0 1
_
_
Example 2.
_
_
1 0 1 2
0 1 3 4
0 0 1 0
0 0 0 1
_
_
10
=
_
I A
0 I
_
10
=
_
I 10A
0 I
_
=
_
_
1 0 10 20
0 1 30 40
0 0 1 0
0 0 0 1
_
_
Example 2.
_
_
1 0 1 2
0 1 3 4
0 0 1 0
0 0 0 1
_
_
10
=
_
I A
0 I
_
10
=
_
I 10A
0 I
_
=
_
_
1 0 10 20
0 1 30 40
0 0 1 0
0 0 0 1
_
_
Example 2.
_
_
1 0 1 2
0 1 3 4
0 0 1 0
0 0 0 1
_
_
10
=
_
I A
0 I
_
10
=
_
I 10A
0 I
_
=
_
_
1 0 10 20
0 1 30 40
0 0 1 0
0 0 0 1
_
_
Example 2.
_
_
1 0 1 2
0 1 3 4
0 0 1 0
0 0 0 1
_
_
10
=
_
I A
0 I
_
10
=
_
I 10A
0 I
_
=
_
_
1 0 10 20
0 1 30 40
0 0 1 0
0 0 0 1
_
_
Matrices and Linear systems
A system of linear equations
_
_
a
11
x
1
+ a
12
x
2
+ + a
1n
x
n
= b
1
a
21
x
1
+ a
22
x
2
+ + a
2n
x
n
= b
2

a
m1
x
1
+ a
m2
x
2
+ + a
mn
x
n
= b
m
can be written as a matrix equation AX = B, where
A =
_
_
a
11
a
12
a
1n
a
21
a
22
a
2n

a
m1
a
m2
a
mn
_
_
, X =
_
_
x
1
x
2
.
.
.
x
n
_
_
, B =
_
_
b
1
b
2
.
.
.
b
m
_
_
_
_
a
11
x
1
+ a
12
x
2
+ + a
1n
x
n
= b
1
a
21
x
1
+ a
22
x
2
+ + a
2n
x
n
= b
2

a
m1
x
1
+ a
m2
x
2
+ + a
mn
x
n
= b
m
A =
_
_
a
11
a
12
a
1n
a
21
a
22
a
2n

a
m1
a
m2
a
mn
_
_
, X =
_
_
x
1
x
2
.
.
.
x
n
_
_
, B =
_
_
b
1
b
2
.
.
.
b
m
_
_
_
_
a
11
x
1
+ a
12
x
2
+ + a
1n
x
n
= b
1
a
21
x
1
+ a
22
x
2
+ + a
2n
x
n
= b
2

a
m1
x
1
+ a
m2
x
2
+ + a
mn
x
n
= b
m
A =
_
_
a
11
a
12
a
1n
a
21
a
22
a
2n

a
m1
a
m2
a
mn
_
_
, X =
_
_
x
1
x
2
.
.
.
x
n
_
_
, B =
_
_
b
1
b
2
.
.
.
b
m
_
_
_
_
a
11
x
1
+ a
12
x
2
+ + a
1n
x
n
= b
1
a
21
x
1
+ a
22
x
2
+ + a
2n
x
n
= b
2

a
m1
x
1
+ a
m2
x
2
+ + a
mn
x
n
= b
m
A =
_
_
a
11
a
12
a
1n
a
21
a
22
a
2n

a
m1
a
m2
a
mn
_
_
, X =
_
_
x
1
x
2
.
.
.
x
n
_
_
, B =
_
_
b
1
b
2
.
.
.
b
m
_
_
_
_
a
11
x
1
+ a
12
x
2
+ + a
1n
x
n
= b
1
a
21
x
1
+ a
22
x
2
+ + a
2n
x
n
= b
2

a
m1
x
1
+ a
m2
x
2
+ + a
mn
x
n
= b
m
A =
_
_
a
11
a
12
a
1n
a
21
a
22
a
2n

a
m1
a
m2
a
mn
_
_
, X =
_
_
x
1
x
2
.
.
.
x
n
_
_
, B =
_
_
b
1
b
2
.
.
.
b
m
_
_
2.3 Matrix inverses
Let A be an n n matrix. An n n matrix B is called an inverse of A if
AB = BA = I
n
Notes.
A matrix may not have an inverse. For example, the matrix
_
1 2
3 6
_
does not have an inverse.
The inverse matrix of a matrix A, if exists, is unique and is denoted
by A
1
. In this case we say A is invertible.
2.3 Matrix inverses
AB = BA = I
n
Notes.
_
1 2
3 6
_
by A
1
2.3 Matrix inverses
Let A be an n n matrix.
An n n matrix B is called an inverse of A if
AB = BA = I
n
Notes.
_
1 2
3 6
_
by A
1
2.3 Matrix inverses
AB = BA = I
n
Notes.
_
1 2
3 6
_
by A
1
2.3 Matrix inverses
AB = BA = I
n
Notes.
_
1 2
3 6
_
by A
1
2.3 Matrix inverses
AB = BA = I
n
Notes.
_
1 2
3 6
_
by A
1
2.3 Matrix inverses
AB = BA = I
n
Notes.
A matrix may not have an inverse.
For example, the matrix
_
1 2
3 6
_
by A
1
2.3 Matrix inverses
AB = BA = I
n
Notes.
_
1 2
3 6
_
by A
1
2.3 Matrix inverses
AB = BA = I
n
Notes.
_
1 2
3 6
_
by A
1
Inverses of 2 2 matrices
Let A =
_
a b
c d
_
. The determinant of A = det(A) := ad bc.
Theorem
The matrix A =
_
a b
c d
_
is invertible if and only if det(A) = 0. In that case,
A
1
=
1
det(A)
_
d b
c a
_
.
Example. Find inverses of the matrices
A =
_
1 2
3 4
_
, B =
_
2 4
3 6
_
Let A =
_
a b
c d
_
Theorem
The matrix A =
_
a b
c d
_
A
1
=
1
det(A)
_
d b
c a
_
.
A =
_
1 2
3 4
_
, B =
_
2 4
3 6
_
Let A =
_
a b
c d
_
Theorem
The matrix A =
_
a b
c d
_
A
1
=
1
det(A)
_
d b
c a
_
.
A =
_
1 2
3 4
_
, B =
_
2 4
3 6
_
Let A =
_
a b
c d
_
Theorem
The matrix A =
_
a b
c d
_
A
1
=
1
det(A)
_
d b
c a
_
.
Example.
Find inverses of the matrices
A =
_
1 2
3 4
_
, B =
_
2 4
3 6
_
Let A =
_
a b
c d
_
Theorem
The matrix A =
_
a b
c d
_
A
1
=
1
det(A)
_
d b
c a
_
.
A =
_
1 2
3 4
_
,
B =
_
2 4
3 6
_
Let A =
_
a b
c d
_
Theorem
The matrix A =
_
a b
c d
_
A
1
=
1
det(A)
_
d b
c a
_
.
A =
_
1 2
3 4
_
, B =
_
2 4
3 6
_
Application in solving linear systems
Consider a system of linear equations AX = B. If the matrix A is
invertible, then X = A
1
B is the solution.
Example. Solve the system
_
2x
1
x
2
= 3
3x
1
+ 4x
2
= 1
1
B is the solution.
_
2x
1
x
2
= 3
3x
1
+ 4x
2
= 1
1
B is the solution.
_
2x
1
x
2
= 3
3x
1
+ 4x
2
= 1
Matrix Inversion Algorithm
Let A be invertible. Then A
reduced
= I , and with the same operations
I
reduced
= A
1
.
To nd A
1
, perform [A|I ]
reduced-row echelon
= [I |B]. Then B is the
inverse of A.
Example. Find the inverse of the matrix A =
_
_
2 7 1
1 4 1
1 3 0
_
_
.
_
_
2 7 1 1 0 0
1 4 1 0 1 0
1 3 0 0 0 1
_
_
reduced
=
_
_
1 0 0 3/2 3/2 11/2
0 1 0 1/2 1/2 3/2
0 0 1 1/2 1/2 1/2
_
_
Then A
1
=
_
_
3/2 3/2 11/2
1/2 1/2 3/2
1/2 1/2 1/2
_
_
reduced
I
reduced
= A
1
.
To nd A
1
, perform [A|I ]
reduced-row echelon
inverse of A.
_
_
2 7 1
1 4 1
1 3 0
_
_
.
_
_
2 7 1 1 0 0
1 4 1 0 1 0
1 3 0 0 0 1
_
_
reduced
=
_
_
1 0 0 3/2 3/2 11/2
0 1 0 1/2 1/2 3/2
0 0 1 1/2 1/2 1/2
_
_
Then A
1
=
_
_
3/2 3/2 11/2
1/2 1/2 3/2
1/2 1/2 1/2
_
_
reduced
I
reduced
= A
1
.
To nd A
1
, perform [A|I ]
reduced-row echelon
inverse of A.
Example.
Find the inverse of the matrix A =
_
_
2 7 1
1 4 1
1 3 0
_
_
.
_
_
2 7 1 1 0 0
1 4 1 0 1 0
1 3 0 0 0 1
_
_
reduced
=
_
_
1 0 0 3/2 3/2 11/2
0 1 0 1/2 1/2 3/2
0 0 1 1/2 1/2 1/2
_
_
Then A
1
=
_
_
3/2 3/2 11/2
1/2 1/2 3/2
1/2 1/2 1/2
_
_
reduced
I
reduced
= A
1
.
To nd A
1
, perform [A|I ]
reduced-row echelon
inverse of A.
_
_
2 7 1
1 4 1
1 3 0
_
_
.
_
_
2 7 1 1 0 0
1 4 1 0 1 0
1 3 0 0 0 1
_
_
reduced
=
_
_
1 0 0 3/2 3/2 11/2
0 1 0 1/2 1/2 3/2
0 0 1 1/2 1/2 1/2
_
_
Then A
1
=
_
_
3/2 3/2 11/2
1/2 1/2 3/2
1/2 1/2 1/2
_
_
reduced
I
reduced
= A
1
.
To nd A
1
, perform [A|I ]
reduced-row echelon
inverse of A.
_
_
2 7 1
1 4 1
1 3 0
_
_
.
_
_
2 7 1 1 0 0
1 4 1 0 1 0
1 3 0 0 0 1
_
_
reduced
=
_
_
1 0 0 3/2 3/2 11/2
0 1 0 1/2 1/2 3/2
0 0 1 1/2 1/2 1/2
_
_
Then A
1
=
_
_
3/2 3/2 11/2
1/2 1/2 3/2
1/2 1/2 1/2
_
_
reduced
I
reduced
= A
1
.
To nd A
1
, perform [A|I ]
reduced-row echelon
inverse of A.
_
_
2 7 1
1 4 1
1 3 0
_
_
.
_
_
2 7 1 1 0 0
1 4 1 0 1 0
1 3 0 0 0 1
_
_
reduced
=
_
_
1 0 0 3/2 3/2 11/2
0 1 0 1/2 1/2 3/2
0 0 1 1/2 1/2 1/2
_
_
Then A
1
=
_
_
3/2 3/2 11/2
1/2 1/2 3/2
1/2 1/2 1/2
_
_
Theorem
I
1
= I , where I is an identity matrix.
(A
1
)
1
= A
If A and B are invertible then (AB)
1
= B
1
A
1
.
If A is invertible then (A
n
)
1
= (A
1
)
n
.
If A is invertible and c = 0 then (cA)
1
=
1
c
A
1
T
)
1
= (A
1
)
T
.
Example. Find the matrix A that satisfy:
(A
T
2I )
1
=
_
2 1
1 0
_
Theorem
I
1
(A
1
)
1
= A
1
= B
1
A
1
.
n
)
1
= (A
1
)
n
.
1
=
1
c
A
1
T
)
1
= (A
1
)
T
.
(A
T
2I )
1
=
_
2 1
1 0
_
Theorem
I
1
(A
1
)
1
= A
1
= B
1
A
1
.
n
)
1
= (A
1
)
n
.
1
=
1
c
A
1
T
)
1
= (A
1
)
T
.
(A
T
2I )
1
=
_
2 1
1 0
_
Theorem
I
1
(A
1
)
1
= A
1
= B
1
A
1
.
n
)
1
= (A
1
)
n
.
1
=
1
c
A
1
T
)
1
= (A
1
)
T
.
(A
T
2I )
1
=
_
2 1
1 0
_
Theorem
I
1
(A
1
)
1
= A
1
= B
1
A
1
.
n
)
1
= (A
1
)
n
.
1
=
1
c
A
1
T
)
1
= (A
1
)
T
.
Example.
Find the matrix A that satisfy:
(A
T
2I )
1
=
_
2 1
1 0
_
Theorem
I
1
(A
1
)
1
= A
1
= B
1
A
1
.
n
)
1
= (A
1
)
n
.
1
=
1
c
A
1
T
)
1
= (A
1
)
T
.
(A
T
2I )
1
=
_
2 1
1 0
_
Theorem
I
1
(A
1
)
1
= A
1
= B
1
A
1
.
n
)
1
= (A
1
)
n
.
1
=
1
c
A
1
T
)
1
= (A
1
)
T
.
(A
T
2I )
1
=
_
2 1
1 0
_
Theorem
Let A be an n n matrix. The following are equivalent:
A is invertible.
The homogeneous system AX = 0 has only the trivial solution X = 0.
A
reduced
= I .
The system AX = B has at least one solution for every choice of
column B.
There is an n n matrix C such that AC = I .
Theorem
A is invertible.
A
reduced
= I .
column B.
Theorem
A is invertible.
A
reduced
= I .
column B.
Theorem
A is invertible.
A
reduced
= I .
column B.
Theorem
A is invertible.
A
reduced
= I .
column B.
2.5 Matrix transformation
- x
6
y
o
x
y
H
H
H
Hj
x
y
T is reection in the x-axis

T
_
x
y
_
=
_
x
y
_
=
_
1 0
0 1
_ _
x
y
_
T is induced by the matrix
_
1 0
0 1
_
Question. Find the matrix of the following transformation in the plane:
(a) Reection in the y-axis
(b) Projection on the x-axis
- x
6
y
o
x
y
H
H
H
Hj
x
y

T
_
x
y
_
=
_
x
y
_
=
_
1 0
0 1
_ _
x
y
_
_
1 0
0 1
_
- x
6
y
o
x
y
H
H
H
Hj
x
y

T
_
x
y
_
=
_
x
y
_
=
_
1 0
0 1
_ _
x
y
_
_
1 0
0 1
_
- x
6
y
o
x
y
H
H
H
Hj
x
y

T
_
x
y
_
=
_
x
y
_
=
_
1 0
0 1
_ _
x
y
_
_
1 0
0 1
_
- x
6
y
o
x
y
H
H
H
Hj
x
y

T
_
x
y
_
=
_
x
y
_
=
_
1 0
0 1
_ _
x
y
_
_
1 0
0 1
_
- x
6
y
o
x
y
H
H
H
Hj
x
y

T
_
x
y
_
=
_
x
y
_
=
_
1 0
0 1
_ _
x
y
_
_
1 0
0 1
_
- x
6
y
o
x
y
H
H
H
Hj
x
y

T
_
x
y
_
=
_
x
y
_
=
_
1 0
0 1
_ _
x
y
_
_
1 0
0 1
_
- x
6
y
o
x
y
H
H
H
Hj
x
y

T
_
x
y
_
=
_
x
y
_
=
_
1 0
0 1
_ _
x
y
_
_
1 0
0 1
_
Question.
Find the matrix of the following transformation in the plane:
- x
6
y
o
x
y
H
H
H
Hj
x
y

T
_
x
y
_
=
_
x
y
_
=
_
1 0
0 1
_ _
x
y
_
_
1 0
0 1
_
- x
6
y
o
x
y
H
H
H
Hj
x
y

T
_
x
y
_
=
_
x
y
_
=
_
1 0
0 1
_ _
x
y
_
_
1 0
0 1
_
- x
6
y
o
x
y
H
H
H
Hj
x
y

T
_
x
y
_
=
_
x
y
_
=
_
1 0
0 1
_ _
x
y
_
_
1 0
0 1
_
-
6
x
y
o
x
y
T is rotation through an angle

T
_
x
y
_
=
_
x
_
=
_
cos sin
sin cos
_ _
x
y
_
_
cos sin
sin cos
_
-
6
x
y
o
x
y

T
_
x
y
_
=
_
x
_
=
_
cos sin
sin cos
_ _
x
y
_
_
cos sin
sin cos
_
-
6
x
y
o
x
y

T
_
x
y
_
=
_
x
_
=
_
cos sin
sin cos
_ _
x
y
_
_
cos sin
sin cos
_
-
6
x
y
o
x
y

T
_
x
y
_
=
_
x
_
=
_
cos sin
sin cos
_ _
x
y
_
_
cos sin
sin cos
_
A map T : R
n
R
m
is a matrix transformation if there is a matrix A
such that T(v) = Av for all v R
n
.
This matrix A is of size m n. We say the matrix of T is A, or T is
induced by the matrix A.
Example. T : R
3
R
2
, T[x, y, z]
T
= [2x + y, x y + z]
T
, is a matrix
transformation; it is induced by the matrix
_
2 1 0
1 1 1
_
A map T : R
n
R
m
n
.
Example. T : R
3
R
2
, T[x, y, z]
T
= [2x + y, x y + z]
T
, is a matrix
_
2 1 0
1 1 1
_
A map T : R
n
R
m
n
.
Example. T : R
3
R
2
, T[x, y, z]
T
= [2x + y, x y + z]
T
, is a matrix
_
2 1 0
1 1 1
_
A map T : R
n
R
m
n
.
This matrix A is of size m n.
We say the matrix of T is A, or T is
Example. T : R
3
R
2
, T[x, y, z]
T
= [2x + y, x y + z]
T
, is a matrix
_
2 1 0
1 1 1
_
A map T : R
n
R
m
n
.
Example. T : R
3
R
2
, T[x, y, z]
T
= [2x + y, x y + z]
T
, is a matrix
_
2 1 0
1 1 1
_
A map T : R
n
R
m
n
.
Example.
T : R
3
R
2
, T[x, y, z]
T
= [2x + y, x y + z]
T
, is a matrix
_
2 1 0
1 1 1
_
A map T : R
n
R
m
n
.
Example. T : R
3
R
2
, T[x, y, z]
T
= [2x + y, x y + z]
T
, is a matrix
_
2 1 0
1 1 1
_
A map T : R
n
R
m
n
.
Example. T : R
3
R
2
, T[x, y, z]
T
= [2x + y, x y + z]
T
, is a matrix
_
2 1 0
1 1 1
_
Linear transformations
A map T : R
n
R
m
is a linear transformation if for all u, v in R
n
:
T(u +v) = T(u) + T(v)
T(ku) = kT(u), where k is a real number
Example. Check if the transformation is linear:
(a) T : R
2
R, T
_
a
b
_
= ab
(b) T : R
2
R, T
_
a
b
_
= a + 2b
(c) T : R
2
R, T
_
a
b
_
= a + 2b + 1
A map T : R
n
R
m
n
:
T(u +v) = T(u) + T(v)
(a) T : R
2
R, T
_
a
b
_
= ab
(b) T : R
2
R, T
_
a
b
_
= a + 2b
(c) T : R
2
R, T
_
a
b
_
= a + 2b + 1
A map T : R
n
R
m
n
:
T(u +v) = T(u) + T(v)
(a) T : R
2
R, T
_
a
b
_
= ab
(b) T : R
2
R, T
_
a
b
_
= a + 2b
(c) T : R
2
R, T
_
a
b
_
= a + 2b + 1
A map T : R
n
R
m
n
:
T(u +v) = T(u) + T(v)
Example.
Check if the transformation is linear:
(a) T : R
2
R, T
_
a
b
_
= ab
(b) T : R
2
R, T
_
a
b
_
= a + 2b
(c) T : R
2
R, T
_
a
b
_
= a + 2b + 1
A map T : R
n
R
m
n
:
T(u +v) = T(u) + T(v)
(a) T : R
2
R, T
_
a
b
_
= ab
(b) T : R
2
R, T
_
a
b
_
= a + 2b
(c) T : R
2
R, T
_
a
b
_
= a + 2b + 1
A map T : R
n
R
m
n
:
T(u +v) = T(u) + T(v)
(a) T : R
2
R, T
_
a
b
_
= ab
(b) T : R
2
R, T
_
a
b
_
= a + 2b
(c) T : R
2
R, T
_
a
b
_
= a + 2b + 1
A map T : R
n
R
m
n
:
T(u +v) = T(u) + T(v)
(a) T : R
2
R, T
_
a
b
_
= ab
(b) T : R
2
R, T
_
a
b
_
= a + 2b
(c) T : R
2
R, T
_
a
b
_
= a + 2b + 1
A map T : R
n
R
m
n
:
T(u +v) = T(u) + T(v)
(a) T : R
2
R, T
_
a
b
_
= ab
(b) T : R
2
R, T
_
a
b
_
= a + 2b
(c) T : R
2
R, T
_
a
b
_
= a + 2b + 1
A map T : R
n
R
m
n
:
T(u +v) = T(u) + T(v)
(a) T : R
2
R, T
_
a
b
_
= ab
(b) T : R
2
R, T
_
a
b
_
= a + 2b
(c) T : R
2
R, T
_
a
b
_
= a + 2b + 1
Property of Linear Transformation
Let T : R
n
R
m
be a linear transformation. Then
T(a
1

x
1
+ a
2

x
2
+ + a
k

x
k
) = a
1
T(

x
1
) + a
2
T(

x
2
) + + a
k
T(

x
k
)
for all a
i
R and

x
i
R
n
.
Example 1. Let T : R
2
R
2
be a linear transformation satisfying
T(u) =
_
2
3
_
, T(v) =
_
1
1
_
.
Find T(2u 5v).
2
R
2
T
_
1
1
_
=
_
2
3
_
, T
_
1
2
_
=
_
5
1
_
.
Find T
_
4
3
_
.
Let T : R
n
R
m
T(a
1

x
1
+ a
2

x
2
+ + a
k

x
k
) = a
1
T(

x
1
) + a
2
T(

x
2
) + + a
k
T(

x
k
)
for all a
i
R and

x
i
R
n
.
2
R
2
T(u) =
_
2
3
_
, T(v) =
_
1
1
_
.
Find T(2u 5v).
2
R
2
T
_
1
1
_
=
_
2
3
_
, T
_
1
2
_
=
_
5
1
_
.
Find T
_
4
3
_
.
Let T : R
n
R
m
T(a
1

x
1
+ a
2

x
2
+ + a
k

x
k
) = a
1
T(

x
1
) + a
2
T(

x
2
) + + a
k
T(

x
k
)
for all a
i
R and

x
i
R
n
.
Example 1.
Let T : R
2
R
2
T(u) =
_
2
3
_
, T(v) =
_
1
1
_
.
Find T(2u 5v).
2
R
2
T
_
1
1
_
=
_
2
3
_
, T
_
1
2
_
=
_
5
1
_
.
Find T
_
4
3
_
.
Let T : R
n
R
m
T(a
1

x
1
+ a
2

x
2
+ + a
k

x
k
) = a
1
T(

x
1
) + a
2
T(

x
2
) + + a
k
T(

x
k
)
for all a
i
R and

x
i
R
n
.
2
R
2
T(u) =
_
2
3
_
, T(v) =
_
1
1
_
.
Find T(2u 5v).
2
R
2
T
_
1
1
_
=
_
2
3
_
, T
_
1
2
_
=
_
5
1
_
.
Find T
_
4
3
_
.
Let T : R
n
R
m
T(a
1

x
1
+ a
2

x
2
+ + a
k

x
k
) = a
1
T(

x
1
) + a
2
T(

x
2
) + + a
k
T(

x
k
)
for all a
i
R and

x
i
R
n
.
2
R
2
T(u) =
_
2
3
_
, T(v) =
_
1
1
_
.
Find T(2u 5v).
2
R
2
T
_
1
1
_
=
_
2
3
_
, T
_
1
2
_
=
_
5
1
_
.
Find T
_
4
3
_
.
Let T : R
n
R
m
T(a
1

x
1
+ a
2

x
2
+ + a
k

x
k
) = a
1
T(

x
1
) + a
2
T(

x
2
) + + a
k
T(

x
k
)
for all a
i
R and

x
i
R
n
.
2
R
2
T(u) =
_
2
3
_
, T(v) =
_
1
1
_
.
Find T(2u 5v).
2
R
2
T
_
1
1
_
=
_
2
3
_
, T
_
1
2
_
=
_
5
1
_
.
Find T
_
4
3
_
.
Let T : R
n
R
m
T(a
1

x
1
+ a
2

x
2
+ + a
k

x
k
) = a
1
T(

x
1
) + a
2
T(

x
2
) + + a
k
T(

x
k
)
for all a
i
R and

x
i
R
n
.
2
R
2
T(u) =
_
2
3
_
, T(v) =
_
1
1
_
.
Find T(2u 5v).
Example 2.
Let T : R
2
R
2
T
_
1
1
_
=
_
2
3
_
, T
_
1
2
_
=
_
5
1
_
.
Find T
_
4
3
_
.
Let T : R
n
R
m
T(a
1

x
1
+ a
2

x
2
+ + a
k

x
k
) = a
1
T(

x
1
) + a
2
T(

x
2
) + + a
k
T(

x
k
)
for all a
i
R and

x
i
R
n
.
2
R
2
T(u) =
_
2
3
_
, T(v) =
_
1
1
_
.
Find T(2u 5v).
2
R
2
T
_
1
1
_
=
_
2
3
_
, T
_
1
2
_
=
_
5
1
_
.
Find T
_
4
3
_
.
Let T : R
n
R
m
T(a
1

x
1
+ a
2

x
2
+ + a
k

x
k
) = a
1
T(

x
1
) + a
2
T(

x
2
) + + a
k
T(

x
k
)
for all a
i
R and

x
i
R
n
.
2
R
2
T(u) =
_
2
3
_
, T(v) =
_
1
1
_
.
Find T(2u 5v).
2
R
2
T
_
1
1
_
=
_
2
3
_
, T
_
1
2
_
=
_
5
1
_
.
Find T
_
4
3
_
.
Let T : R
n
R
m
T(a
1

x
1
+ a
2

x
2
+ + a
k

x
k
) = a
1
T(

x
1
) + a
2
T(

x
2
) + + a
k
T(

x
k
)
for all a
i
R and

x
i
R
n
.
2
R
2
T(u) =
_
2
3
_
, T(v) =
_
1
1
_
.
Find T(2u 5v).
2
R
2
T
_
1
1
_
=
_
2
3
_
, T
_
1
2
_
=
_
5
1
_
.
Find T
_
4
3
_
.
Let T : R
n
R
m
T(a
1

x
1
+ a
2

x
2
+ + a
k

x
k
) = a
1
T(

x
1
) + a
2
T(

x
2
) + + a
k
T(

x
k
)
for all a
i
R and

x
i
R
n
.
2
R
2
T(u) =
_
2
3
_
, T(v) =
_
1
1
_
.
Find T(2u 5v).
2
R
2
T
_
1
1
_
=
_
2
3
_
, T
_
1
2
_
=
_
5
1
_
.
Find T
_
4
3
_
.
Linear Transformation and Matrix Linear Transformation
Theorem
Let T : R
n
R
m
be a linear transformation. Then T is a matrix
transformation induced by the following m n matrix
A = [T(E
1
) T(E
2
) . . . T(E
n
)]
where E
1
=
_
_
1
0
.
.
.
0
_
_
, E
2
=
_
_
0
1
.
.
.
0
_
_
, . . . , E
n
=
_
_
0
0
.
.
.
1
_
_
.
Theorem
Let T : R
n
R
m
A = [T(E
1
) T(E
2
) . . . T(E
n
)]
where E
1
=
_
_
1
0
.
.
.
0
_
_
, E
2
=
_
_
0
1
.
.
.
0
_
_
, . . . , E
n
=
_
_
0
0
.
.
.
1
_
_
.
Theorem
Let T : R
n
R
m
A = [T(E
1
) T(E
2
) . . . T(E
n
)]
where E
1
=
_
_
1
0
.
.
.
0
_
_
, E
2
=
_
_
0
1
.
.
.
0
_
_
, . . . , E
n
=
_
_
0
0
.
.
.
1
_
_
.
Composite of linear transformations
The composite of S and T, denoted by S T, is a transformation from R
n
to R
p
. It is dened by
S T(

x ) = S(T(

x ))
for all

x R
n
.
n
to R
p
. It is dened by
S T(

x ) = S(T(

x ))
for all

x R
n
.
n
to R
p
.
It is dened by
S T(

x ) = S(T(

x ))
for all

x R
n
.
n
to R
p
. It is dened by
S T(

x ) = S(T(

x ))
for all

x R
n
.
n
to R
p
. It is dened by
S T(

x ) = S(T(

x ))
for all

x R
n
.
n
to R
p
. It is dened by
S T(

x ) = S(T(

x ))
for all

x R
n
.
Theorem
If the matrix of T is A and the matrix of S is B then the matrix of S T
is BA.
Example. Let T be reection in the x-axis followed by rotation through
/2. Find the matrix of T.
The matrix of rotation R
/2
through /2 is A =
_
0 1
1 0
_
.
The matrix of reection S in x-axis is B =
_
1 0
0 1
_
.
The matrix of the composite T = R
/2
S is
AB =
_
0 1
1 0
_ _
1 0
0 1
_
=
_
0 1
1 0
_
Theorem
is BA.
/2
through /2 is A =
_
0 1
1 0
_
.
_
1 0
0 1
_
.
/2
S is
AB =
_
0 1
1 0
_ _
1 0
0 1
_
=
_
0 1
1 0
_
Theorem
is BA.
/2
through /2 is A =
_
0 1
1 0
_
.
_
1 0
0 1
_
.
/2
S is
AB =
_
0 1
1 0
_ _
1 0
0 1
_
=
_
0 1
1 0
_
Theorem
is BA.
/2
through /2 is A =
_
0 1
1 0
_
.
_
1 0
0 1
_
.
/2
S is
AB =
_
0 1
1 0
_ _
1 0
0 1
_
=
_
0 1
1 0
_
Theorem
is BA.
/2
through /2 is A =
_
0 1
1 0
_
.
_
1 0
0 1
_
.
/2
S is
AB =
_
0 1
1 0
_ _
1 0
0 1
_
=
_
0 1
1 0
_
Theorem
is BA.
/2
through /2 is A =
_
0 1
1 0
_
.
_
1 0
0 1
_
.
/2
S is
AB =
_
0 1
1 0
_ _
1 0
0 1
_
=
_
0 1
1 0
_
Theorem
is BA.
/2
through /2 is A =
_
0 1
1 0
_
.
_
1 0
0 1
_
.
/2
S is
AB =
_
0 1
1 0
_ _
1 0
0 1
_
=
_
0 1
1 0
_
2.7 Application: Input-Output economic models
A society has three basic needs: food, shelter, clothing.
There are three industries in the society - farming, housing, garment -
that produce these commodities.
Each of these industries consumes a certain proportion of the total
output of each commodity.
OUTPUT
Farming Housing Garment
Farming 0.4 0.2 0.3
CONSUMPTION Housing 0.2 0.6 0.4
Garment 0.4 0.2 0.3
Problem. Find the annual prices that each industry must charge for its
income to equal its expenditures.
OUTPUT
Farming 0.4 0.2 0.3
Garment 0.4 0.2 0.3
OUTPUT
Farming 0.4 0.2 0.3
Garment 0.4 0.2 0.3
OUTPUT
Farming 0.4 0.2 0.3
Garment 0.4 0.2 0.3
OUTPUT
Farming 0.4 0.2 0.3
Garment 0.4 0.2 0.3
OUTPUT
Farming 0.4 0.2 0.3
Garment 0.4 0.2 0.3
Problem.
Find the annual prices that each industry must charge for its
OUTPUT
Farming 0.4 0.2 0.3
Garment 0.4 0.2 0.3
OUTPUT
Farming 0.4 0.2 0.3
Garment 0.4 0.2 0.3
Let p
1
, p
2
, p
3
be the annual prices charged by the farming, housing and
garment industries.
_
_
_
0.4p
1
+ 0.2p
2
+ 0.3p
3
= p
1
0.2p
1
+ 0.6p
2
+ 0.4p
3
= p
2
0.4p
1
+ 0.2p
2
+ 0.3p
3
= p
3
Solution: (p
1
, p
2
, p
3
) = (2t, 3t, 2t)
OUTPUT
Farming 0.4 0.2 0.3
Garment 0.4 0.2 0.3
Let p
1
, p
2
, p
3
garment industries.
_
_
_
0.4p
1
+ 0.2p
2
+ 0.3p
3
= p
1
0.2p
1
+ 0.6p
2
+ 0.4p
3
= p
2
0.4p
1
+ 0.2p
2
+ 0.3p
3
= p
3
Solution: (p
1
, p
2
, p
3
) = (2t, 3t, 2t)
OUTPUT
Farming 0.4 0.2 0.3
Garment 0.4 0.2 0.3
Let p
1
, p
2
, p
3
garment industries.
_
_
_
0.4p
1
+ 0.2p
2
+ 0.3p
3
= p
1
0.2p
1
+ 0.6p
2
+ 0.4p
3
= p
2
0.4p
1
+ 0.2p
2
+ 0.3p
3
= p
3
Solution: (p
1
, p
2
, p
3
) = (2t, 3t, 2t)
OUTPUT
Farming 0.4 0.2 0.3
Garment 0.4 0.2 0.3
Let p
1
, p
2
, p
3
garment industries.
_
_
_
0.4p
1
+ 0.2p
2
+ 0.3p
3
= p
1
0.2p
1
+ 0.6p
2
+ 0.4p
3
= p
2
0.4p
1
+ 0.2p
2
+ 0.3p
3
= p
3
Solution: (p
1
, p
2
, p
3
) = (2t, 3t, 2t)
OUTPUT
Farming 0.4 0.2 0.3
Garment 0.4 0.2 0.3
Let p
1
, p
2
, p
3
garment industries.
_
_
_
0.4p
1
+ 0.2p
2
+ 0.3p
3
= p
1
0.2p
1
+ 0.6p
2
+ 0.4p
3
= p
2
0.4p
1
+ 0.2p
2
+ 0.3p
3
= p
3
Solution:
(p
1
, p
2
, p
3
) = (2t, 3t, 2t)
OUTPUT
Farming 0.4 0.2 0.3
Garment 0.4 0.2 0.3
Let p
1
, p
2
, p
3
garment industries.
_
_
_
0.4p
1
+ 0.2p
2
+ 0.3p
3
= p
1
0.2p
1
+ 0.6p
2
+ 0.4p
3
= p
2
0.4p
1
+ 0.2p
2
+ 0.3p
3
= p
3
Solution: (p
1
, p
2
, p
3
) = (2t, 3t, 2t)
Put
E =
_
_
0.4 0.2 0.3
0.2 0.6 0.4
0.4 0.2 0.3
_
_
, P =
_
_
p
1
p
2
p
3
_
_
Then the equations can be rewritten as
(I E)P = 0
The matrix E is called the input-output matrix for the economy.
Solutions P to the equation (I E)P = 0 are called equilibrium price
structures.
Put
E =
_
_
0.4 0.2 0.3
0.2 0.6 0.4
0.4 0.2 0.3
_
_
, P =
_
_
p
1
p
2
p
3
_
_
(I E)P = 0
structures.
Put
E =
_
_
0.4 0.2 0.3
0.2 0.6 0.4
0.4 0.2 0.3
_
_
, P =
_
_
p
1
p
2
p
3
_
_
(I E)P = 0
structures.
Put
E =
_
_
0.4 0.2 0.3
0.2 0.6 0.4
0.4 0.2 0.3
_
_
, P =
_
_
p
1
p
2
p
3
_
_
(I E)P = 0
structures.
Put
E =
_
_
0.4 0.2 0.3
0.2 0.6 0.4
0.4 0.2 0.3
_
_
, P =
_
_
p
1
p
2
p
3
_
_
(I E)P = 0
structures.
Put
E =
_
_
0.4 0.2 0.3
0.2 0.6 0.4
0.4 0.2 0.3
_
_
, P =
_
_
p
1
p
2
p
3
_
_
(I E)P = 0
structures.
Put
E =
_
_
0.4 0.2 0.3
0.2 0.6 0.4
0.4 0.2 0.3
_
_
, P =
_
_
p
1
p
2
p
3
_
_
(I E)P = 0
structures.

MAA101 Chapter 2

Enviado por

Dados do documento

Direitos autorais

Formatos disponíveis

Compartilhar este documento

Compartilhar ou incorporar documento

Opções de compartilhamento

Você considera este documento útil?

Este conteúdo é inapropriado?

Direitos autorais:

Formatos disponíveis

MAA101 Chapter 2

Enviado por

Direitos autorais:

Formatos disponíveis

Advanced Mathematics 2 - Linear Algebra

Chapter 2: Matrix algebra

T is reection in the x-axis

T is reection in the x-axis

T is reection in the x-axis

T is reection in the x-axis

T is reection in the x-axis

T is reection in the x-axis

T is reection in the x-axis

T is reection in the x-axis

T is reection in the x-axis

T is reection in the x-axis

T is reection in the x-axis

T is rotation through an angle

T is rotation through an angle

T is rotation through an angle

T is rotation through an angle

Você também pode gostar