In mathematics, a proof is a rock-solid argument that a statement is true. It’s not just about showing your work or trying a few examples. A proof is a chain of logical steps, starting from things we already know or assume to be true, that leads to an undeniable conclusion. Think of it like a lawyer building a case, but with numbers and symbols instead of evidence and witnesses. Every step must follow logically from the one before it, leaving no room for doubt.

The starting points for proofs are called axioms or postulates. These are statements we accept as true without proof, like “the shortest distance between two points is a straight line.” From these axioms, we build up more complex truths called theorems. A proof is the bridge that connects the axioms to the theorem.

The statement we want to prove usually takes the form of a conditional statement: "If P, then Q." The part "P" is called the premise or hypothesis, and "Q" is the conclusion. The proof's job is to show that whenever P is true, Q must also be true.

The most straightforward way to build this bridge is with a direct proof. You start by assuming the premise (P) is true and then use definitions, axioms, and logical steps to show that the conclusion (Q) must follow. It’s a step-by-step march from A to B.

Let's prove a classic statement: If you add two even integers, the sum is even.

First, we need a precise definition of an even integer. An integer is even if it can be written as $2$ times some other integer. For example, $6 = 2 \times 3$ and $14 = 2 \times 7$.

Now let's build the proof:

1. Assume the premise is true. Let's take two even integers, we'll call them $x$ and $y$.
2. Using our definition, we can write $x = 2a$ and $y = 2b$ for some integers $a$ and $b$.
3. Now, let's look at their sum: $x + y$. We can substitute our expressions for $x$ and $y$.

4. We can factor out a 2 from the right side.

5. Since $a$ and $b$ are integers, their sum $(a + b)$ is also an integer. Let's call this new integer $k$. So, $x + y = 2k$.

Because the sum can be written as $2$ times an integer ($k$), the sum is, by definition, an even number. We've directly proven that the sum of any two even integers is always even. The logic is airtight.

Sometimes, the direct path from P to Q is hard to find. It might be blocked or hidden. In these cases, mathematicians use clever detours called indirect proofs. Instead of tackling the problem head-on, we can approach it from a different angle. We'll look at two common types: proof by contrapositive and proof by contradiction.

These methods feel a bit like a logic puzzle, and they are powerful tools for proving tricky statements.

Every "If P, then Q" statement has a logically equivalent partner called the contrapositive: "If not Q, then not P." If one is true, the other is automatically true as well. Sometimes, proving the contrapositive is much easier than proving the original statement.

Consider a simple, non-math example: "If it is raining, then the ground is wet." The contrapositive is "If the ground is not wet, then it is not raining." Both statements say the same thing. Proving one is the same as proving the other.

Let's try proving a mathematical statement using this method: If $n^2$ is an even integer, then $n$ is an even integer.

A direct proof is tricky. If we assume $n^2$ is even, we can write $n^2 = 2k$. Then $n = \sqrt{2k}$. It's not immediately obvious why that means $n$ has to be even.

So, let's try the contrapositive. First, we write it down:

• Original Statement: If $n^2$ is even (P), then $n$ is even (Q).
• Contrapositive: If $n$ is not even (not Q), then $n^2$ is not even (not P).

"Not even" is just another way of saying "odd." So, we need to prove: If $n$ is odd, then $n^2$ is odd. This is much easier and looks like a direct proof problem.

1. Assume $n$ is odd. By definition, an odd integer can be written as $2k + 1$ for some integer $k$.
2. So, we set $n = 2k + 1$.
3. Now we square it:

4. Let the integer inside the parenthesis, $2k^2 + 2k$, be called $m$. Then $n^2 = 2m + 1$.

This expression, $2m+1$, is the definition of an odd number. We have successfully proven that if $n$ is odd, then $n^2$ is odd. Because we've proven the contrapositive, we have also proven the original statement.

This method is another powerful indirect technique. It's a bit like playing devil's advocate with the statement you're trying to prove. The process goes like this:

1. Assume that the statement you want to prove is actually false.
2. Follow the logical consequences of this assumption.
3. Show that this path leads to a contradiction—something impossible, like $1=0$ or a number being both even and odd.
4. Since your initial assumption led to nonsense, the assumption must be wrong. Therefore, the original statement must be true.

Let's prove one of the most famous results in mathematics: The square root of 2 is an irrational number.

An irrational number is one that cannot be written as a fraction $\frac{a}{b}$ where $a$ and $b$ are integers and the fraction is in simplest form.

1. We start by assuming the opposite. Assume that $\sqrt{2}$ is rational.
2. This means we can write $\sqrt{2} = \frac{a}{b}$ where $a$ and $b$ are integers with no common factors (the fraction is fully simplified).
3. Let's square both sides: $2 = \frac{a^2}{b^2}$.
4. Multiply by $b^2$ to get $2b^2 = a^2$.
5. This equation tells us that $a^2$ is an even number (since it's 2 times something). From our contrapositive proof earlier, we know that if $a^2$ is even, then $a$ must also be even.
6. If $a$ is even, we can write it as $a = 2k$ for some integer $k$.
7. Now, substitute $2k$ for $a$ in the equation from step 4:

8. This new equation shows that $b^2$ must be even, which means $b$ must also be even.

Here comes the contradiction. We've concluded that both $a$ and $b$ must be even. But at the very beginning, we assumed that the fraction $\frac{a}{b}$ was in simplest form, meaning $a$ and $b$ have no common factors. If they are both even, they share a common factor of 2. This is a contradiction!

The only possible conclusion is that $\sqrt{2}$ is irrational.

These proof techniques are the building blocks of mathematical reasoning. They allow us to build a solid foundation of knowledge, where each new truth rests securely on the ones that came before.