Definitions And Basic Rules Flashcards

Stuff to memorise

1
Q

Vector Space

A

A set V equipped with the following data:
D1: Addition operation (sum of 2 vectors im V is also in V)
D2: contains zero vector
D3: scalar multiplication (scalarXv must be in V)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

8 vector space rules

A
  1. v+w = w+v (COMMUTATIVE)
  2. (v+w)+u = v+(w+u) (ASSOCIATIVE)
  3. 0+v = v+0 = v (ZERO VECTOR IS ADDITIVE IDENTITY)
  4. k.(v+w) = kv+kw, k is a scalar (DISTRIBUTIVE)
  5. (k+l).v = kv+lv, k and l are scalars (DISTRIBUTIVE)
  6. k.(l.v) = (kl).v , k, l scalars (ASSOCIATIVE)
  7. 1.v = v (1 IS MULTIPLICATIVE IDENTITY)
  8. 0.v = 0 (0 scalar X any vector = 0 vector)
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Additive inverse

A

(-v) := (-1)v

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Subspace

A

A subspace that satisfies all the vector space rules (see vector space card)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Degree of a polynomial

A

The highest power of x

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Degree of a trig polynomial

A

The highest multiple of x in the formula

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

Linear combination

A

A linear combination of a finite collection v1,v2,…,vn of vectors in a vector space V is a vector of the form a1v1+a2v2+…+anvn where a1, a2, …, an are scalars

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

Span

A

A list of vectors spans a vector space if every vector in the vector space can be written as a linear combination of the vectors in the list

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

Linearly independent

A

v1, …, vn is linearly independent if a1v1+…+anvn =0 has only the trivial solution a1=a2…=an=0

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

list is linearly independent iff …

A

all vectors are non-zero and cannot be expressed as linear combinations of the others

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

Linear combination of preceding vectors proposition

A

v1, v2, …, vn is a list of vectors in V. The following are equivalent:

  1. The list is linearly dependent
  2. Either v1 = 0, or for some r in {2, 3, …n} vr is a linear combination the v1, v2, …, v(r-1) vectors
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

Bumping off proposition

A

Suppose l1, l2, …, lm is a linearly independent list of vectors in V and s1, s2, …, sn spans V. Then m<= n

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

Basis

A

A list of vectors that is linearly independent and spans V

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

Finite-dimensional

A

A vector space is finite dimensional if it has a basis e1, e2, …, en (you can count the basis vectors)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

Dimension of V

A

din V:= the number of vectors in a basis for V

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

Invariance of dimension theorem

A

If e1, e2, …, en and f1, f2, …, fm are bases of a vector space V, then m=n

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
17
Q

Bases give coordinates proposition

A

A list of vectors e1, e2, …, en is a basis for V iff every vector in V can be written as a linear combination v = a1e1+a2e2+…+anen in precisely one way

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
18
Q

Sifting algorithm

A
  1. Start with a list of vectors v1, v2, …,vn in a vector space V
  2. Consider each vector vi consecutively. If vi=0, or if it is a linear combination of the preceding vectors, remove it
  3. At the end, the resulting list will be linearly independent, by the linear combination of preceding vectors proposition
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
19
Q

Coordinate vector of v with respect to the basis B

A

v = a1b1=a2b2+…+anbn

v := [a1, a2, …, an]^T in Col(n)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
20
Q

Change of basis matrix from B to C

A

B and C are both bases for V. The change of basis matrix from B to C is the matrix whose columns are the coordinate vectors of the B basis with respect to the C basis
P(C

21
Q

Change of basis theorem

A

B and C are bases of V.

v = P(C

22
Q

Linear map

A

A function T: V –> W satisfying:
T(v+v’) = T(v) + T(v’)
T(kv) = kT(v)
where V, v’ are vectors and k is scalar

23
Q

Sufficient to define a linear map on a basis proposition

A

Suppose B = {e1, e2, …, en} is a basis of V and let W be a vector space with w1, w2, …, wn in W. There exists a linear map T:V–>W such that ei |–> wi , i = 1, …, n

24
Q

T after S

A

The composite of T with S.

If S: U –> V and T: V–> W then the composition of T after S is the function T(S(u))

25
Q

Isomorphism

A

A linear map T: V–>W is an isomorphism of vector spaces if there exists a linear map S:W–>V such that
T after S = id(v) and S after T = id(w)
We say that S is the inverse of T

26
Q

Uniqueness of inverse

A

If T:V–>W is a linear map and S,S’:W–>V are inverses of T, then S=S’

27
Q

Isomorphic

A

Two vector spaces V and W are isomorphic if there exists and isomorphism T:V–>W

28
Q

Theorem: V and W are isomorphic iff…

A

dimV=dimW

29
Q
A

V –> Col(n)
v |–> v
is an isomorphism

30
Q

The matrix of T with respect to the bases B and C

A

The matrix whose columns are the coordinate vectors of T(bi) with respect to the basis C
[T](C

31
Q

T(v) = …

A

[T](C

32
Q

Functoriality of a matrix on a linear map theorem

A

Let S:U–>V and T:V–>W be linear maps between finite dimensional vector spaces. Let B, C, D be bases for U, V and W respectively.
[T after S](D

33
Q

Corollary of Functoriality of a matrix on a linear map theorem

A

T is invertible iff [T](C

34
Q

Kernel

A

T:V –> W
Ker(t) := {v in V : T(v) = the zero vector in W}
(null space)

35
Q

Image

A

T:V –> W
Im(T) := {w in W : w=T(v) for some v in V}
(image/ column space)

36
Q

Nullity

A

Nullity(T) := Dim(Ker(T))

37
Q

Rank

A

Rank(T) := Dim(Im(T))

38
Q

Rank-nullity theorem

A

Nullity(T)+Rank(T) = Dim(T)

39
Q

Injective

A

f(x) = f(x’) ==> x = x’

40
Q

Surjective

A

For every y in Y, there is an x in X such that f(x) = y

41
Q

T:V –> W then T injective iff

A

Ker(T) = {the zero vector in v}

42
Q

T:V –> V where V is finite dimensional

T injective iff

A

T surjective

43
Q

T: V–>W is an isomorphism iff

A

T is injective and surjective

44
Q

Eigenvalue

A

T: V–>V

l is an eigenvalue of T if there exists a non-zero vector such that T(v) = Lv

45
Q

l is an eigenvalue of T iff… (3 statements)

A

T-Lid is not injective
T-Lid is not surjective
T-Lid is not an isomorphism

46
Q

Eigenvector

A

A non-zero vector such that T(v)=Lv for some l in the Reals

47
Q

Determinant of a linear operator

A

det(T) := det([T}(B

48
Q

Characteristic polynomial

A

det(Lid-T)

49
Q

Eigenspace

A

E(L) := {v in V : T(v) = Lv} in V