Search This Blog

Friday, November 20, 2026

Mathematical proof

From Wikipedia, the free encyclopedia
https://en.wikipedia.org/wiki/Mathematical_proof

P. Oxy. 29, one of the oldest surviving fragments of Euclid's Elements, a textbook used for millennia to teach proof-writing techniques. The diagram accompanies Book II, Proposition 5.

A mathematical proof is a deductive argument for a mathematical statement, showing that the stated assumptions logically guarantee the conclusion. The argument may use other previously established statements, such as theorems; but every proof can, in principle, be constructed using only certain basic or original assumptions known as axioms, along with the accepted rules of inference. Proofs are examples of exhaustive deductive reasoning that establish logical certainty, to be distinguished from empirical arguments or non-exhaustive inductive reasoning that establish "reasonable expectation". Presenting many cases in which the statement holds is not enough for a proof, which must demonstrate that the statement is true in all possible cases. A proposition that has not been proved but is believed to be true is known as a conjecture, or a hypothesis if frequently used as an assumption for further mathematical work.

Proofs employ logic expressed in mathematical symbols, along with natural language that usually admits some ambiguity. In most mathematical literature, proofs are written in terms of rigorous informal logic. Purely formal proofs, written fully in symbolic language without the involvement of natural language, are considered in proof theory. The distinction between formal and informal proofs has led to much examination of current and historical mathematical practice, quasi-empiricism in mathematics, and so-called folk mathematics, oral traditions in the mainstream mathematical community or in other cultures. The philosophy of mathematics is concerned with the role of language and logic in proofs, and mathematics as a language.

History and etymology

The word proof derives from the Latin probare 'to test'; related words include English probe, probation, and probability, as well as Spanish probar 'to taste' (sometimes 'to touch' or 'to test'), Italian provare 'to try', and German probieren 'to try'. The legal term probity means authority or credibility, the power of testimony to prove facts when given by persons of reputation or status.

Plausibility arguments using heuristic devices such as pictures and analogies preceded strict mathematical proof. It is likely that the idea of demonstrating a conclusion first arose in connection with geometry, which originated in practical problems of land measurement. The development of mathematical proof is primarily the product of ancient Greek mathematics. Thales (624–546 BCE) and Hippocrates of Chios (c. 470–410 BCE) gave some of the first known proofs of theorems in geometry. Eudoxus (408–355 BCE) and Theaetetus (417–369 BCE) formulated theorems but did not prove them. Aristotle (384–322 BCE) said definitions should describe the concept being defined in terms of other concepts already known.

Mathematical proof was revolutionized by Euclid (300 BCE), who introduced the axiomatic method still in use today. It starts with undefined terms and axioms, propositions concerning the undefined terms which are assumed to be self-evidently true (from Greek axios 'something worthy'). From this basis, the method proves theorems using deductive logic. Euclid's Elements was read by anyone who was considered educated in the West until the middle of the 20th century. In addition to theorems of geometry, such as the Pythagorean theorem, the Elements also covers number theory, including a proof that the square root of two is irrational and a proof that there are infinitely many prime numbers.

Further advances also took place in medieval Islamic mathematics. In the 10th century, the Iraqi mathematician Al-Hashimi worked with numbers as such, called "lines" but not necessarily considered as measurements of geometric objects, to prove algebraic propositions concerning multiplication, division, etc., including the existence of irrational numbers. An inductive proof for arithmetic progressions was introduced in the Al-Fakhri (1000) by Al-Karaji, who used it to prove the binomial theorem and properties of Pascal's triangle.

Modern proof theory treats proofs as inductively defined data structures, not requiring an assumption that axioms are "true" in any sense. This allows parallel mathematical theories as formal models of a given intuitive concept, based on alternate sets of axioms, for example axiomatic set theory and non-Euclidean geometry.

Nature and purpose

As practiced, a proof is expressed in natural language and is a rigorous argument intended to convince the audience of the truth of a statement. The standard of rigor is not absolute and has varied throughout history. A proof can be presented differently depending on the intended audience. To gain acceptance, a proof has to meet communal standards of rigor; an argument considered vague or incomplete may be rejected.

