Академический Документы
Профессиональный Документы
Культура Документы
Preliminaries
1.1
(b) A\(A\B)
(c) A (B\A)
6. The symmetric difference of two sets A and B is the set D of all elements that belong
to either A or B but not both. Represent D with a diagram.
A
{An : n N} and
{An : n N}.
11. Let g(x) := x2 and f (x) := x + 2 for x R, and let h be the composite function
h := g f .
(a) Find the direct image h(E) of E := {x R : 0 x 1}.
h := g f = g(f (x)) = (x + 2)2 . We have h(E) = {x R : 4 x 9}.
(b) Find the inverse image h1 (G) of G := {x R : 0 x 4}.
We have h1 (G) := {x R : 4 x 0}.
12. Let f (x) := x2 for x R, and let E := {x R : 1 x 0} and F := {x R : 0
x 1}. Show that E F = {0} and f (E F ) = {0}, while f (E) = f (F ) = {y R :
0 y 1}. Hence f (E F ) is a proper subset of f (E) f (F ). What happens if 0 is
deleted from the sets E and F ?
Since 0 is the only common element between E and F , then E F = {0} ; and
f (E F ) = f (0) = 02 = 0, then f (E F ) = {0}. If 0 is deleted from E and F , then
E F := and f (E F ) is not defined.
13. Let f and E, F be as in Exercice 12. Find the sets E\F and f (E)\f (F ) and show that
it is not true that f (E\F ) f (E)\f (F ).
We have E\F = {x R : 1 x < 0}, f (E) = f (F ) and f (E)\f (F ) = , therefore
f (E\F ) f (E)\f (F ).
14. Show that if f : A B and E, F are subsets of A, then f (E F ) = f (E) f (F )
and f (E F ) f (E) f (F ).
Demonstration. If we suppose y f (E F ), by definition 1.1.7, it means that, for
y = f (x), there is some x (E F ), which means that some x E or x F ; this
impllies, by definition 1.1.7 again, that y f (E) of y f (F ), therefore f (E F )
f (E) f (F ). Conversely, if we suppose y (f (E) f (F )), then y f (E) or y f (F ) ;
it follows, by definition 1.1.7, that, for y = f (x), there is some x such that x E or
x F , which means that x (E F ). This implies, by definition 1.1.7 again, that
y f (E F ), then f (E) f (F ) f (E F ). By definition 1.1.1, we conclude that
f (E F ) = f (E) f (F ).
Demonstration. Now, if we suppose y f (E F ), then, by definition 1.1.7, it implies
that for y = f (x), there is some x such that x (E F ), which means that x E
and x F ; this implies, by definition 1.1.7 again, that y = f (E) and y = f (F ), then
y (f (E) f (F )), therefore f (E F ) f (E) f (F ).
15. Show that if f : A B and G, H are subsets of B, then f 1 (G H) = f 1 (G)
f 1 (H) and f 1 (G H) = f 1 (G) f 1 (H).
Demonstration. If we suppose x f 1 (G H), then, by definition 1.1.7, for x =
f 1 (x), there is some f (x) such that f (x) f (G H), which means that some f (x)
f (G) or f (x) f (H) ; this implies, by definition 1.1.7 again, that x f 1 (G) or
x f 1 (H), then x f 1 (H) f 1 (G), therefore f 1 (G H) f 1 (G) f 1 (H).
Conversely, if we suppose x f 1 (G) f 1 (H), then x f 1 (G) or x f 1 (H) ;
it follows, by definition 1.1.7, that for x = f 1 (x), there is some f (x) such that
f (x) f (G) or f (x) f (H), which means that f (x) f (G H) ; this implies, by
definition 1.1.7 again, that x f 1 (GH), therefore f 1 (G)f 1 (H) f 1 (GH).
By definition 1.1.1, we conclude that f 1 (G H) = f 1 (G) f 1 (H).
Demonstration. Now, if we suppose we have x f 1 (GH), then, by definition 1.1.7,
for x = f 1 (x), there is some f (x) such that f (x) f (G H), which means that some
f (x) f (G) and f (x) f (H) ; this implies, by definition 1.1.7 again, that x f 1 (G)
and x f 1 (H), then x f 1 (G) f 1 (H), therefore f 1 (G H) f 1 (G) f 1 (H).
Conversely, if we suppose we have x f 1 (G) f 1 (H), then, by definition 1.1.7,
for x = f 1 (x), there is some f (x) such that f (x) f (G) f (H), which means that
f (x) f (G) and x f (H) ; this implies, by definition 1.1.7 again, that x f 1 (G)
and x f 1 (H), which means that x f 1 (G H), therefore f 1 (G) f 1 (H)
f 1 (GH). By definition 1.1.1, we conclude that f 1 (GH) = f 1 (G)f 1 (H).
x1
x2
=q
x21 + 1
x22 + 1
x21
x22
=
x21 + 1
x22 + 1
x21 (x22 + 1) = x22 (x21 + 1)
x21 x22 + x21 = x21 x22 + x22
x21 = x22
|x1 | = |x2 |
x1 = x2
(square root > 0 numerator signs must agree)
x
+1
x2
y 2 (x2 + 1) = x2
y 2 x2 + y 2 = x2
y 2 x2 + x2 = y 2
x2 (1 y 2 ) = y 2
x=
y
1 y2