0% found this document useful (0 votes)
122 views

The Geometry of Maps From R Tor: X Y 2 2 0 X Y 2 0 X Y X Y

This document discusses linear transformations from R2 to R2. It defines what it means for a transformation to be one-to-one and onto. A linear transformation given by a matrix A is one-to-one and onto if and only if the determinant of A is not equal to 0, meaning the matrix is invertible. An example transformation maps the rectangle [0,1]x[0,2π) onto the unit disk in a way that is onto but not one-to-one, because many inputs map to the point (0,0).

Uploaded by

Fgh Fh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
122 views

The Geometry of Maps From R Tor: X Y 2 2 0 X Y 2 0 X Y X Y

This document discusses linear transformations from R2 to R2. It defines what it means for a transformation to be one-to-one and onto. A linear transformation given by a matrix A is one-to-one and onto if and only if the determinant of A is not equal to 0, meaning the matrix is invertible. An example transformation maps the rectangle [0,1]x[0,2π) onto the unit disk in a way that is onto but not one-to-one, because many inputs map to the point (0,0).

Uploaded by

Fgh Fh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Math 2374

Section 6.1 Notes

The Geometry of maps from R2 to R2


This section is basically a preview (or review if you’ve taken Linear/DiffEq) of Linear
Algebra. Its main purpose is to prepare you for the next section, which covers the Change
of Variable formula for changing your variables of integration in multiple integrals.

Linear Transformations of R2
Theorem 1. Let A be a 2 × 2 matrix with det(A) = 0 and let T be the linear
mapping of R2 to R2 given by T (x) = Ax (matrix multiplication). Then T transforms
parallelograms into parallelograms and vertices into vertices. Moreover, if T (D) is a
parallelogram, D must be a parallelogram.

One-to-one and Onto


Definition. A mapping T is one-to-one on D∗ if for any two points (u, v) and
(u0 , v 0 ), then T (u, v) = T (u0 , v 0 ) imples (u, v) = (u0 , v 0 ).

Definition. A mapping T is onto D if for every point (x, y) in D, there is at least


one point (u, v) in the domain of T such that T (u, v) = (x, y).

Intuitively, a mapping T being onto means it hits everything in the target space, and
being one-to-one means it never hits the same thing twice (passes the vertical line test.
For example, T (x, y) = (ex , ey ) is not onto R2 because it never hits (0,0) or any negative
number in either coordinate. But if I define R2>0 to be the set of (x, y) with x and y
both positive, T (x, y) = (ex , ey ) is onto R2>0 . Also, T (x, y) = (ex , ey ) is one-to-one, but
2
T ∗ (x) = (ex , ey ) is not one-to-one (because (1, 1) and (−1, 1) map to the same thing!).

Now lets do the following problem from the homework:

7. Let D∗ = [0, 1] × [0, 1] and define T on D∗ by T (u, v) = (−u2 + 4u, v). Find the
image D. Is T one-to-one?

Solution: First off, the function for the second coordinate is just the identity
v 7→ v, so this is one-to-one and onto [0, 1] (the domain for v is [0, 1] so the
identity just maps [0, 1] 7→ [0, 1]).

Now lets consider the second coordinate function u 7→ −u2 + 4u. As a function
of u, we can graph this as a parabola. Using −b/(2a) we get the vertex is
(2, 4), and since it opens downward, the parabola goes through (0,0) and (1,3)
as follows:

We only care about what happens when u is in [0,1] (whats inside the red box).
This function passes the vertical line test (one-to-one), and is onto [0,3].

Therefore the first [0,1] in terms of u is mapped onto [0,3] and the second [0,1]
in terms of v is mapped onto [0,1], so the as a whole we get D∗ = [0, 1] × [0, 1]
is mapped onto D = [0, 3] × [0, 1].

This map is also one-to-one because, as stated throughout, the function for each
component is one-to-one.

An Example

Consider the mapping T (r, θ) = (r cos θ, r sin θ) defined in the rectangle D∗ = [0, 1] ×
p
[0, 2π). Explain why T is onto the unit disk D = {(x, y) : 0 6 x2 + y 2 6 1} but
not one-to-one.

Solution: As for why this is onto, T is exactly the polar coordinate transformation!
Everything in the unit disk is uniquely determined by its distance from the origin (r
between 0 and 1) and its angle θ in [0, 2π).

The reason this mapping is not one-to-one is simply because there are many inputs
that map to (0,0). In fact, any ordered pair (0, θ) will map to (0,0) for all θ in [0, 2π).

Now consider the same mapping T (r, θ) = (r cos θ, r sin θ) defined in the half open
rectangle D∗ = (0, 1] × [0, 2π) (the difference between this and the first question is that 0
is no longer included in the first interval). Explain why T is one-to-one but not onto the
p
unit disk D = {(x, y) : 0 6 x2 + y 2 6 1}.

Solution: Now this is one-to-one because there is no longer multiple ways to obtain
(0,0). In fact, there is no input at all that will yield (0,0), which is exactly why it is
not onto!
Note: If instead the target space was the punctured unit disk D = {(x, y) : 0 <
p
x2 + y 2 6 1} where the origin (0,0) is not included, then T would be onto!

When are Linear Transformations one-to-one and onto

Lastly we state a theorem that is very powerful when we can write a mapping as matrix
multiplication (T (x) = Ax):

Theorem. A linear transformation given by multiplication by a matrix A is one-to-


one and onto if and only if det(A) 6= 0 (the matrix is invertible).

You might also like