• Aucun résultat trouvé

1212: Linear Algebra II Dr. Vladimir Dotsenko (Vlad) Lecture 1

N/A
N/A
Protected

Academic year: 2022

Partager "1212: Linear Algebra II Dr. Vladimir Dotsenko (Vlad) Lecture 1"

Copied!
2
0
0

Texte intégral

(1)

1212: Linear Algebra II

Dr. Vladimir Dotsenko (Vlad) Lecture 1

Recollections from the module 1111

In this module, we shall be using extensively notions and methods from the module 1111. Please consult the notes for that module when you have questions. The most important notions are that of

• vector space

• linear map and linear transformation

• linearly independent set vectors

• spanning set of vectors

• basis, dimension

• coordinates relative to a basis

• transition matrix between two coordinate systems

You should know how to compute change of coordinate between different coordinate systems, and how to transform matrices of linear maps and linear transformations between different coordinate systems.

Outline of this module

The main question that we shall address this semester is

Given a linear map or a linear transformation, how simple can its matrix be made by a change of coordinates?

We shall find an answer to this question, and see some applications of it.

The module roughly consists of three parts:

• simple observations for the general case of the question concerned

• answering the question in case there is some extra structure present (scalar product)

• answering the question in full generality (“Jordan decomposition theorem”).

There will be seven tutorial classes during this semester, and a midterm exam on March 2.

Kernels and images

Recall that asubspace of a vector spaceV is a non-empty subsetW⊂V for which

• ifw1, w2∈Wthenw1+w2∈W,

• ifw∈W andcis a scalar, thenc·w∈W.

It is easy to see that a subspace of a vector space is a vector space with the same operations.

Definition 1. Letϕ:V →W be a linear map between two vector spaces. We define itskernel Ker(ϕ)as the set of all vectorsv ∈V for which ϕ(v) = 0, and its image Im(ϕ)as the set of all vectorsw∈W such thatw=ϕ(v)for somev∈V.

1

(2)

Lemma 1. The subsetKer(ϕ)is a subset ofV, and the subsetIm(ϕ)is a subspace of W.

Proof. It follows immediately from definitions and the linearity ofϕ:

ifv1, v2∈Ker(ϕ), thenϕ(v1+v2) =ϕ(v1) +ϕ(v2) =0+0=0, ifv∈Ker(ϕ), then for any scalarcwe haveϕ(c·v) =cϕ(v) =c·0=0,

if w1, w2 ∈ Im(ϕ), then w1 = ϕ(v1) for some v1 ∈ V and w2 = ϕ(v2) for some v2 ∈ V, so we have w1+w2=ϕ(v1) +ϕ(v2) =ϕ(v1+v2),

ifw∈Im(ϕ), then w=ϕ(v)for somev∈V, so for any scalarcwe havec·w=cϕ(v) =ϕ(c·v).

We shall discuss properties of kernels and images in our next class.

2

Références

Documents relatifs

For a matrix A, the dimension of the solution space to the system of equations Ax = 0 is equal to the number of free unknowns, that is the number of columns of the reduced row

In some sense, this is a central result about linear maps (which also justifies the definition of matrix products).

(Alternatively, one can argue that being the number of pivots in the reduced row echelon form, the rank cannot exceed either the number of rows or the number of columns, but this

Clearly, for n > 0 there is basis consisting of eigenvectors (we cannot express polynomials of positive degree using eigenvectors), so the matrix of ϕ cannot be made diagonal by

To determine a basis for a linear span of given vectors, the easiest way is to form the matrix whose columns are the given vectors, and find its reduced column echelon form (like

− a k−1 e k−1 ; this way the condition on linear combinations on the first k vectors of the original basis is automatically satisfied.. The process described in the proof is

(If we introduce a coordinate system corresponding to an orthonormal basis, the vector space gets identified with R n with the usual scalar product, and a symmetric

Today we shall start proving the theorems on quadratic forms that you used in the tutorial class last week..