Consistent vs. Inconsistent Systems - Linear Algebra

  1. If Ax=bAx = b is consistent and Ax=0Ax = 0 has only the trivial solution, how many solutions does Ax=bAx = b have?
    Exactly one. Any two solutions differ by a solution of Ax=0Ax = 0, which must be 00.
  2. How many solutions can a system of linear equations have?
    Exactly 00, exactly 11, or infinitely many. No linear system has exactly two solutions.
  3. Why is every homogeneous system Ax=0Ax = 0 consistent?
    The zero vector x=0x = 0 always satisfies Ax=0Ax = 0, so the trivial solution always exists.
  4. When is a system of two linear equations in two unknowns inconsistent, geometrically?
    When the two lines are parallel and distinct, so they never intersect.
  5. What does it mean for a linear system to be consistent?
    It has at least one solution. An inconsistent system has no solution.
  6. How many solutions does the system x+y=2x + y = 2, 2x+2y=52x + 2y = 5 have?
    None. Doubling the first equation gives 2x+2y=42x + 2y = 4, which contradicts 2x+2y=52x + 2y = 5.
  7. An echelon form of an augmented matrix has rows [1,2,3∣4][1, 2, 3 \mid 4], [0,1,5∣2][0, 1, 5 \mid 2], [0,0,0∣7][0, 0, 0 \mid 7]. What does the third row show?
    The system is inconsistent: the third row says 0=70 = 7.
  8. For which value of kk is the system x+2y=3x + 2y = 3, 2x+4y=k2x + 4y = k consistent?
    k=6k = 6. The left side of the second equation is twice the first, so the right side must be 2â‹…3=62 \cdot 3 = 6; then there are infinitely many solutions.
  9. State the rank condition for Ax=bAx = b to be consistent.
    rank(A)=rank([A∣b])\text{rank}(A) = \text{rank}([A \mid b]). Appending bb must not create a new pivot.
  10. A consistent system has 33 equations in 55 unknowns. How many solutions does it have?
    Infinitely many. There are at most 33 pivots, so at least 22 variables are free.
  11. What row in an echelon form of the augmented matrix shows that a system is inconsistent?
    A row [0,0,…,0∣c][0, 0, \ldots, 0 \mid c] with c≠0c \ne 0, which states the false equation 0=c0 = c.
  12. If an m×nm \times n matrix AA has a pivot in every row, what is true of Ax=bAx = b?
    It is consistent for every bb in Rm\mathbb{R}^m, because no row of the form [0,…,0∣c][0, \ldots, 0 \mid c] with c≠0c \ne 0 can appear.

Study these flashcards