Download as pdf or txt
Download as pdf or txt
You are on page 1of 6

Brian Streit

Math 2451

Section 6.1 Selected Solutions

1. Let S = (0; 1] [0; 2 ) and de…ne T (r; ) = (r cos ; r sin ) = (x; y).
Because of the identity

x2 + y 2 = r2 cos2 + r2 sin2 = r2

and 0 < r 1 we must have that (x; y) = T (r; ) is contained in the unit disk
minus the origin. We claim that

T (S ) = S = f(x; y) 2 R2 : 0 < x2 + y 2 1g:

We have already shown T (S ) S. To show T (S ) = S, it remains to be


shown that T (S ) S. We …x r0 2 (0; 1] and observe that

T (r0 [0; 2 )) = f(x; y) 2 R2 : (x; y) = (r0 cos ; r0 sin ) with 0 <2 g

is a circle of radius r0 centered at the origin. We see that any point (x; y) 2 S
is contained in some circle of radius r0 2 (0; 1] and therefore S T (S ). We
conclude that T (S ) = S. To show that T is one-to-one on S we must show
that
T (r; ) = T (r0 ; 0 ) ) (r; ) = (r0 ; 0 ):
To this end, if
(r cos ; r sin ) = r0 cos 0 ; r0 sin 0

then
0 2 0
r cos = r0 cos r2 cos2 = (r0 ) cos2
0 ) 2
r sin = r0 sin r2 sin2 = (r0 ) sin2 0

so
2 0 2 0 2
r2 = r2 cos2 + r2 sin2 = (r0 ) cos2 + (r0 ) sin2 = (r0 ) :
0 0
Since r; r0 2 (0; 1] it follows that r = r0 . But then cos = cos and sin = sin
so
cos sin = sin 0 cos 0
or
0 0 0
0 = sin cos cos sin = sin( ):
0 0
Since ; 2 [0; 2 ) it follows that = . We conclude that T is one-to-one on
S .

2. Let
x y x +y
T (x ; y ) = p ; p
2 2

1
and D = [0; 1] [0; 1]. We must show that T (D ) is a rotation of D . Those
with a knowledge of linear algebra can verify that T is a linear transformation
and then observe that the matrix representation of T with respect to the stan-
dard basis is a rotation matrix. We proceed without assuming a knowledge of
linear algebra as in Example 2. Fix t 2 [0; 1] and consider the line segment

Lt = f( ; t) 2 R2 : 0 1g:

Observe that for each t 2 [0; 1] we have

t +t
T (Lt ) = f(x; y) 2 R2 : (x; y) = p ; p ;0 1g:
2 2

is a line segment from p t ; pt to 1p t 1+t


; p2 . So T (L0 ) is segment from (0; 0)
2 2 2

to p1 ; p1 and T (L1 ) is segment from p12 ; p12


to 0; p22 : When we let t
2 2
vary from 0 to 1 we see that T (D ) is a square with vertices

1 1 1 1 2
(0; 0) ; p ;p ; p ;p ; 0; p :
2 2 2 2 2
We observe that T rotates L0 by an angle of 4 and, in fact, T rotates every Lt
by an angle of 4 so that T (D ) is a rotation of D :

3. Let D = [0; 1] [0; 1] and T (u; v) = ( u2 + 4u; v). Fix u 2 [0; 1] and
consider
Lu = f(u; v) 2 R2 : 0 v 1g:
Observe that for each u 2 [0; 1] we have

T (Lu ) = f(x; y) 2 R2 : (x; y) = u2 + 4u; v ; 0 v 1g

is a line segment from u2 + 4u; 0 to u2 + 4u; 1 . Similarly, we …x v 2 [0; 1]


and consider
Lv = f(u; v) 2 R2 : 0 u 1g:
For each v 2 [0; 1] we see that T (Lv ) is a line segment from (0; v) to (3; v).
Therefore T (D ) = [0; 3] [0; 1]. Now, if T (u; v) = T (u0 ; v 0 ) then
2
u2 + 4u = (u0 ) + 4u0
:
v = v0

We see that
2 2
u2 + 4u = (u0 ) + 4u0 , (u0 ) u2 + 4u 4u0 = 0
0
, (u u) (u + u) + 4 (u u0 ) = 0 , (u0 + u
0
4) (u0 u) = 0:

But u0 + u 4 < 0 for u; u0 2 [0; 1] so u = u0 . Since we also have v = v 0 , we


conclude that T is one-to-one on D :

2
4. Suppose D is the parallelogram bound by the lines
1 1
y = 3x 4; y = 3x; y = x; and y = (x + 4) :
2 2
Let D = [0; 1] [0; 1]. We want to …nd a T such that T (D ) = D. We …rst
…nd a S such that S(D) = D . We see that the vertices of our parallelogram
are the pair-wise intersections of the non-parallel lines listed above. We …nd
that 3x = 12 x when x = 0 so y = 0 and (0; 0) is a vertex of D . Similarly,
3x = 12 (x + 4) yields ( 45 ; 12
5 ), 3x 4 = 21 x yields 45 ; 52 , and 3x 4 = 12 (x + 4)
8 4
yields 5 ; 5 . We see that our desired transformation should be such that

4 12 4 2 8 4
T ( ; ) = (0; 1); T ; = (1; 0); and T ; = (1; 1) :
5 5 5 5 5 5

So let S be such that


4 2 4 12
S(1; 0) = ; and S(0; 1) = ( ; ):
5 5 5 5

Viewing the points (1; 0) and (0; 1) as the usual basis vectors tells us that the
matrix of S with respect to the standard basis is

1 4 4
A= :
5 2 12

Since det(A) 6= 0, S has an inverse transformation. Observe that S(x; y) =


