1.01a, 1.01b - Proof, logic and mathematical arguments

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 n2+nn^2+n always even when nn is an integer? At n=3n=3 it is 1212, and at n=−2n=-2 it is 22. 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 n2+nn^2+n represents a value. The equation n2+n=12n^2+n=12 makes a claim that is true only for particular values of nn. 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 x=−2x=-2, then x2=(−2)2=4x^2=(-2)^2=4, whereas −x2=−4-x^2=-4.

Here is the vocabulary you will use throughout A-level mathematics.

Expression, equation and identity

An expression combines numbers, letters and operations, such as 3x2−4x+73x^2-4x+7. An equation states that two expressions are equal, such as 3x+7=193x+7=19. An identity holds for every value in its stated domain, such as 3(x+2)≡3x+63(x+2)\equiv3x+6 for real xx. The symbol ≡\equiv emphasises an identity. By contrast, 3x+7=193x+7=19 holds only when x=4x=4.

The domain matters even for an identity: x/x≡1x/x\equiv1 requires x≠0x\ne0, because division by zero is undefined. Expanding brackets establishes an identity; substituting one value only verifies one case.

In 3x2−4x+73x^2-4x+7, the terms are 3x23x^2, −4x-4x and 77. A coefficient is the multiplying factor of a variable or its power: the coefficient of xx is −4-4. An index is a power, so the index in x2x^2 is 22. A constant has a fixed value; the constant term here is 77. 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; f(x)=3x2−4x+7\mathrm f(x)=3x^2-4x+7 defines a rule, and f(2)=11\mathrm f(2)=11 gives its output at input 22. The notation is not multiplication of f\mathrm f by xx.

Worked example 1: reading and using a function

Question. For f(x)=3x2−4x+7\mathrm f(x)=3x^2-4x+7, state the coefficient of xx, then find f(2)\mathrm f(2).

Plan. Read the sign with the coefficient, then replace every xx by the input.

coefficient of x=−4include its signf(2)=3(2)2−4(2)+7substitute=12−8+7=11powers before products\begin{aligned} \text{coefficient of }x&=-4 && \text{include its sign} \\ \mathrm f(2)&=3(2)^2-4(2)+7 && \text{substitute} \\ &=12-8+7=11 && \text{powers before products} \end{aligned}

Why this step? Substituting into the whole rule keeps the coefficient and the input separate.

Answer. The coefficient is −4-4, and f(2)=11\mathrm f(2)=11.

Check. The three term values are 1212, −8-8 and 77; they total 1111.

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 f(x)=3x2−4x+7\mathrm f(x)=3x^2-4x+7, find f(−2)\mathrm f(-2).

Plan. Substitute −2-2 in brackets and evaluate each term before adding.

f(−2)=3(−2)2−4(−2)+7substitute=12+8+7two negative factors give positive=27add\begin{aligned} \mathrm f(-2)&=3(-2)^2-4(-2)+7 && \text{substitute} \\ &=12+8+7 && \text{two negative factors give positive} \\ &=27 && \text{add} \end{aligned}

Why this step? The square acts on the input −2-2, not on the coefficient 33.

Answer. f(−2)=27\mathrm f(-2)=27.

Check. The square term is unchanged from input 22; the linear term changes from −8-8 to 88, so the output increases by 1616, from 1111 to 2727.

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 xx in 3x2−4x+73x^2-4x+7 is 44.

Right: the term is −4x-4x, so its coefficient is −4-4. 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, 4+7=114+7=11 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 2k2k for an integer kk, and odd if it has the form 2k+12k+1. Thus 00 is even and −3=2(−2)+1-3=2(-2)+1 is odd. These definitions include negative integers; they do not apply to a non-integer such as 1/21/2.

Use separate parameters for independent numbers. Writing both odd integers as 2k+12k+1 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 2a2a and 2b+12b+1, where a,b∈Za,b\in\mathbb Z.

2a+(2b+1)=2a+2b+1remove brackets=2(a+b)+1factor out 2\begin{aligned} 2a+(2b+1)&=2a+2b+1 && \text{remove brackets} \\ &=2(a+b)+1 && \text{factor out }2 \end{aligned}

Why this step? The final form matches the definition of odd because a+ba+b is an integer.

Answer. The sum is odd for every allowed pair.

Check. a=2a=2, b=3b=3 gives 4+7=114+7=11. 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 22.

Let the integers be 2a+12a+1 and 2b+12b+1, where a,b∈Za,b\in\mathbb Z.

