Elementary proof
Template:Short description In mathematics, an elementary proof is a mathematical proof that only uses basic techniques. More specifically, the term is used in number theory to refer to proofs that make no use of complex analysis. Historically, it was once thought that certain theorems, like the prime number theorem, could only be proved by invoking "higher" mathematical theorems or techniques. However, as time progresses, many of these results have also been subsequently reproven using only elementary techniques.
While there is generally no consensus as to what counts as elementary, the term is nevertheless a common part of the mathematical jargon. An elementary proof is not necessarily simple, in the sense of being easy to understand or trivial. In fact, some elementary proofs can be quite complicated — and this is especially true when a statement of notable importance is involved.[1]
Prime number theorem
The distinction between elementary and non-elementary proofs has been considered especially important in regard to the prime number theorem. This theorem was first proved in 1896 by Jacques Hadamard and Charles Jean de la Vallée-Poussin using complex analysis.[2] Many mathematicians then attempted to construct elementary proofs of the theorem, without success. G. H. Hardy expressed strong reservations; he considered that the essential "depth" of the result ruled out elementary proofs: Template:Quote However, in 1948, Atle Selberg produced new methods which led him and Paul Erdős to find elementary proofs of the prime number theorem.[3]
Friedman's conjecture
Script error: No such module "Labelled list hatnote".
Harvey Friedman conjectured, "Every theorem published in the Annals of Mathematics whose statement involves only finitary mathematical objects (i.e., what logicians call an arithmetical statement) can be proved in elementary arithmetic."[4] The form of elementary arithmetic referred to in this conjecture can be formalized by a small set of axioms concerning integer arithmetic and mathematical induction. For instance, according to this conjecture, Fermat's Last Theorem should have an elementary proof; Wiles's proof of Fermat's Last Theorem is not elementary. However, there are other simple statements about arithmetic such as the existence of iterated exponential functions that cannot be proven in this theory.
References
Page Template:Reflist/styles.css has no content.
- ^ Page Module:Citation/CS1/styles.css has no content.Diamond, Harold G. (1982), "Elementary methods in the study of the distribution of prime numbers", Bulletin of the American Mathematical Society, 7 (3): 553–89, doi:10.1090/S0273-0979-1982-15057-1, MR 0670132.
- ^ Page Module:Citation/CS1/styles.css has no content.Zagier, Don. "Newman's Short Proof of the Prime Number Theorem" (PDF). Mathematical Association of America. Archived (PDF) from the original on 2014-07-14.
- ^ Page Module:Citation/CS1/styles.css has no content.Goldfeld, Dorian M. (2003), The Elementary Proof of the Prime Number Theorem: An Historical Perspective (PDF), p. 3, retrieved October 31, 2009
- ^ Page Module:Citation/CS1/styles.css has no content.Avigad, Jeremy (2003), "Number theory and elementary arithmetic" (PDF), Philosophia Mathematica, 11 (3): 257, at 258, doi:10.1093/philmat/11.3.257.
Lua error in package.lua at line 80: module 'Module:Navbox/configuration' not found.
