Axiom
|
|
In epistemology, an axiom is a self-evident truth upon which other knowledge must rest, from which other knowledge is built up. Not all epistemologists agree that any axioms, understood in that sense, exist.
In mathematics, an axiom is not necessarily a self-evident truth but rather, a formal logical expression used in a deduction to yield further results. Mathematics distinguishes two types of axioms: logical axioms and non-logical axioms.
| Contents |
Etymology
The word axiom comes from the Greek word αξιωμα (axioma), which means that which is deemed worthy or fit or that which is considered self-evident. The word comes from αξιοειν (axioein), meaning to deem worthy, which in turn comes from αξιος (axios), meaning worthy. Among the ancient Greek philosophers an axiom was a claim which could be seen to be true without any need for proof.
Mathematics
In the field of mathematical logic, a clear distinction is made between two notions of axioms: logical axioms and non-logical axioms.
Logical axioms
These are certain formulas in a language that are universally valid, that is, formulas that are satisfied by every structure under every variable assignment function. More colloquially, these are statements that are true in any possible universe, under any possible interpretation and with any assignment of values. Usually one takes as logical axioms some minimal set of tautologies that is sufficient for proving all tautologies in the language.
Examples
In the propositional calculus it is common to take as logical axioms all formulas of the following forms, where <math>\phi<math>, <math>\psi<math>, and <math>\chi<math> can be any formulas of the language:
- <math>\phi \to (\psi \to \phi)<math>
- <math>(\phi \to (\psi \to \chi)) \to ((\phi \to \psi) \to (\phi \to \chi))<math>
- <math>(\lnot \phi \to \lnot \psi) \to (\psi \to \phi)<math>
Each of these patterns is an axiom schema, a rule for generating an infinite number of axioms. For example, if <math>A<math>, <math>B<math>, and <math>C<math> are propositional variables, then <math>A \to (B \to A)<math> and <math>(A \to \lnot B) \to (C \to (A \to \lnot B))<math> are both instances of axiom schema 1, and hence are axioms. It can be shown that with only these three axiom schemata and modus ponens, one can prove all tautologies of the propositional calculus. It can also be shown that no pair of these schemata is sufficient for proving all tautologies with modus ponens.
These axiom schemata are also used in the predicate calculus, but additional logical axioms are needed.
Example. Let <math>\mathfrak{L}\,<math> be a first-order language. For each variable <math>x\,<math>, the formula
<math>x = x<math>
is universally valid.
This means that for any variable symbol <math>x\,<math>, the formula <math>x = x\,<math> can be regarded as an axiom. Also, in this example, for this not to fall into vagueness and a never-ending series of "primitive notions", either a precise notion of what we mean by <math>x = x\,<math> (or, for all what matters, "to be equal") has to be well established first, or a purely formal and syntactical usage of the symbol <math>=\,<math> has to be enforced, and mathematical logic does indeed that.
Another, more interesting example, is that which provides us with what is known as universal instantiation:
Example. Given a formula <math>\phi\,<math> in a first-order language <math>\mathfrak{L}\,<math>, a variable <math>x\,<math> and a term <math>t\,<math> that is substitutable for <math>x\,<math> in <math>\phi\,<math>, the formula
<math>\forall x \phi \to \phi^x_t<math>
is universally valid.
Informally speaking, this example allows us to state that if we know that a certain property <math>P\,<math> holds for every <math>x\,<math> and that if <math>t\,<math> stands for a particular object in our structure, then we should be able to claim <math>P(t)\,<math>. Again, we are claiming that the formula <math>\forall x \phi \to \phi^x_t<math> is valid, that is, we must be able to give a "proof" of this fact, or more properly speaking, a metaproof. Actually, these examples are metatheorems of our theory of mathematical logic since we are dealing with the very concept of proof itself. Aside from this, we can also have existential generalization:
Axiom scheme. Given a formula <math>\phi\,<math> in a first-order language <math>\mathfrak{L}\,<math>, a variable <math>x\,<math> and a term <math>t\,<math> that is substitutable for <math>x\,<math> in <math>\phi\,<math>, the formula
<math>\phi^x_t \to \exists x \phi<math>
is universally valid.
Non-logical axioms
Non-logical axioms are formulas that play the role of theory-specific assumptions. Reasoning about two different structures, for example the natural numbers and the integers, may involve the same logical axioms; the non-logical axioms aim to capture what is special about a particular structure (or set of structures, such as groups). Thus non-logical axioms, unlike logical axioms, are not tautologies. Another name for a non-logical axiom is postulate.
Almost every modern mathematical theory starts from a given set of non-logical axioms, and it was thought that in principle every theory could be axiomatized in this way and formalized down to the bare language of logical formulas. This turned out to be impossible and proved to be quite a story (see below).
Non-logical axioms are often simply referred to as axioms in mathematical discourse. This does not mean that it is claimed that they are true in some absolute sense. For example, in some groups, the group operation is commutative, and this can be asserted with the introduction of an additional axiom, but without this axiom we can do quite well developing (the more general) group theory, and we can even take its negation as an axiom for the study of non-commutative groups.
Thus, an axiom is an elementary basis for a formal logic system that together with the rules of inference define a deductive system.
Examples
This section gives examples of mathematical theories that are developed entirely from a set of non-logical axioms (axioms, henceforth). A rigorous treatment of any of these topics begins with a specification of these axioms.
Basic theories, such as arithmetic, real analysis (sometimes referred to as the theory of functions of one real variable), linear algebra, and complex analysis (a.k.a. complex variables), are often introduced non-axiomatically in mostly technical studies, but any rigorous course in these subjects always begins by presenting its axioms.
Geometries such as Euclidean geometry, projective geometry, symplectic geometry.
The study of topology in mathematics extends all over through point set topology, algebraic topology, differential topology, and all the related paraphernalia, such as homology theory, homotopy theory. The development of abstract algebra brought with itself group theory, rings and fields, Galois theory.
This list could be expanded to include most fields of mathematics, including axiomatic set theory, measure theory, ergodic theory, probability, representation theory, and differential geometry.
Arithmetic
The Peano axioms are the most widely used axiomatization of arithmetic. They are a set of axioms strong enough to prove many important facts about number theory and they allowed Gödel to establish his famous second incompleteness theorem.
We have a language <math>\mathfrak{L}_{NT} = \{0, S\}\,<math> where <math>0\,<math> is a constant symbol and <math>S\,<math> is a unary function and the following axioms:
- <math>(\forall x) \lnot (Sx = 0) <math>
- <math>(\forall x)(\forall y)(Sx = Sy \to x = y) <math>
- <math>((\phi(0) \land \forall x\,(\phi(x) \to \phi(Sx))) \to \forall x\phi(x)<math> for any <math>\mathfrak{L}_{NT}\,<math> formula <math>\phi\,<math> with one free variable.
The standard structure is <math>\mathfrak{N} = <\N, 0, S>\,<math> where <math>\N\,<math> is the set of natural numbers, <math>S\,<math> is the successor function and <math>0\,<math> is naturally interpreted as the number 0.
Euclidean geometry
Probably the oldest, and most famous, list of axioms are the 4 + 1 Euclid's postulates of plane geometry. This set of axioms turns out to be incomplete, and many more postulates are necessary to rigorously characterize his geometry (Hilbert used 23).
The axioms are referred to as "4 + 1" because for nearly two millennia the fifth (parallel) postulate ("through a point outside a line there is exactly one parallel") was suspected of being derivable from the first four. Ultimately, the fifth postulate was found to be independent of the first four. Indeed, one can assume that no parallels through a point outside a line exist, that exactly one exists, or that infinitely many exist. These choices give us alternative forms of geometry in which the interior angles of a triangle add up to less than, exactly, or more than a straight line respectively and are known as elliptic, Euclidean, and hyperbolic geometries.
Real analysis
The object of study is the real numbers. The real numbers are uniquely picked out (up to isomorphism) by the properties of a complete ordered field. However, expressing these properties as axioms requires use of second-order logic. The Löwenheim-Skolem theorems tell us that if we restrict ourselves to first-order logic, any axiom system for the reals admits other models, including both models that are smaller than the reals and models that are larger. Some of the latter are studied in non-standard analysis.
Role in mathematical logic
Deductive systems and completeness
A deductive system consists of a set <math>\Lambda\,<math> of logical axioms, a set <math>\Sigma\,<math> of non-logical axioms, and a set <math>\{(\Gamma, \phi)\}\,<math> of rules of inference. A desirable property of a deductive system is that it be complete. A system is said to be complete if, for all formulas <math>\phi<math>,
if <math>\Sigma \models \phi<math> then <math>\Sigma \vdash \phi<math>
that is, for any statement that is a logical consequence of <math>\Sigma<math> there actually exists a deduction of the statement from <math>\Sigma\,<math>. This is sometimes expressed as "everything that is true is provable", but it must be understood that "true" here means "made true by the set of axioms", and not, for example, "true in the intended interpretation". Gödel's completeness theorem establishes the completeness of a certain commonly-used type of deductive system.
Note that "completeness" has a different meaning here than it does in the context of Gödel's first incompleteness theorem, which states that no recursive, consistent set of non-logical axioms <math>\Sigma\,<math> of the Theory of Arithmetic is complete, in the sense that there will always exist an arithmetic statement <math>\phi\,<math> such that neither <math>\phi\,<math> nor <math>\lnot\phi\,<math> can be proved from the given set of axioms.
There is thus, on the one hand, the notion of completeness of a deductive system and on the other hand that of completeness of a set of non-logical axioms. The completeness theorem and the incompleteness theorem, despite their names, do not contradict one another.
Further discussion
Early mathematicians regarded axiomatic geometry as a model of physical space, and obviously there could only be one such model. The idea that alternative mathematical systems might exist was very troubling to mathematicians of the 19th century and the developers of systems such as Boolean algebra made elaborate efforts to derive them from traditional arithmetic. Galois showed just before his untimely death that these efforts were largely wasted, but that the grand parallels between axiomatic systems could be put to good use, as he algebraically solved many classical geometrical problems. Ultimately, the abstract parallels between algebraic systems were seen to be more important than the details and modern algebra was born. In the modern view we may take as axioms any set of formulas we like, so long as they are consistent.
See also
- Axiomatic system
- Peano axioms
- Axiom of choice
- Axiom of countability
- Axiomatic set theory
- Parallel postulate
- Continuum hypothesis
- Axiomatization
- List of axioms
External links
- Metamath axioms page (http://us.metamath.org/mpegif/mmset.html#axioms)be:Аксіёма
cs:Axiom da:Aksiom de:Axiom et:Aksioom es:Axioma eo:Aksiomo fr:Axiome he:אקסיומה hr:Aksiom hu:Axióma id:Aksioma io:Axiomo it:Assioma (matematica) ja:公理 ko:공리 lt:Aksioma nl:Axioma no:Aksiom pl:Aksjomat pt:Axioma ru:Аксиома sl:Aksiom sv:Axiom vi:Tiên đề uk:Аксіома zh:公理
Axiom is also the name of a 3D graphics engine.