Scribd
Upload
10 views1 page

NOTES Mathematical Analysis

The document discusses different proof techniques for mathematical statements involving logical connectives such as and, or, implies, if and only if. It also covers proof techniques for existential statements involving 'there exists' by either finding an explicit example or using an indirect argument.

Uploaded by

Ivan B.planto
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
10 views1 page

NOTES Mathematical Analysis

The document discusses different proof techniques for mathematical statements involving logical connectives such as and, or, implies, if and only if. It also covers proof techniques for existential statements involving 'there exists' by either finding an explicit example or using an indirect argument.

Uploaded by

Ivan B.planto
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

Mathematical Analysis

2.6.1 Proofs of Statements Involving Connectives


 To prove a theorem whose conclusion is of the form “p and q” we have
to show that both p is true and q is true.

 To prove a theorem whose conclusion is of the form “p or q” we have to


show that at least one of the statements p or q is true. Three different
ways of doing this are:

• Assume p is false and use this to show q is true,


• Assume q is false and use this to show p is true,
• Assume p and q are both false and obtain a contradiction.
 To prove a theorem of the type “p implies q” we may proceed in one of the
following ways:

• Assume p is true and use this to show q is true,


• Assume q is false and use this to show p is false, i.e. prove the
contra- positive of “p implies q”,
• Assume p is true and q is false and use this to obtain a
contradiction. To prove a theorem of the type “p iff q” we
usually
• Show p implies q and show q implies p.

2.6.2 Proofs of Statements Involving “There Exists”


 In order to prove a theorem whose conclusion is of the form “there exists
x such that P (x)”, we usually either
• show that for a certain explicit value of x, the statement P (x)
is true; or more commonly
• • use an indirect argument to show that some x with property P
(x) does exist.
For example to prove
∃x such that x5 − 5x − 7 = 0 we can argue as follows: Let the function f be
defined by f (x) = x5 5x −7 (for all real x). Then f (1) < 0 and f (2) > 0; so
f (x) = 0 for some x between 1 and 2 by the Intermediate Value Theorem9 for
continuous functions.
An alternative approach would be to
• assume P (x) is false for all x and deduce a contradiction.

Prepared by:

IVONNE S. SUICATRE
MILE-MATHEMATICS

You might also like