Transition matrix: P_{C←B} such that [v]_C = P_{C←B}[v]_B
- Form matrices B and C with basis vectors as columns
- Calculate P_{C←B} = C⁻¹B
- Apply transformation: [v]_C = P_{C←B}[v]_B
B = \(\begin{bmatrix} 1 & 3 \\ 2 & 4 \end{bmatrix}\) (columns are vectors in basis B)
C = \(\begin{bmatrix} 1 & 0 \\ 0 & 1 \end{bmatrix}\) = I (standard basis is identity matrix)
Since C = I, we have C⁻¹ = I
Therefore: P_{C←B} = C⁻¹B = IB = B
So P_{C←B} = \(\begin{bmatrix} 1 & 3 \\ 2 & 4 \end{bmatrix}\)
[v]_C = P_{C←B}[v]_B
[v]_C = \(\begin{bmatrix} 1 & 3 \\ 2 & 4 \end{bmatrix} \begin{bmatrix} 2 \\ 1 \end{bmatrix}\)
= \(\begin{bmatrix} (1)(2) + (3)(1) \\ (2)(2) + (4)(1) \end{bmatrix} = \begin{bmatrix} 5 \\ 8 \end{bmatrix}\)
In standard coordinates: v = 5(1, 0) + 8(0, 1) = (5, 8)
Check using B coordinates: v = 2(1, 2) + 1(3, 4) = (2, 4) + (3, 4) = (5, 8) ✓
For any basis B to standard basis C, P_{C←B} is simply the matrix with B's vectors as columns
This is because the standard basis vectors are the "reference" for coordinate representation
The transition matrix is P_{C←B} = \(\begin{bmatrix} 1 & 3 \\ 2 & 4 \end{bmatrix}\) and [v]_C = \(\begin{bmatrix} 5 \\ 8 \end{bmatrix}\)
• Transition formula: [v]_C = P_{C←B}[v]_B
• Standard basis: Transition to standard basis uses basis matrix directly
• Verification: Convert back to verify correctness
General transition matrix: P_{C←B} = C⁻¹B where B and C are matrices with basis vectors as columns
B = \(\begin{bmatrix} 1 & 2 \\ 1 & 3 \end{bmatrix}\) (columns: (1,1), (2,3))
C = \(\begin{bmatrix} 1 & 1 \\ 2 & 1 \end{bmatrix}\) (columns: (1,2), (1,1))
For C = \(\begin{bmatrix} 1 & 1 \\ 2 & 1 \end{bmatrix}\): det(C) = (1)(1) - (1)(2) = -1
Using 2×2 inverse formula: C⁻¹ = \(\frac{1}{-1}\begin{bmatrix} 1 & -1 \\ -2 & 1 \end{bmatrix} = \begin{bmatrix} -1 & 1 \\ 2 & -1 \end{bmatrix}\)
P_{C←B} = \(\begin{bmatrix} -1 & 1 \\ 2 & -1 \end{bmatrix} \begin{bmatrix} 1 & 2 \\ 1 & 3 \end{bmatrix}\)
= \(\begin{bmatrix} (-1)(1) + (1)(1) & (-1)(2) + (1)(3) \\ (2)(1) + (-1)(1) & (2)(2) + (-1)(3) \end{bmatrix}\)
= \(\begin{bmatrix} 0 & 1 \\ 1 & 1 \end{bmatrix}\)
[w]_C = P_{C←B}[w]_B = \(\begin{bmatrix} 0 & 1 \\ 1 & 1 \end{bmatrix} \begin{bmatrix} 4 \\ 1 \end{bmatrix}\)
= \(\begin{bmatrix} (0)(4) + (1)(1) \\ (1)(4) + (1)(1) \end{bmatrix} = \begin{bmatrix} 1 \\ 5 \end{bmatrix}\)
In basis C: w = 1(1,2) + 5(1,1) = (1,2) + (5,5) = (6,7)
In basis B: w = 4(1,1) + 1(2,3) = (4,4) + (2,3) = (6,7) ✓
Both representations yield the same vector in standard coordinates
The transition matrix is P_{C←B} = \(\begin{bmatrix} 0 & 1 \\ 1 & 1 \end{bmatrix}\) and [w]_C = \(\begin{bmatrix} 1 \\ 5 \end{bmatrix}\)
• General formula: P_{C←B} = C⁻¹B
• Matrix multiplication: Standard algorithm
• Verification: Convert to standard coordinates to check
Inverse property: P_{B←C} = (P_{C←B})⁻¹
P_{B←C} = B⁻¹C
From Exercise 2: B = \(\begin{bmatrix} 1 & 2 \\ 1 & 3 \end{bmatrix}\), C = \(\begin{bmatrix} 1 & 1 \\ 2 & 1 \end{bmatrix}\)
det(B) = (1)(3) - (2)(1) = 1
B⁻¹ = \(\begin{bmatrix} 3 & -2 \\ -1 & 1 \end{bmatrix}\)
P_{B←C} = B⁻¹C = \(\begin{bmatrix} 3 & -2 \\ -1 & 1 \end{bmatrix} \begin{bmatrix} 1 & 1 \\ 2 & 1 \end{bmatrix}\)
= \(\begin{bmatrix} 3-4 & 3-2 \\ -1+2 & -1+1 \end{bmatrix} = \begin{bmatrix} -1 & 1 \\ 1 & 0 \end{bmatrix}\)
From Exercise 2: P_{C←B} = \(\begin{bmatrix} 0 & 1 \\ 1 & 1 \end{bmatrix}\)
det(P_{C←B}) = (0)(1) - (1)(1) = -1
(P_{C←B})⁻¹ = \(\frac{1}{-1}\begin{bmatrix} 1 & -1 \\ -1 & 0 \end{bmatrix} = \begin{bmatrix} -1 & 1 \\ 1 & 0 \end{bmatrix}\)
P_{B←C} = \(\begin{bmatrix} -1 & 1 \\ 1 & 0 \end{bmatrix}\) = (P_{C←B})⁻¹ ✓
P_{C←B} × P_{B←C} should equal I:
\(\begin{bmatrix} 0 & 1 \\ 1 & 1 \end{bmatrix} \begin{bmatrix} -1 & 1 \\ 1 & 0 \end{bmatrix} = \begin{bmatrix} 1 & 0 \\ 0 & 1 \end{bmatrix} = I\) ✓
Given [w]_C = \(\begin{bmatrix} 1 \\ 5 \end{bmatrix}\) (from Exercise 2), let's verify:
[w]_B = P_{B←C}[w]_C = \(\begin{bmatrix} -1 & 1 \\ 1 & 0 \end{bmatrix} \begin{bmatrix} 1 \\ 5 \end{bmatrix} = \begin{bmatrix} -1+5 \\ 1+0 \end{bmatrix} = \begin{bmatrix} 4 \\ 1 \end{bmatrix}\)
This matches [w]_B = \(\begin{bmatrix} 4 \\ 1 \end{bmatrix}\) from Exercise 2 ✓
The inverse transition matrix is P_{B←C} = \(\begin{bmatrix} -1 & 1 \\ 1 & 0 \end{bmatrix}\)
• Inverse property: P_{B←C} = (P_{C←B})⁻¹
• Verification: P_{C←B}P_{B←C} = I
• Consistency: Both methods yield the same result
Matrix representation: [A]_B = P_{B←E}AP_{E←B} where E is standard basis and P_{E←B} = B
B = \(\begin{bmatrix} 1 & 2 \\ 1 & 1 \end{bmatrix}\) (columns are basis vectors)
B⁻¹ = \(\frac{1}{(1)(1)-(2)(1)}\begin{bmatrix} 1 & -2 \\ -1 & 1 \end{bmatrix} = \frac{1}{-1}\begin{bmatrix} 1 & -2 \\ -1 & 1 \end{bmatrix} = \begin{bmatrix} -1 & 2 \\ 1 & -1 \end{bmatrix}\)
[A]_B = \(\begin{bmatrix} -1 & 2 \\ 1 & -1 \end{bmatrix} \begin{bmatrix} 4 & -2 \\ 1 & 1 \end{bmatrix} \begin{bmatrix} 1 & 2 \\ 1 & 1 \end{bmatrix}\)
First, calculate B⁻¹A:
\(\begin{bmatrix} -1 & 2 \\ 1 & -1 \end{bmatrix} \begin{bmatrix} 4 & -2 \\ 1 & 1 \end{bmatrix} = \begin{bmatrix} (-1)(4)+(2)(1) & (-1)(-2)+(2)(1) \\ (1)(4)+(-1)(1) & (1)(-2)+(-1)(1) \end{bmatrix}\)
= \(\begin{bmatrix} -4+2 & 2+2 \\ 4-1 & -2-1 \end{bmatrix} = \begin{bmatrix} -2 & 4 \\ 3 & -3 \end{bmatrix}\)
[A]_B = \(\begin{bmatrix} -2 & 4 \\ 3 & -3 \end{bmatrix} \begin{bmatrix} 1 & 2 \\ 1 & 1 \end{bmatrix}\)
= \(\begin{bmatrix} (-2)(1)+(4)(1) & (-2)(2)+(4)(1) \\ (3)(1)+(-3)(1) & (3)(2)+(-3)(1) \end{bmatrix}\)
= \(\begin{bmatrix} 2 & 0 \\ 0 & 3 \end{bmatrix}\)
Since [A]_B is diagonal, [A⁴]_B = ([A]_B)⁴
[A⁴]_B = \(\begin{bmatrix} 2 & 0 \\ 0 & 3 \end{bmatrix}^4 = \begin{bmatrix} 2^4 & 0 \\ 0 & 3^4 \end{bmatrix} = \begin{bmatrix} 16 & 0 \\ 0 & 81 \end{bmatrix}\)
The fact that [A]_B is diagonal means the basis B consists of eigenvectors of A
We can verify: A(1,1) = (4,-2) + (1,1) = (2,2) = 2(1,1)
A(2,1) = (8,-4) + (2,1) = (6,3) = 3(2,1)
So (1,1) is eigenvector with eigenvalue 2, and (2,1) is eigenvector with eigenvalue 3
The matrix representation is [A]_B = \(\begin{bmatrix} 2 & 0 \\ 0 & 3 \end{bmatrix}\) and [A⁴]_B = \(\begin{bmatrix} 16 & 0 \\ 0 & 81 \end{bmatrix}\)
• Matrix representation: [A]_B = B⁻¹AB
• Diagonal matrices: Powers computed element-wise
• Eigenvector basis: Results in diagonal matrix representation
Orthogonal matrix: Matrix where PᵀP = PPᵀ = I, so P⁻¹ = Pᵀ
Since we're going from U to E (standard basis), and E is the identity, P_{E←U} is formed by placing the U vectors as columns:
P_{E←U} = \(\begin{bmatrix} 1/\sqrt{2} & -1/\sqrt{2} \\ 1/\sqrt{2} & 1/\sqrt{2} \end{bmatrix}\)
Pᵀ = \(\begin{bmatrix} 1/\sqrt{2} & 1/\sqrt{2} \\ -1/\sqrt{2} & 1/\sqrt{2} \end{bmatrix}\)
PᵀP = \(\begin{bmatrix} 1/\sqrt{2} & 1/\sqrt{2} \\ -1/\sqrt{2} & 1/\sqrt{2} \end{bmatrix} \begin{bmatrix} 1/\sqrt{2} & -1/\sqrt{2} \\ 1/\sqrt{2} & 1/\sqrt{2} \end{bmatrix}\)
Row 1, Col 1: \(\frac{1}{\sqrt{2}} \cdot \frac{1}{\sqrt{2}} + \frac{1}{\sqrt{2}} \cdot \frac{1}{\sqrt{2}} = \frac{1}{2} + \frac{1}{2} = 1\)
Row 1, Col 2: \(\frac{1}{\sqrt{2}} \cdot \left(-\frac{1}{\sqrt{2}}\right) + \frac{1}{\sqrt{2}} \cdot \frac{1}{\sqrt{2}} = -\frac{1}{2} + \frac{1}{2} = 0\)
Row 2, Col 1: \(\left(-\frac{1}{\sqrt{2}}\right) \cdot \frac{1}{\sqrt{2}} + \frac{1}{\sqrt{2}} \cdot \frac{1}{\sqrt{2}} = -\frac{1}{2} + \frac{1}{2} = 0\)
Row 2, Col 2: \(\left(-\frac{1}{\sqrt{2}}\right) \cdot \left(-\frac{1}{\sqrt{2}}\right) + \frac{1}{\sqrt{2}} \cdot \frac{1}{\sqrt{2}} = \frac{1}{2} + \frac{1}{2} = 1\)
So PᵀP = \(\begin{bmatrix} 1 & 0 \\ 0 & 1 \end{bmatrix} = I\) ✓
PPᵀ = \(\begin{bmatrix} 1/\sqrt{2} & -1/\sqrt{2} \\ 1/\sqrt{2} & 1/\sqrt{2} \end{bmatrix} \begin{bmatrix} 1/\sqrt{2} & 1/\sqrt{2} \\ -1/\sqrt{2} & 1/\sqrt{2} \end{bmatrix}\)
Similar calculation shows PPᵀ = I ✓
Since PᵀP = I, we have Pᵀ = P⁻¹ by definition of matrix inverse
This confirms that transition matrices between orthonormal bases are orthogonal
The transition matrix P_{E←U} is orthogonal, confirming P⁻¹ = Pᵀ
• Orthogonal matrix: PᵀP = I ⟺ P⁻¹ = Pᵀ
• Orthonormal basis: Transition matrix is orthogonal
• Geometric interpretation: Preserves lengths and angles
Transition matrix: P_{B'←B} such that [v]_{B'} = P_{B'←B}[v]_B
Coordinate vector: Representation of vector with respect to a basis
Change of basis: Converting coordinate representations between different bases
- Identify bases: Clearly specify B and B'
- Form basis matrices: Create matrices with basis vectors as columns
- Calculate transition matrix: P_{B'←B} = (B')⁻¹B
- Apply transformation: [v]_{B'} = P_{B'←B}[v]_B
- Verify results: Convert back to check consistency
• Transition property: [v]_{B'} = P_{B'←B}[v]_B
• Inverse property: P_{B←B'} = (P_{B'←B})⁻¹
• Chain rule: P_{C←A} = P_{C←B}P_{B←A}
• Identity: P_{B←B} = I
• Orthogonal: For orthonormal bases, P⁻¹ = Pᵀ
• Composition: Transition matrices compose like functions
• Orthogonality conditions
• Inverse relationships
• Coordinate transformation properties
Analysis: The visualization shows how different transition matrix properties behave.
- Orthogonal matrices preserve norms
- Inverse property holds for all valid transitions
- Chain rule enables complex basis changes