Professional Documents
Culture Documents
Math 6A
Homework 2
1.4-30 Rewrite each of these statements so that negations appear only within
predicates (that is, so that no negation is outside a quantifier or an express
involving logical connectives)
a) ~yxP(x,y): yx~P(x,y)
b) ~xyP(x,y): xy~P(x,y)
c) ~y(Q(y) x~R(x,y)): y(~Q(y) xR(x,y))
d) ~y(xR(x,y) xS(x,y)): y(x~R(x,y) x~S(x,y))
e) ~y(xzT(x,y,z) xzU(x,y,z)): y(xz~T(x,y,z) xz~U(x,y,z))
1.4-33 Rewrite each of these statements so that negations appear only within
predicates (that is, so that no negation is outside a quantifier or an expresssion
involving logical connectives.)
a) ~xyP(x,y): xy~P(x,y)
b) ~yxP(x,y): yx~P(x,y)
c) ~yx(P(x,y) Q(x,y)): yx~(P(x,y) Q(x,y)) = yx(~P(x,y) ~Q(x,y))
d) ~(xy~P(x,y) xyQ(x,y)): xyP(x,y) (xy~Q(x,y))
e) ~x(yzP(x,y,z) zyP(x,y,z)):
x~(yzP(x,y,z) zyP(x,y,z))
= x(~yzP(x,y,z) ~zyP(x,y,z))
= x(yz~P(x,y,z) zy~P(x,y,z))
1.6-2 Use set guilder notation to give a description of each of these sets.
a) {0,3,6,9,12}: {3n | n = 0,1,2,3,4} or {x | x is a multiple of 3 0 x 12}
b) {-3, -2, -1, 0, 1, 2, 3}: {x | -3 x 3}, where we are assuming that the
universe of discourse is the set of integers.
c) {m, n, o, p}: {x | x is a letter of the word monopoly other than l or y}
1.6-7 Determine whether each of these statements is true of false.
a) 0 : false, since the empty set has no elements.
{0}: false: The set on the right has only one element, namely the number
0, not the empty set
c) {0} : false: the empty set has no proper subsets.
{0}: true: every element of the set on the left is an element of the set on
the right; and the set on the right contains an element, namely 0, that is not
the set on the left
e) {0} {0}: false: the set on the right has only one element, namely the
number 0, not the set containing the number 0
f) {0} {0}: false: for one set to be a proper subset of another, the two sets
cannot be equal
g) {} {}: true: every set is a subset of itself
f(x) = 2x + 1: bijection
a) f(x) = (x2 + 1)/(x2+2): not a bijection, not injection since x and x have the same
image for all real numbers x
If a function is not a bijection, we cannot define an inverse function