One-to-One & Onto - Linear Algebra

  1. For T(x)=AxT(\mathbf{x}) = A\mathbf{x} with AA an m×nm \times n matrix, what condition on the columns makes TT onto Rm\mathbb{R}^m?
    The columns span Rm\mathbb{R}^m, so there is a pivot in every row.
  2. Which of one-to-one and onto does T(x,y)=(x−y,3y−3x)T(x, y) = (x - y, 3y - 3x) satisfy?
    Neither. (1,1)(1, 1) is a nonzero kernel vector, and the range is only the line spanned by (1,−3)(1, -3).
  3. What prevents any linear T:R3→R2T: \mathbb{R}^3 \to \mathbb{R}^2 from being one-to-one?
    Its 2×32 \times 3 matrix has at most 2 pivots for 3 columns, so a free variable gives a nonzero kernel vector.
  4. Which of one-to-one and onto does T(x,y)=(x,y,x+y)T(x, y) = (x, y, x + y) from R2\mathbb{R}^2 to R3\mathbb{R}^3 satisfy?
    One-to-one only. The kernel is {0}\{\mathbf{0}\}, but the range is a plane in R3\mathbb{R}^3.
  5. For T(x)=AxT(\mathbf{x}) = A\mathbf{x}, what condition on the columns of AA makes TT one-to-one?
    The columns of AA are linearly independent, so there is a pivot in every column.
  6. What does it mean for a transformation TT to be one-to-one?
    T(u)=T(v)T(\mathbf{u}) = T(\mathbf{v}) implies u=v\mathbf{u} = \mathbf{v}: each output comes from at most one input.
  7. T(x)=AxT(\mathbf{x}) = A\mathbf{x} for a 3×33 \times 3 matrix with det⁡A=0\det A = 0. Which of one-to-one and onto does TT satisfy?
    Neither. A singular square matrix has a nontrivial null space, and for square matrices onto fails exactly when one-to-one fails.
  8. What prevents any linear T:R2→R3T: \mathbb{R}^2 \to \mathbb{R}^3 from being onto?
    Its 3×23 \times 2 matrix has at most 2 pivots for 3 rows, so the range has dimension at most 2.
  9. Which of one-to-one and onto does T(x,y,z)=(x,y)T(x, y, z) = (x, y) from R3\mathbb{R}^3 to R2\mathbb{R}^2 satisfy?
    Onto only. Every (a,b)(a, b) is hit, but the kernel contains (0,0,1)(0, 0, 1).
  10. For a linear T:Rn→RnT: \mathbb{R}^n \to \mathbb{R}^n, how are one-to-one and onto related?
    They are equivalent: both hold exactly when the standard matrix is invertible.
  11. What kernel condition is equivalent to a linear TT being one-to-one?
    ker⁡T={0}\ker T = \{\mathbf{0}\}. If T(u)=T(v)T(\mathbf{u}) = T(\mathbf{v}), then u−v\mathbf{u} - \mathbf{v} is in the kernel.
  12. What does it mean for T:V→WT: V \to W to be onto?
    Every vector in WW is T(v)T(\mathbf{v}) for at least one v\mathbf{v} in VV; the range is all of WW.

Study these flashcards