lecture2 notes
lecture2 notes
Exercise 1.
Let A = (Aij )(i,j)∈{1,...,n} be a square matrix of size n × n, recall that the trace of A is
the sum of its diagonal elements:
X
n
tr(A) = Aii .
i=1
Define an inner product on Mn (R) by:
(A|B) = tr(t AB).
Show, by brute force computation, that:
1 1 0 1 1 0 1 0 1 1 0 −1
√ , √ , √ , √
2 0 1 2 0 −1 2 1 0 2 1 0
Exercise 2.
Let E be a 3-dimensional Euclidean space with basis B = (⃗e1 , ⃗e2 , ⃗e3 ) and assume that
its dot product satisfies:
⃗e1 · ⃗e1 = 1, ⃗e2 · ⃗e2 = 2, ⃗e2 · ⃗e3 = 2
⃗e · ⃗e = 1
1 2
⃗e1 · ⃗e3 = −1
⃗e2 · ⃗e3 = −1
This can also be represented as a symmetric matrix:
1 1 −1
G = (ei · ej )(i,j)∈{1,2,3} =
1 2 −1.
−1 −1 2
The goal of this exercise is to apply to this example an algorithm that enables us to
construct an orthonormal basis (Gram-Schmidt orthonormalisation procedure) from
the basis (this is, essence, the proof carried out on an example, that every Euclidean
space has an orthonormal basis).
(1) We set ⃗f1 = ⃗e1 , calculate ⃗f2′ = ⃗e2 − (⃗f1 · ⃗e2 )⃗f1 .
⃗′
f
(2) Show that ⃗f ′ · ⃗f1 = 0, define ⃗f2 = 2′ .
2 ||f
⃗ ||
2
(3) Calculate ⃗f3′ = ⃗e3 − (⃗f1 · ⃗e3 )⃗f1 − (⃗f2 · ⃗e3 )⃗f2 .
(4) Show that ⃗f3′ · f⃗1 = ⃗f3′ · ⃗f2 = 0.
(5) Deduce an orthonormal basis for E from these computations.
(6) (Optional): Can you describe the general procedure?
1
Winter 2025 - Advanced Calculus MATH 314
1 1 0
(1) Consider in R3 the vectors X =
Exercise 3. 0 , Y = −1 , Z = 0 ,
0 0 1
calculate the triple product of [X, Y, Z].
(2) Sketch the parallelepiped with vertices: A = (0, 0, 0), B = (1, 0, 0), C = (1, −1, 0), D =
(2, −1, 0), E = (0, 0, 1), F = (1, 0, 1), G = (1, −1, 1), D = (2, −1, 1) and calculate
its volume.
(3) Compare with the answer to the first question.