Skip to main content

Module Quiz

Complete this quiz after finishing all concept and practice pages.

Current Module Questions​

Question 1: Row Operations​

Why do elementary row operations preserve the solution set of a linear system?

Answer: Because they replace equations by logically equivalent linear combinations, so the set of vectors satisfying all equations stays the same.

Question 2: Pivot Meaning​

A reduced matrix has pivots in columns 1, 2, and 4, with 5 total columns. What does that tell you immediately about the nullspace?

Answer: Nullity is 5 - 3 = 2, so the nullspace has dimension 2 and there are two free variables.

Question 3: Composition​

If B acts first and A acts second on a vector, which product represents the combined action?

Answer: AB.

Question 4: Invertibility​

What are two structural consequences of a square matrix being invertible?

Answer: Every b has a unique solution in Ax = b, and the columns are linearly independent.

Question 5: Subspace Test​

Why is the set {(x, y) : y = x + 1} not a subspace of R^2?

Answer: It does not contain the zero vector and is not closed under scalar multiplication.

Question 6: Column Space​

What does it mean geometrically if b is not in Col(A)?

Answer: The system Ax = b is inconsistent; the output target lies outside the space the matrix can produce.

Question 7: Basis​

What two properties must a set have to be a basis?

Answer: It must be linearly independent and spanning.

Question 8: Linear Transformations​

Why do the columns of a matrix represent the images of basis vectors?

Answer: Because linearity means the action on any vector is determined by how the transformation acts on the basis vectors, and those images become the columns.

Question 9: Orthogonality​

What condition characterizes a residual vector in least squares?

Answer: The residual is orthogonal to the column space of A.

Question 10: QR​

Why is QR often preferred to normal equations in computation?

Answer: Because QR avoids squaring conditioning effects through A^T A and is generally more numerically stable.

Question 11: Determinants​

What does det(A) = 0 mean structurally?

Answer: The transformation collapses volume, is singular, and is not invertible.

Question 12: Eigenvectors​

What is an eigenvector of A?

Answer: A nonzero vector whose direction is preserved by A, so Av = lambda v for some scalar lambda.

Question 13: Diagonalization​

What is the main computational advantage of diagonalization?

Answer: It turns repeated matrix powers and related operations into scalar powers on a diagonal matrix.

Question 14: Positive Definiteness​

What does it mean for a symmetric matrix A to be positive definite?

Answer: x^T A x > 0 for every nonzero vector x.

Question 15: SVD​

What is the conceptual meaning of the singular values of a matrix?

Answer: They are the principal stretch factors of the matrix along orthogonal input directions.

Interleaved Review Questions​

Prior Module Question 1​

Why is a direct proof sensitive to the exact form of the statement you are trying to prove?

Answer: Because the proof method should match the logical shape of the claim and its hypotheses.

Prior Module Question 2​

What is the difference between a graph path and a cycle?

Answer: A path moves through distinct vertices in sequence; a cycle is a closed path that returns to the start.

Prior Module Question 3​

What does conditional probability do to a probability space?

Answer: It restricts the world to outcomes consistent with the conditioning event and renormalizes inside that restricted space.

Prior Module Question 4​

Why is P(A | B) usually different from P(B | A)?

Answer: Because the conditioning event changes the denominator and therefore changes the restricted world being measured.

Prior Module Question 5​

Why does a proof by example fail for a universal statement?

Answer: Because some verified instances cannot rule out a counterexample elsewhere.

Self-Assessment and Remediation​

Mastery Level (90-100% correct):

  • Ready to advance with strong structural understanding.

Proficient Level (75-89% correct):

  • Review the exact cluster where misses occurred and redo two parallel problems of that type.

Developing Level (60-74% correct):

  • Rework the practice pages, especially rank/nullspace, least squares, and spectral thinking.

Insufficient Level (<60% correct):

  • Return to the concept sequence and rebuild elimination, subspace, and transformation language before advancing.