# CSE115/ENGR160 Discrete Mathematics 02/01/11

## Presentation on theme: "CSE115/ENGR160 Discrete Mathematics 02/01/11"— Presentation transcript:

CSE115/ENGR160 Discrete Mathematics 02/01/11
Ming-Hsuan Yang UC Merced

1.6 Direct proofs of p→q First assume p is true
Then show q must be true (using axioms, definitions, and previously proven theorems) So the combination of p is true and q is false never occurs Thus p→q is true Straightforward But sometimes tricky and require some insight

Example Definition: Show “If n is an odd integer, then n2 is odd”
The integer n is even if there exists an integer k such that n=2k, and n is odd if there exists an integer k such that n=2k+1 Note that an integer is either even or odd Show “If n is an odd integer, then n2 is odd”

Example Note the theorem states
By definition of odd integer, n=2k+1, where k is some integer n2=(2k+1)2=4k2+4k+1=2(2k2+2k)+1 By definition of odd integer, we conclude n2 is an odd integer Consequently, we prove that if n is an odd integer, then n2 is odd

Example “If m and n are both perfect squares, then nm is also a perfect square (an integer a is a perfect square if there is an integer b such that a=b2) By definition, there are integers s and t such that m=s2, and n=t2 Thus, mn=s2t2=(st)2 (using commutativity and associativity of multiplication) We conclude mn is also a perfect square

Proof by contraposition
Indirect proof: sometimes direct proof leads to dead ends Based on Use ┐q as hypothesis and show ┐p must follow

Example Show that “if n is an integer and 3n+2 is odd, then n is odd”
Use Proof by contraposition: Assume n is even, i.e., n=2k, for some k It follows 3n+2=3(2k)+2=6k+2=2(3k+1) Thus 3n+2 is even

Example Prove that if n=ab, where a and b are positive integers, then

Vacuous proof Prove p→q is true
Vacuous proof: If we show p is false and then claim a proof However, often used to establish special case Show that p(0) is true when p(n) is “If n>1, then n2>n” and the domain consists of all integers The fact 02>0 is false is irrelevant to the truth value of the conditional statement

Trivial proof Trivial proof: a proof of p→q that uses the fact q is true Often important when special cases are proved Let p(n) be “If a and b are positive integers with a≥b, then an ≥bn where the domain consists all integers The proposition p(0) is “If a≥b, then a0 ≥b0”. a0 ≥b0 is true, hence the conditional statement p(0) is true

Example Definition: the real number r is rational if there exist integers p and q with q≠0 such that r=p/q A real number that is not rational is irrational Prove that the sum of two rational numbers is rational (i.e., “For every real number r and every real number s, if r and s are rational numbers, then r+s is rational”) Direct proof? Proof by contraposition?

Direct proof Let r=p/q and s=t/u where p, q, t, u, are integers and q≠0, and u≠0. r+s=p/q+t/u=(pu+qt)/qu Since q≠0 and u≠0, qu≠0 Consequently, r+s is the ratio of two integers. Thus r+s is rational

Example Prove that if n is an integer and n2 is odd, then n is odd
Direct proof? Proof by contraposition?

Suppose we want to prove a statement p Further assume that we can find a contradiction q such that ┐p→q is true Since q is false, but ┐p→q is true, we can conclude ┐p is false, which means p is true The statement ┐r˄r is contradiction, we can prove that p is true if we can show that ┐p→(┐r˄r), i.e., if p is not true, then there is a contradiction

Example Show that at least 4 of any 22 days must fall on the same day of the week Let p be the proposition “at least 4 of any 22 days fall on the same day of the week” Suppose ┐p is true, which means at most 3 of 22 days fall on the same day of the week Which implies at most 21 days could have been chosen because for each of the days of the week, at most 3 of the chosen days could fall on that day If r is the statement that 22 days are chosen. Then, we have ┐p→(┐r˄r)

Example Prove that is irrational by giving a proof by contradiction
Let p be the proposition “ is irrational” ┐p: is rational, and thus where a and b have no common factors Thus 2=a2/b2, 2b2=a2, and thus a2 is even a2 is even and so a is even. Let a=2c for some integer c, 2b2=4c2, and thus b2=2c2, and b2 is even

Example Use the fact that if the square of an integer is even, then the integer itself is even, we conclude b must be even ┐p leads to where and b have no common factors, and both a and b are even (and thus a common factor), a contradiction That is, the statement “ is irrational” is true

Can be used to prove conditional statements First assume the negation of the conclusion Then use premises and negation of conclusion to arrive a contradiction Reason: p→q≡((p˄┐q)→F)