(2a+1)+(2b+1)=2a+2b+2collect terms=2(a+b+1)factor out 2\begin{aligned} (2a+1)+(2b+1)&=2a+2b+2 && \text{collect terms} \\ &=2(a+b+1) && \text{factor out }2 \end{aligned}

Why this step? a+b+1a+b+1 is an integer, so the sum is an integer multiple of 22.

Answer. The sum of any two odd integers is even.

Check. With a=2a=2, b=3b=3, the sum is 5+7=125+7=12, agreeing with 2(2+3+1)2(2+3+1).

The surprising reach of this tiny argument is that it covers an odd integer with a million digits just as completely as it covers 55. 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 xx, x=3x=3 guarantees x2=9x^2=9. Yet x2=9x^2=9 does not guarantee x=3x=3, because x=−3x=-3 also works.

Implication and equivalence

P⇒QP\Rightarrow Q means “if PP, then QQ”. Here PP is sufficient for QQ, and QQ is necessary for PP. The converse is Q⇒PQ\Rightarrow P, also written P⇐QP\Leftarrow Q. Equivalence, P⇔QP\Leftrightarrow Q, means both directions hold: “PP if and only if QQ”, or “iff”.

Thus x=3⇒x2=9x=3\Rightarrow x^2=9 is true over the reals, while x=3⇔x2=9x=3\Leftrightarrow x^2=9 is false. A true equivalence is

x2=9⇔x=3 or x=−3(x∈R)x^2=9\Leftrightarrow x=3\text{ or }x=-3 \qquad (x\in\mathbb R)

The “or” includes every possible solution. Restricting the domain to x≥0x\ge0 would instead make x=3⇔x2=9x=3\Leftrightarrow x^2=9 true. This is why domains belong in an argument, not in the reader's guesswork.

The symbol ≡\equiv has meanings supplied by context. In algebra, (x+1)2≡x2+2x+1(x+1)^2\equiv x^2+2x+1 is an identity. For integers, 17≡2(mod5)17\equiv2\pmod5 is a congruence: their difference 1515 is divisible by 55, so they have the same remainder on division by 55. It does not say 17=217=2. 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 00, 11 or 22 on division by 33. This proves that n(n+1)(n+2)n(n+1)(n+2) is divisible by 33:

Form of nn, with k∈Zk\in\mathbb ZA factor divisible by 33
n=3kn=3kn=3kn=3k
n=3k+1n=3k+1n+2=3(k+1)n+2=3(k+1)
n=3k+2n=3k+2n+1=3(k+1)n+1=3(k+1)

Every row makes the product divisible by 33, and every integer belongs to a row. Negative integers are included: −1=3(−1)+2-1=3(-1)+2.

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 n2+nn^2+n is even for every integer nn.

Plan. Substitute the two general parity forms and factor out 22 in each case.

For n=2kn=2k, with k∈Zk\in\mathbb Z,

n2+n=4k2+2k=2(2k2+k)an even integern^2+n=4k^2+2k=2(2k^2+k) \qquad \text{an even integer}

For n=2k+1n=2k+1, with k∈Zk\in\mathbb Z,

n2+n=4k2+6k+2=2(2k2+3k+1)an even integern^2+n=4k^2+6k+2=2(2k^2+3k+1) \qquad \text{an even integer}

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 n2+nn^2+n is always even.

Check. n=3n=3 gives 1212, and n=−2n=-2 gives 22, matching the opening examples.

Example 6 changes just the constant term by adding 33. 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 n2+n+3n^2+n+3 is odd for every integer nn.

Plan. Use the two parity cases and write each result as twice an integer plus one.

If n=2kn=2k,

n2+n+3=4k2+2k+3=2(2k2+k+1)+1n^2+n+3=4k^2+2k+3=2(2k^2+k+1)+1

If n=2k+1n=2k+1,

n2+n+3=4k2+6k+5=2(2k2+3k+2)+1n^2+n+3=4k^2+6k+5=2(2k^2+3k+2)+1

In both cases kk is an integer, so the bracket is an integer.

Why this step? The final +1+1 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 nn.

Check. At n=2n=2, the expression is 4+2+3=94+2+3=9, which is odd.

You can also read n2+nn^2+n as n(n+1)n(n+1): 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 n=2n=2 and n=3n=3, so both parity cases are proved.”

Right: use n=2kn=2k and n=2k+1n=2k+1, with arbitrary integer kk. 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.
  • P⇒QP\Rightarrow Q needs one direction; P⇔QP\Leftrightarrow Q needs both.
  • Exhaustion proves a claim only when the cases cover the entire domain.

The opening expression n2+n=n(n+1)n^2+n=n(n+1) is always even because one of two consecutive integers is even; the two general parity cases prove this for every integer.