Exercise 1.2.7

Given a function f and a subset A of its domain, let f ( A ) represent the range of f over the set A ; that is, f ( A ) = { f ( x ) : x A } .

(a)
Let f ( x ) = x 2 . If A = [ 0 , 2 ] (the closed interval { x R : 0 x 2 } ) and B = [ 1 , 4 ] , find f ( A ) and f ( B ) . Does f ( A B ) = f ( A ) f ( B ) in this case? Does f ( A B ) = f ( A ) f ( B ) ?
(b)
Find two sets A and B for which f ( A B ) f ( A ) f ( B ) .
(c)
Show that, for an arbitrary function g : R R , it is always true that g ( A B ) g ( A ) g ( B ) for all sets A , B R
(d)
Form and prove a conjecture about the relationship between g ( A B ) and g ( A ) g ( B ) for an arbitrary function g

Answers

(a)
f ( A ) = [ 0 , 4 ] , f ( B ) = [ 1 , 16 ] , f ( A B ) = [ 1 , 4 ] = f ( A ) f ( B ) and f ( A B ) = [ 0 , 16 ] = f ( A ) f ( B )
(b)
A = { 1 } , B = { 1 } thus f ( A B ) = but f ( A ) f ( B ) = { 1 }
(c)
Suppose y g ( A B ) , then x A B such that g ( x ) = y . But if x A B then x A and x B , meaning y g ( A ) and y g ( B ) implying y g ( A ) g ( B ) and thus g ( A B ) g ( A ) g ( B ) .

Notice why it is possible to have x g ( A ) g ( B ) but x g ( A B ) , this happens when something in A B and something in B A map to the same thing. If g is 1-1 this does not happen.

(d)
I conjecture that g ( A B ) = g ( A ) g ( B ) . To prove this we show inclusion both ways, First suppose y g ( A B ) . then either y g ( A ) or y g ( B ) , implying y g ( A ) g ( B ) . Now suppose y g ( A ) g ( B ) meaning either y g ( A ) or y g ( B ) which is the same as y g ( A B ) as above.
User profile picture
2022-01-27 00:00
Comments