Math · Sets & Logic · Grade 9-12 · 5 min read

Proof Techniques

Q: What is the fastest recognition cue for Proof Techniques?

Look for **prove that**, **show that**, **which method**, **establish**, but treat those words as clues, not proof. A word problem can contain a familiar keyword and still ask for a different idea. After noticing the cue, ask the recognition question: Have I matched the strategy to the claim's form before starting to write the proof? That question protects you from using a memorized procedure in the wrong place.

⚡ In one breath

Orient

The one-line idea, why it matters, and the intuition.

Section 1

Quick Answer

Proof techniques are the named strategies for establishing a mathematical claim: pick direct proof, contradiction, contrapositive, cases, or induction based on the claim's structure and what you are given. Use this meta-skill the moment you face 'prove that...' and must decide HOW before writing line one. The cue is that you are selecting an approach, not yet executing one. Before calculating, ask: Have I matched the strategy to the claim's form before starting to write the proof?

Section 2

Why This Matters

Choosing the wrong technique can make a one-line proof into an impossible slog; recognizing that 'for all integers $n$ ' suggests induction, 'no such thing exists' suggests contradiction, and 'if $P$ then $Q$ ' suggests direct or contrapositive is what separates students who get stuck from those who start correctly. Recognizing it by "Have I matched the strategy to the claim's form before starting to write the proof?" — rather than by familiar numbers — is what lets a student tell it apart from direct proof and proof by contradiction and mathematical induction in a mixed problem set.

Section 3

Intuitive Explanation

A toolbox where each claim is a different fastener: a screw wants a screwdriver (direct), a stuck bolt wants the back-door wrench (contradiction), and a row of identical bolts wants the assembly-line approach (induction) — you read the fastener before grabbing a tool. This is the clean version of the idea because the visible structure matches the concept before any formula or procedure is chosen.

Reaching for proof by contradiction on every problem because it feels powerful — many claims are cleaner by direct proof, and a contradiction wrapper around a direct argument just adds an unnecessary 'assume not'. That contrast matters because many wrong answers come from recognizing a surface feature, such as a familiar number or word, instead of the actual task.

A useful way to slow down is to name the signal words and then test them. Words like **prove that**, **show that**, **which method**, **establish**, **demonstrate** are helpful clues, but they are not enough by themselves. They must point to the same structure as the mental model: Proof techniques are the menu of standard strategies — direct, contradiction, contrapositive, induction, cases — and the skill is choosing the one that fits the statement you must establish.

The recognition test is simple: Have I matched the strategy to the claim's form before starting to write the proof? If yes, proof techniques is probably the right tool; if not, compare with Direct proof or Proof by contradiction or Mathematical induction before calculating.

Core idea

Proof techniques are the menu of standard strategies — direct, contradiction, contrapositive, induction, cases — and the skill is choosing the one that fits the statement you must establish.

Recognize

The cues that signal this concept and how to distinguish it from look-alikes.

Section 4

When to Use

Use Proof Techniques when you face a 'prove that' task and must decide which proof strategy fits the claim's structure before writing the argument. Strong signals include **prove that**, **show that**, **which method**, **establish**, **demonstrate**. The safest workflow is to read the final question first, identify what kind of answer it wants, and then test the structure. Do not use proof techniques just because familiar numbers appear; first decide whether the situation answers "Have I matched the strategy to the claim's form before starting to write the proof?" with yes.

✨ Pro tip

Ask: Have I matched the strategy to the claim's form before starting to write the proof?

Section 5

How to Recognize It

Before using Proof Techniques, check the structure of the problem, not just the vocabulary. These questions force the same recognition move from several angles: the task, the signal words, the nearest confusion, and the thing that would make the concept fail.

Have I matched the strategy to the claim's form before starting to write the proof?

If yes, the problem matches proof techniques. If no, pause before applying the procedure, because the same numbers may belong to a different idea.
Which words signal the structure?

