Professional Documents
Culture Documents
Exercise 6-1:
Which of the following are functions from {1, 2, 3} to {a, b, c}?
1 a
2 b
3 c
Solution:
It is not a function because 2 in the domain does not have an image in
{a, b, c}.
Exercise 6-2:
Which of the following are functions from {1, 2, 3} to {a, b, c}?
1 a
2 b
3 c
Solution:
It is a function because every element of {1, 2, 3} has assigned a unique
element of {a, b, c}.
Exercise 6-3:
Which of the following are functions from {1, 2, 3} to {a, b, c}?
1 a
2 b
3 c
Solution:
It is not a function because 1 from the domain is assigned to a and c from
the codomain.
Exercise 6-4:
1 a
2 b
3 c
Which of the following are functions from {1, 2, 3} to {a, b, c}?
6.1
Solution:
It is a function because every element of {1, 2, 3} has assigned a unique
element of {a, b, c}.
Exercise 6-5:
For each of the following formulas, find the largest set X ⊆ R for which f :
X → R defines a real valued function of a real variable. Sketch the graph of
each function and find the image Y = f (X). State whether or not the function
f : X → Y has an inverse f −1 : Y → X, and give a formula for f −1 (x) when
the inverse exists.
f (x) = x2 − 1.
Solution:
Let f (x) = x2 − 1. f is defined for all x ∈ R. so X = R.
y0
0
x
Exercise 6-6:
For each of the following formulas, find the largest set X ⊆ R for which f :
X → R defines a real valued function of a real variable. Sketch the graph of
each function and find the image Y = f (X). State whether or not the function
f : X → Y has an inverse f −1 : Y → X, and give a formula for f −1 (x) when
the inverse
√ exists.
f (x) = x − 2.
Solution: √
Let f (x) = x − 2. f is not real when x − 2 < 0 so X = {x ∈ R | x ≥ 2}.
6.2
y1
1.5
x
Exercise 6-7:
For each of the following formulas, find the largest set X ⊆ R for which f :
X → R defines a real valued function of a real variable. Sketch the graph of
each function and find the image Y = f (X). State whether or not the function
f : X → Y has an inverse f −1 : Y → X, and give a formula for f −1 (x) when
the inverse exists.
x
f (x) = 2 .
x +x
Solution:
Let f (x) = x/(x2 + x). f is not defined when x = 0 or x = −1, then
X = {x ∈ R | x 6= −1, 0}.
-1 0
6.3
Then f −1 : Y → X given by f −1 (x) = (1 − x)/x.
Exercise 6-8:
For each of the following formulas, find the largest set X ⊆ R for which f :
X → R defines a real valued function of a real variable. Sketch the graph of
each function and find the image Y = f (X). State whether or not the function
f : X → Y has an inverse f −1 : Y → X, and give a formula for f −1 (x) when
the inverse exists.
x
f (x) = .
x+1
Solution:
Let f (x) = x/(x + 1). f is not defined when x = −1, then X = {x ∈ R | x 6=
−1}.
0.5y
-0.5
x
Now for x ∈ X,
x x+1−1 1
f (x) = = =1− .
x+1 x+1 x+1
Because 1/(x + 1) 6= 0 for all x ∈ X then f (x) 6= 1 for all x ∈ X. So the image
Y = f (X) is R = {y ∈ R | y 6= 1}.
Since f : X → Y is both injective and surjective then f has an inverse. To
find the formula for f −1 we interchange x and y which gives x = y/(y + 1).
Solving for y gives,
y
x =
y+1
xy − y = −x
−x x
y = = .
x−1 1−x
Then f −1 : Y → X given by f −1 (x) = x/(1 − x).
6.4
Exercise 6-9:
For each of the following formulas, find the largest set X ⊆ R for which f :
X → R defines a real valued function of a real variable. Sketch the graph of
each function and find the image Y = f (X). State whether or not the function
f : X → Y has an inverse f −1 : Y → X, and give a formula for
f (x) = sin 5x
Solution:
Let f (x) = sin 5x.
The domain of f (x) is the same as the domain of the sine function. So the
largest set for which f defines a real valued function of a real variable is X = R.
−π π
Exercise 6-10:
For each of the following formulas, find the largest set X ⊆ R for which f :
X → R defines a real valued function of a real variable. Sketch the graph of
each function and find the image Y = f (X). State whether or not the function
f : X → Y has an inverse f −1 : Y → X, and give a formula for
f (x) = 5x
Solution:
Let f (x) = 5x .
f (x) is an exponential function. The largest set for which f defines a real
valued function of a real variable is X = R.
y 1.5
0
x
6.5
Now for x ∈ X, 5x > 0. So Y = f (X) = {y ∈ R | y > 0}.
Because f (x) is both injective and surjective then f has an inverse. To find
the function of f −1 we interchange x and y which gives x = 5y . Solving for y
we get
5y = x
log5 5y = log5 x
y = log5 x
Exercise 6-11:
For each of the following formulas, find the largest set X ⊆ R for which f :
X → R defines a real valued function of a real variable. Sketch the graph of
each function and find the image Y = f (X). State whether or not the function
f : X → Y has an inverse f −1 : Y → X, and give a formula for
f (x) = log10 (3 − x)
Solution:
Let f (x) = log10 (3 − x).
f (x) is a logarithmic function. In order for f to be defined 3 − x > 0, then
x < 3. Therefore the largest set for which f defines a real valued function of a
real variable is X = {x ∈ R | x < 3}. And the image Y = f (X) = R.
0 3
log10 (3 − y) = x
10log10 (3−y) = 10x
3 − y = 10x
Exercise 6-12:
For each of the following formulas, find the largest set X ⊆ R for which f :
X → R defines a real valued function of a real variable. Sketch the graph of
each function and find the image Y = f (X). State whether or not the function
f : X → Y has an inverse f −1 : Y → X, and give a formula for
6.6
p
f (x) = 4
2 − log3 x
Solution: p
Let f (x) = 4 2 − log3 x.
log3 x is only defined for x > 0 and because f (x) is not real when 2−log3 x <
0 then x ≤ 32 = 9.
Therefore the largest set for which f defines a real valued function of a real
variable is X = {x ∈ R | 0 < x ≤ 9}.
y2
4.5
x
Exercise 6-13:
For each of the following formulas, find the largest set X ⊆ R for which f :
X → R defines a real valued function of a real variable. Sketch the graph of
each function and find the image Y = f (X). State whether or not the function
f :X→Y√ has an inverse f −1 : Y → X, and give a formula for
f (x) = sin x
Solution: √
Let f (x) = sin x
Because f (x) is not real when sin x < 0, then x ∈ [ 2kπ, (2k + 1)π ] for
k ∈ Z. Therefore theSlargest set for which f defines a real valued function of a
real variable is X = k∈Z [2kπ, (2k + 1)π]
6.7
−2π −π 0 π 2π 3π
√
And for x p∈ X, 0 ≤ sin x √
≤ 1 so 0 ≤ sin x ≤ 1. Then Y = f (X) = [0, 1].
Because sin(x + 2π) = sin x then f (x) is not bijective and does not have
an inverse f −1 (x) : Y → X.
Exercise 6-14:
For each of the following formulas, find the largest set X ⊆ R for which f :
X → R defines a real valued function of a real variable. Sketch the graph of
each function and find the image Y = f (X). State whether or not the function
f : X → Y has an inverse f −1 : Y → X, and give a formula for
f (x) = Sin−1 3x
Solution:
Let f (x) = Sin−1 3x
The domain of Sin−1 x is [−1, 1]. So if −1 ≤ 3x ≤ 1 then −1/3 ≤ x ≤ 1/3.
So the largest set for which f defines a real valued function of a real variable is
X = [−1/3, 1/3].
0.5y
-0.5
x
Sin−1 3y = x
sin(Sin−1 3y) = sin x
3y = sin x
sin x
y =
3
6.8
Then f −1 : Y → X defined as f −1 (x) = (sin x)/3.
Exercise 6-15:
Below are three diagrams defining functions f, g and h from P5 to itself.
1 1 1 1 1 1
2 2 2 2 2 2
3 3 3 3 3 3
4 4 4 4 4 4
5 5 5 5 5 5
f g h
1 1 1 1 1 1
2 2 2 2 2 2
3 3 3 3 3 3
4 4 4 4 4 4
5 5 5 5 5 5
f g h
6.9
1 1 1 1 1 1
2 2 2 2 2 2
3 3 3 3 3 3
4 4 4 4 4 4
5 5 5 5 5 5
f g h
Exercise 6-19:
For each of the following formulas, specify subsets X and Y of R so that
f :X→Y√ is a bijective function. Find a formula for each inverse function.
f (x) = 3 − x
Solution: √
Let f (x) = y = 3 − x. f (x) is not real when 3 − x < 0. So for X = {x ∈
R | x ≤ 3}, f (X) is real valued. Then Y = f (X) = {y ∈ R | y ≥ 0} is such
bijective. To find the formula for f −1 we interchange x and
that f : X → Y is √
y which gives x = 3 − y. Solving for y we get,
p
3−y = x
3 − y = x2
6.10
Exercise 6-20:
For each of the following formulas, specify subsets X and Y of R so that
f : X → Y is a bijective function. Find a formula for each inverse function.
f (x) = (tan x)2
Solution:
Let f (x) = y = (tan x)2 . tan(x + π) = tan(x) for x 6= (2k + 1)π/2, k ∈ Z
and tan(x + π/2) = − tan(x) for x 6= kπ, k ∈ Z. So f (x + π) = f (x) and
f (x + π/2) = f (x) for x 6= π(2k + 1)/2 and x 6= kπ respectively. So in order for
f : X → Y to be bijective, X must be an interval of length π/2. We will choose
X = [0, π/2]. Then Y = {x ∈ R | x ≥ 0} is such that f : X → Y is a bijection.
To find the formula of f −1 we interchange x and y which gives x = (tan y)2 .
Solving for y we get
(tan y)2 = x
√
tan y = x
√
y = Tan−1 x
√
Hence, the inverse function f −1 : Y → X is given by f −1 (x) = Tan−1 x.
Exercise 6-21:
For each of the following formulas, specify subsets X and Y of R so that
f : X → Y is a bijective function. Find a formula for each inverse function.
x+2
f (x) =
2x − 1
Solution:
Let f (x) = y = (x + 2)/(2x − 1). f (x) is not defined when x = 1/2, choosing
X = {x ∈ R | x 6= 1/2},
x+2 2x − 4 1 5
= = + ,
2x − 1 2(2x − 1) 2 4x − 2
f (x) + 2
f (f (x)) =
2f (x) − 1
x+2
2x−1 + 2
= 2(x+2)
2x−1 −1
x + 2 + 4x − 2 5x
= = =x
2x + 4 − 2x + 1 5
x+2
So f −1 (x) = f (x) = .
2x − 1
6.11
Exercise 6-22:
For each of the following formulas, specify subsets X and Y of R so that
f :X→Yp is a bijective function. Find a formula for each inverse function.
f (x) = loge x
Solution: p
Let f (x) = y = loge x.
loge x is only defined for x > 0 and f (x) is not real when loge x < 0. There-
fore for X = {x ∈ R | x ≥ 1}, f is real valued and it is also injective. Then for
Y = f (X) = {x ∈ R | x ≥ 0}, f : X → Y is a p bijection. To find the formula for
f −1 we interchange x and y which gives x = loge y. Solving for y we get
p
loge y = x
loge y = x2
2
eloge y = ex
2
y = ex
2
So, the inverse function f −1 : Y → X is given by f −1 (x) = ex .
Exercise 6-23:
For each of the following formulas, specify subsets X and Y of R so that
f : X → Y is a bijective
√ function. Find a formula for each inverse function.
f (x) = f (x) = 3 x
Solution: √ √
Let f (x) = y = 3 x , x is not real for x < 0. So, choosing X = {x ∈ R | x ≥
0}, then Y = f (X) = {x ∈ R | x ≥ 1}. X and Y are such that f : X → Y
is a bijection.
√
To find the formula for f −1 we interchange x and y which gives
x = 3 y . Solving for y we get
√
3 y = x
√
log3 3 y = log3 x
√
y = log3 x
y = (log3 x)2
Exercise 6-24:
Which of the following functions are injections?
The function that assigns to everybody their height, to the nearest millime-
ter.
Solution:
It is not injective because there can be many people with the same height
to the nearest millimeter.
6.12
Exercise 6-25:
Which of the following functions are injections?
The function that assigns to everybody their maternal grandfather.
Solution:
It is not injective because any two brothers will have the same maternal
grandfather.
Exercise 6-26:
Which of the following functions are injections?
The function that assigns to each ship at sea, its latitude and longitude.
Solution:
Assuming that only one ship can be in a certain latitude and longitude at a
given point in time, the function is injective.
Exercise 6-27:
Which of the following functions are injections?
The function that assigns to everybody their name.
Solution:
It is not injective because two different people can have the same name.
Exercise 6-28:
Which of the following functions are injections?
The function that assigns to every worker their social security number
Solution:
Because no two people have legally the same social security number then the
function is injective.
Exercise 6-29:
Draw the graph of each of the following functions
f : P4 −→ P6 defined by f (n) = n
Solution:
6
5
4 •
3 •
2 •
1 •
1 2 3 4
6.13
Exercise 6-30:
Draw the graph of each of the following functions
f : P6 −→ P6 defined by f (n) = gcd(2, n)
Solution:
6
5
4
3
2 • • •
1 • • •
1 2 3 4 5 6
Exercise 6-31:
Draw the graph of each of the following functions
f : P3 −→ P10 defined by f (n) = n2 + 1
Solution:
10 •
9
8
7
6
5 •
4
3
2
1 •
1 2 3
Exercise 6-32:
Sketch the graph of the greatest integer function f : R → R, where f (x) = bxc,
the greatest integer less than or equal to x. What is the image of this function?
Solution:
6.14
y0
0
x
The image of the greatest integer function is Z, because for every z ∈ Z then
bz + (1/2)c = z.
Exercise 6-33:
Let f : R → R and g : R → R be defined by f (x) = x2 − 1 and g(x) = x − 1.
Find formulas for f ◦ g, g ◦ f , f ◦ f and g ◦ f ◦ g.
Solution: Let f, g : R → R by f (x) = x2 − 1, g(x) = x − 1. Then,
Exercise 6-34:
Let X = R − {0, 1}, the set of all real numbers, except for 0 and 1. Find
all the possible functions obtained by taking composites of the two functions
f : X → X and g : X → X where f (x) = 1 − x and g(x) = x1 .
Solution:
For notational convenience we shall denote f i = f ◦ f . . . f ◦ f , composing f
i times. By Theorem 6.33. composition of functions is associative, therefore
there is no ambiguity in the order of composition of f i . And f 0 = g 0 = 1R .
The composites of f and g are all defined since f and g have the same
domain and codomain X. Now f ◦ f (x) = f (1 − x) = 1 − (1 − x) = x and
g ◦ g(x) = g(1/x) = x. Hence f 2 = g 2 = 1R . Now f ◦ g = 1 − (1/x) and
6.15
g ◦ f = 1/(1 − x). Also for f ◦ g ◦ f and g ◦ f ◦ g we have,
1
(f ◦ g ◦ f )(x) = f (g(1 − x)) = f
1−x
1 x
= 1− = .
1−x x−1
1 1
(g ◦ f ◦ g)(x) = g f =g 1−
x x
x−1 x
= g = .
x x−1
It follows that f ◦ g ◦ f = g ◦ f ◦ g.
So far we have six different functions: 1R , f, g, f ◦ g, g ◦ f and g ◦ f ◦ g. Now,
we will prove that these are the only possible functions.
Because composition of functions is associative, any composite of f and g
can be written as
f n1 ◦ g n2 ◦ · · · ◦ g nk−1 ◦ f nk
where each ni is a nonnegative integer. Because g 2 = f 2 = 1R , each term f ni is
either 1R or f , and g ni is either 1R or g. The composite therefore simplifies to
(f ◦ g)m or (f ◦ g)m ◦ f or (g ◦ f )m or (g ◦ f )m ◦ g.
We want to show that each of these composites is one of the six functions
1R , f, g, g ◦ f, f ◦ g and g ◦ f ◦ g. Using the fact that f ◦ g ◦ f = g ◦ f ◦ g we have
(f ◦ g)2 = (f ◦ g) ◦ (f ◦ g) = f ◦ (g ◦ f ◦ g) = f ◦ (f ◦ g ◦ f ) = g ◦ f ;
(f ◦ g)3 = (f ◦ g) ◦ (f ◦ g)2 = (f ◦ g) ◦ (g ◦ f ) = f ◦ g ◦ g ◦ f = 1R .
Exercise 6-35:
of each of the following bijective functions, f : Z → Z.
Find inverses
n + 5 if n is even
f (n) =
n − 5 if n is odd
Solution:
Lets consider f (f (n)). For n even we have f (f (n)) = f (n + 5). Because
n + 5 is odd then f (n + 5) = n + 5 − 5 = n. If n is odd then f (f (n)) = f (n − 5).
6.16
Because n − 5 is even then f (n − 5) = n − 5 + 5 = n. Therefore f (f (n)) = n for
all n ∈ Z.
It follows that f −1 (n) = f (n).
Exercise 6-36:
of each of the following bijective functions, f : Z → Z.
Find inverses
n + 4 if n ≡ 0 (mod 3)
f (n) = −n − 3 if n ≡ 1 (mod 3)
n + 1 if n ≡ 2 (mod 3)
Solution:
n − 1 if n≡0 (mod 3)
f −1 (n) = n − 4 if n≡1 (mod 3)
−n − 3 if n≡2 (mod 3)
Exercise 6-37:
If f : X → Y is a bijective function, prove that its inverse is unique.
Solution:
Suppose that both g : Y → X and h : Y → X are inverses of f : X → Y .
Both g and h have the same domain and codomain. Then g ◦ f = 1dx and
f ◦ h = 1dY .
Using this we see that
g = g ◦ 1dy = g ◦ (f ◦ h) = (g ◦ f ) ◦ h = 1dx ◦ h = h .
Exercise 6-38:
Let f : X → Y and g : Y → Z be bijective functions. Prove that
(g ◦ f )−1 = f −1 ◦ g −1 .
Solution:
Let h = g ◦ f then f −1 ◦ g −1 : Z → X. Using the fact that composition of
functions is associative,
(g ◦ f ) ◦ (f −1 ◦ g −1 ) = g ◦ (f ◦ f −1 ) ◦ g −1 = g ◦ 1Y ◦ g −1 = g ◦ g −1 = 1Z .
And
(f −1 ◦ g −1 ) ◦ (g ◦ f ) = f −1 ◦ (g −1 ◦ g) ◦ f = f −1 ◦ 1Z ◦ f = f −1 ◦ f = 1X
6.17
It follows that (g ◦ f )−1 = f −1 ◦ g −1 .
Exercise 6-39:
Determine which of the following functions are injective, surjective, and bijec-
tive. Find the inverses of the bijective functions.
f : R −→ R defined by f (x) = (x − 2)3 .
Solution:
For f (x) = y = (x − 2)3 . If we let g : R → R to be g(x) = x3 and h : R → R
to be h(x) = x − 2. Then both g and h are bijections. So by Proposition
6.54., f = g ◦ h is also a bijection. Therefore f is also injective, surjective and
it has an inverse.
To get the formula for f −1 we √can interchange x and y and solve for y. This
gives f −1 : R → R as f −1 (x) = 3 x + 2.
Exercise 6-40:
Determine which of the following functions are injective, surjective, and bijec-
tive. Find the inverses of the bijective functions.
g : R − {0} −→ R defined by g(x) = log2 |x|.
Solution:
g(−x) = log2 | − x| = log2 |x| = g(x). So g is not injective.
log2 : X → R where X are the positive real numbers is a surjective function.
Also |x| : R − 0 → X is surjective. So by Proposition 6.54. the composition
of these functions g(x) = log2 |x| is also surjective.
Because g(x) is not injective then it is not bijective and it does not have an
inverse g −1 : R → R − {0}.
Exercise 6-41:
Determine which of the following functions are injective, surjective, and bijec-
tive. Find the inverses of the bijective functions.
h : Z −→ Z defined by h(n) = n3 .
Solution:
The function f : R → R defined by f (x) = x3 is injective so in particular
for m, n ∈ Z, if f (m) = h(m) = h(n) = f (n) then m = n. It follows that h is
injective.
h(n+1) = (n+1)3 > n3 = h(n) for all n ∈ Z, then h is monotone increasing.
Because 13 < 2 < 23 , then there is no n such that h(n) = n3 = 2. So, h is not
surjective.
Because h is not surjective then it is not bijective and it does not have an
inverse h−1 : Z → Z.
Exercise 6-42:
Determine which of the following functions are injective, surjective, and bijec-
tive. Find the inverses of the bijective functions.
6.18
k : X −→ X, where X = P − {1} is the set of integers greater than 1, and
k(n) is the greatest prime factor of n.
Solution:
Let us determine a few small values of the function k.
k(2) = 2
k(3) = 3
k(4) = 2
k(5) = 5
k(6) = 3 .
Exercise 6-43:
Let f : X → Y and g : Y → X be functions so that g ◦ f = 1X . Prove that f is
injective and g is surjective. Need either be bijective?
Solution:
f is injective: Let f (x1 ) = f (x2 ); x1 , x2 ∈ X. Then g(f (x1 )) = g(f (x2 ))
because g is a function. And so because g ◦ f = 1X then 1X (x1 ) = 1X (x2 ).
By the definition of 1X , x1 = x2 .
g is surjective: Let x ∈ X. Then,
Exercise 6-44:
1. Prove that #A = #A for every set A.
2. If #A = #B, prove that #B = #A.
3. If #A = #B and #B = #C, prove that #A = #C.
Solution:
(a) The identity function on A, 1A : A → A, is a bijection because it is injective
and surjective. Therefore, by the definition of cardinality #A = #A.
(b) If #A = #B then there exists a bijection f : A → B. Because f is bijective
then it has an inverse f −1 : B → A. Because f is the inverse of f −1 then f −1
is also a bijection. Thus, by the definition of cardinality, #B = #A.
6.19
(c) If #A = #B and #B = #C then there exist bijections f : A → B and
g : B → C. By Proposition 6.54. g ◦ f : A → C is also a bijection. Therefore,
by the definition of cardinality #A = #C.
Exercise 6-45:
If A, B and C are finite sets, show that
Solution:
We will use Exercise 1-71, the distributive law, A ∩ (B ∪ A
#(A ∪ B ∪ C)
= #(A ∪ (B ∪ C)) = #A + #(B ∪ C) − #(A ∩ (B ∪ C))
= #A + #B + #C − #(B ∩ C) − #((A ∩ B) ∪ (A ∩ C))
= #A + #B + #C − #(B ∩ C) − #(A ∩ B) − #(A ∩ C)
+#((A ∩ B) ∩ (A ∩ C))
= #A + #B + #C − #(A ∩ B) − #(A ∩ C) − #(B ∩ C) + #(A ∩ B ∩ C).
Exercise 6-46:
In a regiment returning from war, 70% of the men had lost an eye, 80% an arm
and 85% a leg. What percentage, at least, must have lost all three? (Adapted
from Lewis Carroll, “A Tangled Tale”.)
Solution:
Let E be the set of men that lost an eye, let A be the set of men that lost an
arm and let L be the set of men that lost a leg. We know that E ∪ A ∪ L is the
set of men that lost an eye, an arm or a leg. Lets find a formula for E ∪ A ∪ L.
By Exercise 6-45 we know that
100% =
#E + #A + #L − #(A ∩ L) − #(E ∩ A) − #(E ∪ L) + #(E ∩ A ∩ L)
= 70% + 80% + 85% − #(A ∩ L) − #(E ∩ A) − #(E ∪ L) + #(E ∩ A ∩ L)
= 235% − #(A ∩ L) − #(E ∩ A) − #(E ∩ L) + #(E ∩ A ∩ L)
6.20
So
#(E ∩ A ∩ L) = #(A ∩ L) + #(E ∩ A) + #(E ∩ L) − 135%
Now,
#(A ∪ L) = #A + #B − #(A ∩ B)
= 80% + 85% − #(A ∩ B)
Exercise 6-47:
Show that the set of even positive integers has the same cardinality as the set
of all positive integers. Show that the set of odd positive integers also has the
same cardinality.
Solution:
Let f : 2P → P be defined by f (n) = n/2. If f (n) = f (m) then m = n
so f is injective. And for every k ∈ P, 2k ∈ 2P and f (2k) = k. So, f is also
surjective. Thus, f is bijective and by definition of cardinality #2P = #P.
Now let g : 2P → O, where mathbbO is the set of odd positive integers, be
defined by g(n) = n − 1. Again if g(n) = g(m) then n = m and for every k ∈ O,
k + 1 ∈ 2P and g(k + 1) = k. So, g is also surjective. Thus, g is bijective and
by definition of cardinality#2P = #O.
Exercise 6-48:
Let P(X) denote the set of all subsets (including ∅ and X) of a set X. Write
out the elements of P(∅), P({a}) and P({r, s, t}). If #X = n, a finite number,
what is #P(X)? Prove your assertion.
Solution:
P(∅) = {∅}
P({a}) = {∅, {a}}
P({r, s, t}) = {∅, {r}, {s}, {t}, {r, s}, {r, t}, {s, t}, {r, s, t}}
Claim: If #X = n, #P(X) = 2n
Proof: by induction:
n = 0: When n = 0, X = ∅, P(x) = {∅}, #X = 1 = 20 .
As induction hypothesis assume that the result holds for n = k: that is if
#X = k, then #P(X) = 2k .
Then for n = k + 1, let #Y = k + 1, let Y = X ∪ {yk+1 } where X =
{y1 , y2 , . . . , yk }, #X = k.
6.21
Any subset of Y either contains yk+1 or it doesn’t. The number which don’t
include yk+1 is equal to the number of subsets of X, namely 2k . The number
which do include yR+1 is also 2k , since any such subset is the union of {yk+1 },
and a subset of X.
Therefore #P(Y ) = 2k + 2k = 2k+1 .
The result holds for n = k+1 and by the Principle of Mathematical Induction
the claim is true.
Exercise 6-49:
Define the function Sec−1 x, giving its domain and image.
Solution:
sec(x) = 1/ cos(x)
y0
0
x
Because sec(x) is not defined when cos(x) = 0 then the graph of sec(x)
has asymptotes at odd multiples of π/2. Therefore, the domain of sec(x) is
X = {x ∈ R | x 6= π(2k + 1)/2 k ∈ Z}. Because | cos x| ≤ 1 then | sec x| ≥ 1.
So the image of the function is Y = f (X) = {x ∈ R | |x| ≥ 1}.
We will use the branch through the origin to define the inverse. If the secant
function is restricted to Sec : [0, π/2) ∪ (π/2, π] → Y , where Y is as defined
above, we get a bijection. Then Sec−1 : Y → [0, π/2) ∪ (π/2, 1].
6.22
2
y p
_
2
0
0
x
Exercise 6-50:
Define the function Cot−1 x, giving its domain and image.
Solution:
cot(x) = cos(x)/ sin(x)
y0
0
x
Because cot(x) is not defined when sin(x) = 0 then the graph of cot(x) has
asymptotes at multiples of π. Therefore, the domain of cot(x) is X = {x ∈
R | x 6= kπ k ∈ Z}. The image of cot(x) is Y = f (X) = R.
We will use the branch starting at the origin to define the inverse. If the
cotangent function is restricted to mboxCot : (0, π) → R, we get a bijection.
Then Cot−1 : R → (0, π).
6.23
2
y p
_
2
0
0
x
Exercise 6-51:
Solve the equation Sin−1 x + Sin−1 1 = π.
Solution:
Because sin(π/2) = 1 then Sin−1 1 = π/2. So we have
Sin−1 x = π − π/2.
Exercise 6-52: √
Solve the equation Sin−1 12 + Sin−1 2
3
= x.
Solution: √
Because sin(π/6) = 1/2, and sin(π/3) = 3/2 and both π/2 and π/3 ∈
[−π/2, π/2] then
1 3 π π
x = Sin−1 + Sin−1 = +
2 2 6 3
π
= .
2
Exercise 6-53:
What is the relationship between Cos−1 x and Sin−1 x in the domain in which
they are both defined.
Solution:
6.24
Because sin(x + π/2) = cos x then for x ∈ [0, π/2] (where both Sin−1 x and
Cos−1 x are defined), x − π/2 ∈ [−π/2, 0] we have Cos−1 x = Sin−1 x − π/2.
Check: If we take cos on both sides we get
Exercise 6-54:
Prove that the shaded segment of the circle of radius r A
has area p p r
r2 Cos−1 − p r 2 − p2 O p
r C
where p is the perpendicular distance from the center to
the segment. B
Solution:
The angle AOC is certainly between 0 and π, and its cosine is p/r. So the
angle is Cos−1 (p/r).
The area of the shaded segment of the circle can be calculated by subtracting
the area of the isosceles triangle AOB from the arc region AOB.
The area of the arc region AOB is
p p
πr2 2Cos−1 /2π = r2 Cos−1 .
r r
And the area of the triangle AOB is (1/2)bh where b and h p are the base and
height of the triangle. h = pp and by Pythagoras Theorem b = 2 r2 − p2 . Hence
the area of the triangle is p r2 − p2 .
So, the area of the shaded region is
p p
r2 Cos−1 − p r 2 − p2 .
r
Exercise 6-55:
1
Sketch the graph of y = .
10x
Solution:
f (x) = 1/10x = (1/10)x is an exponential function. Because 0 < 1/10 < 1
then f is monotone decreasing.
The domain of the function is X = R and its image is Y = f (X) = {y ∈
R | y > 0}. We also know that f (0) = 1 and f (1) = 1/10.
6.25
1
-1 0 1
Exercise 6-56:
Sketch the graphs of y = (1/2)x , y = 2x and y = 3x in the same diagram.
Solution:
f (x) = 1/2x = (1/2)x , g(x) = 2x and h(x) = 3x are all exponential
functions. Because 0 < 1/2 < 1 then f is monotone decreasing. And be-
cause 1 < 2 < 3 then both g and h are monotone increasing. For x ≥ 0,
(1/2)x ≤ 2x ≤ 3x and for x < 0 then (1/2)x ≥ 2x ≥ 3x .
The domain of all three functions is X = R and their image is Y = f (X) =
g(X) = h(X) = {y ∈ R | y > 0}. We also know that f (0) = g(0) = h(0) = 1
and f (1) = 1/2 , g(1) = 2 and h(x) = 3.
x x x
y=(1/2) y=3 y=2
y 1.5
0
x
Exercise 6-57:
2x + 2−x
Sketch the graph of y = .
2
Solution: For f (x) = y = (2x +2−x )/2, f (x) = f (−x) so f is even or symmetric
with respect to the y axis.
6.26
For x > y ≥ 0, because g(x) = 2x is monotone increasing then 2x > 2y and
1
1 >
2x+y
2x − 2y 1
>
2x − 2y 2x+y
2x − 2y
2x − 2y >
2x+y
2x + 2−x > 2 + 2−y .
y
Dividing the inequality by 2 we get that f (x) > f (y). Therefore f is monotone
increasing in {x ∈ R | x ≥ 0}.
And for 0 > y > x then −x > −y > 0 which implies that f (−x) > f (−y)
by what was proven above. And because f is even or symmetric with respect
to the y axis, then f (x) = f (−x) and f (y) = f (−y) so f (x) > f (y). Therefore
f is monotone decreasing in {x ∈ R | x < 0}.
The domain of the function is X = R and its image is Y = f (X) = {y ∈
R | y > 0}. Also f (0) = 1 and f (1) = 3/4.
-2 -1 0 1 2
Exercise 6-58:
2
Sketch the graph of y = e−x . (This is a simple form of the normal probability
curve in statistics.)
2
Solution: For f (x) = y = e−x , f (x) = f (−x) so f is even or symmetric with
respect to the y axis.
2 2
For x > y ≥ 0 then −x2 < −y 2 and e−x < e−y because g(x) = ex is
monotone increasing. So f (x) is monotone decreasing in {x ∈ R | x ≥ 0}. And
for 0 > y > x then −x > −y > 0 which implies that f (−x) < f (−y) because f
is monotone decreasing for −x > −y > 0. And because f is even or symmetric
with respect to the y axis, then f (x) = f (−x) and f (y) = f (−y) so f (x) < f (y).
Therefore f is monotone increasing in {x ∈ R | x < 0}.
The domain of the function is X = R and its image is Y = f (X) = {y ∈
R | y > 0}. Also f (0) = 1 and f (1) = 1/e.
6.27
y1
0
x
Exercise 6-59:
Solve the following equation.
8 = log2 x
Solution:
8 = log2 x if and only if 28 = x. So x = 256.
Check: log2 256 = log2 28 = 8.
Exercise 6-60:
Solve the following equation.
2 = logx 10
Solution: √ √ √
2 = logx 10 if and only if x2 = 10. So x = 10 = 2 5.
Check: log√10 10 = 2.
Exercise 6-61:
Solve
√ the following equation.
x
2 = e2
Solution:
If we take loge on both sides we get
√x
loge 2 = 2
1
loge 2 x = 2
1
loge 2 = 2
x
Solving for x we get x = (loge 2)/2
Check: 22/(loge 2) = (eloge 2 )2/(loge 2) = e2 .
6.28
Exercise 6-62:
Solve the following equation.
loge (loge x) = 5
Solution:
loge (loge x) = 5 if and only if e5 = loge x. And e5 = loge x if and only if
5
x = ee .
5
Check: loge (loge ee ) = loge e5 = 5.
Exercise 6-63:
Solve the following equation.
10−3 log10 x = 5
Solution:
10−3 log10 x = 5
(10log10 x )−3 = 5
x−3 = 5
x = 5−1/3
−1/3
Check: 10−3 log10 5 = (5−1/3 )−3 = 5.
Exercise 6-64:
Solve the following equation.
5 = 2loge x
Solution:
By Theorem 6.84., loge x = (log2 x)/(log2 e), so
5 = (2log2 x )1/(log2 e)
5 = x1/ log2 e .
Exercise 6-65:
If x > 0, write xx as a power of e.
Solution:
Because x > 0 then loge x is defined. Using y = eloge y then
x
xx = eloge x
= ex(loge x)
6.29
Exercise 6-66:
If a piece of paper 0.2 mm thick could be folded in half 20 times, approximately
how thick would the resulting paper be?
(Use the fact that log10 2 is approximately 0.3.)
Solution:
Every time the paper is folded in half, its thickness is doubled. The thickness
of the resulting paper after being folded by half 20 times is 220 (0.2) mm. Using
the fact that log10 2 as approximately 0.3, the thickness of the resultant paper
after being folded 20 times is
20
220 (0.2) mm = 10log 2 (0.2) mm
0.3 20
≈ 10 (0.2) mm
= 106 (0.2) mm
= 2 · 105 mm
= 200 meters.
Exercise 6-67:
An archaeologist claims that a bone he has discovered is seventeen thousand
years old. If this were true, how much of the original amount of carbon 14
would you expect to remain in the bone?
Solution:
The carbon 14 has a half-life of 5700 years. If the bone discovered by the
archeologist is seventeen thousand years old and r is the fraction of the original
amount of carbon 14 left in the bone,
17000/5700
1
r =
2
3
1 1
≈ = .
2 8
Approximately 1/8 ≈ 13% of the original amount of carbon 14 should be left in
the bone.
Exercise 6-68:
The earth’s population is now 6 billion, and is increasing at the rate of 2% a
year. If it continues at this rate, how long will it take to double? What would
be the population in 100 years time?
(Use the fact that log10 2 ≈ 0.3 and log10 1.02 ≈ 0.0086.)
Solution:
If the rate of growth continues, after t years the population of the world
would be
p = (1.02)t 6 × 109 .
6.30
So if t0 is the number of years necessary for the population of the world to
double, then
If we take log10 on both sides we get log10 2 = t0 log10 1.02. Using the fact
that log10 2 ≈ 0.3 and log10 1.02 ≈ 0.0086. then t0 = log10 2/ log10 1.02 ≈
0.3/0.0086 ≈ 35. If the rate of growth continues then the population of the
world will double in 35 years.
Applying the same formula, if the rate of growth continues then after 100
years,
p
r= = (1.02)100
6 × 109
If we take log10 on both sides then
Hence the population after 100 years will be approximately 43.4 billion people.
Exercise 6-69:
When a ship docks, its rope is thrown
to the quay, wound round a bollard, θ
and then held by a sailor. If θ is
the angle that the rope turns through
when wound round the bollard, then
a sailor exerting a tension of M kilo- to the
sailor to the ship
grams on the rope can hold a tension
of T kilograms from the ship, where T
M
µθ
T = Me .
The constant µ is the coefficient of friction between the rope and the bollard.
How many times would the sailor have to wrap the rope around the bollard to
hold a tension of 160 tonnes, if µ = .5 and the sailor could exert a tension of 20
kilograms?
Solution:
6.31
Using the given formula for T = 1.6 × 105 kilograms, M = 20 kilograms≈ e3
and µ = .5, if θ is the angle that the rope turns through when wound round the
bollard then,
Taking log10 on both sides and using the fact that log10 e ≈ .4343 then
To find the number of times the sailor has to wrap the rope around the bollard
we divide θ ≈ 18 by 2π ≈ 6.28 to get 2.87. Hence, the sailor has to wrap the
rope around the bollard about 3 times.
Exercise 6-70:
If $1000 is placed in a savings bank at 10% interest, compounded daily, how
much will be in the account after one year?
Solution:
The annual rate is 10% therefore the daily rate is (10/365)%. After 365 days
the amount of money in the account will be
The amount of money in the bank after one year will be approximately 107.28 =
1.90 × 107 .
Exercise 6-71:
If X is a finite set, show that the following conditions on a function f : X → X
are equivalent.
(a) f is an injection.
(b) f is a surjection.
6.32
(c) f is a bijection.
Solution:
We have a function f : X → X for X = {x1 , x2 , . . . , xn } for some n ∈ P.
First we will show that condition (a) implies condition (b). Because f is an in-
jection, then f (x1 ), f (x2 ), . . . , f (xn ) are all distinct elements of X. But because
X has n elements then {f (x1 ), f (x2 ), . . . , f (xn )} = X in some particular order.
Therefore f is surjective.
Now we show that condition (b) implies condition (c).
If f is not injective then f (xi ) = f (xj ) for some xi , xj ∈ X i 6= j. Then
f (x1 ), f (x2 ), . . . , f (xn ) are at most n − 1 different elements of X. This implies
that f is not surjective. Therefore if f : X → X is surjective it is also injective
and thus it is a bijection.
Now we show that condition (c) implies condition (a).
If f is a bijection then it is also an injection.
It follows that the three conditions are equivalent.
Exercise
6-72:
1234 1234 1234
If ρ = ,σ= and τ = are permutations of the
2143 2341 3241
set P4 = {1, 2, 3, 4}, find the following permutations.
ρ ◦ σ.
Solution: To compute ρ ◦ σ : P4 → P4 we must first apply σ and then ρ. Since
σ(1) = 2 and ρ(2) = 1 then ρ(σ(1)) = 1. Similarly , ρ(σ(2)) = 4, ρ(σ(3)) = 3
and ρ(σ(4)) = 2. Hence
1234 1234 1234
ρ◦σ = ◦ = .
2143 2341 1432
Exercise
6-73:
1234 1234 1234
If ρ = ,σ= and τ = are permutations of the
2143 2341 3241
set P4 = {1, 2, 3, 4}, find the following permutations.
σ ◦ ρ.
Solution: To compute σ ◦ ρ : P4 → P4 we must first apply ρ and then σ. Since
ρ(1) = 2 and σ(2) = 3 then σ(ρ(1)) = 3. Similarly , σ(ρ(2)) = 2, σ(ρ(3)) = 1
and σ(ρ(4)) = 4. Hence
1234 1234 1234
σ◦ρ= ◦ = .
2341 2143 3214
6.33
Exercise
6-74:
1234 1234 1234
If ρ = ,σ= and τ = are permutations of the
2143 2341 3241
set P4 = {1, 2, 3, 4}, find the following permutations.
ρ2 = ρ ◦ ρ.
Solution: To compute ρ ◦ ρ : P4 → P4 we must apply ρ twice. Since ρ(1) = 2
and ρ(2) = 1 then ρ(ρ(1)) = 1. Similarly , ρ(ρ(2)) = 2, ρ(ρ(3)) = 3 and
σ(ρ(4)) = 4. Hence
1234 1234 1234
ρ◦ρ= ◦ = .
2341 2341 1234
Exercise
6-75:
1234 1234 1234
If ρ = ,σ= and τ = are permutations of the
2143 2341 3241
set P4 = {1, 2, 3, 4}, find the following permutations.
(ρ ◦ σ) ◦ τ .
Solution: By Exercise 6-72 we know that
1234
ρ◦σ = .
1432
Exercise
6-76:
1234 1234 1234
If ρ = ,σ= and τ = are permutations of the
2143 2341 3241
set P4 = {1, 2, 3, 4}, find the following permutations.
ρ−1 .
Solution: By Exercise 6-74 we know that
1234
ρ2 = .
1234
6.34
Exercise
6-77:
1234 1234 1234
If ρ = ,σ= and τ = are permutations of the
2143 2341 3241
set P4 = {1, 2, 3, 4}, find the following permutations.
τ −1 .
Solution: By Proposition 6.92., τ ◦ τ −1 = τ −1 ◦ τ = ι. Because τ (1) = 3 and
τ −1 (τ (1)) = 1 so τ −1 (3) = 1. Similarly τ −1 (2) = 2, τ −1 (4) = 3 and τ −1 (1) = 4.
Hence,
−1 1234
τ = .
4213
Indeed τ (τ −1 (1)) = 1, τ (τ −1 (2)) = 2, τ (τ −1 (3)) = 3, and τ (τ −1 (4)) = 4 so
τ τ −1 = ι.
Exercise
6-78:
1234 1234 1234
If ρ = ,σ= and τ = are permutations of the
2143 2341 3241
set P4 = {1, 2, 3, 4}, find the following permutations.
ρ−1 ◦ τ −1 .
Solution: By Exercises 6-76 and 6-77,
1234 1234
ρ−1 = and τ −1 = .
2143 4213
Exercise
6-79:
1234 1234 1234
If ρ = ,σ= and τ = are permutations of the
2143 2341 3241
set P4 = {1, 2, 3, 4}, find the following permutations.
(τ ◦ ρ)−1 .
Solution:
By Proposition 6.92. the composition of permutations is associative, if we
compose τ ◦ ρ with ρ−1 ◦ τ −1 then,
(τ ◦ ρ)(ρ−1 ◦ τ −1 ) = τ ◦ (ρ ◦ ρ−1 ) ◦ τ −1 = τ ◦ τ −1 = ι.
Similarly,
6.35
Therefore (τ ◦ ρ)−1 = ρ−1 ◦ τ −1 . And by Exercise 6-78,
−1 −1 −1 1234
(τ ◦ ρ) = ρ ◦ τ = .
3124
Exercise 6-80:
If S is a finite set with more than two elements, show that there are permutations
σ and τ of S such that σ ◦ τ 6= τ ◦ σ.
Solution: The set S = {i1 , i2 , . . . , in } where n > 2. Let σ and τ be per-
mutations of S such that σ(i1 ) = i2 , σ(i2 ) = i3 , σ(i3 ) = i1 and everything
else is fixed, and τ (i1 ) = i2 , τ (i2 ) = i1 , and everything else is fixed. Then
σ(τ (i1 )) = σ(i2 ) = i3 and τ (σ(i1 )) = τ (i2 ) = i1 . Because σ(τ (i1 )) 6= τ (σ(i1 ))
then σ ◦ τ 6= τ ◦ σ.
Problem 6-81:
For each of the following functional equations satisfied by the function f : R →
R, find:
(a) f (0),
(b) f (−x) in terms of f (x),
(c) f (n) where n ∈ P,
(d) f (n) where n ∈ Z,
(e) f (r) where r ∈ Q.
6.36
(e) For n ∈ P,
1 1 1
f (1) = f + + ... + ,
n n n
1 1 1
= f +f + ... + f
n n n
1
= nf .
n
Problem 6-82:
For each of the following functional equations satisfied by the function f : R →
R, find:
(a) f (0),
(b) f (−x) in terms of f (x),
(c) f (n) where n ∈ P,
(d) f (n) where n ∈ Z,
(e) f (r) where r ∈ Q.
6.37
(b) 1 = f (0) = f (x + −x) = f (x) · f (−x). Because f (x) · f (−x) 6= 0 then
f (x) 6= 0. Dividing by it gives f (−x) = 1/f (x).
(c) For n ∈ P, f (n) = q n . We will prove this by induction on n.
(i). For n = 1, f (1) = q. So the result holds.
(ii). As induction hypothesis assume that the result holds for n = k, that is
f (k) = q k . Then for n = k + 1, f (k + 1) = f (k) · f (1) = q k · q = q k+1 .
By the Principle of Mathematical induction the result holds for all n ∈ P.
(d) By part (c) we already know that f (n) = q n for n ∈ P. By part (b) then
f (−n) = 1/f (n) = 1/(q n ) = q −n , and by part (a) f (0) = 1 = q 0 . So we can
conclude that f (n) = q n for n ∈ Z.
(e) For n ∈ P,
1 1 1
f (1) = f + + ... + ,
n n n
1 1 1
= f ·f ···f
n n n
n
1
= f .
n
If f (1) = q < 0 and n is odd then f (1/n) is not real which is a contradiction.
√
Because f is real valued at 1/n then q ≥ 0 and f (1/n) = n q.
So for r ∈ Q we can express r = a/b where a, b ∈ Z, gcd(a, b) = 1 and b > 0.
So
a
f (r) = f
b
1 1 1
= f + + ... +
b b b
1 1 1
= f ·f ···f
b b b
a
1
= f .
b
Problem 6-83:
Give one example of a function f : R → R satisfying f (x + y) = f (x) · f (y) with
f (1) = 2.
Solution:
By Problem 6-82 we know that if f : R → R and f (x + y) = f (x) · f (y)
and f (1) = q for q > 0 then f (r) = q r for r ∈ Q. So if f (1) = 2 then
f (x) = 2x is the desired function because f (1) = 21 = 2 and for all x, y ∈ R,
f (x + y) = 2x+y = 2x · 2y = f (x) · f (y).
6.38
Problem 6-84:
Give two examples of functions f : R → R satisfying f (x + y) = f (x) · f (y).
Solution:
The exponential function f (x) = bx for b > 0 is such that for all x and
y ∈ R, then f (x + y) = bx+y = bx · by = f (x) · f (y). So for 2, 3, f (x) = 2x
and f (x) = 3x , are two examples of functions f : R → R satisfying the given
functional equation.
Problem 6-85:
Solve the functional equation
Problem 6-86:
If f (x + y) = f (x) · f (y) and f is a bijection, show that its inverse satisfies the
functional equation
f −1 (xy) = f −1 (x) + f −1 (y).
Solution:
Because f is a bijection then it has an inverse f −1 . And for all x, y in the
domain of f −1 , there exists u, v in the domain of f such that f (u) = x and
f (v) = y. Then
Problem 6-87:
Find all real functions f , of a real variable, of the form
ax + b
f (x) = where a, b, c, d ∈ R
cx + d
such that f (f (x)) = x for all x except when cx + d = 0.
Solution:
6.39
We want to find all a, b, c, d ∈ R such that f (f (x)) = x. That is,
x = f (f (x))
a ax+b
cx+d + b
=
c ax+b
cx+d + d
a(ax + b) + b(cx + d)
=
c(ax + b) + d(cx + d)
a2 x + ab + cbx + db
=
cax + cb + cdx + d2
x(a2 + cd) + ab + db
=
x(ca + cd) + cb + d2
c(a + d) = 0
c(b − d) + d2 − a2 = 0
b(a + d) = 0
6.40
Problem 6-88:
Find a function f : R → R, different from any of those of the previous example,
for which f ◦ f = 1R .
[Noncontinuous functions are allowed, though there are continuous examples.]
Solution:
Let f : R → R be defined by
−2x if x ≥ 0
f (x) = −1
2 x if x < 0.
Problem 6-89:
What are all the elements of the subset P4 × P4 that define the relation ‘greater
than’ ?
Solution:
We want all the (x, y) ∈ P4 × P4 such that x > y. The first element x can
be 4, 3 or 2. Then all the elements of the relation are
{(2, 1), (3, 2), (3, 1), (4, 3), (4, 2), (4, 1)}
Problem 6-90:
Which subset of P6 ×P6 defines the relation ‘divides’ ? Is this relation a function
from P6 to P6 ?
Solution:
We want all the (x, y) ∈ P6 × P6 such that x|y. Clearly x ≤ y. So for each
x ∈ P6 ,
1|1, 2, 3, 4, 5, 6 2|2, 4, 6 3|3, 6 4 6 | 5 6 | 6|6
So the desired subset is
{(1, 1), (1, 2), (1, 3), (1, 4), (1, 5), (1, 6), (2, 4), (2, 6), (3, 3), (3, 6), (6, 6)}.
6.41
Problem 6-91:
Sketch the subset of R × R that defines the ‘equals’ relation. Do the same for
the ‘less than or equals’ relation. Are either of these relations functions from R
to R ?
Solution:
For the ’equals’ relation, we want S = {(x, y) ∈ R × R | x = y} = {(x, x) ∈
R × R}.
This relation is a function because each element x is assigned uniquely to x.
For the ’less than’ relation, we want T = {(x, y) ∈ R × R | x < y}.
This relation is not a function because for any x ∈ R, there exist y and
z ∈ R with x < y and y < z. Because x < z then (x, y), (x, z) ∈ T . So x is not
assigned to a unique element of R.
R R
R R
Problem 6-92:
Sketch the subset of R × R that defines the relation R where xRy if and only if
x2 + y 2 = 4. Is this relation a function from R to R ?
Solution:
For the given relation, we want S = {(x, y) ∈ R × R | x2 + y 2 = 4}. These
are all the points on a circle of radius 2 centered at the origin.
Because (0, 2) ∈ S, then S 6= ∅. And if (x, y) ∈ S, then x2 +y 2 = x2 +(−y)2 =
4 so (x, −y) ∈ S. If y 6= 0, x is not assigned to a unique element of R. It follows
that this relation is not a function.
2
6.42
Problem 6-93:
If the telephone directory defines a bijection from the set of listed subscribers
to the set of listed numbers, how would you find the inverse of a given number?
Solution:
Call the number and see who answers. Then check this name in the telephone
directory to see if it corresponds to the given number. Alternatively see if the
web has a Reverse Phone Number Search for your area; in this case a computer
has been used to find the inverse function.
Problem 6-94:
Let ` and m be lines and P a point in a plane. We try to define a function f ,
from the points of ` to the points of m, by taking any point X on `, and letting
the line P X intersect m in the point f (X). Under what geometric conditions
will f be a bijection?
Solution:
l
x•
• P
m
f (x)
Problem 6-95:
Does the function f : R → R defined by f (x) = x3 + x + 1 have an inverse? If
so, can you find an equation for the inverse function?
Solution:
If f (x) = f (y) then
x3 + x + 1 = y 3 + y + 1
x − y = y 3 − x3
x − y = (y − x)(y 2 + yx + x2 )
6.43
Let’s assume that x 6= y. We can then divide both sides by (y − x) to get
y 2 + yx + x2 = −1. Now,
x 2 3y 2
y 2 + yx + x2 = y + + .
2 4
Because both (y + (x/2))2 , 3y 2 /4 ≥ 0 for all x, y ∈ R then they cannot add up
to give -1. Therefore our assumption that x 6= y was incorrect.
Hence, f is injective.
Looking at the graph of the function we can argue that the function is
surjective.
Hence f (x) = x3 + x + 1 is a bijection and it has an inverse. The explicit
formula of the inverse f −1 involves solving the particular cubic equation x3 +x+1
which is somewhat cumbersome. Solving a general cubic equation is discussed
in Chapter 9.
Problem 6-96:
How many functions are there from Pr to Pn ?
Solution:
Pr = {1, 2, 3, . . . , r} and Pn = {1, 2, 3, . . . , n}. For every function from Pr to
Pn , each element of Pr is assigned to a unique element of Pn . So every element
of the domain, Pr can be assigned to any of the n elements of Pn . Therefore
# functions =
(# choices for 1) × (# choices for 2) × . . . × (# choices for r)
= n × n × n... × n
= nr .
Problem 6-97:
How many injections are there from Pr to Pn ?
Solution:
Pr = {1, 2, 3, . . . , r} and Pn = {1, 2, 3, . . . , n}. By Problem 6-96 there are nr
functions from Pr to Pn . In order for a function to be an injection, each element
of Pr must be assigned to a distinct element of Pn .
If r > n then there are 0 injections because there are not enough elements
in the codomain to be assigned uniquely with elements in the domain.
But if r ≤ n then 1 ∈ Pr can be assigned to any of the n elements of Pn .
2 ∈ Pr can be assigned to any of the n elements of Pn except the one that was
assigned with 1 ∈ Pr . Generally, if there are k elements of Pr assigned to k
distinct elements of Pn , the k + 1th element can be assigned to any of the n − k
6.44
elements left in Pn . Because r ≤ n and k ≤ r then n − k ≥ 0. Therefore
# injections =
(# choices for 1) × (# choices for 2) × . . . × (# choices for r)
= n × (n − 1) . . . × (n − r + 1)
n!
= .
(n − r)!
The number of injections is n!/r! if r ≤ n and 0 if r > n.
Problem 6-98:
(a) Find the number of surjections from a 3-element set to a 2-element set.
(b) How would you tackle the problem of finding the number of surjections
from Pr to Pn in general? [There is no simple formula.]
Solution:
(a) We want to find the number of surjections from a 3-element set, like P3 ,
to a 2-element set, like P2 . For every surjection f : P3 → P2 , all the elements
of the codomain will be an image of at least one element of the domain. So if
a1 and a2 are the number of elements in the domain mapped to 1 and 2 in P2
respectively, then a1 + a2 = 3 because f is a function and a1 , a2 ≥ 1.
The only possibilities are a1 = 2, a2 = 1 or a1 = 1, a2 = 2.
For a1 = 2, a2 = 1, if 1 ∈ P2 is the image of two elements of P3 then there
are 32 possibilities of choosing these two elements. Once these are chosen the
element sent to 2 ∈ P2 will be determined. Hence, in total there are 32 11 = 3
surjections.
For a1 = 1, a2 = 2 the same argument applies so there are 3 more surjections.
In total there are 6 surjections.
1
-1
1
1 -1 1 PP 1 1
3
P 3
2 12 2 -2 2 P q2
3 3 3
a1 = 2, a2 = 1 a1 = 2, a2 = 1 a1 = 2, a2 = 1
1 -1 1 PP 11 1 PP 1
P
q P3
2
-2
1 2 P 12
2 - q2
P
3 3 3
a1 = 1, a2 = 2 a1 = 1, a2 = 2 a1 = 1, a2 = 2
6.45
Another random document with
no related content on Scribd:
being taken in at one glance. But already it appears heavier and
richer in the ornament of the Imperial Fora (Nerva’s, Trajan’s) and
that of the temple of Mars Ultor; the organic disposition has become
so complicated that, as a rule, it requires to be studied, and the
tendency to fill up the surfaces appears. In Byzantine art—of which
Riegl thirty years ago noticed the “latent Saracenic character” though
he had no suspicion of the connexion brought to light here—the
acanthus leaf was broken up into endless tendril-work which (as in
Hagia Sophia) is disposed quite inorganically over whole surfaces.
To the Classical motive are added the old-Aramæan vine and palm
leaves, which have already played a part in Jewish ornamentation.
The interlaced borders of “Late-Roman” mosaic pavements and
sarcophagus-edges, and even geometrical plane-patterns are
introduced, and finally, throughout the Persian-Anatolian world,
mobility and bizarrerie culminate in the Arabesque. This is the
genuine Magian motive—anti-plastic to the last degree, hostile to the
pictorial and to the bodily alike. Itself bodiless, it disembodies the
object over which its endless richness of web is drawn. A
masterpiece of this kind—a piece of architecture completely opened
out into Ornamentation—is the façade of the Castle of Mashetta in
Moab built by the Ghassanids.[268] The craft-art of Byzantine-Islamic
style (hitherto called Lombard, Frankish, Celtic or Old-Nordic) which
invaded the whole youthful West and dominated the Carolingian
Empire, was largely practised by Oriental craftsmen or imported as
patterns for our own weavers, metal-workers and armourers.[269]
Ravenna, Lucca, Venice, Granada, Palermo were the efficient
centres of this then highly-civilized form-language; in the year 1000,
when in the North the forms of a new Culture were already being
developed and established, Italy was still entirely dominated by it.
Take, lastly, the changed point of view towards the human body.
With the victory of the Arabian world-feeling, men’s conception of it
underwent a complete revolution. In almost every Roman head of
the period 100-250 that the Vatican Collection contains, one may
perceive the opposition of Apollinian and Magian feeling, and of
muscular position and “look” as different bases of expression. Even
in Rome itself, since Hadrian, the sculptor made constant use of the
drill, an instrument which was wholly repugnant to the Euclidean
feeling towards stone—for whereas the chisel brings out the limiting
surfaces and ipso facto affirms the corporeal and material nature of
the marble block, the drill, in breaking the surfaces and creating
effects of light and shade, denies it; and accordingly the sculptors,
be they Christian or “pagan,” lose the old feeling for the phenomenon
of the naked body. One has only to look at the shallow and empty
Antinous statues—and yet these were quite definitely “Classical.”
Here it is only the head that is physiognomically of interest—as it
never is in Attic sculpture. The drapery is given quite a new meaning,
and simply dominates the whole appearance. The consul-statues in
the Capitoline Museum[270] are conspicuous examples. The pupils
are bored, and the eyes look into the distance, so that the whole
expression of the work lies no longer in its body but in that Magian
principle of the “Pneuma” which Neo-Platonism and the decisions of
the Church Councils, Mithraism and Mazdaism alike presume in
man.
The pagan “Father” Iamblichus, about 300, wrote a book
concerning statues of gods in which the divine is substantially
present and working upon the beholder.[271] Against this idea of the
image—an idea of the Pseudomorphosis—the East and the South
rose in a storm of iconoclasm; and the sources of this iconoclasm lay
in a conception of artistic creation that is nearly impossible for us to
understand.
CHAPTER VII | | MUSIC AND PLASTIC
I
THE ARTS OF FORM
CHAPTER VII
II
With this, the notion of Form opens out immensely. Not only the
technical instrument, not only the form-language, but also the choice
of art-genus itself is seen to be an expression-means. What the
creation of a masterpiece means for an individual artist—the “Night
Watch” for Rembrandt or the “Meistersinger” for Wagner—that the
creation of a species of art, comprehended as such, means for the
life-history of a Culture. It is epochal. Apart from the merest
externals, each such art is an individual organism without
predecessor or successor. Its theory, technique and convention all
belong to its character, and contain nothing of eternal or universal
validity. When one of these arts is born, when it is spent, whether it
dies or is transmuted into another, why this or that art is dominant in
or absent from a particular Culture—all these are questions of Form
in the highest sense, just as is that other question of why individual
painters and musicians unconsciously avoid certain shades and
harmonies or, on the contrary, show preferences so marked that
authorship-attributions can be based on them.
The importance of these groups of questions has not yet been
recognized by theory, even by that of the present day. And yet it is
precisely from this side, the side of their physiognomic, that the arts
are accessible to the understanding. Hitherto it has been supposed
—without the slightest examination of the weighty questions that the
supposition involves—that the several “arts” specified in the
conventional classification-scheme (the validity of which is assumed)
are all possible at all times and places, and the absence of one or
another of them in particular cases is attributed to the accidental lack
of creative personalities or impelling circumstances or discriminating
patrons to guide “art” on its “way.” Here we have what I call a
transference of the causality-principle from the world of the become
to that of the becoming. Having no eye for the perfectly different logic
and necessity of the Living, for Destiny and the inevitableness and
unique occurrence of its expression-possibilities, men had recourse
to tangible and obvious “causes” for the building of their art-history,
which thus came to consist of a series of events of only superficial
concordance.
I have already, in the earliest pages of this work, exposed the
shallowness of the notion of a linear progression of “mankind”
through the stages of “ancient,” “mediæval” and “modern,” a notion
that has made us blind to the true history and structure of higher
Cultures. The history of art is a conspicuous case in point. Having
assumed as self-evident the existence of a number of constant and
well-defined provinces of art, one proceeded to order the history of
these several provinces according to the—equally self-evident—
scheme of ancient-mediæval-modern, to the exclusion, of course, of
Indian and East-Asiatic art, of the art of Axum and Saba, of the
Sassanids and of Russia, which if not omitted altogether were at
best relegated to appendices. It occurred to no one that such results
argued unsoundness in the method; the scheme was there,
demanded facts, and must at any price be fed with them. And so a
futile up-and-down course was stolidly traced out. Static times were
described as “natural pauses,” it was called “decline” when some
great art in reality died, and “renaissance” where an eye really free
from prepossessions would have seen another art being born in
another landscape to express another humanity. Even to-day we are
still taught that the Renaissance was a rebirth of the Classical. And
the conclusion was drawn that it is possible and right to take up arts
that are found weak or even dead (in this respect the present is a
veritable battle-field) and set them going again by conscious
reformation-program or forced “revival.”
And yet it is precisely in this problem of the end, the impressively
sudden end, of a great art—the end of the Attic drama in Euripides,
of Florentine sculpture with Michelangelo, of instrumental music in
Liszt, Wagner and Bruckner—that the organic character of these arts
is most evident. If we look closely enough we shall have no difficulty
in convincing ourselves that no one art of any greatness has ever
been “reborn.”
Of the Pyramid style nothing passed over into the Doric. Nothing
connects the Classical temple with the basilica of the Middle East,
for the mere taking over of the Classical column as a structural
member, though to a superficial observer it seems a fact of the first
importance, weighs no more in reality than Goethe’s employment of
the old mythology in the “Classical Walpurgis Night” scene of
“Faust.” To believe genuinely in a rebirth of Classical art, or any
Classical art, in the Western 15th Century requires a rare stretch of
the imagination. And that a great art may die not merely with the
Culture but within it, we may see from the fate of music in the
Classical world.[275] Possibilities of great music there must have been
in the Doric springtime—how otherwise can we account for the
importance of old-fashioned Sparta in the eyes of such musicians as
there were later (for Terpander, Thaletas and Alcman were effective
there when elsewhere the statuary art was merely infantile)?—and
yet the Late-Classical world refrained. In just the same fashion
everything that the Magian Culture had attempted in the way of
frontal portraiture, deep relief and mosaic finally succumbed before
the Arabesque; and everything of the plastic that had sprung up in
the shade of Gothic cathedrals at Chartres, Reims, Bamberg,
Naumburg, in the Nürnberg of Peter Vischer and the Florence of
Verrocchio, vanished before the oil-painting of Venice and the
instrumental music of the Baroque.
III
IV