The concept of proof is formalized in the field of mathematical logic. A formal proof is written in a formal language instead of natural language. A formal proof is a sequence of formulas in a formal language, starting with an assumption, and with each subsequent formula a logical consequence of the preceding ones. This definition makes the concept of proof amenable to study. Indeed, the field of proof theory studies formal proofs and their properties, the most famous and surprising being that almost all axiomatic systems can generate certain undecidable statements not provable within the system.

The definition of a formal proof is intended to capture the concept of proofs as written in the practice of mathematics. The soundness of this definition amounts to the belief that a published proof can, in principle, be converted into a formal proof. However, outside the field of automated proof assistants, this is rarely done in practice. A classic question in philosophy asks whether mathematical proofs are analytic or synthetic. Kant, who introduced the analytic–synthetic distinction, believed mathematical proofs are synthetic, whereas Quine argued in his 1951 "Two Dogmas of Empiricism" that such a distinction is untenable.

Proofs may be admired for their mathematical beauty. The mathematician Paul Erdős was known for describing proofs which he found to be particularly elegant as coming from "The Book", a hypothetical tome containing the most beautiful method(s) of proving each theorem. The book Proofs from THE BOOK, published in 2003, is devoted to presenting 32 proofs its editors find particularly pleasing.

Methods of proof

Direct proof

In direct proof, the conclusion is established by logically combining the axioms, definitions, and earlier theorems. For example, direct proof can be used to prove that the sum of two even integers is always even:

Consider two even integers x and y. Since they are even, they can be written as x = 2a and y = 2b, respectively, for some integers a and b. Then the sum is x + y = 2a + 2b = 2(a + b). Therefore x + y has 2 as a factor and, by definition, is even. Hence, the sum of any two even integers is even.

This proof uses the definition of even integers, the integer properties of closure under addition and multiplication, and the distributive property.

Proof by mathematical induction

Despite its name, mathematical induction is a method of deduction, not a form of inductive reasoning. In proof by mathematical induction, a single "base case" is proved, and an "induction rule" is proved that establishes that any arbitrary case implies the next case. Since in principle the induction rule can be applied repeatedly (starting from the proven base case), it follows that all (usually infinitely many) cases are provable. This avoids having to prove each case individually. A variant of mathematical induction is proof by infinite descent, which can be used, for example, to prove the irrationality of the square root of two.

A common application of proof by mathematical induction is to prove that a property known to hold for one number holds for all natural numbers: Let N = {1, 2, 3, 4, ...} be the set of natural numbers, and let P(n) be a mathematical statement involving the natural number n belonging to N such that

  • (i) P(1) is true, i.e., P(n) is true for n = 1.
  • (ii) P(n+1) is true whenever P(n) is true, i.e., P(n) is true implies that P(n+1) is true.
  • Then P(n) is true for all natural numbers n.

For example, we can prove by induction that all positive integers of the form 2n − 1 are odd. Let P(n) represent "2n − 1 is odd":

(i) For n = 1, 2n − 1 = 2(1) − 1 = 1, and 1 is odd, since it leaves a remainder of 1 when divided by 2. Thus P(1) is true.
(ii) For any n, if 2n − 1 is odd (P(n)), then (2n − 1) + 2 must also be odd, because adding 2 to an odd number results in an odd number. But (2n − 1) + 2 = 2n + 1 = 2(n+1) − 1, so 2(n+1) − 1 is odd (P(n+1)). So P(n) implies P(n+1).
Thus 2n − 1 is odd, for all positive integers n.

The shorter phrase "proof by induction" is often used instead of "proof by mathematical induction".

Proof by contraposition

Proof by contraposition infers the statement "if p then q" by establishing the logically equivalent contrapositive statement: "if not q then not p".

For example, contraposition can be used to establish that, given an integer , if is even, then is even:

Suppose is not even. Then is odd. The product of two odd numbers is odd, hence is odd. Thus is not even. Thus, if is even, the supposition must be false, so has to be even.

