Lecture # 16 Nested Quantifiers
Lecture # 16 Nested Quantifiers
Lecture # 16 Nested Quantifiers
Lecture # 16
1
NESTED QUANTIFIER
Nested Quantifier, where one quantifier is within the
scope of another, such as:
xy (x + y = 0).
Note:
Everything within the scope of a quantifier can be thought of
as a propositional function.
2
Example:
xy (x + y = 0) is the same as x Q(x),
where
Q(x) = y P(x, y)
where
P(x, y) = x + y = 0
3
UNDERSTANDING STATEMENTS
INVOLVING NESTED QUANTIFIERS
Example: Assume that the domain of the variables x and
y consists of all real numbers. The statement
x y (x + y = y + x)
4
UNDERSTANDING NESTED
QUANTIFIER
Consider the statement
x y (x + y = 0)
5
Consider the statement:
x y z (x + (y + z) = (x + y) + z)
6
TRANSLATE INTO ENGLISH
Translate into English the statement:
Where the domain for both variables consists of all real nos.
For all real number x and for all real number y. If x > 0 and y < 0, then
xy < 0.
OR
For all real number x and y. If x is positive real no. and y is negative
real no, then xy is a negative.
OR
The product of a positive real no. and a negative real no is always a
negative real number.
7
EXAMPLE
Translate into English the statement:
Where the domain for both variables consists of all real nos.
For all real number x and for all real number y. If x ≥ 0 and y ≥ 0, then
xy ≥ 0.
OR
For all real number x and y. If x is positive real no. and y is positive
real no, then xy is a positive real number.
OR
The product of a two non-negative real numers is always non-negative.
8
EXAMPLE
Translate into English the statement
xy (xy = y)
9
EXAMPLE
Translate into English the statement
xyz(x = y + z)
10
EXAMPLE
Translate into English the statement:
11
THE ORDER OF QUANTIFIERS
Many mathematical statements involve multiple
quantifications of propositional functions involve more
than one variable.
12
EXAMPLE
Let P(x, y) be the statement “x + y = y + x”. What are the
truth values of the quantifications:
13
SOLUTION
The quantification xy P(x, y) denotes the proposition:
“For all real numbers x, for all real numbers y,
x + y = y + x.”
That is, xy P(x, y) and yx P(x, y) have the same
meaning and both are true.
14
Principle
This illustrate the principle that the order of nested
universal quantifiers in a statement without other
quantifiers can be changed without changing the meaning
of the quantified statement.
15
EXAMPLE
Let Q(x, y) denote “x + y = 0”. What are the truth values of
the quantification yxQ(x, y) and xyQ(x, y), where the
domain for all variables consists of all real numbers?
Solution:
yxQ(x, y) denotes the proposition:
17
OBSERVATION
From these observations in previous example, it follows
that if yx P(x, y) is true, then xyP(x, y) must also be
true.
18
19
EXAMPLE
Let Q(x, y, z) be the statement “x + y = z.” What are the
truth values of the statement xyz Q(x, y, z) and
zxy Q(x, y, z), where the domain of all variables
consists of all real numbers?
Solution:
The quantification xyz Q(x, y, z) denotes that:
“For all real numbers x and for all real numbers y there is
a real number z such that x + y = z” is true.
20
zxy Q(x, y, z) which is the statement:
21
TRANSLATING MATHEMATICAL STATEMENTS INTO
STATEMENTS INVOLVING NESTED QUANTIFIERS
EXAMPLE: Translate the statement into a logical expression.
“The sum of two positive integers is always positive”
Solution:
Step 1: Rephrase it so that Quantifiers and Domain are shown:
“For every two integers, if these integers are both positive, then
the sum of these integers is positive.”
22
Step 3: Propositional Function
P(x) = x > 0
Q(x) = y > 0
R(x) = x + y > 0
Domain = All integers
Step 4:
xy ((x > 0) (y > 0) → (x + y > 0))
xy (P(x) Q(y)) → R(x))
23
EXAMPLE
Translate the statement into a logical expression.
“Every real number except zero has a multiplicative inverse”
(A multiplicative inverse of a real number x and y is xy = 1)
Solution:
Step 1: Rephrase
“For every real number x except zero, x has a multiplicative
inverse.”
25
EXAMPLE
Translate the statement into a logical expression.
“The difference of two positive integers is not necessarily
positive”
Solution:
Step 1: Rephrase
“For every positive integers x and y, the difference is not
necessarily positive.”
Step 2:
“For every integer x and y, the x – y > 0 or x – y < 0”
26
Step 3:
xy (((x > 0) (y > 0)) → ((x – y > 0) (x – y < 0)))
OR
27
EXAMPLE
Translate the statement into a logical expression.
“The absolute value of the product of two integers is the product
of their absolute values.”
Solution:
Step 1: Rephrase
“For every positive integers x and y, the absolute value of product
of two values x and y is product of their absolute values.”
Step 2:
“For every integer x and y, the |x.y| = |x||y|”
28
Step 3:
x y (|x.y| = |x||y|)
29
EXAMPLE
Translate the statement into a logical expression.
“Every positive integer is the sum of the squares of four integers.”
Solution:
Step 1: Rephrase
“For every positive integers x , there exist four integers a, b, c and
d such that every integer x is equal to sum of four integers.”
Step 2:
“For every positive integer x, there exist four integers a, b, c and d
31
TRANSLATING FROM NESTED
QUANTIFIERS INTO ENGLISH
Expression with nested quantifiers expressing statements
in English can be quite complicated.
Step 1:
Write out Quantifiers and Predicates.
Step 2:
Express the meaning in simple sentence.
32
EXAMPLE
Translate the statement
x (C(x) y(C(y) F(x,y)))
where
C(x) = x has a computer
F(x, y) = x and y are friends
Domain = All students in the school
33
SOLUTION
The statement says that “for every student x in your
school, x has a computer or there is a student y such that y
has a computer and x and y are friends”.
In other words,
Every student in your school has a computer or has a
friend who has a computer.
34
EXAMPLE
Translate the statement
xyz ((F(x, y) F(x, z) (y ≠ z)) → ¬F(y, z))
where
F(a, b) = means a and b are friends.
Domain = all students in the school
35
SOLUTION
First examine ((F(x, y) F(x, z) (y ≠ z)) → ¬F(y, z))
This expression says that “if student x and y are friends
and student x and z are friends, and furthermore if y and z
are not same student, then y and z are not friends”
36
EXAMPLE
Translate the statement
xyz ((x ≠ y) (W(x, z) W(y, z)))
where
W(x, z) = student x has visited website z.
Domain for x and y = All students in the school
Domain for z = All websites.
37
SOLUTION
First examine ((x ≠ y) (W(x, z) W(y, z)))
This expression says that: “x and y are not the same and
student x has visited a website z if and only if student y
has visited a website z.”
38
In other words,
Two different people who have visited the exactly same
website.
39
TRANSLATING ENGLISH SENTENCES
INTO LOGICAL EXPRESSIONS
Example: Express the statement as a logical expression
involving predicates and quantifiers with a domain
consisting of all people.
40
SOLUTION
Step 1: Rephrase so that domain and quantifier can be
shown.
Step 4:
x ((F(x) P(x)) → y M(x, y))
OR
x y(((F(x) P(x)) → M(x, y))
42
EXAMPLE
Let
S(x) = “x is a student”
F(x) = “x is a faculty member”
A(x, y) = “x has asked y a question”
Domain = all people associated with your school.
43
Lois has asked Professor Michaels a question.
A(Lois, Professor Michaels)
44
Some student has not asked any faculty member a question.
x (S(x) y(F(y) → ¬A(x, y)))
45
There is a faculty member who has asked every other
faculty member a question.
x (F(x) y((F(y) (y ≠ x)) → A(x, y)))
46
EXAMPLE
Express the statement as a logical expression involving
predicates and quantifiers with a domain consisting of all
people.
Solution:
Step 1: Rephrase
“There is a man, the man has taken a flight, on every
airline in the world.”
47
Step 2: Introducing variables.
“There is a man x, the man x has taken a flight f, on every airline
in the world.”
Solution:
49
EXAMPLE
Use Quantifiers to express the negation of the statement
that:
“There does not exist a man who has taken a flight on
every airline in the world.”
Solution:
The statement is negation of the statement
“There is a man who has taken a flight on every airline in
the world.”
¬waf (P(w, f) Q(f, a))
50
¬waf (P(w, f) Q(f, a)) Given
w¬af (P(w, f) Q(f, a))De-Morgan’s Law
wa¬f (P(w, f) Q(f, a))De-Morgan’s Law
waf ¬(P(w, f) Q(f, a))De-Morgan’s Law
waf (¬P(w, f) ¬Q(f, a)) De-Morgan’s Law
51
EXAMPLE
Express the negation of the statement
xy P(x, y) xy Q(x, y).
Solution:
52
EXAMPLE
Express the negation of the statement
xy (Q(x, y) Q(y, x)).
Solution:
53
xy ¬(Q(x, y) → Q(y, x)) ¬(Q(y, x) → Q(x, y))
De-Morgan’s Law
xy ¬[¬(Q(x, y) ¬Q(y, x))] ¬[¬(Q(y, x) ¬Q(x, y))]
As we know that p q ¬(p ¬q)
xy ¬[¬Q(x, y) ¬Q(y, x)] ¬[¬Q(y, x) ¬Q(x, y)]
De-Morgan’s Law
º xy [¬¬Q(x, y) ¬¬Q(y, x)] [¬¬Q(y, x) ¬¬Q(x, y)]
De-Morgan’s Law
xy [Q(x, y) Q(y, x)] [Q(y, x) Q(x, y)]
Double Negation Law
54