Professional Documents
Culture Documents
My contact details
Dr Enrico Onali
Who am I?
Financial econometrics
What is it? Why is it useful?
Financial econometrics: Basically, a branch of applied
mathematics
Dissertation: This module will be very helpful for those of you
who decide to write a dissertation
Employability: employers like people with numeracy skills,
although returns to skills vary with the country
http://www.economist.com/blogs/freeexchange/2014/01/economic-value-skills
1.
TECHNICAL BACKGROUND
1.
TECHNICAL BACKGROUND
1.
TECHNICAL BACKGROUND
1.
TECHNICAL BACKGROUND
2,1 a 2, 2 a 2,3
10
11
12
0 1 0 0
A=
0 0 2 0
0 0 0 1
13
0 1
14
0 1
I3 = 1 0 0
0 1 0
0 0 1
15
0 1
I3 = 1 0 0
0 1 0
0 0 1
I4 = 1
0
0
0
1
0
0
0
0
1
0
0
0
16
0 1
I3 = 1 0 0
0 1 0
0 0 1
I4 = 1
0
0
0
1
0
0
0
0
1
0
0
0
4
7
1 2
A=
9
2 3 6
4 6
2 8
7 9 8 0
17
18
0.3
0
19
0.3
0
0.5 0.5
0.3 0.2 0.6 0.1
A+B=
=
0.1 1
0.1 0 0.7 0.3
20
0.3
0
0.5 0.5
0.3 0.2 0.6 0.1
A+B=
=
0.1 1
0.1 0 0.7 0.3
0.3 0.2 0.6 0.1
0.1 0.7
A B =
=
0.1 0.4
0.1 0 0.7 0.3
21
(i)
Scalar multiplication
A = 0.3 0.6
0.1 0.7
then
22
(i)
Scalar multiplication
(ii)
A = 0.3 0.6
0.1 0.7
then
Matrix multiplication
Two matrices can be multiplied together if (and only if) the number of
columns in the 1st matrix equals the number of rows in the 2nd matrix.
The number of rows in the 1st matrix determines the number of rows in
the product matrix, and the number of columns in the 2nd matrix
determines the number of columns in the product matrix.
23
24
25
1 2
Let A =
7 3
1 6
and B = 0 2 4 9
6 3 0 2
26
0 2 4 9
1 2
Let A =
and B =
6 3 0 2
7 3
1 6
c1,1
Let C = c 2,1
c
3,1
c1, 2
c 2, 2
c 3, 2
c1,3
c 2,3
c 3, 3
c1, 4
c 2, 4
c 3, 4
27
1 2
A=
7 3
1 6
B = 0 2 4 9
6 3 0 2
c1,1 is the sum of the products of the 1st row of A and the 1st column of B
c1,1 = 10 + 26 = 12
28
A=
1 2
7 3
1 6
B = 0 2 4 9
6 3 0 2
c1,1 is the sum of the products of the 1st row of A and the 1st column of B
c1,1 = 10 + 26 = 12
c1,2 is the sum of the products of the 1st row of A and the 2nd column of B
c1,2 = 12 + 23 = 8
29
1 2
A=
7 3
1 6
B = 0 2 4 9
6 3 0 2
c1,1 is the sum of the products of the 1st row of A and the 1st column of B
c1,1 = 10 + 26 = 12
c1,2 is the sum of the products of the 1st row of A and the 2nd column of B
c1,2 = 12 + 23 = 8
c1,3 is the sum of the products of the 1st row of A and the 3rd column of B
c1,3 = 14 + 20 = 4
30
1 2
A=
7 3
1 6
B = 0 2 4 9
6 3 0 2
c1,1 is the sum of the products of the 1st row of A and the 1st column of B:
c1,1 = 10 + 26 = 12
c1,2 is the sum of the products of the 1st row of A and the 2nd column of B:
c1,2 = 12 + 23 = 8
c1,3 is the sum of the products of the 1st row of A and the 3rd column of B:
c1,3 = 14 + 20 = 4
c1,4 is the sum of the products of the 1st row of A and the 4th column of B
c1,4 = 19 + 22 = 13
31
1 2
A=
7 3
1 6
B = 0 2 4 9
6 3 0 2
c1,1 is the sum of the products of the 1st row of A and the 1st column of B:
c1,1 = 10 + 26 = 12
c1,2 is the sum of the products of the 1st row of A and the 2nd column of B:
c1,2 = 12 + 23 = 8
c1,3 is the sum of the products of the 1st row of A and the 3rd column of B:
c1,3 = 14 + 20 = 4
c1,4 is the sum of the products of the 1st row of A and the 4th column of B:
c1,4 = 19 + 22 = 13
c2,1 is the sum of the products of the 2nd row of A and the 1st column of B
c2,1 = 70 + 36 = 18
32
1 2
A=
7 3
1 6
B = 0 2 4 9
6 3 0 2
c1,1 is the sum of the products of the 1st row of A and the 1st column of B:
c1,1 = 10 + 26 = 12
c1,2 is the sum of the products of the 1st row of A and the 2nd column of B:
c1,2 = 12 + 23 = 8
c1,3 is the sum of the products of the 1st row of A and the 3rd column of B:
c1,3 = 14 + 20 = 4
c1,4 is the sum of the products of the 1st row of A and the 4th column of B:
c1,4 = 19 + 22 = 13
c2,1 is the sum of the products of the 2nd row of A and the 1st column of B:
c2,1 = 70 + 36 = 18
c2,2 is the sum of the products of the 2nd row of A and the 2nd column of B
33
c2,2 = 72 + 33 = 23
and so on.
6 3 0 2
36 20 4 21
1 6
34
6 3 0 2
36 20 4 21
1 6
Note that in this case the product matrix AB exists, but the product matrix
BA does not exist, because the number of columns in B the number of
rows in A.
35
6 3 0 2
36 20 4 21
1 6
Note that in this case the product matrix AB exists, but the product matrix
BA does not exist, because the number of columns in B the number of
rows in A.
Transposition
The transpose of an (RC) matrix A, written A', is the (CR) matrix
obtained by transposing (switching) the rows and columns of the matrix
A.
36
6 3 0 2
36 20 4 21
1 6
Note that in this case the product matrix AB exists, but the product matrix
BA does not exist, because the number of columns in B the number of
rows in A.
Transposition
The transpose of an (RC) matrix A, written A', is the (CR) matrix
obtained by transposing (switching) the rows and columns of the matrix
A.
1 2
1 7 1
If A =
A' =
7
3
2 3 6
1 6
37
38
1 2
3 6
and B =
2 4
0 0
and C =
0 0
39
1 2
3 6
and B =
2 4
0 0
and C =
0 0
40
1 2
3 6
and B =
2 4
0 0
and C =
0 0
41
1 2
3 6
and B =
2 4
0 0
and C =
0 0
42
For any square matrix that has full rank, an inverse matrix can be defined
such that the product of the original matrix and the inverse matrix is an
identity matrix. In this case, the order in which the two matrices are
multiplied does not matter.
43
For any square matrix that has full rank, an inverse matrix can be defined
such that the product of the original matrix and the inverse matrix is an
identity matrix. In this case, the order in which the two matrices are
multiplied does not matter.
If the original matrix is A, the inverse matrix is denoted A1.
44
For any square matrix that has full rank, an inverse matrix can be defined
such that the product of the original matrix and the inverse matrix is an
identity matrix. In this case, the order in which the two matrices are
multiplied does not matter.
If the original matrix is A, the inverse matrix is denoted A1.
If A is (mm), AA1 = A1A = Im
45
For any square matrix that has full rank, an inverse matrix can be defined
such that the product of the original matrix and the inverse matrix is an
identity matrix. In this case, the order in which the two matrices are
multiplied does not matter.
If the original matrix is A, the inverse matrix is denoted A1.
If A is (mm), AA1 = A1A = Im
If A is (22), the formula for A1 is relatively simple.
46
a b
If A =
c d
1 d b
then A1 =
ad bc c a
47
1 2
48
1 2
A1
1
2 3
=
4 2 3 1 1 4
49
1 2
A1
1
2 3
=
4 2 3 1 1 4
1 2 3
0.4 0.6
=
=
5 1 4
0.2 0.8
50
1 2
A1
1
2 3
=
4 2 3 1 1 4
1 2 3
0.4 0.6
=
=
5 1 4
0.2 0.8
4 3 0.4 0.6
1 0 = I
Check: AA1 =
=
2
1 2 0.2 0.8
0 1
51
1 2
A1
1
2 3
=
4 2 3 1 1 4
1 2 3
0.4 0.6
=
=
5 1 4
0.2 0.8
4 3 0.4 0.6
1 0 = I
Check: AA1 =
=
2
1 2 0.2 0.8
0 1
52
53
54
55
56
57
For A =
1 2
3
A Im = 4 3 1 0 = 4 3 0 = 4
2
1 2
0 1 1 2 0 1
58
For A =
1 2
3
A Im = 4 3 1 0 = 4 3 0 = 4
2
1 2
0 1 1 2 0 1
det(A Im) = (4 )(2 ) 3 1 = 8 6 + 2 3 = 2 6 + 5
59
For A =
1 2
3
A Im = 4 3 1 0 = 4 3 0 = 4
2
1 2
0 1 1 2 0 1
det(A Im) = (4 )(2 ) 3 1 = 8 6 + 2 3 = 2 6 + 5
det(A Im) = 0
2 6 + 5 = 0
60
For A =
1 2
3
A Im = 4 3 1 0 = 4 3 0 = 4
2
1 2
0 1 1 2 0 1
det(A Im) = (4 )(2 ) 3 1 = 8 6 + 2 3 = 2 6 + 5
det(A Im) = 0
2 6 + 5 = 0
( 5)( 1) = 0
61
For A =
1 2
3
A Im = 4 3 1 0 = 4 3 0 = 4
2
1 2
0 1 1 2 0 1
det(A Im) = (4 )(2 ) 3 1 = 8 6 + 2 3 = 2 6 + 5
det(A Im) = 0
2 6 + 5 = 0
( 5)( 1) = 0
62
63