Experimental mathematics

Last updated

Experimental mathematics is an approach to mathematics in which computation is used to investigate mathematical objects and identify properties and patterns. [1] It has been defined as "that branch of mathematics that concerns itself ultimately with the codification and transmission of insights within the mathematical community through the use of experimental (in either the Galilean, Baconian, Aristotelian or Kantian sense) exploration of conjectures and more informal beliefs and a careful analysis of the data acquired in this pursuit." [2]

Contents

As expressed by Paul Halmos: "Mathematics is not a deductive science—that's a cliché. When you try to prove a theorem, you don't just list the hypotheses, and then start to reason. What you do is trial and error, experimentation, guesswork. You want to find out what the facts are, and what you do is in that respect similar to what a laboratory technician does." [3]

History

Mathematicians have always practiced experimental mathematics. Existing records of early mathematics, such as Babylonian mathematics, typically consist of lists of numerical examples illustrating algebraic identities. However, modern mathematics, beginning in the 17th century, developed a tradition of publishing results in a final, formal and abstract presentation. The numerical examples that may have led a mathematician to originally formulate a general theorem were not published, and were generally forgotten.

Experimental mathematics as a separate area of study re-emerged in the twentieth century, when the invention of the electronic computer vastly increased the range of feasible calculations, with a speed and precision far greater than anything available to previous generations of mathematicians. A significant milestone and achievement of experimental mathematics was the discovery in 1995 of the Bailey–Borwein–Plouffe formula for the binary digits of π. This formula was discovered not by formal reasoning, but instead by numerical searches on a computer; only afterwards was a rigorous proof found. [4]

Objectives and uses

The objectives of experimental mathematics are "to generate understanding and insight; to generate and confirm or confront conjectures; and generally to make mathematics more tangible, lively and fun for both the professional researcher and the novice". [5]

The uses of experimental mathematics have been defined as follows: [6]

  1. Gaining insight and intuition.
  2. Discovering new patterns and relationships.
  3. Using graphical displays to suggest underlying mathematical principles.
  4. Testing and especially falsifying conjectures.
  5. Exploring a possible result to see if it is worth formal proof.
  6. Suggesting approaches for formal proof.
  7. Replacing lengthy hand derivations with computer-based derivations.
  8. Confirming analytically derived results.

Tools and techniques

Experimental mathematics makes use of numerical methods to calculate approximate values for integrals and infinite series. Arbitrary precision arithmetic is often used to establish these values to a high degree of precision – typically 100 significant figures or more. Integer relation algorithms are then used to search for relations between these values and mathematical constants. Working with high precision values reduces the possibility of mistaking a mathematical coincidence for a true relation. A formal proof of a conjectured relation will then be sought – it is often easier to find a formal proof once the form of a conjectured relation is known.

If a counterexample is being sought or a large-scale proof by exhaustion is being attempted, distributed computing techniques may be used to divide the calculations between multiple computers.

Frequent use is made of general mathematical software or domain-specific software written for attacks on problems that require high efficiency. Experimental mathematics software usually includes error detection and correction mechanisms, integrity checks and redundant calculations designed to minimise the possibility of results being invalidated by a hardware or software error.

Applications and examples

Applications and examples of experimental mathematics include:

Plausible but false examples

Some plausible relations hold to a high degree of accuracy, but are still not true. One example is:

The two sides of this expression actually differ after the 42nd decimal place. [13]

Another example is that the maximum height (maximum absolute value of coefficients) of all the factors of xn − 1 appears to be the same as the height of the nth cyclotomic polynomial. This was shown by computer to be true for n < 10000 and was expected to be true for all n. However, a larger computer search showed that this equality fails to hold for n = 14235, when the height of the nth cyclotomic polynomial is 2, but maximum height of the factors is 3. [14]

Practitioners

The following mathematicians and computer scientists have made significant contributions to the field of experimental mathematics:

See also

Related Research Articles

<span class="mw-page-title-main">Conjecture</span> Proposition in mathematics that is unproven

In mathematics, a conjecture is a conclusion or a proposition that is proffered on a tentative basis without proof. Some conjectures, such as the Riemann hypothesis or Fermat's Last Theorem, have shaped much of mathematical history as new areas of mathematics are developed in order to prove them.

