Indirect Proofs in Calculus- Techniques and Examples

What Indirect Proofs Actually Are

Most calculus students learn direct proofs first. You start with assumptions, apply definitions, and arrive at what you want to prove. Clean. Linear. Usually useless when the problem gets interesting.

Indirect proofs take a different route. Instead of going forward, you go backward or sideways. You prove something by showing that not proving it would break mathematics. Two main types exist: proof by contradiction and proof by contrapositive.

Calculus is full of statements where direct proof is a nightmare. Limits that don't exist. Functions that aren't continuous. Numbers that are irrational. Indirect proofs handle these cleanly.

Proof by Contradiction: Assume the Opposite and Watch It Collapse

The logic is simple:

  1. Assume the statement you want to prove is false
  2. Follow the mathematical consequences until something breaks
  3. Since the assumption led to nonsense, the original statement must be true

That's it. You're not proving your theorem directly. You're proving that its negation is impossible.

Classic Example: √2 Is Irrational

You can't escape this one. It's the textbook indirect proof, and here's why it works so well:

Claim: √2 cannot be expressed as a fraction of two integers.

Proof: Assume √2 = a/b where a and b are integers with no common factors (in lowest terms).

Squaring both sides: 2 = a²/b², so a² = 2b².

This means a² is even, so a must be even. Write a = 2k.

Substituting: (2k)² = 2b² → 4k² = 2b² → b² = 2k².

Now b² is even, so b is even.

But if both a and b are even, they share a common factor of 2. This contradicts our assumption that a/b was in lowest terms.

The contradiction means our assumption was wrong. √2 is irrational. ✅

Calculus Application: Proving a Limit Doesn't Exist

Here's where calculus gets interesting. Proving a limit doesn't exist often requires contradiction.

Claim: lim(x→0) sin(1/x) does not exist.

Proof: If the limit L existed, then for every sequence xₙ → 0, we'd have f(xₙ) → L.

Take two sequences: xₙ = 1/(2πn) and yₙ = 1/((2n+1)π).

Both sequences approach 0, but:

f(xₙ) = sin(2πn) = 0 for all n

f(yₙ) = sin((2n+1)π) = sin(π + n·2π) = 0... wait, that's also 0. Let me use better sequences.

Better choice: xₙ = 1/(2πn) and yₙ = 1/((2n+1/2)π)

f(xₙ) = 0 for all n

f(yₙ) = sin((2n+1/2)π) = sin(2nπ + π/2) = 1 for all n

Same limit approach, different function values. If the limit existed, all sequences would give the same limit. They don't. Contradiction. The limit doesn't exist. ✅

Proof by Contrapositive: Flip and Rearrange

Contrapositive is cleaner than contradiction but operates on a different principle.

The contrapositive of "If P, then Q" is "If not Q, then not P."

Here's the key: any conditional statement is logically equivalent to its contrapositive. They're not just similar—they're identical in truth value.

So instead of proving "If P, then Q" directly, you prove "If not Q, then not P." Sometimes the contrapositive is easier to work with.

Example: Proving a Function Is Injective

Claim: f(x) = 3x + 7 is injective (one-to-one).

Direct approach: assume f(a) = f(b), show a = b.

Contrapositive approach: show that if a ≠ b, then f(a) ≠ f(b).

Assume a ≠ b.

f(a) - f(b) = (3a + 7) - (3b + 7) = 3(a - b).

Since a ≠ b, a - b ≠ 0, so 3(a - b) ≠ 0.

Therefore f(a) ≠ f(b). ✅

Same result, different logical structure.

Calculus Application: Proving Continuity Implies Limits

Claim: If f is continuous at c, then lim(x→c) f(x) = f(c).

Contrapositive: If lim(x→c) f(x) ≠ f(c), then f is not continuous at c.

This is just the definition of continuity restated. Sometimes restating is the whole point.

Proof by Contradiction vs. Contrapositive: When to Use Which

