A Levels / Maths

Introduction to Proof by Deduction

Proof by deduction is a method of proving a mathematical statement by starting from known facts, definitions, identities, or previously established results and using logical steps to reach a definite conclusion. It is widely used in algebra, number theory and geometry. In A Level Mathematics, students should be able to construct clear deductive arguments, justify every step, and distinguish deduction from other forms of reasoning such as induction or checking individual examples.

Proof by deduction uses established mathematical facts and logical reasoning to prove that a statement must be true.

A deductive proof begins with known information, definitions, identities, assumptions or previously proven results.

Every step in a deductive argument must follow logically from the previous step.

A proof by deduction establishes a result generally rather than confirming it using only selected examples.

Algebraic manipulation is commonly used in proof by deduction.

Known properties of integers, such as even and odd number representations, can be used in deductive proofs.

An even integer can be written in the form 2n, where n is an integer.

An odd integer can be written in the form 2n + 1, where n is an integer.

A multiple of an integer k can be represented as kn, where n is an integer.

Proof by deduction can be used to prove divisibility statements and properties involving even and odd integers.

Proof by deduction is also used in geometry by applying established angle facts, properties of shapes and geometric theorems.

In a geometric deductive proof, each conclusion should be supported by a recognised geometric fact or theorem.

Applications of proof by deduction include algebra, number theory, coordinate geometry and classical geometry.

Deduction differs from mathematical induction because deduction derives a result directly from known facts, whereas induction proves a statement across a sequence of cases using a base case and an inductive step.

Testing several numerical examples does not constitute a complete deductive proof.

A valid proof should clearly state assumptions, show logical working and finish with the required conclusion.

When proving a statement about all integers, variables should normally be defined as integers before algebraic manipulation begins.

A counterexample can disprove a universal statement, but examples alone cannot generally prove that a universal statement is true.

The final line of a proof should explicitly connect the working to the statement that was required to be proved.

Good mathematical proofs are concise, logically ordered and contain sufficient justification for each important step.