Scribd
Upload
13 views

Quiz On Section 1.5, 1.6 Today Homework Questions? Test #1 On Chapters 1, 2 Expected On 2/13 Wednesday Recall

The document discusses an upcoming quiz and homework for a math class. It covers topics like quantifiers, direct and indirect proofs. Examples are provided for writing proofs to show statements like if n is an odd integer, then 5n+3 is an even integer.

Uploaded by

goflux pwns
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
13 views

Quiz On Section 1.5, 1.6 Today Homework Questions? Test #1 On Chapters 1, 2 Expected On 2/13 Wednesday Recall

The document discusses an upcoming quiz and homework for a math class. It covers topics like quantifiers, direct and indirect proofs. Examples are provided for writing proofs to show statements like if n is an odd integer, then 5n+3 is an even integer.

Uploaded by

goflux pwns
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

MAT214A

Wednesday 1/30 10:50 – 12:05 pm


SSU Spring 2019

Quiz on Section 1.5, 1.6 Today


Homework Questions?
Test #1 on Chapters 1, 2 expected on 2/13 Wednesday

Recall
Section 1.6
Statement When True When False
∀ x ∀ y P( x , y) P(x,y) is true for all pairs x,y There is an x,y pair for which P(x,y)
∀ y ∀ x P( x , y) is false
∀ x ∃ y P( x , y ) For every x there is a y such that There is an x such that P(x,y) is
P(x, y) is true. false for every y.
∃ x ∀ y P( x , y ) There exists an x such that P(x, y) is For all x there exists a y such that
true for every y. P(x,y) is false
∃x ∃ y P(x , y) There is an x,y pair for which P(x,y) P(x,y) is false for all pairs x,y
∃ y ∃x P(x , y) is true

Negations
Negation of the quantifiers is a quick exercise that doesn’t require the use of any sophisticated logic rules, you
just ‘flip’ the quantifiers ∀ ¿ ∃∨∃¿ ∀, then negate the statement (when you get to the statement then you will
need logic rules to negate).

Negation Rules: When we negate a quantified statement, we negate all the quantifiers first, from left to right
(keeping the same order), then we negative the statement.
1. ¬[∀x P(x)] ≡ ∃x ¬P(x).
2. ¬[∃x P(x)] ≡ ∀x ¬P(x).
3. ¬[∀x ∃y P(x, y)] ≡ ∃x ∀y ¬P(x, y).
4. ¬[∃x ∀y P(x, y)] ≡ ∀x ∃y ¬P(x, y).
5. ¬[∀ x ∀ yP( x , y)¿ ≡∃ x ∃ y ¬ P( x , y )
6. ¬[∃ x ∃ yP(x , y) ¿ ≡ ∀ x ∀ y ¬ P( x , y )

Unrelated, but important, when it comes time to negate the statement remember how to negate an
implication: ¬[IF P, THEN Q] ≡ P AND ¬ Q
A few more examples:
Let f(x,y) be the statement “x can fool y”
Domain: people
Write in symbolic form:

(a) Everyone can fool Jack


∀ xf ( x , Jack ) or ∀ x(x can fool Jack)

(b) Owen can fool everybody


∀ yf (Owen , y ) or ∀ y(Owen can fool y)

(c) There exists a person who can fool everybody


∃ x ∀ yf ( x , y ) or ∃ x ∀ y (x can fool y)

(e) No one can fool themselves


∀ x ¬ f (x , x ) or ∀ x ¬(x can fool x)

Today:
Start Chapter 2 Proofs
A) Section 2.1 - Mathematical Systems, Direct Proofs, and Counterexamples
Mathematical systems consist of
 Axioms - statements accepted as true.
“If a = b, then b = a”
“If a = b and b = c, then a = c”

 Theorems - a proposition that has been proved to be true


“In an isosceles triangle the base angles are equal”

 Corollary – a theorem that follows easily from another theorem


“If a triangle is equilateral then it is equiangular”

 Lemma “small” theorem, not too interesting, but useful to prove other theorems.
“The angle inscribed in a semicircle is 90 degrees”

Direct proof 
Determine the truth value of a statement using established facts and theorems. If p then q: we assume p is
true and prove that q is also true. (If p is false then the statement is true by default and trivial)

Indirect proof 
This is same as proof by contradiction. We assume that what we want to prove is not true, and then
show that the consequences of this are not possible.
How to write proofs
 Always state assumptions made
 Always state what you are trying to prove
 Always separate strings of equations. Write them line by line so your reader can verify your work
 Always state when the proof is done.
A black box or open box
QED  "Quod Erat Demonstrandum" which loosely translated means "that which was to be
demonstrated".
 Never refer to yourself in proof. If you have to use a pronoun use “we”

Miscellaneous
An integer n is even if for any integer k, n =2k
An integer n is odd if for any integer k, n = 2k + 1

Examples of Direct Proofs


Ex: if n is an odd integer than 5n +3 is an even integer
Proof: Assume that n is an odd integer. We want to show that 5n + 3 is an even integer.
If n is an odd integer, then n=2k+1 where k ∈Z
Now,
5n+3 = 5(2k+1)+3
5n + 3 = 10k +5+3
5n + 3 = 10k + 8
5n + 3 = 2(5k +4)
Since 5k+4 ∈ Z and 2(5k +4) is divisible by 2, then 5n +3 is an even integer.
QED

Ex: If n is an odd integer then n2 is odd


Proof: assume that n is an odd integer. We want to show that n 2 is an odd integer
If n is odd integer, then n = 2k +1 where k ∈Z
n2 = (2k+1)2 = (2k+1)(2k+1) = 4k2+4k +1= 2k(2k+2)+1
If k is an integer, then 2k + 2 is also an integer and n2 is in the form necessary to be included in the set of
odd integers.
QED

----------------------stopped here -----------------------

You might also like