A proof asserts n+3=n+7 for all n. Assuming it for n and adding 1 does establish the next case. Why is this not a proof?
Quant ResearchLevel: FoundationInduction logic
A proof asserts n+3=n+7 for all n. Assuming it for n and adding 1 does establish the next case. Why is this not a proof?
Hints
- Check the smallest claimed n directly.
- Separate implication validity from premise truth.
Answer
The induction step is a valid implication with a false premise, but no base case is true. Induction requires both an actual starting case and a propagation rule; a chain of implications alone supplies no true statement.
Source and licence: Oscar Levin — Discrete Mathematics: An Open Introduction, 3rd edition · CC-BY-SA-4.0 · answer: Quantoros editorial