# Conjecture

In mathematics, a **conjecture** is a conclusion or proposition based on incomplete information, for which no proof has been found.^{[1]}^{[2]} Conjectures such as the Riemann hypothesis (still a conjecture) or Fermat's Last Theorem (which was a conjecture until proven in 1995 by Andrew Wiles) have shaped much of mathematical history as new areas of mathematics are developed in order to prove them.

## Contents

## Important examples[edit]

### Fermat's Last Theorem[edit]

In number theory, Fermat's Last Theorem (sometimes called **Fermat's conjecture**, especially in older texts) states that no three positive integers *a*, *b*, and *c* can satisfy the equation *a*^{n} + *b*^{n} = *c*^{n} for any integer value of *n* greater than two.

This theorem was first conjectured by Pierre de Fermat in 1637 in the margin of a copy of *Arithmetica* where he claimed he had a proof that was too large to fit in the margin.^{[3]} The first successful proof was released in 1994 by Andrew Wiles, and formally published in 1995, after 358 years of effort by mathematicians. The unsolved problem stimulated the development of algebraic number theory in the 19th century and the proof of the modularity theorem in the 20th century. It is among the most notable theorems in the history of mathematics and prior to its proof it was in the *Guinness Book of World Records* for "most difficult mathematical problems".

### Four color theorem[edit]

In mathematics, the four color theorem, or the four color map theorem, states that, given any separation of a plane into contiguous regions, producing a figure called a *map*, no more than four colors are required to color the regions of the map so that no two adjacent regions have the same color. Two regions are called *adjacent* if they share a common boundary that is not a corner, where corners are the points shared by three or more regions.^{[4]} For example, in the map of the United States of America, Utah and Arizona are adjacent, but Utah and New Mexico, which only share a point that also belongs to Arizona and Colorado, are not.

Möbius mentioned the problem in his lectures as early as 1840.^{[5]} The conjecture was first proposed on October 23, 1852^{[6]} when Francis Guthrie, while trying to color the map of countries of England, noticed that only four different colors were needed. The five color theorem, which has a short elementary proof, states that five colors suffice to color a map and was proven in the late 19th century (Heawood 1890); however, proving that four colors suffice turned out to be significantly harder. A number of false proofs and false counterexamples have appeared since the first statement of the four color theorem in 1852.

The four color theorem was proven in 1976 by Kenneth Appel and Wolfgang Haken. It was the first major theorem to be proved using a computer. Appel and Haken's approach started by showing that there is a particular set of 1,936 maps, each of which cannot be part of a smallest-sized counterexample to the four color theorem. (If they did appear, you could make a smaller counter-example.) Appel and Haken used a special-purpose computer program to confirm that each of these maps had this property. Additionally, any map that could potentially be a counterexample must have a portion that looks like one of these 1,936 maps. Showing this required hundreds of pages of hand analysis, Appel and Haken concluded that no smallest counterexamples exists because any must contain, yet do not contain, one of these 1,936 maps. This contradiction means there are no counterexamples at all and that the theorem is therefore true. Initially, their proof was not accepted by all mathematicians because the computer-assisted proof was infeasible for a human to check by hand (Swart 1980). Since then the proof has gained wider acceptance, although doubts remain (Wilson 2002, 216–222).

### Hauptvermutung[edit]

The Hauptvermutung (German for main conjecture) of geometric topology is the conjecture that any two triangulations of a triangulable space have a common refinement, a single triangulation that is a subdivision of both of them. It was originally formulated in 1908, by Steinitz and Tietze.

This conjecture is now known to be false. The non-manifold version was disproved by John Milnor^{[7]} in 1961 using Reidemeister torsion.

The manifold version is true in dimensions *m* ≤ 3. The cases *m* = 2 and 3 were proved by Tibor Radó and Edwin E. Moise^{[8]} in the 1920s and 1950s, respectively.

### Weil conjectures[edit]

In mathematics, the Weil conjectures were some highly influential proposals by André Weil (1949) on the generating functions (known as local zeta-functions) derived from counting the number of points on algebraic varieties over finite fields.

A variety *V* over a finite field with *q* elements has a finite number of rational points, as well as points over every finite field with *q*^{k} elements containing that field. The generating function has coefficients derived from the numbers *N*_{k} of points over the (essentially unique) field with *q*^{k} elements.

Weil conjectured that such *zeta-functions* should be rational functions, should satisfy a form of functional equation, and should have their zeroes in restricted places. The last two parts were quite consciously modeled on the Riemann zeta function and Riemann hypothesis. The rationality was proved by Dwork (1960), the functional equation by Grothendieck (1965), and the analogue of the Riemann hypothesis was proved by Deligne (1974)

### Poincaré conjecture[edit]

In mathematics, the Poincaré conjecture is a theorem about the characterization of the 3-sphere, which is the hypersphere that bounds the unit ball in four-dimensional space. The conjecture states:

Every simply connected, closed 3-manifold is homeomorphic to the 3-sphere.

