← Module 00 / Math starter kit

Lesson 00.6 · Prerequisite bridge

How do you know it is true?

Separate a definition, an example, and a proof—and learn to break a false claim.

In this lesson 6 ideas
  1. A picture suggests. A proof explains.
  2. Try to break a claim
  3. Follow a direct proof
  4. Which direction does an implication run?
  5. A proof by contradiction
  6. Ready for the source

A picture suggests. A proof explains.

A definition fixes what a word means. An integer nn is even if it can be written as n=2kn=2k for some integer kk. A claim states something that may be true or false. A theorem is a proved mathematical result; propositions and lemmas are other names used to organize results. A corollary follows from an earlier result.

An example helps you understand a claim. It does not prove a statement about every possible input.

Try to break a claim

Consider “For every real number xx, x2≥xx^2\ge x.” It works at x=2x=2, x=3x=3, and x=−1x=-1. Is that enough?

Explore it yourself

One counterexample is enough

Claim: x² ≥ x for every real number x. Try to break it.

Preparing interactive controls…

xy0-3-2-11234
Blue: y = x²Red: y = x

2.0² = 4.00 ≥ 2.0. This value fits the claim. It does not prove “every.”

At x=1/2x=1/2, the square is 1/4<1/21/4<1/2. One counterexample disproves a universal claim. The experiment visualizes why: between zero and one, the square curve lies below the straight line. Testing many successful cases would never make that one failure disappear.

Follow a direct proof

Claim: The sum of two even integers is even.

  1. Let aa and bb be any even integers. By definition, a=2ra=2r and b=2sb=2s for integers r,sr,s.
  2. Add: a+b=2r+2s=2(r+s)a+b=2r+2s=2(r+s).
  3. Since r+sr+s is an integer, the result has the form “2 times an integer.” It is even by definition.

The proof covers all even inputs because rr and ss were arbitrary. Checking 2+4=62+4=6 would cover only one pair.

Which direction does an implication run?

Let A mean “n is divisible by 4” and B mean “n is even.” Then A⇒BA\Rightarrow B.

  • A is sufficient for B: divisibility by 4 guarantees evenness.
  • B is necessary for A: divisibility by 4 requires evenness.
  • B is not sufficient for A: 6 is even but not divisible by 4.

An “if and only if” statement requires both directions. For integers, “n is even if and only if n² is even” makes two promises, not one.

A proof by contradiction

To prove a claim by contradiction, assume it fails and show that the assumption forces an impossibility.

Claim: There is no largest integer. Suppose there were a largest integer NN. But N+1N+1 is also an integer and is larger than NN. That contradicts the meaning of “largest.” Therefore no largest integer exists.

Keep the assumptions visible. For example, x2=1⇒x=1x^2=1\Rightarrow x=1 is false over the reals because x=−1x=-1 is possible. It becomes true if we add the assumption x≥0x\ge0.

Make a prediction

A matrix has property A only if it has property B. What does that say?

Ready for the source

You now have a way to approach unfamiliar notation: draw a small case, calculate an example, test the assumptions, then read the general statement. Module 1 connects these habits to the original lecture notes.