Logic & Mathematical Proofs
Develop rigorous mathematical thinking with fundamental proof techniques that form the backbone of mathematics and computer science.
Logic Basics
Mathematical logic provides the foundation for all proofs. Understanding logical operators and their truth values is essential.
AND (Conjunction)
True only when both statements are true
OR (Disjunction)
True when at least one statement is true
NOT (Negation)
Reverses the truth value
IMPLIES (Conditional)
False only when P is true and Q is false
Key Insight
P �?Q �?¬P �?Q
"If P then Q" is logically equivalent to "Not P or Q". This is crucial for understanding proof by contrapositive.
Direct Proof
The most straightforward proof technique: assume the hypothesis is true and use logical steps to arrive at the conclusion.
Structure of Direct Proof
Example: Sum of Two Even Numbers
Proof by Contradiction
Assume the negation of what you want to prove and show that this leads to a logical impossibility.
The Approach
To prove P is true:
- Assume ¬P (P is false)
- Derive a contradiction (something both true and false)
- Conclude that ¬P must be false, so P is true
Classic Example: �? is Irrational
Mathematical Induction
Induction proves statements about all natural numbers by showing they work for the first case and that each case implies the next.
The Domino Effect
If the first domino falls (base case) and each domino knocks down the next (inductive step), all dominoes fall.
Structure of Induction
Example: Sum of First n Natural Numbers
Writing Good Proofs
Be Clear About Goals
State what you're proving and what technique you're using upfront.
Justify Each Step
Cite definitions, theorems, or axioms that support each logical step.
Write for Readers
Use complete sentences and explain transitions between steps.
Check Edge Cases
Verify your proof works for boundary values and special cases.