Write a Mathematical Proof Step by Step
Start from definitions and hypotheses, choose a proof method, justify every implication, test edge cases, and edit the argument for a skeptical reader.

A proof is a chain of justified implications that starts from agreed definitions, hypotheses, and prior results and ends at the exact claim. It is not a description of what a diagram seems to show, a list of examples, or algebra with missing reasons.
Parse the claim before trying to prove it
Identify quantifiers such as every, some, there exists, or unique. Separate hypotheses from the conclusion and expand definitions. To prove “the sum of two even integers is even,” write a = 2m and b = 2n for integers m and n; this definition supplies the structure the proof needs. Also inspect edge cases and try small examples. A counterexample ends a universal claim, while supportive examples only suggest that proof may be possible.
Build a definition and dependency sheet
List the objects, what is given, what must be shown, and the definitions connecting them. Mark any theorem you plan to use and its hypotheses. If you cite a result about differentiable functions, confirm differentiability; if you use triangle congruence, establish the required side or angle relationships first.
- Rewrite the claim with explicit quantifiers.
- Expand the key definitions symbolically.
- Test boundary and degenerate cases.
- Record theorem conditions beside theorem names.
Choose a proof method that matches the logic
Direct proof begins with the hypotheses and moves to the conclusion. Contraposition proves “if P then Q” by proving “if not Q then not P.” Contradiction assumes the claim is false and derives an impossibility. Induction proves a base case and a step from one index to the next. Existence can be proved by constructing an object; uniqueness usually requires showing any two candidates must be equal. The method follows logical shape, not personal preference.
Use a method-selection test
If negating the conclusion creates a useful algebraic fact, try contraposition. If the object is indexed by positive integers and each case depends on earlier ones, consider induction. If you can explicitly build the required object, use construction. Do not choose contradiction merely because direct progress feels slow; first expand definitions and work backward from the conclusion on scratch paper.
- Implication: direct proof or contraposition.
- Impossible alternative: contradiction.
- Integer-indexed family: induction or strong induction.
- Existence and uniqueness: construct, then compare arbitrary candidates.
Write the logical spine before polishing
On scratch paper, alternate forward work from the hypotheses with backward work from the conclusion until the chains meet. Then rewrite in forward order. Each displayed equation should follow from the prior line or a cited fact. Words such as therefore, because, and since should describe a real dependency. Avoid writing “obviously” where the reader needs the missing reason; a short justification is both clearer and safer.
A compact direct-proof example
Let a = 2m and b = 2n, where m and n are integers, because a and b are even. Then a + b = 2m + 2n = 2(m + n). Since integers are closed under addition, m + n is an integer. Therefore a + b equals two times an integer and is even. Every sentence either uses a definition, algebra, or closure.
- Introduce variables and their domains.
- State why each representation is permitted.
- Cite closure, inequalities, or theorem conditions when they matter.
- End by naming the exact conclusion reached.
Audit the proof like a skeptical reader
Check that no step assumes the conclusion, relies on a picture being accurate, divides by a quantity that might be zero, or proves only selected examples. Verify all cases, including zero, negative values, endpoints, or equality cases when allowed. For a biconditional, prove both directions. For induction, verify the base case and make the induction hypothesis explicit before using it. Remove exploratory dead ends from the final proof but keep enough detail that the central inference is visible.
Separate discovery from presentation
Proof discovery is often messy: diagrams, examples, failed approaches, and backward reasoning are useful. The final proof is a readable certificate. Present definitions before their use, keep notation stable, and group routine algebra without hiding the key idea. Ask whether another student could identify both the reason for each step and where every hypothesis entered.
- Circle each hypothesis and mark where it is used.
- Search for division, square roots, logarithms, and reversed inequalities.
- Check that every allowed case is covered.
- Read the final sentence against the original conclusion word for word.
Match proof structure to a method
| Claim shape | Useful method | Main danger |
|---|---|---|
| If P, then Q | Direct proof or contraposition | Using Q before it has been established |
| No object can have a property | Contradiction | Deriving something surprising rather than impossible |
| For every positive integer n | Induction | Skipping the base case or misusing the hypothesis |
| There exists an object | Construction | Naming an object without verifying every property |
| There exists exactly one | Existence plus uniqueness | Proving only one of the two parts |
| P if and only if Q | Prove P→Q and Q→P | Proving one direction and assuming the converse |
Common questions
Can examples prove a theorem?
A finite list of examples does not prove a universal statement over an infinite or larger domain. Examples can reveal a pattern or disprove it with one counterexample.
How much detail should a proof include?
Include the steps a reader at the course's level cannot safely infer, especially the key idea and theorem conditions. Routine arithmetic can be compressed once the logic stays visible.
Is a diagram a proof?
A diagram can guide discovery and support a construction, but measurements from a not-to-scale picture do not establish a general claim.
What is circular reasoning?
It occurs when the argument assumes the conclusion, or an equivalent statement, in order to prove it. Trace dependencies to ensure every step rests on earlier accepted facts.
Continue with the exact next skill
- Follow the logic and proof units in the discrete mathematics course.
- Connect definitions and theorems in the geometry learning hub.
- Check the exact conditions behind results in the formula library.
Put the method into practice
After drafting, perform a hypothesis audit and a case audit. Then give the proof to a reader who has not seen your scratch work and ask them to mark the first implication whose reason is unclear.
Draft the claim and dependency chain yourself, then use the MathGPT AI reasoning workspace to look for a missing implication or counterexample without asking it to author the proof you will submit.