Movatterモバイル変換


[0]ホーム

URL:


Wikipedia

Axiomatic system

(Redirected fromAxiomatic method)
This article has multiple issues. Please helpimprove it or discuss these issues on thetalk page.(Learn how and when to remove these messages)
This article includes a list ofgeneral references, butit lacks sufficient correspondinginline citations. Please help toimprove this article byintroducing more precise citations.(March 2013) (Learn how and when to remove this message)
This articleneeds attention from an expert in Mathematics. The specific problem is:Few citations despite the degree of detail.WikiProject Mathematics may be able to help recruit an expert.(January 2025)
(Learn how and when to remove this message)

Inmathematics andlogic, anaxiomatic system is anyset ofprimitive notions andaxioms to logically derivetheorems. Atheory is a consistent, relatively-self-contained body of knowledge which usually contains an axiomatic system and all its derived theorems. An axiomatic system that is completely described is a special kind offormal system. A formal theory is an axiomatic system (usually formulated withinmodel theory) that describes a set of sentences that is closed under logical implication.[1] Aformal proof is a complete rendition of amathematical proof within a formal system.

Properties

edit

An axiomatic system is said to beconsistent if it lackscontradiction. That is, it is impossible to derive both a statement and its negation from the system's axioms. Consistency is a key requirement for most axiomatic systems, as the presence of contradiction would allow any statement to be proven (principle of explosion).

In an axiomatic system, an axiom is calledindependent if it cannot be proven or disproven from other axioms in the system. A system is called independent if each of its underlying axioms is independent. Unlike consistency, independence is not a necessary requirement for a functioning axiomatic system — though it is usually sought after to minimize the number of axioms in the system.

An axiomatic system is calledcomplete if for every statement, either itself or its negation is derivable from the system's axioms (equivalently, every statement is capable of being proven true or false).[2]

Relative consistency

edit

Beyond consistency, relative consistency is also the mark of a worthwhile axiom system. This describes the scenario where the undefined terms of a first axiom system are provided definitions from a second, such that the axioms of the first are theorems of the second.

A good example is the relative consistency ofabsolute geometry with respect to the theory of thereal number system.Lines andpoints are undefined terms (also calledprimitive notions) in absolute geometry, but assigned meanings in the theory of real numbers in a way that is consistent with both axiom systems.[citation needed]

Models

edit

Amodel for an axiomatic system is a well-definedset, which assigns meaning for the undefined terms presented in the system, in a manner that is correct with the relations defined in the system. The existence of aconcrete model proves theconsistency of a system[disputeddiscuss]. A model is called concrete if the meanings assigned are objects and relations from the real world[clarification needed], as opposed to anabstract model which is based on other axiomatic systems.

Models can also be used to show the independence of an axiom in the system. By constructing a valid model for a subsystem without a specific axiom, we show that the omitted axiom is independent if its correctness does not necessarily follow from the subsystem.

Two models are said to beisomorphic if a one-to-one correspondence can be found between their elements, in a manner that preserves their relationship.[3] An axiomatic system for which every model is isomorphic to another is calledcategorial (sometimescategorical). The property of categoriality (categoricity) ensures the completeness of a system, however the converse is not true: Completeness does not ensure the categoriality (categoricity) of a system, since two models can differ in properties that cannot be expressed by thesemantics of the system.

Example

edit

As an example, observe the following axiomatic system, based onfirst-order logic with additional semantics of the followingcountably infinitely many axioms added (these can be easily formalized as anaxiom schema):

x1:x2:¬(x1=x2){\displaystyle \exists x_{1}:\exists x_{2}:\lnot (x_{1}=x_{2})}  (informally, there exist two different items).
x1:x2:x3:¬(x1=x2)¬(x1=x3)¬(x2=x3){\displaystyle \exists x_{1}:\exists x_{2}:\exists x_{3}:\lnot (x_{1}=x_{2})\land \lnot (x_{1}=x_{3})\land \lnot (x_{2}=x_{3})}  (informally, there exist three different items).
...{\displaystyle ...} 

Informally, this infinite set of axioms states that there are infinitely many different items. However, the concept of aninfinite set cannot be defined within the system — let alone thecardinality of such a set.

The system has at least two different models – one is thenatural numbers (isomorphic to any other countably infinite set), and another is the real numbers (isomorphic to any other set with thecardinality of the continuum). In fact, it has an infinite number of models, one for each cardinality of an infinite set. However, the property distinguishing these models is their cardinality — a property which cannot be defined within the system. Thus the system is not categorial. However it can be shown to be complete, for example by using theŁoś–Vaught test.

Axiomatic method

edit

Stating definitions and propositions in a way such that each new term can be formally eliminated by the priorly introduced terms requires primitive notions (axioms) to avoidinfinite regress. This way of doing mathematics is called theaxiomatic method.[4]

