Professional Documents
Culture Documents
1.2.1 √
√ (a) Prove that 3 is irrational. Does a similar argument work to show
6 is irrational?
(b) Where √ does the proof of Theorem 1.1.1 break down if we try to use
it to prove 4 is irrational?
√ √
(a) Proof: Suppose 3 is rational. Then 3 = pq where p and q are
2
positive integers with no common factor. It follows that 3 = pq2 and hence
3q 2 = p2 . Since 3 divides p2 , 3 must divide p itself, and hence in fact 9
divides p2 . But in that case, 9 must divided the LHS (left hand side) of the
equation 3q 2 = p2 also, which means that 3 divides q 2 . This tells us that 3
divides q, and we have arrived at a contradiciton: 3 divides both q and√p,
even though we assumed that q and p have no common factors. Thus, 3
must be irrational. √
Essentially the same argument will work √ for 6.
(b) If we start the same procedure with 4, we find that the argument
breaks down at the point where we concluded (above) that if 3 divides p2
then 3 must divide p. Clearly, if 4 divides p2 we cannot conclude that 4
divides p (consider the case of p = 2, for example).
1.2.4 Verify the triangle inequality in the special cases where (a) a and b
have the same sign; (b) a ≥ 0, b < 0, and a + b ≥ 0.
(a) If a and b are both positive then |a + b| = |a| + |b|. If a and b are both
negative then |a + b| = −a − b = |a| + |b|.
(b) If a ≥ 0, b < 0 and a + b ≥ 0 then |a + b| = a + b = |a| − |b| ≤ |a| + |b|.
all sets A, B ⊆ R.
1
(a) By definion of preimage, f −1 ([0, 4]) = {x ∈ R|x2 ∈ [0, 4]}. This is the
set of reals whose square is in [0, 4], which is [−2, 2]. Similarly,
f −1 ([−1, 1]) =
{x ∈ R|x2 ∈ [−1, 1]} = [−1, 1]. In this case, f −1
(A B) = f −1 ([0, 1]) =
−1
[−1, 1] which is indeed [−2, 2] [−1, 1] = f (A) f −1 (B).
For the case of unions
−1 we have: f −1 (A B) = f −1 ([−1, 4]) = [−2, 2]
−1
which is indeed f (A) f (B).
g. By definition of preimage, we have:
(b)Now for the arbitrary function
g −1(A B) = {x ∈ R|g(x) ∈ A B}. This set can be described as {x ∈
R|g(x) ∈ A and g(x) ∈ B}. But, if g(x) ∈ A and g(x) ∈ B then x ∈ g −1 (A)
and x ∈ g −1 (B), which implies that x ∈ g −1(A) g −1 (B). Furthermore,
the reverse reasoning also holds.
That is, if x∈ g −1 (A) and x ∈ g −1 (B)
it mustbe that g(x) ∈ A B so x ∈ g −1 (A B). Thus, g −1(A B) =
g −1(A) g −1(B).
By similar reasoning, if x is in g −1(A B) then g(x) ∈ A B and hence
g(x) is in A or B. Butthat means that x ∈ g −1(A) or x ∈ g −1 (B), which
is to say: x∈ g −1 (A) g −1(B). Again, the reverse reasoning holdstoo: If
x ∈ g −1 (A) g −1(B) then either g(x)∈ A or g(x) ∈ B, so g(x) ∈ A B and
hence x ∈ g (A B). Thus, g (A B) = g (A) g −1(B).
−1 −1 −1