Look for prove that, show that, which method, establish. These words are useful only after the situation matches them; a keyword without structure is not proof.
What is the nearest confusion?

Direct proof is the common trap here: One specific technique: assume the hypothesis and chain forward to the conclusion. Compare the desired final answer before choosing a method.
What answer form should I expect?

The answer should fit this mental model: Proof techniques are the menu of standard strategies — direct, contradiction, contrapositive, induction, cases — and the skill is choosing the one that fits the statement you must establish. If the expected answer sounds more like direct proof, use the comparison table before solving.
What would make this NOT Proof Techniques?

Reaching for proof by contradiction on every problem because it feels powerful — many claims are cleaner by direct proof, and a contradiction wrapper around a direct argument just adds an unnecessary 'assume not'. This tells you when to switch tools instead of forcing the concept.

Section 6

Proof Techniques vs Common Confusions

The hard part is recognizing when the task is really about proof techniques instead of a nearby idea. Read the final answer the problem wants, then ask which row describes the structure before you start calculating.

Proof Techniques vs Common Confusions
Type	Meaning	Key test	Formula	Example
Proof Techniques	Use this when you face a 'prove that' task and must decide which proof strategy fits the claim's structure before writing the argument. The deciding question is: Have I matched the strategy to the claim's form before starting to write the proof?	Have I matched the strategy to the claim's form before starting to write the proof?		You must prove: 'For every integer $n \ge 1$ , $1+2+\dots+n=\frac{n(n+1)}{2}$ .' Which technique fits?
Direct proof	One specific technique: assume the hypothesis and chain forward to the conclusion.	Use when the claim is 'if $P$ then $Q$' and $P$ gives you something concrete to build on.	$P \Rightarrow Q$	Assume $n$ is even, show $n^2$ is even
Proof by contradiction	One specific technique: assume the claim is false and derive an impossibility.	Use for 'there is no...', irrationality, or when the negation is easier to work with.	Assume $\neg P$ , derive $\bot$	Assume $\sqrt{2}$ is rational, reach a contradiction
Mathematical induction	One specific technique: prove a base case and that each case forces the next.	Use for claims 'for all integers $n \ge n_0$' with a self-referential structure.	Base case + inductive step	Prove $1+2+\dots+n=\frac{n(n+1)}{2}$ for all $n$

Proof Techniques

Meaning: Use this when you face a 'prove that' task and must decide which proof strategy fits the claim's structure before writing the argument. The deciding question is: Have I matched the strategy to the claim's form before starting to write the proof?
Key test: Have I matched the strategy to the claim's form before starting to write the proof?
Example: You must prove: 'For every integer $n \ge 1$ , $1+2+\dots+n=\frac{n(n+1)}{2}$ .' Which technique fits?

Direct proof

Meaning: One specific technique: assume the hypothesis and chain forward to the conclusion.
Key test: Use when the claim is 'if $P$ then $Q$' and $P$ gives you something concrete to build on.
Formula: $P \Rightarrow Q$
Example: Assume $n$ is even, show $n^2$ is even

Proof by contradiction

Meaning: One specific technique: assume the claim is false and derive an impossibility.
Key test: Use for 'there is no...', irrationality, or when the negation is easier to work with.
Formula: Assume $\neg P$ , derive $\bot$
Example: Assume $\sqrt{2}$ is rational, reach a contradiction

Mathematical induction

Meaning: One specific technique: prove a base case and that each case forces the next.
Key test: Use for claims 'for all integers $n \ge n_0$' with a self-referential structure.
Formula: Base case + inductive step
Example: Prove $1+2+\dots+n=\frac{n(n+1)}{2}$ for all $n$

Apply

Worked examples and the mistakes most students make.

Section 7

Formula & Notation

Section 8

Worked Examples

Example 1 — Choose the technique

Easy

Problem

You must prove: 'For every integer $n \ge 1$ , $1+2+\dots+n=\frac{n(n+1)}{2}$ .' Which technique fits?

