1.01a, 1.01b - Proof, logic and mathematical arguments
A proof turns a convincing pattern into a conclusion you can trust for every allowed case. In 1.01a you will build deductions and complete case arguments; in 1.01b you will use implication, equivalence and congruence precisely. Along the way, the language of expressions, equations and functions will help you say exactly what your argument establishes.
Expressions, equations and identities
Why is always even when is an integer? At it is , and at it is . Those examples are encouraging; this lesson will turn them into a proof that also covers every integer you have not tried.
First, notice what the question says. The expression represents a value. The equation makes a claim that is true only for particular values of . You need this distinction before you can judge a proof.
You already know
Expand brackets by multiplying every term. Substitute a negative number inside brackets: if , then , whereas .
Here is the vocabulary you will use throughout A-level mathematics.
Expression, equation and identity
An expression combines numbers, letters and operations, such as . An equation states that two expressions are equal, such as . An identity holds for every value in its stated domain, such as for real . The symbol emphasises an identity. By contrast, holds only when .
The domain matters even for an identity: requires , because division by zero is undefined. Expanding brackets establishes an identity; substituting one value only verifies one case.
In , the terms are , and . A coefficient is the multiplying factor of a variable or its power: the coefficient of is . An index is a power, so the index in is . A constant has a fixed value; the constant term here is . A letter can represent a constant, so letters are not automatically variables.
A variable can take different values in a domain. An unknown is a value to be found in a problem. A function assigns exactly one output to each input in its domain; defines a rule, and gives its output at input . The notation is not multiplication of by .
Worked example 1: reading and using a function
Question. For , state the coefficient of , then find .
Plan. Read the sign with the coefficient, then replace every by the input.
Why this step? Substituting into the whole rule keeps the coefficient and the input separate.
Answer. The coefficient is , and .
Check. The three term values are , and ; they total .
Example 2 changes only the input's sign. Brackets now prevent a negative square from being mistaken for the negative of a square.
Worked example 2: a negative input
Question. For , find .
Plan. Substitute in brackets and evaluate each term before adding.
Why this step? The square acts on the input , not on the coefficient .
Answer. .
Check. The square term is unchanged from input ; the linear term changes from to , so the output increases by , from to .
Function notation records a calculation; an identity records an equality that survives every admissible input. Neither vocabulary nor these basic algebra rules is supplied on the formula sheet.
Watch out
Wrong: the coefficient of in is .
Right: the term is , so its coefficient is . Keep the sign attached to its term.
Try the same reading and substitution with a new rule.
From assumptions to a conclusion
A deduction starts from assumptions and uses steps that remain valid for every object covered by the claim. General letters do the work that a long list of numerical checks cannot.
For example, suggests that an even integer plus an odd integer is odd. We can represent any such pair without choosing their values.
Even and odd integers
An integer is even if it has the form for an integer , and odd if it has the form . Thus is even and is odd. These definitions include negative integers; they do not apply to a non-integer such as .
Use separate parameters for independent numbers. Writing both odd integers as assumes they are equal, which a question about any two odd integers does not allow.
Worked example 3: an even integer plus an odd integer
Question. Prove that the sum of any even integer and any odd integer is odd.
Plan. Use the definitions, add, then identify twice an integer plus one.
Let the integers be and , where .
Why this step? The final form matches the definition of odd because is an integer.
Answer. The sum is odd for every allowed pair.
Check. , gives . This illustrates the argument; the general algebra proves it.
Example 4 changes the first integer from even to odd. One extra unit changes the parity of the sum.
Worked example 4: two odd integers
Question. Prove that the sum of any two odd integers is even.
Plan. Represent the integers independently and factor their sum by .
Let the integers be and , where .
Why this step? is an integer, so the sum is an integer multiple of .
Answer. The sum of any two odd integers is even.
Check. With , , the sum is , agreeing with .
The surprising reach of this tiny argument is that it covers an odd integer with a million digits just as completely as it covers . The size never enters the reasoning.
Exam tip
For “Prove”, define your integer parameters and show why the final form has the required property. Numerical trials do not replace a general argument. Never assume the conclusion as one of your starting facts: that is circular reasoning.
Every operation also has conditions. You may divide only by a nonzero quantity. Definitions and proof methods are not on the formula sheet; you need to build the argument yourself. Now change addition to subtraction.
Implication, equivalence and congruence
The direction of a statement matters: knowing an input fixes its square, but knowing its square can leave a choice of signs.
For real , guarantees . Yet does not guarantee , because also works.
Implication and equivalence
means “if , then ”. Here is sufficient for , and is necessary for . The converse is , also written . Equivalence, , means both directions hold: “ if and only if ”, or “iff”.
Thus is true over the reals, while is false. A true equivalence is
The “or” includes every possible solution. Restricting the domain to would instead make true. This is why domains belong in an argument, not in the reader's guesswork.
The symbol has meanings supplied by context. In algebra, is an identity. For integers, is a congruence: their difference is divisible by , so they have the same remainder on division by . It does not say . Congruent triangles have equal corresponding sides and angles: the same shape and size.
Squaring can therefore preserve a forward implication while losing a reverse one. Check candidates against the equation you started with; do not replace every equality sign by an equivalence arrow automatically. These logical meanings are not supplied on the formula sheet.
Key idea
For an equivalence, check both directions under the stated domain. One valid direction earns an implication, not an “if and only if”.
Here a missing sign is enough to break the claimed equivalence.
Covering every possible case
Proof by exhaustion works when your cases cover the whole domain. For integers, even and odd are two general cases, each containing infinitely many values.
There are other useful complete splits. An integer leaves remainder , or on division by . This proves that is divisible by :
| Form of , with | A factor divisible by |
|---|---|
Every row makes the product divisible by , and every integer belongs to a row. Negative integers are included: .
Proof by exhaustion
A proof by exhaustion establishes a statement in every case of a complete set of possibilities. Checking all inputs in a finite domain works; for an infinite domain, each of finitely many case arguments must itself be general. Checking one even integer and one odd integer does not cover all integers.
Return to the opening expression. Parity gives just the case split we need.
Worked example 5: the opening question
Question. Use exhaustion to prove that is even for every integer .
Plan. Substitute the two general parity forms and factor out in each case.
For , with ,
For , with ,
Why this step? Each bracket is an integer, so each form proves evenness for its entire case.
Answer. Every integer is even or odd; both cases give an even result, so is always even.
Check. gives , and gives , matching the opening examples.
Example 6 changes just the constant term by adding . The case split stays the same, but the final forms must now establish oddness.
Worked example 6: adding an odd constant
Question. Use exhaustion to prove that is odd for every integer .
Plan. Use the two parity cases and write each result as twice an integer plus one.
If ,
If ,
In both cases is an integer, so the bracket is an integer.
Why this step? The final identifies an odd integer; merely writing an expanded quadratic would leave that point unexplained.
Answer. Both exhaustive cases are odd, so the result holds for every integer .
Check. At , the expression is , which is odd.
You can also read as : one of two consecutive integers is even. That short argument is the same complete parity split in words. No proof principle here is supplied on the formula sheet.
Watch out
Wrong: “It works for and , so both parity cases are proved.”
Right: use and , with arbitrary integer . They cover whole cases rather than one value from each.
Change the added constant again, keeping the general reasoning.
Quick Recap
- An equation holds at its solutions; an identity holds throughout its stated domain.
- Define your variables and use separate parameters for independent integers.
- needs one direction; needs both.
- Exhaustion proves a claim only when the cases cover the entire domain.
The opening expression is always even because one of two consecutive integers is even; the two general parity cases prove this for every integer.