Terminology Flashcards

1
Q

What are elementary matrices? How many types are there? Provide examples

A

Elementary matrices are obtained by performing a single elemntary row operation on an identity matrix, there are 3 types, row swap, row multiplication and row addition

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

How can you show two matrices A and B are row equivalent using elementary matrices?

A

Two matrices are equivalent if one can be transformed into the other using a sequence of elementary row operations

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

What is a non-singular matrix? Given a square matrix A, how can you determine whether A is non-singular or not?

A

A non singular matrix is a square matrix with a non zero determinant. To determine if singular compute det(A), if A doesn’t equal 0, A is non singular

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

Given a matrix An×m. What is the dimension of the transpose of A or A^T
? Explain why the two products AA^T and A^TA can be done.

A

If A is an nxm matrix, then it’s transpose A^t is an mxn matrix. AA^T & A^TA can be done because
A is nxm, and A^T is mxn
AA^T: (nxm)(mxn) is a valid product, result is nxn
A^TA: (mxn)(nxm) is a valid product result is mxm

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

What are Euclidean vector spaces? Provide a couple of examples of Euclidean vector
spaces.

A

Euclidian vector spaces are finite dimensional vector space with a notion of distance & angles defined with dot product.

ex. R^2 is a 2D real vector space
R^3 is a 3D real vector space

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

How can you show if a subset S is a subspace of a vector space V ?

A

A subset S is a subspace if the following properties hold:
Contains 0 vector
Closed under addition
Closed under scalar multiplication

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

Show that the set of vectors, S = {(x1, x2, x3)^T such that x1 = x2 and x3 = 0} is a subspace of R^3

A

Check subspace properties
0 vector
closed under addition
closed under scalar multiplication

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

What is the null space of a matrix, A? How can you find the null space of a matrix A.

A

The null space of a matrix is the set of all vectors x such that Ax=0.

To find null space:
Setup equation Ax=0
Form the augmented matrix
Reduce to RREF
Solve for free variable
Set of solutions form the null space

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

What is the span of a set of vectors, {v1, v2, . . . , vn}?

A

The span of vectors is the set of all linear combinations of these vectors

ex. span{v1, v2, …, vn} = {c1+v1, c2+v2, … + cn+vn | Ci element of R}

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

What is a spanning set for a Euclidean vector space, R^3?

A

A spanning set is a set of vectors whose span equals the whole space R^3

ex. {(1,0,0)^T, (0,1,0)^T, (0,0,1)^T} for R^3

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

Given 3 vectors {v1, v2, v3} ∈ R^3, provide 2 different methods which you can use to determine whether those 3 vectors are linearly independent or not.

A

Row reduction: After RREF if there is a pivot in each column it is linearly independent
Determinant: If matrix is square, if det doesn’t equal 0, it is linearly independent

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

What are the fundamental differences between a spanning set of vectors for R^3,
{v1, v2, v3}, and the span of a set of vectors, span{v1, v2, v3.}

A

A spanning set of vectors is a collection of vectors, the span is all possible linear combinations of those vectors

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

What is a basis of a vector space? What is the elementary basis of R^3? Give an example of a basis of R^3 that is not the elementary basis and explain why that set of vectors form a basis.

A

A basis of vector space is a set of linearly independent vectors that span the entire vector space.

An elementary basis of R^3 is {(1,0,0)^T, (0,1,0)^T,(0,1,1)^T}

This works because vectors span R^3 and are linearly independent

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

Given 3 vectors {v1, v2, v3} ∈ R^3, provide 2 different methods which you can use to
determine whether those 3 vectors form a basis of R^3.

A

Row Reduction: Row reduce to RREF, if 3 pivot columns are present it forms a basis
Determinant: (For 3x3) compute the det(A), if det(A) doesn’t equal 0 it forms a basis

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

What is the dimension of a vector space? What is the dimension of R^3? What is thedimension of a plane in R^3? Explain your reasoning.

A

The dimension of a vector space is the numnber of basis vectors required to span the space. The dimension of R^3 is 3 as it takes 3 independent vectors to span it. The dimension of a plane in R^3 is 2, as a plane can only be spanned by 2 linearly independent vectors

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

What is the rank of a matrix? Given a matrix A3×4, how can you find the rank of matrix A?

A

The rank of amtrix is the # of linearly independent rows or columns, it tell us the dimension of the column space. To find the rank of A3x4, Convert it to RREF and count the # of non zero rows, that count will be the rank

17
Q

What is the row space and column space of a matrix A? How to find them? Are row space of A and RREF(A) the same? Are column space of A and RREF(A) the same? Why or why not?

A

Row space is the span of the row vectors of A. Colun space is the span of the coulumn vectors of A. To find row space, reduce to RREEF, the nonzero rows form a basis for the row space. For finding column space the pivot columns of A before reduction form a basis

18
Q

Explain, step by step, how to demonstrate that a map L, which transforms vectors from vector space V to vector space W (denoted as L : V → W), is a linear transformation.

A

To show tha a map is a linear transformation verify that it satisfies 2 properties, additivity, and homogenity

Additivity: L(u+v) = L(u)+L(v)
Homogenity: L(cv) = cL(v)

19
Q

Given a linear transformation L : R^n → R^m, what is the size of the matrix representationof L, A? How do you find A?

A

The matrix representation of L, A is of size: mxn because L maps R^n to R^m. To find A:

Apply L to the standard basis vectors of R^n, e1, e2, …, en.
The images L(e1), …, L(en) become the columns of A.

20
Q

Given a linear transformation L : V → W, how do you find its Kernel and Range. Show that Kernel is a subspace of vector space V .

A

Kernel space is given by Ker(L) = {v elemt of V | L(V) = 0}
The range of L is Range(L) = {L(v) | v elemtn of V} W.

To find kernel solve L(v) = 0.
Range is getting all possible outputs L(V)

Kernel is a subspace because it contains the zero vector, is closed under addition, and is closed uinder scalar multiplication.