An equivalent form of the conjecture involves a coarser form of equivalence than homeomorphism called homotopy equivalence: if a 3-manifold is *homotopy equivalent* to the 3-sphere, then it is necessarily *homeomorphic* to it.

Originally conjectured by Henri Poincaré, the theorem concerns a space that locally looks like ordinary three-dimensional space but is connected, finite in size, and lacks any boundary (a closed 3-manifold). The Poincaré conjecture claims that if such a space has the additional property that each loop in the space can be continuously tightened to a point, then it is necessarily a three-dimensional sphere. An analogous result has been known in higher dimensions for some time.

After nearly a century of effort by mathematicians, Grigori Perelman presented a proof of the conjecture in three papers made available in 2002 and 2003 on arXiv. The proof followed on from the program of Richard S. Hamilton to use the Ricci flow to attempt to solve the problem. Hamilton later introduced a modification of the standard Ricci flow, called *Ricci flow with surgery* to systematically excise singular regions as they develop, in a controlled way, but was unable to prove this method "converged" in three dimensions.^{[9]} Perelman completed this portion of the proof. Several teams of mathematicians have verified that Perelman's proof is correct.

The Poincaré conjecture, before being proven, was one of the most important open questions in topology.

### Riemann hypothesis[edit]

In mathematics, the Riemann hypothesis, proposed by Bernhard Riemann (1859), is a conjecture that the non-trivial zeros of the Riemann zeta function all have real part 1/2. The name is also used for some closely related analogues, such as the Riemann hypothesis for curves over finite fields.

The Riemann hypothesis implies results about the distribution of prime numbers. Along with suitable generalizations, some mathematicians consider it the most important unresolved problem in pure mathematics (Bombieri 2000). The Riemann hypothesis, along with the Goldbach conjecture, is part of Hilbert's eighth problem in David Hilbert's list of 23 unsolved problems; it is also one of the Clay Mathematics Institute Millennium Prize Problems.

### P versus NP problem[edit]

The P versus NP problem is a major unsolved problem in computer science. Informally, it asks whether every problem whose solution can be quickly verified by a computer can also be quickly solved by a computer; it is widely conjectured that the answer is no. It was essentially first mentioned in a 1956 letter written by Kurt Gödel to John von Neumann. Gödel asked whether a certain NP-complete problem could be solved in quadratic or linear time.^{[10]} The precise statement of the P=NP problem was introduced in 1971 by Stephen Cook in his seminal paper "The complexity of theorem proving procedures"^{[11]} and is considered by many to be the most important open problem in the field.^{[12]} It is one of the seven Millennium Prize Problems selected by the Clay Mathematics Institute to carry a US$1,000,000 prize for the first correct solution.

### Other conjectures[edit]

- Goldbach's conjecture
- The twin prime conjecture
- The Collatz conjecture
- The Manin conjecture
- The Maldacena conjecture
- The Euler conjecture, proposed by Euler in the 18th century but for which counterexamples for a number of exponents starting with n=4 were found beginning in the mid 20th century
- The Hardy-Littlewood conjectures are a pair of conjectures concerning the distribution of prime numbers, the first of which expands upon the twin prime conjecture mentioned above. Neither one has either been proven or disproven, but it
*has*been proven that both cannot simultaneously be true. At least one must be false. It has not been proven which one is false, but it is widely believed that the first conjecture is true and the second one is false.^{[13]} - The Langlands program
^{[14]}is a far-reaching web of these ideas of 'unifying conjectures' that link different subfields of mathematics, e.g. number theory and representation theory of Lie groups; some of these conjectures have since been proved.

## Resolution of conjectures[edit]

### Proof[edit]

Formal mathematics is based on *provable* truth. In mathematics, any number of cases supporting a conjecture, no matter how large, is insufficient for establishing the conjecture's veracity, since a single counterexample would immediately bring down the conjecture. Mathematical journals sometimes publish the minor results of research teams having extended the search for a counterexample farther than previously done. For instance, the Collatz conjecture, which concerns whether or not certain sequences of integers terminate, has been tested for all integers up to 1.2 × 10^{12} (over a trillion). However, the failure to find a counterexample after extensive search does not constitute a proof that no counterexample exists nor that the conjecture is true, because the conjecture might be false but with a very large minimal counterexample.

Instead, a conjecture is considered proven only when it has been shown that it is logically impossible for it to be false. There are various methods of doing so; see Mathematical proof#Methods for details.

One method of proof, usable when there are only a finite number of cases that could lead to counterexamples, is known as "brute force": in this approach, all possible cases are considered and shown not to give counterexamples. Sometimes the number of cases is quite large, in which situation a brute-force proof may require as a practical matter the use of a computer algorithm to check all the cases: the validity of the 1976 and 1997 brute-force proofs of the four color theorem by computer was initially doubted, but was eventually confirmed in 2005 by theorem-proving software.

When a conjecture has been proven, it is no longer a conjecture but a theorem. Many important theorems were once conjectures, such as the Geometrization theorem (which resolved the Poincaré conjecture), Fermat's Last Theorem, and others.

