We use proofs to show that mathematical theorems are true beyond doubt. Similarly, we face theorems that we have to prove in automaton theory.
There are different types of proofs such as direct, indirect, deductive, inductive, divisibility proofs, and many others.
Sometimes it'd not easy to prove something directly but easier to prove it indirectly. Indirect proofs work without formalizing the process. These proofs initiate by assuming the denial of the probable conclusion.
Proof by contradiction is a type of indirect proof.
This proof works by assuming that the theorem is false. We prove through this theorem that the previous assumption leads to a contradiction or an incorrect result.
To prove a sentence
To create this proof, we follow the steps below:
Proposition: For all integers
Proof: Let
To show that these are odd, let
The original equation is:
Substitute the value of
Expand
Simplify the equation:
Divide both sides by 2:
Rearrange the equation:
Through this, we see that
Result: Thus, our assumption that when
Proposition:
Proof: To add contradiction, we will assume that
Let
Take square on both sides:
Rearrange the equation:
Since it is a squared value, we will assume
The equation will become:
Expand the squared value:
Simplify:
This shows that
Result: Since the assumption was incorrect,
Free Resources