Thanks to visit codestin.com
Credit goes to www.scribd.com

0% found this document useful (0 votes)
9 views4 pages

Maths Assignme

Direct proof is a method in mathematics that validates a statement through logical deductions from established axioms or theorems. It involves identifying the statement, making assumptions, and using logical progression to prove the conclusion. Indirect proof, including proof by contradiction and contrapositive proof, demonstrates a statement's truth by showing that its negation leads to a contradiction.

Uploaded by

richo amu
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
9 views4 pages

Maths Assignme

Direct proof is a method in mathematics that validates a statement through logical deductions from established axioms or theorems. It involves identifying the statement, making assumptions, and using logical progression to prove the conclusion. Indirect proof, including proof by contradiction and contrapositive proof, demonstrates a statement's truth by showing that its negation leads to a contradiction.

Uploaded by

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

Direct Proof

Direct proof stands as a fundamental method in mathematics, affirming the truth of a statement
through logical deductions and established axioms or theorems.

Definition and Basics

Direct Proof: This method validates a statement by establishing a logical sequence of deductions from
given assumptions, using definitions, axioms, and previously proven theorems.

Logical Sequence: The proof must seamlessly transition from one logical step to the next, ensuring a
coherent progression from the hypothesis to the conclusion.

Steps in Constructing a Direct Proof

Statement Identification: Clearly pinpoint the statement that requires proving.

Assumptions: Begin with the assumptions or given information that the proof will build upon.

Logical Progression: Employ logical steps and previously proven theorems to affirm the statement’s
truth.

Example: Direct Proof

Statement: If n is an even integer, then n squared is also even.

Method of Direct Proofs

The definitions of direct and indirect proofs give way to the steps we follow to perform each type of
proof.

To perform a direct proof, we use the following steps:

1Identify the hypothesis and conclusion of the conjecture you're trying to prove

2Assume the hypothesis to be true

3Use definitions, properties, theorems, etc. to make a series of deductions that eventually prove the
conclusion of the conjecture to be true

4State that by direct proof, the conclusion of the statement must be true
Proof:

Assumption: Let n be an even integer.

Definition: An even integer can be expressed as n = 2k, where k is an integer.

Calculation: n squared = (2k) squared = 4k squared = 2(2k squared).

Conclusion: Since n squared is divisible by 2, it is also an even integer.

Indirect Proof

NDIRECT PROOF. Indirect proof is based on the classical notion that any given sentence, such as the
conclusion, must be either true or false. We do indirect proof by assuming the premises to be true and
the conclusion to be false and deriving a contradiction.

Indirect proof, in contrast to direct proof, substantiates a statement by demonstrating that its negation
is false. This category encompasses proof by contradiction and contrapositive proof.

Method of Indirect Proofs

But to perform an indirect proof, we use a different process which includes the following steps:

1Assume the opposite of the conjecture, or assume that the conjecture is false

2Try to prove your assumption directly until you run into a contradiction

3Since we get a contradiction, it must be the case that the assumption that the opposite of the
hypothesis is true is false

4State that by contradiction, the original conjecture must be true

1. Proof by Contradiction

Proof by contradiction, or "reductio ad absurdum", validates a statement by assuming its negation is


true and demonstrating that this assumption leads to a contradiction.

Steps in Proof by Contradiction

Assume the Opposite: Begin by assuming that the negation of the statement is true.
Find a Contradiction: Employ logical reasoning to derive a contradiction from this assumption.

Conclusion: Conclude that the original statement must be true since its negation leads to a
contradiction.

Example: Proof by Contradiction

Statement: There are infinitely many prime numbers.

Proof:

Assume the Opposite: Suppose there are finitely many prime numbers.

Contradiction: Multiplying all the prime numbers together and adding 1 yields a number not divisible by
any of the primes, contradicting the assumption.

Conclusion: Therefore, there must be infinitely many prime numbers.

2. Contrapositive Proof

Contrapositive proof validates a statement "If P, then Q" by affirming "If not Q, then not P".

Steps in Contrapositive Proof

Identify the Contrapositive: Determine the contrapositive of the statement.

Prove the Contrapositive: Utilize logical reasoning to validate the contrapositive.

Conclusion: Affirm that the original statement is true if the contrapositive is true.

Example: Contrapositive Proof

Statement: If n squared is odd, then n is odd.

Proof:

Contrapositive: If n is not odd (i.e., even), then n squared is not odd (i.e., even).
Proof of Contrapositive: If n = 2k (even), then n squared = (2k) squared = 4k squared = 2(2k squared),
which is even.

Conclusion: The original statement is true.

You might also like