### Disproof[edit]

Conjectures disproven through counterexample are sometimes referred to as *false conjectures* (cf. the Pólya conjecture and Euler's sum of powers conjecture). In the case of the latter, the first counterexample found for the n=4 case involved numbers in the millions, although subsequently it has been found that the minimal counterexample is smaller than that.

### Undecidable conjectures[edit]

Not every conjecture ends up being proven true or false. The continuum hypothesis, which tries to ascertain the relative cardinality of certain infinite sets, was eventually shown to be undecidable (or independent) from the generally accepted set of axioms of set theory. It is therefore possible to adopt this statement, or its negation, as a new axiom in a consistent manner (much as we can take Euclid's parallel postulate as either true or false).

In this case, if a proof uses this statement, researchers will often look for a new proof that *doesn't* require the hypothesis (in the same way that it is desirable that statements in Euclidean geometry be proved using only the axioms of neutral geometry, i.e. no parallel postulate.) The one major exception to this in practice is the axiom of choice—unless studying this axiom in particular, the majority of researchers do not usually worry whether a result requires the axiom of choice.

## Conditional proofs[edit]

Sometimes a conjecture is called a *hypothesis* when it is used frequently and repeatedly as an assumption in proofs of other results. For example, the Riemann hypothesis is a conjecture from number theory that (amongst other things) makes predictions about the distribution of prime numbers. Few number theorists doubt that the Riemann hypothesis is true. In anticipation of its eventual proof, some have proceeded to develop further proofs which are contingent on the truth of this conjecture. These are called *conditional proofs*: the conjectures assumed appear in the hypotheses of the theorem, for the time being.

These "proofs", however, would fall apart if it turned out that the hypothesis was false, so there is considerable interest in verifying the truth or falsity of conjectures of this type.

## In other sciences[edit]

Karl Popper pioneered the use of the term "conjecture" in scientific philosophy.^{[15]} Conjecture is related to hypothesis, which in science refers to a testable conjecture.

## See also[edit]

## References[edit]

**^***Oxford Dictionary of English*(2010 ed.).**^**Schwartz, JL (1995).*Shuttling between the particular and the general: reflections on the role of conjecture and hypothesis in the generation of knowledge in science and mathematics*. p. 93.**^**Ore, Oystein (1988) [1948],*Number Theory and Its History*, Dover, pp. 203–204, ISBN 978-0-486-65620-5**^**Georges Gonthier (December 2008). "Formal Proof—The Four-Color Theorem".*Notices of the AMS*.**55**(11): 1382–1393.From this paper: Definitions: A planar map is a set of pairwise disjoint subsets of the plane, called regions. A simple map is one whose regions are connected open sets. Two regions of a map are adjacent if their respective closures have a common point that is not a corner of the map. A point is a corner of a map if and only if it belongs to the closures of at least three regions. Theorem: The regions of any simple planar map can be colored with only four colors, in such a way that any two adjacent regions have different colors.**^**W. W. Rouse Ball (1960)*The Four Color Theorem*, in Mathematical Recreations and Essays, Macmillan, New York, pp 222-232.**^**Donald MacKenzie,*Mechanizing Proof: Computing, Risk, and Trust*(MIT Press, 2004) p103**^**Milnor, John W. (1961). "Two complexes which are homeomorphic but combinatorially distinct".*Annals of Mathematics*.**74**(2): 575–590. doi:10.2307/1970299. JSTOR 1970299. MR 0133127.**^**Moise, Edwin E. (1977).*Geometric Topology in Dimensions 2 and 3*. New York: New York : Springer-Verlag. ISBN 978-0-387-90220-3.**^**Hamilton, Richard S. (1997). "Four-manifolds with positive isotropic curvature".*Communications in Analysis and Geometry*.**5**(1): 1–92. doi:10.4310/CAG.1997.v5.n1.a1. MR 1456308. Zbl 0892.53018.**^**Juris Hartmanis 1989, Gödel, von Neumann, and the P = NP problem, Bulletin of the European Association for Theoretical Computer Science, vol. 38, pp. 101–107**^**Cook, Stephen (1971). "The complexity of theorem proving procedures".*Proceedings of the Third Annual ACM Symposium on Theory of Computing*. pp. 151–158.**^**Lance Fortnow,*The status of the*, Communications of the ACM 52 (2009), no. 9, pp. 78–86. doi:10.1145/1562164.1562186**P**versus**NP**problem**^**Richards, Ian (1974). "On the Incompatibility of Two Conjectures Concerning Primes".*Bull. Amer. Math. Soc*.**80**: 419–438. doi:10.1090/S0002-9904-1974-13434-8.**^**Langlands, Robert (1967),*Letter to Prof. Weil***^**Popper, Karl (2004).*Conjectures and refutations : the growth of scientific knowledge*. London: Routledge. ISBN 0-415-28594-1.

## External links[edit]

Look up in Wiktionary, the free dictionary.conjecture |