Math is fascinating to me, though I struggled with math in high school and only took the minimum I needed. (Age changes things, man.) I’m reading a book on Wiles’ proof for Fermat’s Last Theorem and got curious about proofs.
At what point does something move from an assumption with examples (well yeah. Look at this) to a full proof?
Simple example that came to mind:
For any number n, where n is a prime >2, the sum of the factors of n cannot be odd.
In: Mathematics
Essentially, mathematical proofs are all kind of the same– you take what you know, and you use that information to get to a new conclusion that must be true based on what you know.
As an example, let’s prove a statement– “An even number plus an even number is an even number”
How do we prove this? Well, what do we know? We know that an even number is divisible by 2, since that’s the definition of an even number. In other words, we can think of any even number as “2 times another number.”
So let’s say that I have an even number x, and an even number y. In this case, we can say that x=2n, and that y=2m. In this case, by definition,
x * y = 2n * 2m = 4 * n * m = 2 * (2 * n * m). And since 2, n, and m are all numbers, then 2 * n * m must also be a number. And look, we’re back at the definition of an even number.
This is a brief example of how we can use a list of assumptions and create a new statement using those assumptions.
Note however, that in your post you say
>At what point does something move from an assumption with examples (well yeah. Look at this) to a full proof?
*I did not start this proof by making assumptions.* I began this proof by making statements of fact and definition, and all I did was provide examples to work with in order to prove my statement.
You could also do what is called a “proof by contradiction.” In a proof by contradiction, you assume the opposite of what you’re looking for, and then you prove that by making that assumption, you lead yourself to a logical fallacy.
For example:
Assume that x and y are even numbers, and that x * y is odd. In this case, x * y must be able to be written as 2(n+1), the definition of an odd number. Note that n cannot be odd. If n were odd, then n+1 would be even, and since 2 is even, 2 * (n+1) would have to be even (we just proved this), but this is impossible because our assumption is that 2(n+1) is odd. Thus, n must be even, and n+1 must be odd. But if n+1 is odd, then it isn’t divisible by 2. Thus, the only way to factor n+1 and 2 into x and y, is for x= 2, and y= n+1. But then y has to be odd, which violates an initial assumption.
This proof takes an assertion– 2 even numbers multiplied together can be odd– and proves that it’s impossible by going through the logical conclusion of what must be the case.
These are just two quick methods that can be used to prove a statement. There are other methods too, like induction, that I didn’t get into, but I hope that you can see the use of such techniques.
Happy to answer any questions.
Latest Answers