Lecture 8
Lecture 8
Amit Tripathi
Basic algorithm:
(a) Given a system of linear equations, apply elementary row operations
to convert it into a triangular system.
(b) Use backward substition to solve the system, one unknown at a time.
Example
Consider the linear system:
2x + y + z =5
4x − 6y = −2
−2x + 7y + 2z = 9
Example
2 1 1 5 2 1 1 5
R3 →R3 +R2
0 −8 −2 −12 −
−−−−−−→ 0 −8 −2 −12
0 8 3 14 0 0 1 2
T : V → F.
We denote Hom(V , F ) by V ∗ .
Example
Let V = F n . For any scalars c1 , · · · , cn ∈ F , define
T (x1 , · · · , xn ) = c1 x1 + · · · + cn xn .
Example
Let [a, b] be a closed interval on the real line. Let V = C ([a, b]) be the
vector space of continuous real valued functions on [a, b]. Then
Z b
L(f ) = f (t) dt
a
Example
Let V = R2 and let B = {e1 , e2 } be the standard ordered basis. For any
vector α ∈ R2 , let
x
[α]B = 1
x2
be the coordinate matrix.
Question: Can you define two linear functionals fi : R2 → R for i = 1, 2 ?
fi : V → F
Theorem
The linear functionals B ∗ = {f1 , · · · , fn } as defined above form a basis of
V ∗.
Proof.
Spanning set: Let f ∈ V ∗ . Any linear transformation is uniquely
determined by its action on a basis set. Thus, the scalars
f (α1 ), · · · , f (αn )
Proof.
Independent set: Let c1 , · · · , cn be scalars such that
c1 f1 + · · · + cn fn = 0.
Corollary
If V is a finite dimensional vector space, then dim(V ∗ ) = dim(V ).
Definition
The basis B ∗ obtained by the construction fi (αj ) = δij is called the dual
basis of B.
Example
Let V be the space of all polynomials over F . Fix a scalar a ∈ F . Define
the evaluation map at a as
Ta (g ) = g (a).
Let F n×n be the vector space of n × n matrices over F . The trace map
defined as
Tr (A) = a11 + · · · + ann
is a linear functional.
Definition
The trace of a linear operator T : V → V is defined to be the sum of its
eigenvalues.
Definition
An inner product on a real vector space V is a map
<, >: V × V → R
Definition
√
We refer to < u, u > as the norm of the vector u. It is denoted by the
symbol ||u||.
1
||u + v ||2 − ||u − v ||2 .
< u, v >=
4
Example
We define the following inner product on R2
Example
Let V = Rn×n be the space of n × n matrices. For any A and B in V ,
define
< A, B >= Tr (At B).
Then <, > is an inner product on V . Here
n
X
t
(A B)ik = aji bjk .
j=1
Example
Let W be a vector space with an inner product <, > . Let T : V → W be
any injective linear transformation. Then <, > induces an inner product on
V as follows:
< u, v >induced =< T (u), T (v ) >
Example
Let [a, b] ⊂ R be a closed interval. Let V be the vector space C [a, b]
consisting of all continuous real valued functions on [a, b]. We define an
inner product <, > on this space as following
Z b
< f , g >= f · g dt.
a
It is called the L2 norm of the function f over the interval [a, b].
Theorem
Let (V , <, >) be an inner product space. For every α, β ∈ V , we have
< u, v >= u1 v1 + · · · + un vn .
Cauchy-Schwartz implies
Proof.
We have
Let (V , <, >) be an n-dimensional inner product space i.e. there is a map
<, >: V × V → R
Example
Let V = Rn and B = {e1 , · · · , en } be the standard ordered basis. Let
<, > be the usual dot product
To find the matrix associated to this inner product, we define the scalars
Thus, the matrix of the dot product (with respect to the standard ordered
basis) is In .
Definition
We say that a real n × n matrix A is (symmetric) positive definite if it is
symmetric and X t KX > 0 for all nonzero X ∈ Rn .
Theorem
Any inner product on Rn is given by
Corollary
Upto a choice of basis B, any inner product on an n-dimensional vector
space V is given by
Theorem
A real symmetric n × n matrix is symmetric and positive definite if and
only if all its principal minors have positive determinants.