( 4x+4y
5 ; 2x+12y
5 ) and S(D) = D so that S 1 : D ! D. Take T = S 1 so that
the matrix of T with respect to the standard basis is

1 1 3 1
A = 1 :
2 2 1

Therefore
3x y 2y x
T (x; y) = ( ; ):
2 4

5. Let D = [0; 1] [0; 1] and de…ne T on D by

T (x ; y ) = (x y ; x ):

As x ranges from 0 to 1 we see that T traces out the segment connecting (0; 0)
to (y ; 1). As y goes from 0 to 1 we see that our segments connect points
in the plane along the line y = x to points on the line x = 1. So T (D ) is a
triangle with vertices (0; 0); (1; 1); (0; 1). We observe that T is not one-to-one
since T (0; 0) = T (0; 1). In fact,

T (f0g [0; 1]) = (0; 0):

3
Now, T is one-to-one when

T (x ; y ) = T (u ; v ) ) (x ; y ) = (u ; v ):

Since
T (x ; y ) = T (u ; v ) ) x = u
we have to see when y = v . Since x y = v x we have y = v when x 6= 0.
therefore, T is one-to-one on (0; 1] [0; 1]:

7. Let T : R3 ! R3 be the spherical coordinate mapping ( ; '; ) 7! (x; y; z)


where
x = sin ' cos ; y = sin ' sin ; and z = cos ':
Let D be the set of points

( ; '; ) 2 [0; 1] [0; ] [0; 2 ]:

We see that
2 2 2
x2 + y 2 + z 2 = ( sin ' cos ) + ( sin ' sin ) + ( cos ') = 2

and 0 1 so that T (D ) D where

D = f(x; y; z) 2 R3 : x2 + y 2 + z 2 1g

is a solid ball of unit radius, centered at the origin. If we …x 0 then

T( 0 [0; ] [0; 2 ]) = S 2 ( 0 )

is a sphere of radius 0 centered at the origin. Since for any (x; y; z) 2 D we


have (x; y; z) 2 S 2 ( 0 ) for some 0 , we see that D T (D ). We conclude
D = T (D ). However, T is not one-to-one since

T 1; ; 0 = (1; 0; 0) = T 1; ;2 :
2 2
In fact,

T ( ; '; 0) = T ( ; '; 2 ) , T (0; '; ) = (0; 0; 0) ,


T = ( ; '; ) = (0; 0; 1) , and T (0; '; ) = (0; 0; 1)

for ( ; '; ) 2 D . Let E = (0; 1] (0; ) [0; 2 ) D . We see that T is


_
one-to-one on E:

8. Let
a b
A=
c d

4
so det A = ad bc. Observe
a b u
T (u; v) =
c d v

can be written as
au + bv = x
:
cu + dv = y
Multiplying the …rst equation by d, the second by b, and then subtracting yields

dx by = (ad bc) u:

Similarly, we obtain
cx dy = (cb ad) v:
If ad bc 6= 0 then we can solve uniquely for u and v. That is, given (x; y) there
is exactly one (u; v) solving the system. Thus T is one-to-one. So det A 6= 0
implies T one-to-one. Conversely, since the statement ad bc 6= 0 implies T
one-to-one is logically equivalent to its contrapositive, T not one-to-one implies
ad bc = 0, we prove the contrapositive. To this end, if T is not one-to-one
then there are two distinct points (u1 ; v1 ) and (u2 ; v2 ) such that

T (u1 ; v1 ) = T (u2 ; v2 ) = (x; y) :

Thus
(ad bc) u1 = (ad bc) u2
:
(ad cb) v1 = (ad bc) v2
Since either u1 6= u2 or v1 6= v2 , we conclude that ad bc = 0.

10. Suppose T : R2 ! R2 is linear and given by T (x) = Ax where A is a


2 2 matrix and det(A) 6= 0. Suppose further v is not a scalar multiple of w so
that q = p + v + w where ; 2 [0; 1] is a parallelogram. Since T is linear,

T (q) = T (p) + T (v) + T (w):

To show that T (q), ; 2 [0; 1]; is a parallelogram, it su¢ ces to show that T (v)
is not a scalar multiple of T (w). Suppose towards a contradiction that T (v)
is a scalar multiple of T (w); that is, suppose T (v) = T (w) for some 2 R.
Then T is linear so T (v w) = 0. But v is not a scalar multiple of w so
v w 6= 0 for all 2 R. Since

T (0) = T (v w) = 0

and v w 6= 0, T is not one-to-one. Then, by problem 8, we have that


det(A) = 0, a contradiction. We conclude that T (q), ; 2 [0; 1]; is a parallel-
ogram.
1
11. Since det(A) 6= 0 we see that T is invertible. We apply T to
T (q) = T (p) + T (v) + T (w) and argue as in Problem 10.

5
12. Consider T : D ! D, where D is the unit disk in the plane, given by
T (r cos ; r sin ) = r2 cos 2 ; r2 sin 2 = (x; y). We observe

@(x; y) 2r cos 2 2r2 sin 2


= = 4r3 cos2 2 +4r3 sin2 2 = 4r3 6= 0 for r 6= 0.
@(r; ) 2r sin 2 2r2 cos 2

If T were globally one-to-one on Dnf0; 0g then T would have a unique inverse


T 1 : Dnf0; 0g ! Dnf0; 0g such that T 1 (x; y) = (u; v) is one-to-one. We
observe that
1
T (1; 0) = f(u; v) : T (u; v) = (1; 0)g = f(1; 0) ; ( 1; 0)g

so T 1 is not one-to-one and, therefore, T 1 is not globally one-to-one on


Dnf0; 0g. This can be seen in terms of complex variables by the fact that
if f : C ! C is such that f (z) = z 2 then f (1) = f ( 1) = 1 so that f is not
globally one-to-one.

You might also like