chapter 4 Flashcards Preview

Linear Algebra > chapter 4 > Flashcards

Flashcards in chapter 4 Deck (19)
Loading flashcards...
1
Q

Let U and V be two vector spaces. A linear map (or linear transformation)
between U and V is a map T :U →V which..

A

..preserves vector space operations

2
Q

linear maps can be formed by combining other linear maps via

A

addition, composition, scalar multiplication

3
Q

Let U be a vector space with basis (e

1,…,en). A linear map T : U → V is completely determined by

A

by the images of the basis vectors T (e1),…,T(en).

4
Q

The sum of two linear maps T1,T2 :U →V is defined as;

The multiplication of a linear map T :U →V by a scalar λ ∈ R is defined as

A

(T1 +T2)(x) = T1(x)+T2(x) for every x ∈U,

(λT )(x) = λ.T (x) for every x ∈U.

5
Q

we have the standard ‘rules of matrix arithmetic’. Whenever the operations are welldefined, we have:

A
  • A +B = B + A,
  • A +(B +C) = (A +B)+C
  • A(B +C) = AB + AC,
  • (A +B)C = AC = BC,
  • λ(AB) = (λA)B = A(λB).
6
Q

The transpose of an m ×n matrix A is an n×m matrix denoted AT such that

A

(AT)ij = Aji

7
Q

A matrix A ∈ Mn(R) is called invertible iff

A

there exists another matrix B ∈ Mn(R)

such that AB = In. The matrix B is called the inverse of A

8
Q

row vectors/column vectors of matrices

A

row vectors of A - the subspace they spanned is called the row space of A and its dimension, denoted rkr (A), is called the row rank of A.
column vectors of A - the subspace they spanned is called the column space of A
and its dimension, denoted rkc (A), is called the column rank of A.

9
Q

Let A be an m×n matrix. The subspace of solution of the homogeneous system
of linear equations Ax = 0 has dimension

A

n −rk(A).

10
Q

Let A be an n ×n matrix, Then:

A is invertible ⇐⇒

A

⇐⇒ rk(A) = n.

11
Q

Let T : U → V be a linear map. The kernel (or null space) of T , denoted by N(T) or ker(T) is defined as

A

N(T)= {u∈U | T(u)=0V}.

12
Q

The range space of T , denoted by R(T ) is defined as the image of U under T :

A

R(T)={v∈V | v=T(u) for some u∈U} = {T(u) | u∈U}.

13
Q

The nullspace of a linear map T : U → V is a vector subspace of U and the range is

A

a vector subspace of V .

14
Q

Let A be an m×n matrix and let T:Rn→Rm be the linear map T(x):=Ax. Then:

A

(i) the null space of T is the solution space to the homogeneous system of linear equations Ax = 0,
(ii) the range of T is the column space of A.

15
Q

If T : U → V is a linear map, then the dimension of the range of T is called the (1). The dimension of the kernel of T is called (2)

A

(1) rank of T: rk(T):=dimR(T).

(2) the nullity of T.

16
Q

rank-nullity theorem

A

If T : U → V is a linear map between finite-dimensional vector spaces, then we have:
dimU =dimN(T)+dimR(T).

17
Q

Recall that a map f :X →Y between sets X and Y is called:

surjective if, injective if, bijective if

A

(i) surjective if for every y ∈ Y , there exists at least one point x ∈ X such that f (x) = y.
(ii) injective if for every y ∈ Y , there exists at most one point x ∈ X such that f (x) = y. In other words, for every x, x′ ∈ X , f (x) = f (x′) ⇒ x = x′.
(iii) bijective if it is both injective and surjective. In other words, for every y∈Y, there exists exactly one point x∈X such that f(x)=y.

18
Q

Let T : U → V be a linear map between two vector spaces. Then we have:

A

(i) T is surjective ⇔ rk(T ) = dim(V ).

(ii) T is injective⇔N(T)={0U}.

19
Q

Let T : U → V be a linear map between two vector spaces of the same dimension. Then:

A

T is an isomorphism ⇔ T is injective ⇔ T is surjective.