The Gauss–Legendre algorithm is an algorithm to compute the digits of π. It is notable for being rapidly convergent, with only 25 iterations producing 45 million correct digits of π. However, it has some drawbacks and therefore all record-breaking calculations for many years have used other methods, almost always the Chudnovsky algorithm. For details, see Chronology of computation of π.

The number π is a mathematical constant that is the ratio of a circle's circumference to its diameter, approximately equal to 3.14159. The number π appears in many formulae across mathematics and physics. It is an irrational number, meaning that it cannot be expressed exactly as a ratio of two integers, although fractions such as are commonly used to approximate it. Consequently, its decimal representation never ends, nor enters a permanently repeating pattern. It is a transcendental number, meaning that it cannot be a solution of an equation involving only finite sums, products, powers, and integers. The transcendence of π implies that it is impossible to solve the ancient challenge of squaring the circle with a compass and straightedge. The decimal digits of π appear to be randomly distributed, but no proof of this conjecture has been found.

<span class="mw-page-title-main">Theorem</span> In mathematics, a statement that has been proved

In mathematics, a theorem is a statement that has been proved, or can be proved. The proof of a theorem is a logical argument that uses the inference rules of a deductive system to establish that the theorem is a logical consequence of the axioms and previously proved theorems.

The Collatz conjecture is one of the most famous unsolved problems in mathematics. The conjecture asks whether repeating two simple arithmetic operations will eventually transform every positive integer into 1. It concerns sequences of integers in which each term is obtained from the previous term as follows: if the previous term is even, the next term is one half of the previous term. If the previous term is odd, the next term is 3 times the previous term plus 1. The conjecture is that these sequences always reach 1, no matter which positive integer is chosen to start the sequence. The conjecture has been shown to hold for all positive integers that have been tried, up to a very large number: 2.95×1020, but no general proof has been found.

<span class="mw-page-title-main">David H. Bailey (mathematician)</span> American mathematician (born 1948)

David Harold Bailey is a mathematician and computer scientist. He received his B.S. in mathematics from Brigham Young University in 1972 and his Ph.D. in mathematics from Stanford University in 1976. He worked for 14 years as a computer scientist at NASA Ames Research Center, and then from 1998 to 2013 as a Senior Scientist at the Lawrence Berkeley National Laboratory. He is now retired from the Berkeley Lab.

Borwein's algorithm was devised by Jonathan and Peter Borwein to calculate the value of . This and other algorithms can be found in the book Pi and the AGM – A Study in Analytic Number Theory and Computational Complexity.

Jonathan Michael Borwein was a Scottish mathematician who held an appointment as Laureate Professor of mathematics at the University of Newcastle, Australia. He was a close associate of David H. Bailey, and they have been prominent public advocates of experimental mathematics.

Peter Benjamin Borwein was a Canadian mathematician and a professor at Simon Fraser University. He is known as a co-author of the paper which presented the Bailey–Borwein–Plouffe algorithm for computing π.

A computer-assisted proof is a mathematical proof that has been at least partially generated by computer.

Approximations of <span class="texhtml mvar" style="font-style:italic;">π</span> Varying methods used to calculate pi

Approximations for the mathematical constant pi in the history of mathematics reached an accuracy within 0.04% of the true value before the beginning of the Common Era. In Chinese mathematics, this was improved to approximations correct to what corresponds to about seven decimal digits by the 5th century.

Bellard's formula is used to calculate the nth digit of π in base 16.

Tanh-sinh quadrature is a method for numerical integration introduced by Hidetoshi Takahashi and Masatake Mori in 1974. It is especially applied where singularities or infinite derivatives exist at one or both endpoints.

<span class="mw-page-title-main">Inverse Symbolic Calculator</span>

The Inverse Symbolic Calculator is an online number checker established July 18, 1995 by Peter Benjamin Borwein, Jonathan Michael Borwein and Simon Plouffe of the Canadian Centre for Experimental and Constructive Mathematics. A user will input a number and the Calculator will use an algorithm to search for and calculate closed-form expressions or suitable functions that have roots near this number. Hence, the calculator is of great importance for those working in numerical areas of experimental mathematics.

An integer relation between a set of real numbers x1, x2, ..., xn and a set of integers a1, a2, ..., an, not all 0, such that

<span class="mw-page-title-main">Riemann hypothesis</span> Conjecture on zeros of the zeta function

