Does every correct mathematical proof have to be sound argument

discrete mathematicslogicphilosophysolution-verification

We know that if an argument is sound then it must be valid and its all premises must be true (as a result of this its conclusion is also true).

We prove mathematical statement by using logic rules. Then, can we say that all correct mathematical proofs are sound arguments?

I think that the answer is yes because a proof must be valid to reach the conclusion and if it is a correct proof that its premises and conclusion must also be true, but i am not sure about it? What is your notions?

Best Answer

'True' is the sticky notion here. In real life, when we say that a statement is true, we mean true in our world. Thus, for example, any argument that starts out with: "Grass is purple ..." will not be a sound argument.

However, when mathematicians talk about 'truth' they mean that it describes some abstract mathematical world, e.g. the world of numbers, or the world of sets. And these kinds of mathematical worlds can really be anything the mathematician wants it to be. So in that context, a sound argument would be one whose premises are basically the axioms that the mathematician used to define that world.

For example: in the mathematical world of Euclidian geometry, a sound argument could start with "the angles in a triangle add up to the sum of two right angles", but any such argument is automatically not sound in the mathematical world of non-Euclidian geometry.

Related Question