1. Linear Equations in Linear Algebra Flashcards

1
Q

What lies at the heart of linear algebra?

A

Systems of linear equations.

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

What is a linear equation?

A

A linear equation in the variables x_1,……,x_n is an equation that can be written in the form
(a_1)(x_1) = (a_2)(x_2) + ……. (a_n)(x_n) = b
where b and the coefficients a_1, … a_n are real or complex numbers, usually known in advance.

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

What is a system of linear equations?

A

A system of linear equations (or a linear system) is a collection of one or more linear equations involving the same variables - say, x_1, …..x_n

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

What is the solution of a linear system?

A

A list (s_1, s_2, … s_n) of numbers that makes each equation a true statement when the values s_1, s_2, …, s_n are substituted for x_1, x_2, …, x_n respectively.

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

What is a solution set?

A

The set of all possible solutions of a linear system.

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

When are two linear systems said to be equivalent?

A

If they have the same solution set. That is, each solution of the first system is a solution of the second system, and each solution of the second system is a solution of the first.

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

What does finding the solution set of a system of two linear equations amount to?

A

Finding the intersection of two lines.

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

Name two ways in which two lines need not intersect at a single point.

A

They could be parallel (no solution)

They could be coinciding and “intersect” at every point (infinitely many solutions).

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

When is a linear system said to be consistent?

A

When it has either one solution or infinitely many solutions.

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

When is a linear system said to be inconsistent?

A

When it has no solution.

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

What is a matrix?

A

A rectangular array of numbers, symbols, or expressions, arranged in rows and columns.

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

What is a coefficient matrix?

A

A matrix with the coefficients of each variable aligned in columns.

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

What is an augmented matrix?

A

A coefficient matrix with an added column containing constants from the right sides of the equations.

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

What does the size of a matrix tell us?

A

How many rows and columns it has.

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

How is the size of a matrix with 3 rows and 4 columns called termed?

A

A 3 by 4 matrix (3x4 matrix)

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

Describe an m x n matrix.

A

If m and n are positive integers, an m x n matrix is a rectangular array of numbers with m rows and n columns.

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

What is an algorithm?

A

A systematic procedure.

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

What is the basic strategy for solving linear systems?

A

To replace one system with an equivalent system (ie., one with the same solution set) that is easier to solve.

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

Roughly speaking, what is the algorithm for solving a linear system?

A

Use the x_1 term in the first equation of a system to eliminate the x_1 terms in the other equations. Then use the x_2 term in the second equation to eliminate the x_2 terms in the other equations, and so one, until you finally obtain a very simple equivalent system of equations.

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

How do you verify that a solution set is in fact correct?

A

By replacing the values of the corresponding variables back into the initial equations to see if they are true.

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

Name and describe the three elementary row operations.

A
  1. Replacement - Add to one row a multiple of another row.
  2. Interchange - Interchange two rows.
  3. Scaling - Multiply all entries in a row by a nonzero constant.
    It is important to note that row operations are reversible.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
22
Q

When are two matrices row equivalent?

A

When there is a sequence of elementary row operations that transform one matrix into the other.

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

What is a general conclusion of augmented matrices that are row equivalent?

A

They have the same solution sets.

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

What are the two fundamental questions about a linear system?

A
  1. Is the system consistent; does at least one solution exist?
  2. If a solution exists, is it the only one?; is the solution unique?
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
25
Q

What is a nonzero row or columns?

A

A row or column that contains at least one nonzero entry.

26
Q

What is a leading entry?

A

A leading entry of a row refers to the leftmost nonzero entry (in a nonzero row).

27
Q

What are the three properties of matrices in echelon form and the two additional properties of matrices in reduced echelon form?

A

Echelon form

  1. All nonzero rows are above any rows of all zeros.
  2. Each leading entry of a row is in a column to the right of the leading entry of the row above it.
  3. All entries in a column below a leading entry are zeros.