A common attitude towards the axiomatic method islogicism. In their bookPrincipia Mathematica,Alfred North Whitehead andBertrand Russell attempted to show that all mathematical theory could be reduced to some collection of axioms. More generally, the reduction of a body of propositions to a particular collection of axioms underlies the mathematician's research program. This was very prominent in the mathematics of the twentieth century, in particular in subjects based aroundhomological algebra.

The explication of the particular axioms used in a theory can help to clarify a suitable level of abstraction that the mathematician would like to work with. For example, mathematicians opted thatrings need not becommutative, which differed fromEmmy Noether's original formulation. Mathematicians decided to considertopological spaces more generally without theseparation axiom whichFelix Hausdorff originally formulated.

TheZermelo–Fraenkel set theory, a result of the axiomatic method applied to set theory, allowed the "proper" formulation of set-theory problems and helped avoid the paradoxes ofnaïve set theory. One such problem was thecontinuum hypothesis. Zermelo–Fraenkel set theory, with the historically controversialaxiom of choice included, is commonly abbreviatedZFC, where "C" stands for "choice". Many authors useZF to refer to the axioms of Zermelo–Fraenkel set theory with the axiom of choice excluded.[5] Today ZFC is the standard form ofaxiomatic set theory and as such is the most commonfoundation of mathematics.

History

edit
Further information:History of mathematics

Mathematical methods developed to some degree of sophistication in ancient Egypt, Babylon, India, and China, apparently without employing the axiomatic method.

Euclid ofAlexandria authored the earliest extant axiomatic presentation ofEuclidean geometry andnumber theory. His idea begins with five undeniable geometric assumptions calledaxioms. Then, using these axioms, he established the truth of other propositions byproofs, hence the axiomatic method.[6]

Many axiomatic systems were developed in the nineteenth century, includingnon-Euclidean geometry, the foundations ofreal analysis,Cantor'sset theory,Frege's work on foundations, andHilbert's 'new' use of axiomatic method as a research tool. For example,group theory was first put on an axiomatic basis towards the end of that century. Once the axioms were clarified (thatinverse elements should be required, for example), the subject could proceed autonomously, without reference to thetransformation group origins of those studies.

Issues

edit

In practice, not every proof is traced back to the axioms of the system it belongs. For example, a number-theoretic statement might be expressible in the language of arithmetic (i.e. the language of the Peano axioms) and a proof might be given that appeals totopology orcomplex analysis. It might not be immediately clear whether another proof can be found that derives itself solely from the Peano axioms.

Any more-or-less arbitrarily chosen system of axioms is the basis of some mathematical theory. Philosophers of mathematics sometimes assert that mathematicians choose axioms "arbitrarily", but it is possible that although they may appear arbitrary when viewed only from the point of view of the canons of deductive logic, that appearance is due to a limitation on the purposes that deductive logic serves.

Example: The Peano axiomatization of natural numbers

edit
Main article:Peano axioms

The mathematical system ofnatural numbers 0, 1, 2, 3, 4, ... is based on an axiomatic system first devised by the mathematicianGiuseppe Peano in 1889. He chose the axioms, in the language of a single unary function symbolS (short for "successor"), for the set of natural numbers to be:

  • There is a natural number 0.
  • Every natural numbera has a successor, denoted bySa.
  • There is no natural number whose successor is 0.
  • Distinct natural numbers have distinct successors: ifab, thenSaSb.
  • If a property is possessed by 0 and also by the successor of every natural number it is possessed by, then it is possessed by all natural numbers ("Induction axiom").

Axiomatization

edit

Inmathematics,axiomatization is the process of taking a body of knowledge and working backwards towards its axioms. It is the formulation of a system of statements (i.e.axioms) that relate a number of primitive terms — in order that aconsistent body ofpropositions may be deriveddeductively from these statements. Thereafter, theproof of any proposition should be, in principle, traceable back to these axioms.

See also

edit
Wikiquote has quotations related toAxiomatic system.

References

edit
  1. ^Weisstein, Eric W."Theory".mathworld.wolfram.com. Retrieved2019-10-31.
  2. ^Weisstein, Eric W."Complete Axiomatic Theory".mathworld.wolfram.com. Retrieved2019-10-31.
  3. ^Hodges, Wilfrid; Scanlon, Thomas (2018),"First-order Model Theory", in Zalta, Edward N. (ed.),The Stanford Encyclopedia of Philosophy (Winter 2018 ed.), Metaphysics Research Lab, Stanford University, retrieved2019-10-31
  4. ^"Set Theory and its Philosophy, a Critical Introduction S.6; Michael Potter, Oxford, 2004
  5. ^Weisstein, Eric W."Zermelo-Fraenkel Axioms".mathworld.wolfram.com. Retrieved2019-10-31.
  6. ^Lehman, Eric; Meyer, Albert R; Leighton, F Tom.Mathematics for Computer Science(PDF). Retrieved2 May 2023.

Further reading

edit

[8]ページ先頭

©2009-2025 Movatter.jp