Exercise 3.10

(a)
Show that the map f : (1,1) of Example 9 is order preserving.
(b)
Show that the equation g(y) = 2y[1 + (1 + 4y2)12] defines a function g : (1,1) that is both a left and right inverse for f.

Answers

(a)
Recall that f from Example 3.9 is defined by f(x) = x 1 x2

for x (1,1). We show that f preserves the order.

Proof. Suppose that x,y (1,1) and that x < y. Now, since 1 < x < 1, we have 0 |x| < 1 so that

x2 = |x|2 = |x| |x| < |x| 1 = |x| < 1.

Hence 0 < 1 x2 so that also 0 < 1(1 x2) as well. By the same argument 0 < 1 y2 so that 0 < 1(1 y2). We then have the following cases:

Case: x 0. Then also y > 0 since y > x 0. Thus

x2 = x x x y < y y = y2 (since x < yx 0, and y > 0) x2 > y2 1 x2 > 1 y2 1 1 y2 > 1 1 x2.

From this, it follows that

f(x) = x 1 x2 < y 1 x2 < y 1 y2 = f(y)

since x < y and 1(1 x2) and 1(1 y2) are both positive.

Case: x < 0. Then f(x) = x(1 x2) < 0 since x < 0 and 1(1 x2) > 0.

  • Case: y 0. Then we have that x > y 0 so that f(y) < f(x) by the previous case. But we have f(x) = x(1 (x)2) = x(1 x2) = f(x), and similarly f(y) = f(y). Hence f(y) = f(y) < f(x) = f(x) so that f(y) > f(x).
  • Case: y > 0. Then f(y) = y(1 y2) > 0 since y > 0 and 1(1 y2) > 0. Hence f(x) < 0 < f(y).

Therefore in all cases we have f(x) < f(y), which shows that f preserves order. □

(b)

Proof. First we need to show that g is even a function from to (1,1). We note that

y2 0 4y2 0 1 + 4y2 1 > 0 1 + 4y2 > 0 1 + 1 + 4y2 > 1 > 0

so that g(y) is well-defined for all y since the denominator of g(y) is always nonzero. Now, if y = 0 then clearly |g(y)| = |g(0)| = |0| = 0 < 1. So in what follows assume that y0 so that |y| > 0 and y2 > 0. Then we have

1 > 0 1 + 4y2 > 4y2 > 0 1 + 4y2 > 4y2 = 2 |y| 1 + 1 + 4y2 > 1 + 2 |y| > 2 |y| > 0 1 2 |y| > 1 1 + 1 + 4y2 1 = 2 |y| 2 |y| > 2 |y| 1 + 1 + 4y2 = | 2y 1 + 1 + 4y2 | = |g(y)|

so that 1 < g(y) < 1 and hence g(y) (1,1). Thus g is in fact a well-defined function from into (1,1).

To show that g is a left inverse of f consider any x (1,1). First, we have

1 + 4f(x)2 = 1 + 4x2 (1 x2)2 = (1 x2 )2 + 4x2 (1 x2)2 = 1 2x2 + x4 + 4x2 (1 x2)2 = 1 + 2x2 + x4 (1 x2)2 = (1 + x2 )2 (1 x2)2 = 1 + x2 1 x2

so that

(g f)(x) = g(f(x)) = 2f(x) 1 + 1 + 4f(x)2 = 2x(1 x2) 1 + 1+x2 1x2 = 2x (1 x2) (1 + 1+x2 1x2 ) = 2x 1 x2 + 1 + x2 = 2x 2 = x,

which shows that g f = i(1,1) since x was arbitrary so that g is a left inverse of f.

Now consider any y . Then we first have

g(y)2 = ( 2y 1 + 1 + 4y2 ) 2 = 4y2 (1 + 1 + 4y2)2 = 4y2 1 + 21 + 4y2 + 1 + 4y2 = 4y2 2 + 4y2 + 21 + 4y2 = 2y2 1 + 2y2 + 1 + 4y2

so that

(f g)(y) = f(g(y)) = g(y) 1 g(y)2 = 2y(1 + 1 + 4y2) 1 2y2 1+2y2+1+4y2 = 2y (1 + 1 + 4y2) (1+2y2+1+4y22y2 1+2y2+1+4y2 ) = 2y (1 + 1 + 4y2) ( 1+1+4y2 1+2y2+1+4y2 ) = 2y 1+21+4y2+1+4y2 1+2y2+1+4y2 = 2y 2+4y2+21+4y2 1+2y2+1+4y2 = 2y 2 (1+2y2+1+4y2 1+2y2+1+4y2 ) = 2y 2 = y,

which shows that f g = i since y was arbitrary so that g is also a right inverse of f. □

Note that what was shown implies that f is bijective and that g is its inverse, by Exercise 2.5 part (e).

User profile picture
2019-12-01 00:00
Comments