When is this linear transformation an isomorphism?

Click For Summary
SUMMARY

The linear transformation L: ℝ²→ℝ² defined by L(x₁, x₂)ᵀ = (1, 2; 3, α)(x₁, x₂)ᵀ is an isomorphism when α is any real number except 6 or 0. The determinant of the transformation matrix A is given by Det(A) = α - 6, which must be non-zero for L to be bijective. Therefore, L is injective and bijective if α ≠ 6 and α ≠ 0. The kernel of L is trivial, confirming its injectivity.

PREREQUISITES
  • Understanding of linear transformations and their properties
  • Knowledge of determinants and their role in matrix invertibility
  • Familiarity with the concepts of injectivity and bijectivity in linear algebra
  • Ability to work with matrix notation and operations
NEXT STEPS
  • Study the properties of determinants in linear algebra
  • Learn about the kernel of a linear transformation and its implications for injectivity
  • Explore the concept of bijective functions in the context of linear mappings
  • Investigate the conditions for matrix invertibility in greater detail
USEFUL FOR

Students of linear algebra, mathematicians, and educators looking to deepen their understanding of linear transformations and isomorphisms.

lep11
Messages
380
Reaction score
7

Homework Statement


Let L: ℝ2→ℝ2 such that L(x1, x2)T=(1, 2 ; 3, α)(x1, x2)T=Ax
Determine at what values of α is L an isomorphism. Obviously L is given in matrix form.

The Attempt at a Solution


First of all a quick check, dim (ℝ2)=dim(ℝ2)=2 Ok.

An isomorphism means linear transformation which is bijective. ##Det (A)=α-6## so for A to be invertible and therefore L to be bijective must hold ##α≠6.## On the other hand it suffices to determine when L is injective because L is bijective iff it's injective. If ##α## was 0, ker(L) would include infinitely many vectors and L would neither be injective nor bijective.
So ##α≠6.## and ##α≠0.##
What's the best approach to this particular problem?
 
Last edited:
Physics news on Phys.org
A map from \mathbb{R}^n to itself is invertible if and only if its determinant is non-zero. You have shown that the determinant of your map is \alpha - 6.

When \alpha = 0 the inverse of \begin{pmatrix} 1 & 2 \\ 3 & 0 \end{pmatrix} is \begin{pmatrix} \frac12 & -\frac16 \\ 0 & \frac13 \end{pmatrix}.
 
pasmith said:
A map from \mathbb{R}^n to itself is invertible if and only if its determinant is non-zero. You have shown that the determinant of your map is \alpha - 6.
We haven't actually been told that in our class (yet?) so we haven't proven that either. Is it that simple? So is the final solution that L is an isomorphism when α∈ℝ\{6}?

pasmith said:
When \alpha = 0 the inverse of \begin{pmatrix} 1 & 2 \\ 3 & 0 \end{pmatrix} is \begin{pmatrix} \frac12 & -\frac16 \\ 0 & \frac13 \end{pmatrix}.
What about kernel of L and injectivity if α=0?
 
Last edited:
lep11 said:
We haven't actually been told that in our class (yet?) so we haven't proven that either. Is it that simple? So is the final solution that L is an isomorphism when α∈ℝ\{6}?What about kernel of L and injectivity if α=0?

The kernel is trivial: if \begin{pmatrix} 1 & 2 \\ 3 & 0 \end{pmatrix} \begin{pmatrix} x \\ y \end{pmatrix} = 0 then the bottom row gives 3x = 0, so that x = 0. The top row then gives x + 2y = 2y = 0 so y = 0 also.

Similarly it is injective: if \begin{pmatrix} 1 & 2 \\ 3 & 0 \end{pmatrix} \begin{pmatrix} x \\ y \end{pmatrix} = \begin{pmatrix} a \\ b\end{pmatrix} then x = \frac13 b and y = \frac12a - \frac16b.

(The inverse given in my previous post appears to be incorrect; as appears from the above it should be \begin{pmatrix} 0 & \frac13 \\ \frac12 & - \frac16\end{pmatrix}
 

Similar threads

Replies
1
Views
1K
Replies
15
Views
2K
  • · Replies 24 ·
Replies
24
Views
3K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 14 ·
Replies
14
Views
3K
  • · Replies 1 ·
Replies
1
Views
2K
Replies
5
Views
9K
  • · Replies 16 ·
Replies
16
Views
2K
  • · Replies 21 ·
Replies
21
Views
9K