Most students blur these together. They're different tools.

Situation Method Why
Proving something doesn't exist Contradiction You can assume it does and derive nonsense
Proving impossibility results Contradiction Show that "possible" leads to logical conflict
Proving conditional statements Contrapositive Equivalent but often easier structure
Showing injectivity/surjectivity Contrapositive Negating the conclusion gives cleaner algebra
Proving irrationality/transcendental Contradiction Assume rationality, derive arithmetic conflict

When stuck, try both. If one path gets you nowhere after a few lines, switch.

How to Actually Execute an Indirect Proof

Here's the practical process:

Step 1: Identify What You're Proving

State it clearly. Write it down. "I need to prove that [statement]."

Step 2: Write the Negation

This is where most students fail. They can't negate properly.

Quantifier negation trips people up constantly. Practice until it's automatic.

Step 3: Assume the Negation

Write it at the top of your proof. "Assume for contradiction that [negation]."

Step 4: Derive Consequences

Apply definitions. Manipulate algebra. Don't assume what you're trying to prove—that's circular and worthless.

Step 5: Find the Contradiction

You need an explicit conflict. Either:

Step 6: Conclude

"This contradicts [specific result]. Therefore, [original statement] must be true."

Common Mistakes That Wreck Your Proof

1. Forgetting to use the assumption. If you're doing contradiction and your proof doesn't actually use the negated statement, you're probably proving something else entirely.

2. Negating incorrectly. "Not (P and Q)" is NOT "(not P) and (not Q)." It's "(not P) or (not Q)." De Morgan's laws exist for a reason.

3. Proving the wrong thing. Contradiction proves the negation is impossible. Contrapositive proves the original conditional. Know which you're doing.

4. Skipping the contradiction. Your proof isn't done until you've shown the conflict. Deriving intermediate steps isn't enough—you need to reach explicit nonsense.

5. Assuming what you're trying to prove. Obvious, but it happens more than you'd think, especially under time pressure.

Examples Worth Working Through

Example 1: Prove e Is Irrational

Similar structure to √2 but messier arithmetic.

Assumption: e = a/b for integers a, b.

Strategy: Use the series expansion e = Σ(1/n!) and find a contradiction involving factorials and integer bounds.

Work through the algebra: multiply by b!, show that b!·e is both an integer (from the series) and strictly between two consecutive integers (from the tail of the series). Contradiction.

Example 2: Prove f(x) = x³ Is Strictly Increasing

Claim: If a < b, then a³ < b³.

Contrapositive: If a³ ≥ b³, then a ≥ b.

Factor: a³ - b³ = (a - b)(a² + ab + b²).

The quadratic term is always positive. So a³ ≥ b³ implies a - b ≥ 0, meaning a ≥ b.

Done. The contrapositive was cleaner than the direct approach would have been.

Example 3: Prove No Maximum Value Exists for f(x) = x on ℝ

Claim: f(x) = x has no maximum on ℝ.

Proof: Assume M is the maximum. Since M ∈ ℝ, consider M + 1.

M + 1 > M, so f(M + 1) = M + 1 > M = f(M).

But this means f(M + 1) > f(M), contradicting M being the maximum.

Therefore, no maximum exists. ✅

When Indirect Proofs Are Overkill

Sometimes direct proof is faster and clearer. If you can prove something straightforwardly, don't force an indirect approach just because it feels more sophisticated.

Example: Prove that if f'(x) = 0 everywhere, then f is constant.

Direct proof using the Mean Value Theorem is cleaner than any indirect approach. Know when to use the right tool.

Indirect proofs shine when:

The Bottom Line

Indirect proofs aren't mystical. They're just another way to prove things. Contradiction assumes false and breaks. Contrapositive flips the conditional. Both are valid. Both have their place.

The skill is knowing which one to use and executing the negation correctly. Practice negation. Practice finding contradictions. The rest is just algebra and definitions.