When is this linear transformation an isomorphism?

Click For Summary

Homework Help Overview

The discussion revolves around determining the conditions under which a linear transformation represented by a matrix L: ℝ²→ℝ² is an isomorphism. The transformation is expressed in matrix form, and participants are exploring the implications of the determinant of the matrix on its invertibility and bijectiveness.

Discussion Character

  • Conceptual clarification, Assumption checking, Mathematical reasoning

Approaches and Questions Raised

  • Participants discuss the relationship between the determinant and the conditions for L to be bijective, noting that the determinant is α - 6. They explore the implications of α being 0 or 6 on the injectivity and kernel of L. Questions arise regarding the simplicity of the determinant condition and whether it has been formally established in their coursework.

Discussion Status

The discussion is active, with participants examining various aspects of the problem, including the kernel of L and its injectivity. Some guidance has been offered regarding the determinant's role in determining isomorphism, but there is no explicit consensus on the final conditions for α.

Contextual Notes

Participants express uncertainty about whether the determinant condition has been formally covered in their class, indicating a potential gap in their understanding of the material. There is also a focus on the implications of specific values of α on the properties of the transformation.

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
2K
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
4K
  • · Replies 1 ·
Replies
1
Views
2K
Replies
5
Views
9K
  • · Replies 16 ·
Replies
16
Views
2K
  • · Replies 21 ·
Replies
21
Views
9K