Reduced echelon form

  1. The leading entry in each nonzero row is 1.
  2. Each leading 1 is the only nonzero entry in its column.
28
Q

What is a main difference between the uniqueness of echelon form versus reduced echelon form?

A

Any non zero matrix may be row reduced into more than one matrix in echelon form, using different sequences of row operations. However, the reduced echelon form one obtains from a matrix is unique.

29
Q

When is one matrix said to be an echelon form of another matrix?

A

When they are row equivalent.

30
Q

What is an interesting connection between reduced echelon matrices and echelon matrices?

A

When row operations on a matrix produce an echelon form, further row operations obtain the reduced echelon form do not change the position of the leading entries.

31
Q

Why don’t the additional row operations from echelon to reduced echelon change the position of the leading entries?

A

Since reduced echelon form is unique, the leading entries are always in the same positions in any echelon form obtained from a given matrix. These leading entries correspond to leading 1’s in the reduced echelon form.

32
Q

What is a pivot position?

A

A pivot position in a matrix A is a location in A that corresponds to a leading 1 in the reduced echelon form of A.

33
Q

What is a pivot column?

A

A column that contains a pivot position.

34
Q

What is a pivot?

A

A nonzero number in a pivot position that is used as needed to create zeros via row operation.

35
Q

Describe the 4 steps in the forward phase of the row reduction algorithm as well as the backward phase (step 5).

A
  1. Begin with the leftmost nonzero column. This is a pivot column. The pivot position is at the top.
  2. Select a nonzero entry in the pivot column as a pivot. If necessary, interchange rows to move this entry into the pivot position.
  3. Use row replacement operations to create zeros in all positions below the pivot.
  4. Cover (or ignore) the row containing the pivot position and cover all rows, if any, above it. Apply steps 1-3 to the submatrix that remains. Repeat the process until there are no more non zero rows to modify.
  5. Beginning with the rightmost pivot and working upward and to the left, create zeros above each pivot. If a pivot is not 1, make it 1 by a scaling operation.
36
Q

What does the row reduction algorithm directly lead to when applied to the augmented matrix of a system?

A

an explicit description of the solution set of the linear system.

37
Q

What are basic variables?

A

The variables corresponding to pivot columns in the matrix.

38
Q

What are free variables?

A

The variables that are not pivot columns.

39
Q

When there are basic and free variables, how do we describe the solution set?

A

The solution set can be described explicitly by solving the reduced system of equations for the basic variables in terms of the free variables.

40
Q

What does a different choice of input for a free variable do to a solution?

A

Each different choice of free variable determines a (different) solution of the system, and every solution of the system is determined by a choice of the free variable.

41
Q

What is a parametric description of solution sets?

A

Solution sets in which free variables act as parameters. We make the arbitrary convention of always using free variables as the parameters for describing a solution set.

42
Q

Describe the existence and uniqueness theorem.

A

A linear system is consistent if and only if the rightmost column of the augmented matrix is not a pivot column - that is, only if an echelon form of the augmented matrix has no rows in the form [0 …….. 0 b].
If the system is consistent, then the solution set contains either (i) a unique solution, when there are no free variables, or (ii) infinitely many solutions, when there is at least one free variable.

43
Q

Describe the 5 steps to solving a linear system using row reduction.

A
  1. Write the augmented matrix of the system.
  2. Use the row reduction algorithm to obtain an equivalent matrix in echelon form. Decide whether the system is consistent. Stop here is it’s inconsistent.
  3. Continue row reduction to obtain the reduced echelon form.
  4. Write the system of equations corresponding to the matrix obtained in step 3.
  5. Rewrite each nonzero equation from step 4 so that its one basic variable is expressed in terms of any free variable appearing in the equation.
44
Q

What is a vector?

A

An ordered list of numbers.

45
Q

What is a column vector (or simply a vector)?

A

A matrix with only one column.

46
Q

