Mathematics and politics
Lecture notes, 2/4/03
Teach-in on Iraq war.
Today, 6 pm.
Bodek Lounge, Houston Hall.
Current assignments:
- Read Sections 1.1 and 1.2 of Mathematics and Politics for Thursday's class.
- The next homework will be due Tuesday, Feb. 11.
Today: Introduction to mathematical logic, concluded, and this time I mean it!
- Propositional calculus
- Logical quantifiers: for all ("), there exists ($)
- Basic proof techniques
- Escalation models
Propositional calculus
You will not be expected to memorize the formulas symbolically. Generally the English
statements will be more important for us anyway.
Things you are expected to know (exactly what was on the homework):
- Logical symbols
- /\ (and), \/ (or), ¬ (not)
- => (implies), <=> (equivalent)
- How to translate between English and symbols
- Truth tables
- The truth tables for the basic operators
- Determining whether two operations are equivalent
- How to construct the negation
- e.g. negation of "P and Q are both true" is
"Either P or Q or both are false."
- e.g. negation of "P or Q or both are true" is
"P is false and Q is false."
- e.g. negation of "P implies Q" is
"P is true and Q is not true."
- Converse and contrapositive
- Converse of P=>Q is Q=>P
- Contrapositive of P=>Q is ¬Q=>¬P
- The contrapositive is equivalent to the theorem
Logical quantifiers
- We said P="x=3" is not a statement. Its truth value cannot be determined, since we don't know what x is.
- However if we write this as P(x), it's still not a statement, but it becomes a statement when we `plug in' a value for x.
- e.g. P(3) is a true statement and P(2) is a false statement.
- A sentence of the form P(x) is called an "open sentence" or a "predicate."
- When dealing with predicates P(x), there are two very useful operations, called quantifiers.
- "for all," denoted symbolically by " (upside down "A" as in "All")
"x P(x) means "For all values of x, P(x) is true."
- "there exists," denoted symbolically by $ (backwards "E" as in "Exists")
$x P(x) means "There exists at least one value of x such that P(x) is true."
- The possible values for x have to be specified somehow. (Implicitly or explicitly.)
- Examples:
Let P(x)="x will run for President," and suppose the allowable values for x are U.S. Senators.
Then:
- "x P(x) means "Every U.S. Senator will run for President" or "U.S. Senators will run for President." (false)
- $x P(x) means "At least one U.S. Senator will run for President" or "A U.S. Senator will run for President." (true)
-
Negation formulas:
¬["x P(x)] <=>
$x [¬P(x)]
"It is not the case that P(x) is true for every x" <=> "P(x) is false for at least one x"
¬[$x P(x)] <=>
"x [¬P(x)]
"It is not the case that P(x) is true for at least one x" <=> "P(x) is false for every x"
- Caution!
- The following sentence is ambiguous:
"All Penn students are not liberal."
-
Does it mean that "There are no liberal Penn students" or that "At least one Penn student is not liberal"?
-
Usually we can guess from the context, but it should be avoided.
Unambiguous versions would be
"No Penn student is liberal."
or
"Not all Penn students are liberal."
Multiple quantifiers:
- Sometimes we want to deal with predicates P(x,y) depending on two variables.
- If we use quantifiers, we generally have to be careful about the order:
-
"x $y P(x,y) is not the same as $y "x P(x,y)
although
- $x $y P(x,y) is the same as $y $x P(x,y)
-
"x "y P(x,y) is the same as "y "x P(x,y)
Examples:
Suppose x can be any student and y can be any professor, and that P(x,y)="x is taking y's class."
Then
-
"x $y P(x,y) means "For every student, there is a professor teaching a class that the student is in."
- $x "y P(x,y) means "There is some student who is in every professor's class."
-
"y $x P(x,y) means "For every professor, there is a student taking that professor's class."
-
$y "x P(x,y) means "Some professor has every student in his/her class."
None of these sentences are equivalent.
Negation of multiple quantifiers proceeds sequentially.
e.g.
¬["x $y P(x,y)] <=> $x ¬[$y P(x,y)] <=> $x "y [¬P(x,y)]
In English:
- It is not true that for every student, there is a professor teaching a class that the student is in.
- There is at least one student for whom it is not true that there is a professor teaching a class the student is in.
- There is at least one student such that for every professor, the student is not in that professor's class.
- There is at least one student who is not taking any professor's classes.
Techniques of proof
In mathematics our main interest is proving theorems,
P => Q.
- The most obvious way way is a direct proof: start with P, derive things from it, and eventually get Q.
- A subtler way is to prove the contrapositive: start with ¬Q, derive things from that, and eventually get ¬P.
- The easiest way is proof by contradiction.
- Since
P=>Q <=> ¬(P/\¬Q),
in order to show that P=>Q is always true, you can show that P/\¬Q is always false.
- So you assume that P is true and that Q is false, and then derive some false statement from that.
- This is often easier because you get to assume two things rather than one.
- Example:
Prove the theorems.
- Axioms: If the U.S. goes to war, then it has the support of Europe. If the Security Council approves, then the U.S. goes to war.
Prove that if the U.S. does not have the support of Europe, then the Security Council has not approved the war.
We prove the contrapositive, which is that if the Security Council has approved the war, then the U.S. has the support of Europe.
Since the Security Council approved, the U.S. goes to war. Since the U.S. goes to war, it must have the support of Europe.
- Axioms: If there is money in my account and I have a check, then I will pay the rent. If I do not have a check, then I will be evicted.
Prove that if I am not evicted and I do not pay the rent, then there is no money in my account.
Proof by contradiction. Assume that I am not evicted and I do not pay the rent (the hypothesis) and that I do have money in my account (the negation of the conclusion). We must derive a contradiction.
Either I have a check or I do not. Consider each case.
If I have a check, then since there is money in my account, I pay the rent. This contradicts the assumption that I do not pay the rent.
If I do not have a check, then I will be evicted. This contradicts the assumption that I am not evicted.
In either case we have a contradiction. So the assumption must be false.
So it is impossible that I am not evicted and do not pay the rent while still having money in my account. Thus, if I am not evicted and do not pay the rent, then I do not have money in my account.
Class assignment
Do the North Korea exercise first.
If you have time, work on the espionage exercise.