Gödel's 1931 incompleteness theorems proved this impossible. Any consistent formal system powerful enough to express basic arithmetic contains true statements that cannot be proved within that system. No set of axioms can be simultaneously complete and consistent.
David Hilbert's address to the International Congress of Mathematicians in Paris in 1900 opened with a conviction that mathematicians found encouraging rather than provocative: every mathematical problem has a solution. Hilbert told the audience that if the answer is not found today, it can be found tomorrow. Over the following three decades, he developed this optimism into a formal program, now called Hilbert's program: place all mathematics on an unambiguous axiomatic foundation and demonstrate that the system was complete, meaning that any true mathematical statement was, in principle, provable within it.
Kurt Gödel, then twenty-five years old and a member of the Vienna Circle of philosophers, submitted a paper to the Monatshefte für Mathematik und Physik in 1931 titled "On Formally Undecidable Propositions of Principia Mathematica and Related Systems." Principia Mathematica was Bertrand Russell and Alfred North Whitehead's attempt to derive all of mathematics from pure logical foundations, and Hilbert had regarded it as a candidate for the complete, consistent system he sought. Gödel's paper showed it could not be what Hilbert wanted, and neither could any sufficiently powerful system like it.
The proof constructed a specific arithmetical statement that, read at the level of the system's own structure, asserted its own unprovability within that system. If the system is consistent and the statement is false, the system can prove it, which means the system has proved something false, contradicting its consistency. If the statement is true, it genuinely cannot be proved within the system, and the system contains a true statement it cannot capture. A consistent formal system of sufficient expressive power is necessarily incomplete; adding more axioms does not close the gap, because the expanded system faces the same limitation.
The construction required Gödel to encode the entire syntax of a formal system into arithmetic by assigning unique integers to symbols, formulas, and proofs. This Gödel numbering allowed statements about provability to be expressed as numerical relationships, and the self-referential argument to be stated within the very language it was describing.
John von Neumann attended Gödel's presentation at the Königsberg conference in September 1930 and understood the implications before most of the audience did. He sent Gödel a letter noting that the results also implied the unprovability of consistency, a corollary Gödel had not yet published. Gödel's second incompleteness theorem, stated in the 1931 paper, confirmed this: no consistent formal system of sufficient power can prove its own consistency from within. Hilbert, who had built a career on the assumption that such a foundation was achievable, reportedly received the news with profound disturbance.
Alan Turing's 1936 paper on computable numbers drew directly on Gödel's results to show that no algorithm could determine, for an arbitrary program, whether it would eventually halt. The connection was structural: Turing reformulated the diagonal construction in computational terms, producing the theoretical foundation of computer science before electronic computers existed in any practical form. The halting problem and Gödel's unprovable statements were different expressions of the same underlying limit on what formal systems can determine about themselves.
School curricula presented mathematics as a discipline in which proof, applied with sufficient effort, could settle any well-posed question. The incompleteness theorems were known among research mathematicians from 1931 onward, but the content rarely entered secondary education. Students learning Euclidean geometry encountered proof as a mechanism that yielded certainty without inherent limit. The formal result that some true statements lie outside the reach of proof within any given system was classified as graduate-level logic and excluded from the curricula in which most students first encountered the idea of mathematical proof.
Infinity is infinity. There is only one infinite quantity, and all infinities are the same size.
Georg Cantor proved in 1891 that there are different sizes of infinity. The set of real numbers is strictly larger than the set of counting numbers, even though both are infinite. His diagonal argument showed that no complete list of real numbers is possible, because a new real number not on any list can always be constructed.
You cannot take the square root of a negative number. It is undefined and mathematically impossible.
The square root of negative one, written as i, defines the imaginary unit and extends the real numbers to the complex number system. Complex numbers are physically real in the deepest sense: quantum mechanics cannot be expressed using only real numbers, and electrical engineering, signal processing, and GPS calculations all rely on complex arithmetic.
1 is a prime number.
By modern definition, 1 is not prime. Primality requires exactly two distinct positive divisors, and 1 has only one: itself. The exclusion preserves the Fundamental Theorem of Arithmetic, which states that every integer greater than 1 has a unique prime factorization. If 1 were prime, 12 could be factored as 2x2x3 or as 1x2x2x3 or 1x1x2x2x3, making factorizations non-unique.
The angles in any triangle always add up to exactly 180 degrees.
The 180-degree rule holds only in flat Euclidean space. On the surface of a sphere, a triangle with one vertex at the North Pole and two vertices on the equator 90 degrees apart has three right angles, summing to 270 degrees. Einstein's general relativity confirmed that physical space near massive objects is geometrically curved, and light-ray triangles near massive stars do not obey the Euclidean rule.