In regard to vectors, what does ℝ² denote?

A

The set of all vectors with two entries, read: r-two. The ℝ stands for the real numbers that appear as entries in the vectors, and the exponent ² indicates that each vector contains two entries.

47
Q

When are two vectors in ℝ² equal?

A

If and only if their corresponding entries are equal. They need to be corresponding entries because vectors in ℝ² are ordered pairs.

48
Q

How is the sum of two vectors in ℝ² calculated?

A

By adding the corresponding entries of both vectors.

49
Q

How is a vector multiplied by a constant?

A

The scalar multiple is the vector obtained by multiplying each entry in the vector by the constant.

50
Q

How is the geometric visualization of a vector often aided?

A

By including an arrow from the origin (0,0) to the point (x1,x2)

51
Q

What is the parallelogram rule for vector addition?

A

If u and v in ℝ² are represented as points in the plane, then u+v corresponds to the fourth vertex of the parallelogram whose other vertices are u, 0, and v.

52
Q

Describe vectors in ℝ³.

A

Vectors in ℝ³ (read r-three) are 3x1 column matrices with three entries. they are represented geometrically by points in a three-dimensional coordinate space, with arrows from the origin sometimes included for visual clarity.

53
Q

Describe vectors in ℝ^n

A

If n is a positive integer, ℝ^n (read r-n) denotes the collection of all list (or ordered n-tuples) of n real numbers, usually written as nx1 column matrices.

54
Q

What is the zero vector?

A

The vector whose entries are all zero, denoted by 0.

55
Q

Describe the 8 algebraic properties of ℝ^n for all u, v, w, in ℝ^n and all scalars c and d.

A

(i) u+v = v+u
(ii) (u+v) + w = u + (v+w)
(iii) u+0 = 0+u = u
(iv) u + (-u) = -u + u = 0
(v) c(u+v) = cu + cv
(vi) (c+d)u = cu + du
(vii) c(du) = (cd)u
(viii) 1u = u

56
Q

What is a linear combination?

A

Given vectors v_1, v_2, …. , v_p in ℝ^n and given scalars c_1, c_2,….., c_p, the theory y defined by
y = (c_1)(v_1) + … + (c_p)(v_p)
is a linear combination of v_1, …, v_p with weights c_1,…., c_p, which can be any real number including 0.

57
Q

What does a vector equation
x1a1 + x2a2 + … + xnan = b
have the same solution set as?

A

The linear system whose augmented matrix is
[a1 a2 … an b]
In particular, b can be generated by by liner combination of a1, …, an if and only if there exists a solution to the linear system corresponding to the matrix.

58
Q

What is one of the key ideas in linear algebra?

A

To study the set of all vectors that can be generated or written as a linear combination of a fixed set {v1, …, vp} of vectors.

59
Q

Describe subsets and spans.

A

If v1, …, vp are in ℝ^n, then the set of all linear combinations of v1, …, vp is denoted by Span{v1, …, vp} and is called the subset of ℝ^n spanned (or generated) by v1, …, vp. That is, Span {v1, …, vp} is the collection of al vectors that can be written in the form
c1v1 + c2v2 + … + cpvp
with c1, …., cp scalars.

60
Q

What does asking whether a vector b is in Span{v1, …, vp} amount to?

A

Asking whether the vector equation
x1v1 + x2v2 + … + xpvp = b
has a solution, or equivalently, asking whether the linear system with augmented matrix [v1 … vp b] has a solution.

61
Q

Describe the geometry of Span{v} and Span{u,v}.

A

Let v be a nonzero number in ℝ³. Then Span{v} is the set of all scalar multiples of v which is the set of points on the line in ℝ³ through v and 0.
If u and v are non zero vectors in ℝ³, with v not a multiple of u, then Span{u,v} is the plane in ℝ³ that contains u, v, and 0. In particular, Span{u, v} contains the line in ℝ³ through u and 0 and the line through v and 0.