Topic 3 Linear Transformations
This topic explores mapping vectors from one space to another. Key skills include finding the "standard matrix"
Question 1: Standard Matrix from Geometric Transformations (Rotation & Reflection)
Source: Practice Exam 4, Question 9
Exact Question: Let
Methodology:
- Objective: Construct the
standard matrix . - Process: Apply the geometric sequence to the standard basis vectors
and individually. - Step A (Rotation): A rotation by angle
maps to and to . - Step B (Reflection): The line
is the -axis (the horizontal axis). Reflecting across the horizontal axis flips the sign of the vertical component (the or value): .
- Step A (Rotation): A rotation by angle
Solution:
- Track
: - Rotate by
(which is ): . - Reflect through
: Flip the second component. .
- Rotate by
- Track
: - Rotate by
: . - Reflect through
: Flip the second component. .
- Rotate by
- Assemble the Matrix:
Final Answer:
Question 2: Standard Matrix from Geometric Transformations (Projection & Rotation)
Source: Exam 2, Question 5
Exact Question: Let
Methodology:
- Objective: Again, find
. - Projection Formula: The projection of a vector
onto a line spanned by a vector is . - Find the direction vector
for the line . A simple choice is .
- Find the direction vector
- Rotation Logic: A
counterclockwise rotation maps any vector to .
Solution:
- Track
: - Project onto
: . - Rotate
ccw: Swap coordinates and negate the first. .
- Project onto
- Track
: - Project onto
: . - Rotate
ccw: Swap and negate the first. .
- Project onto
- Assemble the Matrix:
Final Answer:
Question 3: Standard Matrix from Non-Standard Mapping Images
Source: Exam 2, Question 9
Exact Question: Consider the linear transformation
a. Find the standard matrix
b. Is
Methodology:
- Part A: You don't know
or directly. Because is linear, . - Express
and as linear combinations of the given inputs and by solving augmented matrices. - Apply the transformation
to those combinations to get and .
- Express
- Part B: A transformation
is injective (one-to-one) if has only the trivial solution. This happens if and only if every column of has a pivot.
Solution:
Part a:
- Find
in terms of : Solve .
Row reduce:.
.
So,. - Compute
: . - Find
in terms of : Solve .
Row reduce:.
.
So,. - Compute
: .
Answer (a):
Part b:
- Row reduce
to check for pivots.
(swapped rows for easier math, ).
.
.
It's clear both columns will have pivots. (Echelon form reduces to).
Answer (b): Sincehas a pivot in every column, the equation only has the trivial solution. Thus, is injective.
Question 4: Range of a Transformation
Source: Practice Exam 3, Question 3
Exact Question: Let
Methodology:
- Objective: Determine if the columns of
span . If they do not, find a vector that makes the system inconsistent (i.e., creates a contradictory row like ). - Process: Set up the augmented matrix
and perform row reduction until you obtain a row of zeros on the left side. The corresponding algebraic expression on the right side will dictate the condition for to be in the range.
Solution:
- Step 1: Set up augmented matrix
. - Step 2: Row reduce.
, . - Step 3: Eliminate row 3 column 3.
. - Step 4: Simplify the right side of the bottom row.
. - Conclusion: The system is only consistent (and thus
is only in the range) if . Since we are restricted by this equation, the range is not all of . To find a vector outside the range, we just need to pick numbers such that .
Let. Then .
Final Answer: No, the range is not. A vector not in the range is .
Question 5: Mapping Properties (Injectivity/Surjectivity/Bijectivity)
Source: Practice Exam 3, Question 10
Exact Question: Give an example of linear transformations
Methodology:
- Objective: Construct standard matrices
(for ) and (for ) that fulfill the required rules. means is . For to be injective, must have a pivot in every column (2 pivots total). means is . For to be surjective, must have a pivot in every row (2 pivots total). is represented by the matrix product . For it to be bijective (both injective and surjective), the resulting matrix must be invertible (have 2 pivots). We need to arrange and so that has less than 2 pivots (rank ).
- Process: Pick very simple matrices (like parts of the identity matrix) and test the product.
Solution:
- Step 1: Construct Injective
. Let . Every column has a pivot. - Step 2: Construct Surjective
. Let . Every row has a pivot. - Step 3: Compute
. - Conclusion: The matrix
represents . It is in echelon form and only has 1 pivot. Since a matrix needs 2 pivots to be invertible/bijective, this transformation is not bijective.
Final Answer: Letand . is injective (pivot in every column), is surjective (pivot in every row), but which lacks a pivot in the second row/column, making it not bijective.