Professional Documents
Culture Documents
DS Lecture 4
DS Lecture 4
Lecture 4
1
Previous Lectures Summary
2
Predicates and Quantified statements I
3
Today’s Lecture
• Predicates
• Set Notation
• Universal and Existential Statement
• Translating between formal and informal language
• Universal conditional Statements
• Equivalent Form of Universal and Existential
statements
• Implicit Qualification
• Negations of Universal and Existential statements
4
Predicates
A predicate is a sentence which contains finite number of
variables and becomes a statement when specific values
are substituted for the variables.
Truth Set
If P(x) is a predicate and x has domain D, the truth set of
P(x) is the set of all elements of D that make P(x) true
when substituted for x. The truth set of P(x) is denoted by
{x D | P ( x)}
5
read as “the set of all x in D such that P(x)”.
Notation
For any two predicates P(x) and Q(x), the notation
P ( x) Q( x) means that every element in the truth set of
P(x) is in the truth set of Q(x). The notation P( x) Q( x)
means that P and Q have identical truth sets.
x R
x 0
6
Cont…
Example
Let P(x) = x is a factor of 8, Q(x)= x is a factor of 4
and R(x)= x < 5 and x 3 . The domain of x is
assumed to be Z . Use symbols , to indicate
Hence x R , x 2
x. is false. 10
Existential Quantifier
Let Q(x) be a predicate and D the domain of
x. An existential statement is of the form.
x D such that Q(x)
It is true if and only if Q(x) is true for at least
one x in D. It is false if and only if Q(x) is
false for all x in D.
The symbol denotes “there exist” and is
called the existential quantifier.
11
Truth and falsity of Existential statements
Suppose P(x) is the predicate “x < |x|.” Determine the
truth value of ∃ x s.t. P(x) where the domain for x is:
(a) the three numbers 1, 2, 3.
(b) the six numbers −2,−1, 0, 1, 2, 3.
Solution
(a) P(1), P(2), and P(3) are all false because in each
case x = |x|. Therefore, ∃ x such that P(x) is false for
this domain.
(b) If we begin checking the six values of x, we find
P(−2) is true. It states that −2 < |−2|. We need to check
no further; having one case that makes the predicate
true is enough to guarantee that ∃ x s.t. P(x) is true.
12
Truth and falsity of Existential statements
a) x R, x 2 0.
b) x R, x 2 1.
c) m Z s.t. m m
2
15
Cont…
Write the following statement in English, using the
predicates
F(x): “x is a Freshman”
T (x, y): “x is taking y”
where x represents students and y represents courses:
Solution
The statement ∃ x (F(x)∧T (x, Discrete)) says that there
is a student x with two properties: x is a freshman and x
is taking Discrete. In English, “Some Freshman is taking
Discrete Math.”
16
Translating from informal Language to Formal language
“Every freshman at the College is taking CSC 102.”
Solution: There are various ways to answer this question,
depending on the domain.
• If we take as our domain all freshmen at the College
and use the predicate T (x) : “x is taking CSC 102”,
then the statement can be written as ∀x, T(x).
• We are making a conditional statement:
“If the student is a freshman, then the student is taking
CSC 101;”
∀x, (F(x) → T (x)).
Note that we cannot say ∀ x (F(x) ∧ T (x)), because this
says that every student is a freshman, which is not 17
∀x ∃y T(x, y).
18
Universal Conditional Statements
A reasonable argument can be made that the most
important form of statement in mathematics is the
universal conditional statement:
∀ x, if P(x) then Q(x)
Example: “Everyone who visited France stayed in
Paris.”
Sol: However, if we take all people as the universe ,
then we need to introduce the predicate F(x) for “x
visited France.” and P(x) is the predicate “x stayed in
Paris.” In this case, the proposition can be written as
∀ x, (F(x) → P(x)).
19
• We can write the following statements in a
variety of informal ways.
x R, if x 2 then x 2 4
Sol:
• if a real number is greater then 2, then the
square is greater than 4.
• Whenever a real number is greater then 2, its
square is greater than 4.
• The squares of real number, greater than 2,
are greater than 4.
20
Exercise
Rewrite the following statements in the form
∀ ,if then .
23
Equivalence form for existential statement
24
Implicit Quantifications
• Consider “ If a number is an integer, then it is a
rational number”
The clue to indicate its universal quantifications comes
from the presence of the indefinite article “a”.
25
Negations of Quantified Statement
The negation of the statement of the form
∀ x in D, Q(x)
is logically equivalent to a statement of the
form
∃ x in D such that ~Q(x)
Symbolically:
~ (x D, Q( x)) x D ~ Q( x).
Note: the negation of universal statement is
logically equivalent to existential statement.
26
Cont….
The negation of the statement of the form
∃ x in D such that Q(x)
is logically equivalent to a statement of the
form
∀ x in D, ~Q(x)
Symbolically:
27
Examples
Negate “Some integer x is positive and all integers
y are negative.”
Solution: Using all integers as the universe for x and y,
the statement is ∃ x s.t. (x > 0) ∧ ∀ y, (y < 0). The
negation is
~{∃x (x > 0) ∧ ∀ y (y < 0)}≡ ~∃x s.t. (x > 0) ∨ ~∀y, (y <
0): by De Morgan’s law
≡ ∀ x, ~(x > 0) ∨ ∃ y s.t. ~(y < 0) properties of negation
≡ ∀ x, (x ≤ 0) ∨ ∃ y s.t. (y ≥ 0).
28
Cont….
Negate “There is a student who came late to class
and there is a student who is absent from class.”
Solution: In symbols, if L(x) : “x came late to class” and
A(x) : “x is absent from class,” this statement can be
written as ∃ x st L(x) ∧ ∃ y st A(y).
Note that we must use a second variable y. By one of
De Morgan’s laws the negation can be written as
~(∃ x st L(x)) ∨ ~(∃ y st A(x)) ≡ ∀x, ~L(x) ∨ ∀ y, ~A(x).
29
Lecture Summary
• Predicates
• Set Notation
• Universal and Existential Statement
• Translating between formal and informal language
• Universal conditional Statements
• Equivalent Form
• Implicit Qualification
• Negations
30