Solution

The claim is indexed by all integers $n \ge 1$ with each case built from the previous sum.

Name the structure before touching arithmetic — that is what makes the right method obvious.
Ask the recognition question: Have I matched the strategy to the claim's form before starting to write the proof?

If the answer is yes, the concept applies; the cue, not a keyword, decides the method.
Recognize 'for all integers $n$ ' plus a self-referential running total as the induction signature.

The rule is chosen only after the structure matches, so the steps mean something.
Select mathematical induction: verify $n=1$ , then show the formula for $n$ forces it for $n+1$ .

Keep units, shape, or answer form tied to the story so the work does not become symbol pushing.
Check the answer against the original question.

It should fit the mental model — match the argument tool to the claim's shape. If it does not, revisit the recognition step before changing the arithmetic.

Answer

Use induction

Takeaway: The phrase 'for all integers $n$ ' over a step-built quantity points to induction before you write anything.

Example 2 — Looks like induction, is direct

Standard

Problem

Prove: 'If $n$ is an even integer, then $n^2$ is even.' Does the integer $n$ mean you need induction?

Solution

Notice why this looks like the same concept.

Nearby language or numbers can tempt you toward match the argument tool to the claim's shape.
There is no chain from one case to the next — it is a single 'if $P$ then $Q$ ' about an arbitrary even $n$ .

Spotting what actually changed is what separates this from the concept it resembles.
Use direct proof: assume $n=2k$ and compute $n^2$ forward.

The nearby idea may share numbers but answers a different question, so it needs a different move.
State the result in the language of the actual task.

Direct proof, not induction. Name it for what the problem really asked, not the concept you first expected.
Say the contrast in one sentence.

An integer variable alone is not an induction cue; induction needs each case to depend on the previous one.

Answer

Direct proof, not induction

Takeaway: An integer variable alone is not an induction cue; induction needs each case to depend on the previous one.

Example 3 — Spot the trap: Match the argument tool to the claim's shape

Application

Problem

A student starts with this idea: "Defaulting to one favorite technique for every problem" What should they check before accepting that reasoning?

Solution

Pause before the first move.

The first move is a decision, not a calculation — does the situation really match match the argument tool to the claim's shape.
Run the recognition test: Have I matched the strategy to the claim's form before starting to write the proof?

This is the single check that the trap skips.
read the claim's structure first; the form tells you which tool fits.

Stating the safer rule turns the mistake into a checkable step instead of a vague "be careful."
Compare with the nearest confusion, Direct proof.

One specific technique: assume the hypothesis and chain forward to the conclusion.
State the corrected decision and reuse it.

Using the concept only when the structure matches leaves a process the student can repeat on a new problem.

Answer

read the claim's structure first; the form tells you which tool fits.

Takeaway: The recognition step prevents the common trap: Defaulting to one favorite technique for every problem

Section 9

Common Mistakes

Common slip-up

Defaulting to one favorite technique for every problem

The right idea

read the claim's structure first; the form tells you which tool fits.

Common slip-up

Confusing the technique (the strategy) with the proof (the executed argument)

The right idea

the technique is your choice of road, not the trip itself.

Common slip-up

Picking contradiction when direct proof works

The right idea

prefer the most direct route; only assume the negation when forward reasoning has no foothold.

Practice

Try it, then see where this concept fits in the path.

Section 10

Mini Practice

Try these on your own. Tap Reveal when you want to check.

What clue tells you this is a Proof Techniques situation: You must prove: 'For every integer $n \ge 1$ , $1+2+\dots+n=\frac{n(n+1)}{2}$ .' Which technique fits?

Hint: Have I matched the strategy to the claim's form before starting to write the proof?
You must prove: 'For every integer $n \ge 1$ , $1+2+\dots+n=\frac{n(n+1)}{2}$ .' Which technique fits?