In mathematics, the Riemann hypothesis is the conjecture that the Riemann zeta function has its zeros only at the negative even integers and complex numbers with real part 1/2. Many consider it to be the most important unsolved problem in pure mathematics. It is of great interest in number theory because it implies results about the distribution of prime numbers. It was proposed by Bernhard Riemann, after whom it is named.

This is a timeline of pure and applied mathematics history. It is divided here into three stages, corresponding to stages in the development of mathematical notation: a "rhetorical" stage in which calculations are described purely by words, a "syncopated" stage in which quantities and common algebraic operations are beginning to be represented by symbolic abbreviations, and finally a "symbolic" stage, in which comprehensive notational systems for formulas are the norm.

The Bailey–Borwein–Plouffe formula is a formula for π. It was discovered in 1995 by Simon Plouffe and is named after the authors of the article in which it was published, David H. Bailey, Peter Borwein, and Plouffe. Before that, it had been published by Plouffe on his own site. The formula is:

The progression of both the nature of mathematics and individual mathematical problems into the future is a widely debated topic; many past predictions about modern mathematics have been misplaced or completely false, so there is reason to believe that many predictions today will follow a similar path. However, the subject still carries an important weight and has been written about by many notable mathematicians. Typically, they are motivated by a desire to set a research agenda to direct efforts to specific problems, or a wish to clarify, update and extrapolate the way that subdisciplines relate to the general discipline of mathematics and its possibilities. Examples of agendas pushing for progress in specific areas in the future, historical and recent, include Felix Klein's Erlangen program, Hilbert's problems, Langlands program, and the Millennium Prize Problems. In the Mathematics Subject Classification section 01Axx History of mathematics and mathematicians, subsection 01A67 is titled Future prospectives.

In mathematics, a Borwein integral is an integral whose unusual properties were first presented by mathematicians David Borwein and Jonathan Borwein in 2001. Borwein integrals involve products of , where the sinc function is given by for not equal to 0, and .

References

  1. Weisstein, Eric W. "Experimental Mathematics". MathWorld .
  2. Experimental Mathematics: A Discussion Archived 2008-01-21 at the Wayback Machine by J. Borwein, P. Borwein, R. Girgensohn and S. Parnes
  3. I Want to be a Mathematician: An Automathography (1985), p. 321 (in 2013 reprint)
  4. The Quest for Pi Archived 2011-09-27 at the Wayback Machine by David H. Bailey, Jonathan M. Borwein, Peter B. Borwein and Simon Plouffe.
  5. Borwein, Jonathan; Bailey, David (2004). Mathematics by Experiment: Plausible Reasoning in the 21st Century. A.K. Peters. pp. vii. ISBN   978-1-56881-211-3.
  6. Borwein, Jonathan; Bailey, David (2004). Mathematics by Experiment: Plausible Reasoning in the 21st Century. A.K. Peters. p. 2. ISBN   978-1-56881-211-3.
  7. Silva, Tomás (28 December 2015). "Computational verification of the 3x+1 conjecture". Institute of Electronics and Informatics Engineering of Aveiro. Archived from the original on 18 March 2013.
  8. Clement W. H. Lam (1991). "The Search for a Finite Projective Plane of Order 10". American Mathematical Monthly . 98 (4): 305–318. doi:10.2307/2323798. JSTOR   2323798.
  9. arXiv, Emerging Technology from the. "Mathematicians Solve Minimum Sudoku Problem". MIT Technology Review. Retrieved 27 November 2017.
  10. Bailey, David (1997). "New Math Formulas Discovered With Supercomputers" (PDF). NAS News. 2 (24).
  11. H. F. Sandham and Martin Kneser, The American mathematical monthly, Advanced problem 4305, Vol. 57, No. 4 (Apr., 1950), pp. 267-268
  12. Mumford, David; Series, Caroline; Wright, David (2002). Indra's Pearls: The Vision of Felix Klein. Cambridge. pp. viii. ISBN   978-0-521-35253-6.
  13. David H. Bailey and Jonathan M. Borwein, Future Prospects for Computer-Assisted Mathematics Archived 2011-07-20 at the Wayback Machine , December 2005
  14. The height of Φ4745 is 3 and 14235 = 3 x 4745. See Sloane sequences OEIS:  A137979 and OEIS:  A160338 .