A topic in the Open Knowledge Graph — a free, open map of 15,290 topics and the order to learn them in.
A mathematical statement is proven when a logical argument demonstrates that the conclusion follows necessarily from accepted axioms, definitions, and previously proven results — with no gaps in reasoning. A proof is not a pile of evidence or a collection of examples; it is a deductive chain where each step is justified. Proof gives mathematical certainty, which is different from scientific confidence (strong evidence) or legal proof (beyond reasonable doubt). Understanding the standard of proof in mathematics helps you distinguish between "strongly supported" and "definitely true."
Compare standards of evidence across fields. In court: "beyond reasonable doubt." In science: "supported by reproducible evidence." In math: "follows necessarily from axioms." Show a conjecture with enormous evidence (Goldbach's) that remains unproven, alongside a simple theorem with a short proof. Discuss: why do mathematicians insist on this standard? Connect to the proof strategies already learned and show how each meets the standard of zero logical gaps.
You have now seen four proof strategies: direct proof, contradiction, exhaustion, and induction. Each works differently, but they all meet the same standard: every step follows logically from previous steps, and the conclusion is an unavoidable consequence of the premises. When mathematicians say something is "proven," they mean this standard has been met — not that there is a lot of evidence for it, not that experts believe it, not that a computer checked many cases.
This standard is unique to mathematics. In a courtroom, the standard is "beyond reasonable doubt" — strong enough for practical purposes, but not logically airtight. In science, the standard is reproducible evidence and peer review — powerful, but always provisional, because tomorrow's experiment could overturn today's theory. In mathematics, once a theorem is proven, it stays proven forever. The Pythagorean theorem was proven over 2,000 years ago, and no discovery will ever invalidate it. The proof is a logical structure that stands independent of observation.
Why insist on such a high standard? Because mathematics deals with universal claims about infinite sets. "Every even number greater than 2 can be written as a sum of two primes" is a claim about infinitely many numbers. You cannot check them all. Goldbach's Conjecture has been verified computationally for every even number up to 4 × 10¹⁸ — an unimaginably large number of cases — and yet no mathematician considers it proven. The reason is not stubbornness; it is that the very next number could be a counterexample. In principle, there might be some enormous even number that defies the pattern. Only a proof can rule that out.
This creates a practical lesson for your own reasoning: always be clear about whether you have evidence or proof. When you check examples and see a pattern, you have evidence — a conjecture worth investigating. When you construct a deductive argument that covers all cases, you have a proof. The cycle of conjecture → testing → proof (or counterexample) is the engine of mathematical discovery, and understanding where you are in that cycle at any moment is one of the most important skills this course teaches.
There is also a humbling corollary. Kurt Godel proved in 1931 that any sufficiently powerful mathematical system contains true statements that cannot be proven within that system. This does not mean proof is unreliable — proven statements are certain. It means there are limits to what can be proven, which is itself a proven theorem. The study of what can and cannot be proven is one of the deepest branches of logic, and the reasoning skills you are building now are the foundation for eventually exploring it.