Hint: Recognize 'for all integers $n$ ' plus a self-referential running total as the induction signature.
Why is this a contrast case instead of Proof Techniques: Prove: 'If $n$ is an even integer, then $n^2$ is even.' Does the integer $n$ mean you need induction?

Hint: There is no chain from one case to the next — it is a single 'if $P$ then $Q$ ' about an arbitrary even $n$ .
Fix this thinking: Defaulting to one favorite technique for every problem

Hint: Name the recognition cue before choosing a rule.
Which is the better fit here: Proof Techniques or Direct proof? Explain the deciding difference.

Hint: For Proof Techniques, ask: Have I matched the strategy to the claim's form before starting to write the proof?
Write one sentence that would remind a classmate how to recognize Proof Techniques.

Hint: Use the mental model "Match the argument tool to the claim's shape." and one signal word.

Want the full set?

50 practice questions for this concept — free to try, every one with a complete worked solution showing the why, not just the answer.

Practice this concept → Take a mastery check

Section 11

Frequently Asked Questions

How do I know when to use Proof Techniques?

Use Proof Techniques when you face a 'prove that' task and must decide which proof strategy fits the claim's structure before writing the argument. Do not start from the numbers alone; first name the structure of the situation. The fastest check is: Have I matched the strategy to the claim's form before starting to write the proof? If the answer is yes and the wording matches cues like prove that, show that, which method, then proof techniques is probably the right tool.

What is Proof Techniques most often confused with?

Proof Techniques is often confused with Direct proof. Direct proof means One specific technique: assume the hypothesis and chain forward to the conclusion. The difference is not just vocabulary; it changes the action you take. For proof techniques, the key test is "Have I matched the strategy to the claim's form before starting to write the proof?" For direct proof, the better cue is: Use when the claim is 'if $P$ then $Q$ ' and $P$ gives you something concrete to build on.

What is the fastest recognition cue for Proof Techniques?

Look for prove that, show that, which method, establish, but treat those words as clues, not proof. A word problem can contain a familiar keyword and still ask for a different idea. After noticing the cue, ask the recognition question: Have I matched the strategy to the claim's form before starting to write the proof? That question protects you from using a memorized procedure in the wrong place.

What mistake should I avoid with Proof Techniques?

Avoid this thinking: "Defaulting to one favorite technique for every problem" That mistake usually happens when the student jumps to a rule before checking the situation. The safer version is: read the claim's structure first; the form tells you which tool fits. A good habit is to say the mental model out loud first: "Match the argument tool to the claim's shape." Then choose the calculation or representation.

How can I tell this apart from Proof by contradiction?

Proof by contradiction is the better fit when the task is about this: One specific technique: assume the claim is false and derive an impossibility. Proof Techniques is the better fit when you face a 'prove that' task and must decide which proof strategy fits the claim's structure before writing the argument. If both ideas seem possible, compare what the problem wants as the final answer. The desired output often reveals whether you should use proof techniques or switch to the nearby concept.

Why does Proof Techniques matter?

Choosing the wrong technique can make a one-line proof into an impossible slog; recognizing that 'for all integers $n$ ' suggests induction, 'no such thing exists' suggests contradiction, and 'if $P$ then $Q$ ' suggests direct or contrapositive is what separates students who get stuck from those who start correctly. The practical value is recognition: once you can spot proof techniques, you can choose a method before calculating. That makes later topics easier because you are not memorizing isolated tricks; you are recognizing the same structure when it appears in a new representation.

Section 12

Learning Path

← Before

Proof (Intuition)Contrapositive Quantifiers

Proof Techniques

You are here

You're at the end!

Before this, students should be comfortable with Proof (Intuition) and Contrapositive. This page focuses on the recognition cue: Have I matched the strategy to the claim's form before starting to write the proof? That cue is the bridge between earlier skills and later problem solving: students first learn to identify the structure, then they learn which calculation, diagram, graph, or proof move belongs to it. After this, students can use proof techniques as a tool in larger problems.

Section 13