Proof by contradiction

In proof by contradiction, also known by the Latin phrase reductio ad absurdum (by reduction to the absurd), it is shown that if some statement is assumed true, a logical contradiction occurs, hence the statement must be false. A famous example involves the proof that is an irrational number:

Suppose that were a rational number. Then it could be written in lowest terms as where a and b are non-zero integers with no common factor. Thus, . Squaring both sides yields 2b2 = a2. Since the expression on the left is an integer multiple of 2, the right expression is by definition divisible by 2. That is, a2 is even, which implies that a must also be even, as seen in the proposition above (in #Proof by contraposition). So we can write a = 2c, where c is also an integer. Substitution into the original equation yields 2b2 = (2c)2 = 4c2. Dividing both sides by 2 yields b2 = 2c2. But then, by the same argument as before, 2 divides b2, so b must be even. However, if a and b are both even, they have 2 as a common factor. This contradicts our previous statement that a and b have no common factor, so we must conclude that it is an irrational number.

To paraphrase: if one could write as a fraction, this fraction could never be written in lowest terms, since 2 could always be factored from numerator and denominator.

Proof by construction

Proof by construction, or proof by example, is the construction of a concrete example with a property to show that something having that property exists. Joseph Liouville, for instance, proved the existence of transcendental numbers by constructing an explicit example. It can also be used to construct a counterexample to disprove a proposition that all elements have a certain property.

Proof by exhaustion

In proof by exhaustion, the conclusion is established by dividing it into a finite number of cases and proving each one separately. The number of cases sometimes can become very large. For example, the first proof of the four color theorem was a proof by exhaustion with 1,936 cases. This proof was controversial because the majority of the cases were checked by a computer program, not by hand.

Probabilistic proof

A probabilistic proof is one in which an example is shown to exist, with certainty, by using methods of probability theory. Probabilistic proof, like proof by construction, is one of many ways to prove existence theorems.

In the probabilistic method, one seeks an object having a given property, starting with a large set of candidates. One assigns a certain probability for each candidate to be chosen, and then proves that there is a non-zero probability that a chosen candidate will have the desired property. This does not specify which candidates have the property, but the probability could not be positive without at least one.

A probabilistic proof is not to be confused with an argument that a theorem is 'probably' true, a 'plausibility argument'. The work toward the Collatz conjecture shows how far plausibility is from genuine proof, as does the disproof of the Mertens conjecture. While most mathematicians do not think that probabilistic evidence for the properties of a given object counts as a genuine mathematical proof, a few mathematicians and philosophers have argued that at least some types of probabilistic evidence (such as Rabin's probabilistic algorithm for testing primality) are as good as genuine mathematical proofs.

Combinatorial proof

A combinatorial proof establishes the equivalence of different expressions by showing that they count the same object in different ways. Often a bijection between two sets is used to show that the expressions for their two sizes are equal. Alternatively, a double counting argument provides two different expressions for the size of a single set, again showing that the two expressions are equal.

Nonconstructive proof

A nonconstructive proof establishes that a mathematical object with a certain property exists—without explaining how such an object can be found. Often, this takes the form of a proof by contradiction in which the nonexistence of the object is proved to be impossible. In contrast, a constructive proof establishes that a particular object exists by providing a method of finding it. The following famous example of a nonconstructive proof shows that there exist two irrational numbers a and b such that itit is a rational number. This proof uses that it is irrational (an easy proof is known since Euclid), but not that it is irrational (this is true, but the proof is not elementary).

Statistical proofs in pure mathematics

The expression "statistical proof" may be used technically or colloquially in areas of pure mathematics, such as involving cryptography, chaotic series, and probabilistic number theory or analytic number theory.  It is less commonly used to refer to a mathematical proof in the branch of mathematics known as mathematical statistics. See also the "Statistical proof using data" section below.

Computer-assisted proofs

Until the twentieth century it was assumed that any proof could, in principle, be checked by a competent mathematician to confirm its validity. However, automated theorem provers and proof assistants are now used to prove theorems and carry out calculations that are too long for any human or team of humans to check; the first proof of the four color theorem is an example of a computer-assisted proof. Some mathematicians are concerned that the possibility of an error in a computer program or a run-time error in its calculations calls the validity of such computer-assisted proofs into question. In practice, the chances of an error invalidating a computer-assisted proof can be reduced by incorporating redundancy and self-checks into calculations, and by developing multiple independent approaches and programs. Errors can never be completely ruled out in case of verification of a proof by humans either, especially if the proof contains natural language and requires deep mathematical insight to uncover the potential hidden assumptions and fallacies involved.

Undecidable statements

A statement that is neither provable nor disprovable from a set of axioms is called undecidable (from those axioms). One example is the parallel postulate, which is neither provable nor refutable from the remaining axioms of Euclidean geometry.

Mathematicians have shown there are many statements that are neither provable nor disprovable in Zermelo–Fraenkel set theory with the axiom of choice (ZFC), the standard system of set theory in mathematics (assuming that ZFC is consistent); see List of statements undecidable in ZFC.

Gödel's (first) incompleteness theorem shows that many axiom systems of mathematical interest will have undecidable statements.

Heuristic mathematics and experimental mathematics

While early mathematicians such as Eudoxus of Cnidus did not use proofs, from Euclid to the foundational mathematics developments of the late 19th and 20th centuries, proofs were an essential part of mathematics. With the increase in computing power in the 1960s, significant work began to be done investigating mathematical objects beyond the proof-theorem framework, in experimental mathematics. Early pioneers of these methods intended the work ultimately to be resolved into a classical proof-theorem framework, e.g. the early development of fractal geometry, which was ultimately so resolved.

Visual proof

Elementary proof

Two-column proof

A two-column proof published in 1913

A particular way of organizing a proof using two parallel columns is often used as a mathematical exercise in elementary geometry classes in the United States. The proof is written as a series of lines in two columns. In each line, the left-hand column contains a proposition, while the right-hand column contains a brief explanation of how the corresponding proposition in the left-hand column is either an axiom, a hypothesis, or can be logically derived from previous propositions. The left-hand column is typically headed "Statements" and the right-hand column is typically headed "Reasons".

Statistical proof using data

Inductive logic proofs and Bayesian analysis

Proofs as mental objects

Ending a proof

Sometimes, the abbreviation "Q.E.D." is written to indicate the end of a proof. This abbreviation stands for "quod erat demonstrandum", which is Latin for "that which was to be demonstrated". A more common alternative is to use a square or a rectangle, such as □ or ∎, known as a "tombstone" or "Halmos" after its eponym Paul Halmos. Often, "which was to be shown" is verbally stated when writing "QED", "□", or "∎" during an oral presentation. Unicode explicitly provides the "end of proof" character, U+220E (∎) (220E(hex) = 8718(dec)).

Virus world hypothesis

From Wikipedia, the free encyclopedia
https://en.wikipedia.org/wiki/Virus_world_hypothesis

The discoverers of viroids (1) (Diener) and bacteriophages (2) (d'Hérelle) both surmised their own versions of a "virus-first hypothesis".

The virus world hypothesis (or the virus-first, the virus early, or the co-evolution hypothesis) proposes that self-replicating virus-like genetic elements existed before cellular life and contributed to its emergence. It is one of several scientific hypotheses that attempt to explain the origin and evolution of viruses.

All modern viruses are obligate parasites that cannot replicate independently of their cellular hosts; thus it may seem more intuitive to assume that viruses originated from cells, an idea known as the "escape hypothesis". However, within the framework of an hypothesized "virus world", modern viruses are held to be possible direct descendants of the very first replicons to arise on Earth, and to have emerged either simultaneously, or before, the evolution of cells. These primordial soup-dwelling replicons could have evolved into archaic virus-like structures, which in turn became the precursors of cellular life forms, with the latter possibly emerging as factories and reservoirs dedicated to virus production and dissemination.

The hypothesis is considered one of the three classical hypotheses of viral origins, although some researchers believe these may not be mutually exclusive: in a "chimeric scenario", it is held that different groups of viruses may have emerged through multiple routes, at different points in time.

History

The idea that viruses represent primordial, pre-cellular forms of life has roots in the earliest decades of virology. The French microbiologist Félix d'Hérelle, discoverer of bacteriophages, proposed that virus-like agents might be ancient replicators. The English evolutionary biologist J. B. S. Haldane developed the conjecture further in his 1929 essay "The Origin of Life", in which the bacteriophage served as his model for the first self-duplicating molecule, and led him to see viruses as a phylogenetic "missing link" between life and non-life.

The "virus world" view was largely displaced through the middle of the twentieth century and remained marginal for several decades. Advances in comparative genomics and structural biology have since revived interest in the origins of viruses; the Russian-American evolutionary biologist Eugene Koonin has described his "primordial virus world" scenario as recapitulating Haldane's ideas "at a new level".

Overview

Model

Hypothesized origin of the main lineages from the primordial gene pool

The virus-first model envisions the pre-cellular stage of life as a diverse pool of competing, virus-like replicators dwelling within networks of inorganic molecules (the so-called "primordial soup"), exchanging genetic material freely and lacking both full-fledged ribosomes and independent metabolism. RNA would have arisen first, followed by retroid elements and then DNA viruses, an order that links the hypothesis to the RNA world hypothesis, as contemporary viruses are argued to reflect evolution spanning from an early RNA world to the modern DNA/protein world. Viroids and ribozymes, as the simplest known self-replicating RNA elements, could be considered the closest extant analogues of these early replicators.

Within this framework, Patrick Forterre proposed that the transition from an RNA world to the modern DNA-based cellular world was itself driven by viruses: three independent DNA viruses may have each displaced the ancestral RNA genome in three separate primordial cell lineages, giving rise to the Bacteria, Archaea, and Eukarya. This accounts for the observed lack of homology between the core DNA polymerases used by the three domains. Forterre introduced the virocell concept to formalise the distinction between the metabolically inert extracellular virion and the metabolically active infected cell, arguing that the latter constitutes the true living form of the virus.[14] Gill and Forterre extended the model by proposing that ancestral extracellular vesicles may have been evolutionary intermediates between simple lipid compartments and the first virions, with early ribovirocells (cells simultaneously capable of dividing and producing virions) representing a transitional stage before the existence of the last universal common ancestor (LUCA). Koonin further proposed that viral capsids may have functioned as a primitive compartment that helped pioneer the plasma membrane architectures eventually adopted by cells.

Phylogenetics

Evolutionary emergence of virus-like particles from RNP-based progenotes, a model linking the RNP world and virus-first theories

The "virus hallmark genes" are a distinct set of conserved genes shared across a wide range of virus groups and notably absent from cellular life. Some of the smallest virus genomes (such as parvoviruses or the single-stranded RNA tombusviruses) consist mostly of these hallmark genes, whereas in the largest viruses these genes comprise a minority. Since the hallmark genes possess only distant homologs in cellular life (which nonetheless appear also to be of viral origin), while also forming a network that connects almost all viruses, their existence therefore seems to suggest descent from a primordial genetic pool predating LUCA, thus constituting an uninterrupted gene flow from the pre-cellular stage, although Koonin suggests that double-stranded RNA and negative-strand RNA viruses are still likely to have independently evolved later.

The conventional assumption that when viral and host genes cluster phylogenetically, the parasitic virus must therefore have derived its genes from the host, has been particularly disputed. Metagenomic surveys of marine environments have shown that the majority of photosynthesis genes detected are of viral origin, display a virus-like codon usage bias, and undergo selection independently of their hosts, suggesting they evolved within the virosphere rather than being captured from cells. Furthermore, viruses collectively constitute the largest reservoir of genetic diversity in the known biosphere, a fact which, with the addition of the hallmark genes having no clear cellular homologs, is argued by Luis P. Villarreal to be difficult to reconcile with a model in which the virosphere is derived from cellular life.

Viroid-first

Unlike the main virus-first scenario, the "viroid-first" or "viroid early" version holds that viroids are not only direct descendants of pre-cellular replicators but also holdovers from the pre-protein RNA world, as evidenced by their use of ribozymes for a stage of replication. Theodor Otto Diener, the discoverer of viroids, proposed in 1989 that their small size, circular structure, ribozyme activity, and complete lack of protein-coding capacity make them more plausible relics of the RNA world than any other known entity, and described them as "living fossils" of pre-cellular evolution. However, a 2022 paper argued that since viroid-like agents have been found only in multicellular eukaryotes, with no representatives in bacteria or archaea, their origin likely postdates rather than predates cellular life, and their secondary structures are attuned to protein-based polymerases rather than the ribozyme polymerases of a pre-cellular setting. They proposed instead that viroids most plausibly arose by "escape" from retrozymes. The discovery of new viroid-like cccRNAs through metatranscriptome mining later caused the authors to reconsider Diener's theory.

Chimeric scenario

A model for the evolution of life forms from a primordial virus world in a chimeric scenario

More recent work has treated the classical hypotheses as complementary. A 2019 Nature article proposed a chimeric scenario in which viral replication modules descended from primordial pre-cellular replicators, consistent with the virus-first view, while genes encoding major capsid proteins were independently recruited from cellular hosts at multiple points during the diversification of the virosphere, consistent with the escape hypothesis.

In the main proposed chimeric scenario, the replication and morphogenetic modules of viruses are argued to have two different evolutionary origins:

New viral lineages could then continue to emerge from cellular sources throughout evolutionary history, while also possessing primordial replication genes, explaining the polyphyletic character of the modern viruses.

Alternatives

Three classical hypotheses of viral origin

The main issue with the primodial virus world is that all known viruses require a host cell for replication, making a pre-cellular virus inconsistent with the standard definition of a virus as an obligate intracellular parasite. Therefore, the hypothesis has been challenged and the existence of an ancient and independent viral world critiqued. Biologists López-García and David Moreira of Paris-Saclay University, known for the Syntrophy hypothesis, have written against the idea of viruses being older than LUCA, or part of the tree of life at all, and claimed that current scientific evidence should downright dismiss the idea. The pair has contended that virus hallmark genes could derive from ancient cellular lineages now extinct, and that viruses lack the structural historical continuity required for inclusion on a tree of life alongside cells. They have also pointed out that not a single hallmark gene is shared across all extant viruses, although this observation does not take the "chimeric scenario"(see above) into account. Supporters Koonin, Senkevich, and Dolja responded that large viral gene sets evolve congruently over hundreds of millions of years, and that the abundance of viral genes lacking any cellular homolog argues against a purely cellular derivation.

Giant viruses

Study of giant viruses has provided mixed evidence for the positioning of viruses in the tree of life. A study analyzing mimiviruses found that the majority of its core replication proteins group phylogenetically with eukaryotic cellular homologs, and that the replication genes show no evidence of recent horizontal gene transfer and are under purifying selection. The authors argued that because the eukaryotic resemblance cannot be explained by recent gene acquisition from a host, it reflects genuine shared ancestry, and concluded that mimiviruses most plausibly descended from a complex cellular ancestor by reductive evolution, contradicting the idea that it represents a relic of a pre-cellular viral lineage. Because viruses leave no fossil record, their evolutionary trajectories must be inferred entirely from extant molecular data, and no analysis to date has definitively resolved the question of viral origins.

Symbiogenic model

In a more complex iteration of the classical regressive hypothesis, the co-evolutionary "symbiogenic" model proposed in 2012 hypothesizes that ancient cells coexisted with ancient virocells and that modern-day viruses evolved by genomic reduction. Their phylogenomic timeline places a communal cellular world first. Viruses would then emerge from a primordial cellular stem line by losing genes and complexity over time, with a key point being that the regression occurred before the advent of parasitism, and that the obligate parasitism of these cell-derived viruses developed much later.

Horizontal gene transfer

From Wikipedia, the free encyclopedia https://en.wikipedia.org/wiki/Horizontal_gene_transfer Tree of life showing vertical and horizontal ge...