1.6 Simple deductive proof

1.6 Simple deductive proof

IB Maths: Analysis and Approaches SL: Revision notes

Studying this course? Keep your progress in one place.

Key facts

  • An example is not a proof; a deductive proof covers every case.
  • == may hold only for some values; an identity ≡\equiv holds for all values.
  • LHS to RHS: begin with one side, finish with the other, one valid step per line.
  • Integers: nn, n+1n+1; even 2n2n; odd 2n+12n+1. Factorise to show a multiple and say why the factor is an integer.
  • Check your result with a numerical substitution.

Examples

  • Can disprove a rule
  • Cannot prove it for all cases

Deductive proof

  • Covers every case
  • Logical steps from known facts

What is a deductive proof?

A deductive proof uses logical steps from accepted facts to reach a conclusion that must be true; examples are not enough.

A deductive proof starts from facts you already accept (definitions, algebraic rules, earlier results) and uses a chain of logical steps to reach a conclusion that must be true.

Checking a few examples is not a proof: n2+n+41n^2+n+41 is prime for n=0,1,…,39n = 0, 1, \ldots, 39 but not for n=40n = 40, where it equals 41241^2.

At SL you need two kinds: algebraic proofs showing two expressions are always equal, and numerical proofs about integers, such as that the sum of three consecutive integers is always a multiple of 3.

51015202530354045200400600800100012001400160018002000xyn = 39: 1601 (prime)n = 40: 1681 = 41²y = n² + n + 41
n² + n + 41 gives a prime for n = 0 to 39, but at n = 40 it equals 1681 = 41², so examples alone are not a proof.

Examples

  • Can disprove a rule
  • Cannot prove it for all cases

Deductive proof

  • Covers every case
  • Logical steps from known facts

A student checks n=1,2,3,4,5n = 1, 2, 3, 4, 5 and finds a rule works each time. Is this a proof?

Equality and identity

An equation holds only for some values; an identity holds for every value of the variable.

An equation such as x2=4xx^2 = 4x is true only for particular values (x=0x = 0 or x=4x = 4).

An identity is true for every value of the variable, and is written with ≡\equiv:

(x−3)2+5≡x2−6x+14.(x-3)^2 + 5 \equiv x^2 - 6x + 14.

When a question says "show that ... ≡\equiv ..." you must prove it holds for all xx, not solve it.

−1123455101520xy(0, 0)(4, 16)y = x²y = 4x
The equation x² = 4x is true only where the curves meet (x = 0 and x = 4). An identity would give curves that coincide everywhere.

Equation ==

  • True for particular values
  • Solve it, e.g. x2=4xx^2 = 4x

Identity ≡\equiv

  • True for every value
  • Prove it, e.g. (x+1)2≡x2+2x+1(x+1)^2 \equiv x^2+2x+1

Which of these is an identity?

LHS to RHS proofs

Start with one side, transform it with valid steps and finish with the other side.

Start with one side (usually the more complicated), transform it using known algebraic steps, and finish with the other side. Each line follows from the one before.

Do not write the whole identity on every line and operate on both sides, as that assumes what you are trying to prove.

  1. 1

    Start with the LHS

    usually the more complicated side

  2. 2

    Transform it

    one valid step per line

  3. 3

    Reach the RHS

    write RHS at the end

LHS to RHS

Worked example

Show that (x−3)2+5≡x2−6x+14(x-3)^2 + 5 \equiv x^2 - 6x + 14.

Worked example

Show (2x−5)2−4(x−1)(x−4)≡9(2x-5)^2 - 4(x-1)(x-4) \equiv 9.

In an LHS to RHS proof, what do you do?

Proofs about integers

Write general integers algebraically, simplify and factorise to show the property.

Write general integers algebraically:

  • any integer: nn; consecutive integers: nn, n+1n+1, n+2n+2
  • an even number: 2n2n; an odd number: 2n+12n+1; consecutive odd numbers: 2n+12n+1, 2n+32n+3
  • a multiple of kk: k×k\times(an integer)

Then simplify and factorise to show the required property. Always state why the bracket is an integer.

Use different letters (2a+12a+1, 2b+12b+1) when two numbers are independent.

0123456782n = 42n+1 = 52n+2 = 62n+3 = 7

Even

  • 2n2n

Odd

  • 2n+12n+1

Consecutive integers

  • nn, n+1n+1, n+2n+2

Consecutive odd numbers

  • 2n+12n+1, 2n+32n+3

Worked example

Prove that the difference of the squares of two consecutive odd numbers is a multiple of 8.

Which expression always represents an odd number, for integer nn?

Checking a result

Substitute a convenient value to catch errors, but a check never replaces the proof.

The syllabus expects you to check results. After proving an identity, substitute a convenient value and confirm both sides agree.

For P+1≡(2m+2)2P + 1 \equiv (2m+2)^2 with P=(2m+1)(2m+3)P=(2m+1)(2m+3) and m=4m = 4: 9×11+1=100=1029\times 11 + 1 = 100 = 10^2.

A check catches expansion and sign errors. Choose values that are easy to work with but not special cases like 00 or 11, which can hide mistakes.

  1. 1

    Prove it algebraically

    LHS to RHS

  2. 2

    Substitute a value

    not 0 or 1

  3. 3

    Compare both sides

    a mismatch means an error

Checking an identity

Does substituting m=4m = 4 and getting equal sides prove an identity?

Try an exam question

Prove that the sum of any three consecutive integers is a multiple of 3.

[4 marks]

That's the notes covered.

Carry on to the next subtopic.

Try a question

Find a simplified expression for the sum of the three consecutive integers.

1 mark, marked against the mark scheme

Revision notes