Copyright © James R Meyer 2012 - 2017 www.jamesrmeyer.com
Mathematicians would have you believe that the world they inhabit is a world of precision and certainty, a world where there is no vagueness, and no uncertainty.
But that is not the case. That precise and certain world is an idealistic concept, but it is not the world that real world mathematicians work in. It is a world that mathematicians desire so strongly that they cannot bring themselves to admit that the world they work in isn’t as clear-cut as they would like it to be. To see why this is the case, we need to consider the cornerstones of mathematics – mathematical proofs.
There is a widespread notion that once something has been proved mathematically, then it is, as it were, set in stone - that we have a mathematical proof that remains ‘true for all time’.
That is certainly a very optimistic idea, but the reality is that most mathematical proofs that anyone will encounter fall a long way short of this idealistic concept. A mathematical proof is ‘set in stone’ and is ‘true for all time’ only if certain conditions are fulfilled…
Now, practically every proof you will encounter includes at least some natural language, and you hardly ever encounter a proof where every assumption and rule used is explicitly stated. Essentially, a mathematical proof isn’t a rigorously proven mathematical proof unless it is proven within a totally formal system, since it is only in such a system that there are precisely defined assumptions and rules that define how one step in the proof follows from a previous step – in a formal proof, these are the axioms and the rules of inference of the system.
And the vast majority of mathematical proofs are not fully formal proofs - the vast majority of what are commonly called mathematical proofs have not been proved to a level of rigor that enables one to say that they are ‘set in stone’ for all time. And even if a proof is claimed to be proven in a formal system, that doesn’t necessarily mean that the proof is ‘true for all time’ - because if that formal system is inconsistent - capable of producing contradictory results - then that system could prove both a statement and the converse of that statement. (Note: despite this, it seems to be the case that creators of formal proofs are always absolutely convinced that their proof is absolutely right, even though they have not also proved that their formal system is consistent.) Another problem with fully formal proofs, especially computerized formal proofs, is that it is not always made clear what the formal proof actually proves - in some cases it has been claimed that a formal proof proves a particular statement, whereas a careful logical analysis shows that in fact, it proves something quite different. (Footnote: See the page Computer proofs)
Note that showing that a proof is wrong does not mean that the conclusion of the proof is necessarily wrong – it may be possible to prove it by a different method. For example, it would be easy to come up with a proof that contained an error, but which nevertheless showed that 1 + 1 = 2. Showing that the proof is wrong does not mean that 1 + 1 = 2 is an incorrect statement.
Now, mathematicians are aware of all the above - it’s just that they don’t like to be reminded of how different their actual world is from the idealistic world they crave so much. A common attitude among mathematicians is that of Dr Alex Kasman of the College of Charleston (also mentioned on this site’s webpage Review of Book ‘The Shackles of Conviction’), who states in an article Mathematics and Skepticism that:
“If you cannot completely prove your claims in mathematics, the new results will not be accepted by the mathematical community, they will not be published in a journal, and -- to be blunt -- you won’t be a mathematician for long…”
Dr Kasman no doubt sincerely believes this, but the evidence that he is wrong is overwhelming. There have been many instances where errors in mathematical proofs have not been discovered for several years after they were first published. And these haven’t all been proofs that were published in an obscure journal that very few people had actually read. Several such proofs had received widespread attention before the error was discovered - for example, a flawed proof by Kempe (Footnote: A proof of the four color map theorem was published by the prominent mathematician Alfred Kempe in 1879, and which received widespread acclaim. Eleven years later, an error was found in the proof.) and a flawed proof by Tait. (Footnote: Another proof of the four color map theorem was published by Peter Guthrie Tait in 1880. Again, it was eleven years before anyone discovered that there was an error in the proof.)
“A valid proof of a mathematical theorem is most certainly a more rigorous and certain thing than what passes for proof in the other sciences…” and “In contrast, something which seems true (such as the apparent fact that any even integer can be written as a sum of two prime numbers) is not given the status of a fact at all unless it has been proven.”
As indicated above, this is quite simply wrong. Most mathematical proofs that have been and continue to be published are not fully rigorous proofs. There are many proofs where the author makes an assertion that encompasses several single steps, and in so doing, he assumes that there cannot be an error in any of those single steps. And most mathematicians, when examining such a proof, will make a judgement as to whether that assumption is justified. So, when a mathematician says that he can find no error in a proof, that does not necessarily mean that there is not an error in the proof. It may mean that he has made a judgment where he makes assumptions about how one statement leads to another.
But, despite the inherent uncertainty surrounding mathematical proofs, for some unfathomable reason, mathematicians refuse to believe that it is possible for a proof to become a widely accepted proof in the mathematical community unless it actually is a rigorous mathematical proof. They seem to think that, unlike all other areas of human endeavour, the study of mathematics is somehow immune to human error.
Mathematicians like to believe that they are working in an environment of certainty, whereas the reality is that they are always attempting to move closer to an environment of certainty.
See What is a proof? by Keith Devlin, former Dean of Science at Saint Mary’s College of California, who points out the difference between what a mathematician would like a proof to be and what passes for a ‘proof’ in the real world.
Also see the article “Formal proof - theory and practice” (Footnote: Harrison, J. “Formal proof - theory and practice”, 2008, Notices of the American Mathematical Society, 55 pp 1395-1406. Available online Formal proof – theory and practice: here PDF.) by John Harrison, an advocate of computerized proof checking software, and the article on computerised proof checking software.
The philosopher Karl Popper (1902-1994) argued that scientific theories can never be considered to be unquestionably correct, and that they are inherently hypothetical. He argued that the only way we have of reckoning whether a scientific theory might or might not be correct is by testing the predictions of the theory against actual real events. He went on to argue that if you look at it logically, then it doesn’t matter how many tests fit in with the predictions of the theory, you still can’t be absolutely sure that the theory will always and invariably give a correct prediction. On the other hand, one single demonstration that a prediction of the theory is wrong is enough to show that the scientific theory isn’t completely correct. Popper called this the falsifiability of a scientific theory.
It appears that he never tried to apply his notion of falsifiability to mathematics. But in many ways the reality of real world mathematical proofs is similar to scientific theories. Because while it is very difficult to demonstrate with absolute certainty that a mathematical proof of a proposition is correct, if a flaw is found in a proof, that immediately invalidates that proof (Note: that does not necessarily mean that the proposition of the proof is incorrect - it may be possible to prove the proposition by a different method of proof.)
Also see Is that a fact? by Keith Devlin, former Dean of Science at Saint Mary’s College of California, who also sees similarities in the way we practice science and mathematics.
Diverse opinions and criticisms are welcome, but messages that are frivolous, irrelevant or devoid of logical basis will be blocked. Difficulties in understanding the site content are usually best addressed by contacting me by e-mail. Note: you will be asked to provide an e-mail address - any address will do, it does not require verification. Your e-mail will only be used to notify you of replies to your comments - it will never be used for any other purpose and will not be displayed. If you cannot see any comments below, see Why isn’t the comment box loading?.
Please wait for comments to load …
There is now a new page on Lebesgue measure theory and how it is contradictory.
There is now a new page Halbach and Zhang’s Yablo without Gödel which demonstrates the illogical assumptions used by Halbach and Zhang.
It has come to my notice that, when asked about the demonstration of the flaw in his proof (see A Fundamental Flaw in an Incompleteness Proof by Peter Smith PDF), Smith refuses to engage in any logical discussion, and instead attempts to deflect attention away from any such discussion. If any other reader has tried to engage with Smith regarding my demonstration of the flaw, I would be interested to know what the outcome was.
I found that making, adding or deleting footnotes in the traditional manner proved to be a major pain. So I developed a different system for footnotes which makes inserting or changing footnotes a doddle. You can check it out at Easy Footnotes for Web Pages (Accessibility friendly).
I have now added a new section to my paper on Russell O’Connor’s claim of a computer verified incompleteness proof. This shows that the flaw in the proof arises from a reliance on definitions that include unacceptable assumptions - assumptions that are not actually checked by the computer code. See also the new page Representability.
There is now a new page on Chaitin’s Constant (Chaitin’s Omega), which demonstrates that Chaitin has failed to prove that it is actually algorithmically irreducible.
For convenience, there are now two pages on this site with links to various material relating to Gödel and the Incompleteness Theorem
– a page with general links:
– and a page relating specifically to the Gödel mind-machine debate:
All pages on this website are printer friendly, and will print the main content in a convenient format. Note that the margins are set by your browser print settings.
Comments on this site are welcome, please see the comment section.
Please note that this web site, like any other is a collection of various statements. Not all of this web site is intended to be factual. Some of it is personal opinion or interpretation.
If you prefer to ask me directly about the material on this site, please send me an e-mail with your query, and I will attempt to reply promptly.
Feedback about site design would also be appreciated so that I can improve the site.
Copyright © James R Meyer 2012 - 2017