What is the fundamental difference between Proof by Deduction and Proof by Exhaustion?

Deduction uses algebraic generalization to prove a statement for all values in a set simultaneously. Exhaustion proves a statement by manually checking every single individual case, which is only possible if the set of values is finite and small.

When should you use $n-1, n, n+1$ instead of $n, n+1, n+2$ in a proof?

The 'middle-start' notation ($n-1, n, n+1$) is preferred for consecutive integers when the proof involves sums or squares. This often leads to the cancellation of linear terms, simplifying the resulting algebraic expression significantly.

How does a Proof by Deduction differ from a Disproof by Counter-example?

A proof by deduction requires a general algebraic argument to show a statement is always true. A disproof by counter-example only requires finding one single specific value where the statement fails, which is sufficient to show the statement is not universally true.

What is a common mistake when defining variables at the start of a proof?

A common error is failing to specify the number set the variable belongs to (e.g., forgetting to state $n \in \mathbb{Z}$). Without this definition, the algebraic forms like $2n$ do not strictly guarantee the number is an integer or even.

Why is it insufficient to show that a statement works for $n=1, 2, 3$ in a deductive proof?

Testing specific values only shows the statement is true for those cases; it does not account for the possibility that the statement might fail for $n=4$ or $n=1000$. Deduction requires a general variable to cover all possible cases.

What error occurs if you use the same variable $n$ to represent two different unknown integers in a proof?

Using the same variable implies the two numbers are identical. For example, if you need to prove something about the sum of two different even numbers, you must use $2n$ and $2m$ (where $n \neq m$) to maintain generality.

What does the symbol $\mathbb{Q}$ represent in the context of proof?

$\mathbb{Q}$ represents the set of Rational Numbers. These are numbers that can be written as a fraction $\frac{a}{b}$ where both $a$ and $b$ are integers and $b$ is not zero.

How is a 'multiple of 5' represented algebraically in a proof?

It is represented as $5k$ (or $5n$), where $k$ is an integer. To complete a proof showing a result is a multiple of 5, you must factor a 5 out of the final expression: $5(\dots)$.

What is the algebraic definition of an odd number?

An odd number is defined as $2n + 1$ or $2n - 1$, where $n$ is an integer. This represents one more or one less than an even number ($2n$).

What does the notation $P \Rightarrow Q$ mean in a logical argument?

It means 'P implies Q'. If statement P is true, then statement Q must also be true as a direct consequence.

Library Podcasts

Courses

Referral & Rewards

Proof by Deduction

Summary

Proof by deduction is a formal mathematical method that uses established facts, algebraic manipulation, and logical reasoning to demonstrate that a statement is universally true for a specific set of numbers. Unlike testing individual cases, deduction provides a rigorous guarantee that a property holds for every possible value within the defined domain.

1. Definition & Core Concepts

Proof by Deduction is the process of using a series of logical, algebraic steps to show that a mathematical statement must be true for a given set of numbers. It relies on starting from known definitions and applying valid operations to reach a definitive conclusion.
A successful deduction does not rely on examples; instead, it uses generalized variables (like $n$ or $k$ ) to represent any number in a set. This ensures the proof covers an infinite number of cases simultaneously.
The conclusion of a deductive proof is often marked with the symbol $\square$ or the abbreviation Q.E.D. (Quod Erat Demonstrandum), signifying that the initial proposition has been successfully demonstrated.

2. Standard Algebraic Notations

3. Number Systems and Domains

Venn diagram showing the nested relationship of number sets: Natural numbers inside Integers, inside Rationals, inside Real numbers.

4. Methodology: Step-by-Step Proof

5. Key Distinctions

Method	Purpose	Scope
Deduction	Proves a statement is always true using algebra.	Universal (all values in a set).
Exhaustion	Proves a statement by testing every individual case.	Finite (only works for small sets).
Counter-example	Disproves a statement by finding one case where it fails.	Singular (only needs one value).
Identity (≡)	Shows two expressions are equal for all values.	Universal equality.

It is vital to distinguish between an equation (true for specific values of $x$ ) and an identity (true for all values of $x$ ). Deductive proofs often aim to show that a relationship is an identity within the specified number set.

6. Exam Strategy & Tips