Can rewrite a proof by contraposition of a conditional statement p→q as proof by contradiction Proof by contraposition: show if ┐q then ┐p Proof by contradiction: assume p and ┐q are both true Then use steps of ┐q→┐p to show ┐p is true This leads to p˄┐p, a contradiction

Example Proof by contradiction “If 3n+2 is odd, then n is odd”
Let p be “3n+2 is odd” and q be “n is odd” To construct a proof by contradiction, assume both p and ┐q are both true Since n is even, let n=2k, then 3n+2=6k+2= 2(3k+1). So 3n+2 is even, i.e. ┐p, Both p and ┐p are true, so we have a contradiction

Example Note that we can also prove by contradiction that p→q is true by assuming that p and ┐q are both true, and show that q must be also true This implies q and ┐q are both true, a contradiction Can turn a direct proof into a proof by contradiction

Proof of equivalence To prove a theorem that is a biconditional statement p↔q, we show p→q and q →p The validity is based on the tautology (p↔q) ↔((p→q)˄(q →p))

Example Prove the theorem “If n is a positive integer, then n is odd if and only if n2 is odd” To prove “p if and only if q” where p is “n is odd” and q is “n2 is odd” Need to show p→q and q→p “If n is odd, then n2 is odd”, and “If n2 is odd, then n is odd We have proved p→q and q→p in previous examples and thus prove this theorem with iff

Equivalent theorems p1↔p2↔…↔pn
For i and j with 1≤i≤n and 1≤j≤n, pi and pj are equivalent [p1↔p2↔…↔pn] ↔[(p1→ p2)˄(p2→ p3) ˄…˄(pn→ p1)] More efficient than prove pi→ pj for i≠j with 1≤i≤n and 1≤j≤n Order is not important as long as we have chain

Example Show that these statements about integer n are equivalent
P1: n is even P2: n-1 is odd P3: n2 is even Show that by p1→ p2 and p2→ p3 and p3→ p1 p1→ p2 : (direct proof) Suppose n is even, then n=2k for some k. thus n-1=2k-1=2(k-1)+1 is odd

Example p2→ p3 : (direct proof) Suppose n-1 is odd, then n-1=2k+1 for some k. Hence n=2k+2, and n2=(2k+2)2=4k2+8k+4=2(2k2+4k+2) is even p3→ p1: (proof by contraposition) That is, we prove that if n is not even, then n2 is not even. This is the same as proving if n is odd, then n2 is odd (which we have done)

Counterexample To show that a statement is false, all we need to do is to find a counterexample, i.e., an example x for which p(x) is false

Example Show that “Every positive integer is the sum of the squares of two integers” is false An counterexample is 3 as it cannot be written as the sum of the squares to two integers Note that the only perfect squares not exceeding 3 are 02=0 and 12=1 Furthermore, there is no way to get 3 as the sum of two terms each of which is 0 or 1

Mistakes in proofs What is wrong with this proof “1=2”? a=b (given)
a2=ab (multiply both sides of 1 by a) a2-b2 =ab-b2 (subtract b2 from both sides of 2) (a-b)(a+b)=b(a-b) (factor both sides of 3) a+b=b (divide both sides of 4 by a-b) 2b=b (replace a by b in 5 as a=b and simply) 2=1 (divide both sides of 6 by b)

What is wrong with this proof?
“Theorem”: If n2 is positive, then n is positive “Proof”: Suppose n2 is positive. As the statement “If n is positive, then n2 is positive” is true, we conclude that n is positive p(n): If n is positive, q(n): n2 is positive. The statement is and the hypothesis is q(n). From these, we cannot conclude p(n) as no valid rule of inference can be applied Counterexample: n=-1

What is wrong with this proof?
“Theorem”: If n is not positive, then n2 is not positive “Proof”: Suppose that n is not positive. Because the conditional statement “If n is positive, then n2 is positive” is true, we can conclude that n2 is not positive. From we cannot conclude as no valid rule of inference can be used Counterexample: n=-1

Circular reasoning Is the following argument correct?
Suppose that n2 is even, then n2=2k for some integer k. Let n=2y for some integer y. This shows that n is even Wrong argument as the statement “n=2y for some integer y” is used in the proof No argument shows n can be written as 2y Circular reasoning as this statement is equivalent to the statement being proved

Proofs Learn from mistakes
Even professional mathematicians make mistakes in proofs Quite a few incorrect proofs of important results have fooled people for years before subtle errors were found Some other important proof techniques Mathematical induction Combinatorial proof

Similar presentations
{"found_math": false, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0}