Content deleted Content added
→Congruence and betweenness: Given the other axioms, the order of 'uz' versus 'zu' in the congruence statement 'yu \equiv zu' does not matter, but anyway 'yu \equiv uz' maintains the pattern of the other congruence statements in the hypotheses of the Euclid axiom, whereas 'yu \equiv zu' doesn't, so for purely aesthetic reasons I suggest changing it. That being said this change has no logical substance... |
parameters in continuity axiom are necessary; more statements that cannot be expressed in elementary geometry |
||
(16 intermediate revisions by 9 users not shown) | |||
Line 1:
{{Short description|Axiom set used in first-order logic}}
{{otheruses4|axioms for Euclidean geometry|Tarski's axioms for the [[real numbers]]|Tarski's axiomatization of the reals|Tarski's axioms for [[set theory]]|Tarski–Grothendieck set theory}}
'''Tarski's axioms'''
The axiom system is due to [[Alfred Tarski]] who first presented it in 1926.<ref>Tarski 1959, Tarski and Givant 1999</ref> Other modern axiomizations of Euclidean geometry are [[Hilbert's axioms]] (1899) and [[Birkhoff's axioms]] (1932).
Using his axiom system, Tarski was able to show that the first-order theory of Euclidean geometry is [[Consistency|consistent]], [[Completeness (logic)|complete]] and [[Decidability (logic)|decidable]]: every sentence in its language is either provable or disprovable from the axioms, and we have an algorithm which decides for any given sentence whether it is provable or not.
==Overview==
Line 19 ⟶ 23:
=== Fundamental relations ===
These axioms are a more elegant version of a set Tarski devised in the 1920s as part of his investigation of the metamathematical properties of [[Euclidean plane geometry]]. This objective required reformulating that geometry as a [[first-order logic|first-order theory]]. Tarski did so by positing a [[universe (mathematics)|universe]] of [[point (geometry)|point]]s, with lower case letters denoting variables ranging over that universe. [[Equality (mathematics)|Equality]] is provided by the underlying logic (see [[First-order logic#Equality and its axioms]]).
* ''Betweenness'', a [[triadic relation]]. The [[atomic sentence]] ''Bxyz
* ''[[congruence (geometry)|Congruence]]'' (or "equidistance"), a [[polyadic relation|tetradic relation]]. The [[atomic sentence]] ''Cwxyz
Betweenness captures the [[affine geometry|affine]] aspect (such as the parallelism of lines) of Euclidean geometry; congruence, its [[metric space|metric]] aspect (such as angles and distances). The background logic includes [[identity (mathematics)|identity]], a [[binary relation]]
The axioms below are grouped by the types of relation they invoke, then sorted, first by the number of existential quantifiers, then by the number of atomic sentences. The axioms should be read as [[universal closure]]s; hence any [[free variable]]s should be taken as tacitly [[universal quantifier|universally quantified]].
Line 75 ⟶ 79:
: <math>\exists a \,\forall x\, \forall y\,[(\phi(x) \land \psi(y)) \rightarrow Baxy] \rightarrow \exists b\, \forall x\, \forall y\,[(\phi(x) \land \psi(y)) \rightarrow Bxby].</math>
Let ''r'' be a ray with endpoint ''a''. Let the first order formulae φ and ψ define subsets ''X'' and ''Y'' of ''r'', such that every point in ''Y'' is to the right of every point of ''X'' (with respect to ''a''). Then there exists a point ''b'' in ''r'' lying between ''X'' and ''Y''. This is essentially the [[Dedekind cut]] construction, carried out in a way that avoids quantification over sets.
Note that the formulae φ(''x'') and ψ(''y'') may contain parameters, i.e. free variables different from ''a'', ''b'', ''x,'' ''y''. And indeed, each instance of the axiom scheme that does not contain parameters can be proven from the other axioms.<ref>Schwabhäuser 1983, p. 287-288</ref>
; Lower [[Dimension]]
Line 82 ⟶ 88:
=== Congruence and betweenness ===
[[File:Points in a plane equidistant to two given points lie on a line.svg|right|thumb|Upper dimension axiom]]
; Upper [[Dimension]]
: <math>(xu \equiv xv) \land (yu \equiv yv) \land (zu \equiv zv )\land (u \ne v) \rightarrow (Bxyz \lor Byzx \lor Bzxy).</math>
Line 88 ⟶ 94:
; Axiom of Euclid
* '''A''' dispenses with [[existential quantifier]]s;▼
* '''B''' has the fewest variables and [[atomic sentence]]s;▼
* '''C''' requires but one primitive notion, betweenness. This variant is the usual one given in the literature.▼
: '''A''': <math>((Bxyw \land xy \equiv yw ) \land (Bxuv \land xu \equiv uv) \land (Byuz \land yu \equiv uz)) \rightarrow yz \equiv vw.</math>
Let a line segment join the midpoint of two sides of a given [[triangle]]. That line segment will be half as long as the third side. This is equivalent to the [[interior angle]]s of any triangle summing to two [[right angles]].
Line 103 ⟶ 105:
Given any [[angle]] and any point ''v'' in its interior, there exists a line segment including ''v'', with an endpoint on each side of the angle.
Each variant has an advantage over the others:
▲* '''A''' dispenses with [[existential quantifier]]s;
▲* '''B''' has the fewest variables and [[atomic sentence]]s;
▲* '''C''' requires but one primitive notion, betweenness. This variant is the usual one given in the literature.
; Five Segment
[[File:Five segment.svg|thumb|right|Five segment]]
Line 117 ⟶ 123:
==Discussion==
A number of other properties of Betweenness are derivable as theorems<ref>Tarski and Givant 1999, p. 189</ref> including:
*[[Reflexive relation|Reflexivity]]: ''Bxxy'' ;
*[[Symmetry]]: ''Bxyz'' → ''Bzyx'' ;
Line 126 ⟶ 132:
The last two properties [[total order|totally order]] the points making up a line segment.
The Upper and Lower Dimension axioms together require that any model of these axioms have
When the number of dimensions is greater than 1, Betweenness can be defined in terms of [[congruence relation|congruence]] (Tarski and Givant, 1999). First define the relation "≤" (where <math>ab \leq cd</math> is interpreted "the length of line segment <math>ab</math> is less than or equal to the length of line segment <math>cd</math>"):
Line 135 ⟶ 141:
:<math>Bxyz \leftrightarrow \forall u ( ( ux \le xy \land uz \le zy ) \rightarrow u = y ).</math>
The Axiom Schema of Continuity assures that the ordering of points on a line is [[Dedekind complete|complete]] (with respect to first-order definable properties).
The Axioms of [[Pasch's axiom|Pasch]] and Euclid are well known. The ''Segment Construction'' axiom makes [[measurement]] and the [[Cartesian coordinate system]] possible—simply assign the length 1 to some arbitrary non-empty line segment. Indeed, it is shown in (Schwabhäuser 1983) that by specifying two distinguished points on a line, called 0 and 1, we can define an addition, multiplication and ordering, turning the set of points on that line into a [[Real closed field|real-closed ordered field]]. We can then introduce coordinates from this field, showing that every model of Tarski's axioms is isomorphic to the two-dimensional plane over some real-closed ordered field.
Let ''wff'' stand for a [[well-formed formula]] (or syntactically correct formula) of elementary geometry. Tarski and Givant (1999: 175) proved that elementary geometry is:▼
*[[consistency|Consistent]]: There is no wff such that it and its negation are both theorems;▼
The standard geometric notions of parallelism and intersection of lines (where lines are represented by two distinct points on them), right angles, congruence of angles, similarity of triangles, tangency of lines and circles (represented by a center point and a radius) can all be defined in Tarski's system.
*[[complete theory|Complete]]: Every sentence or its negation is a theorem provable from the axioms;▼
*[[Decidability (logic)|Decidable]]: There exists an [[algorithm]] that assigns a [[truth value]] to every sentence. This follows from Tarski's:▼
▲Let ''wff'' stand for a [[well-formed formula]] (or syntactically correct first-order formula)
▲*[[consistency|Consistent]]: There is no wff such that it and its negation
▲*[[complete theory|Complete]]: Every
▲*[[Decidability (logic)|Decidable]]: There exists an [[algorithm]] that
** [[Decision procedure]] for the [[real closed field]], which he found by [[quantifier elimination]] (the [[Tarski–Seidenberg theorem]]);
**Axioms admitting
This has the consequence that every statement of (second-order, general) Euclidean geometry which can be formulated as a first-order sentence in Tarski's system is true if and only if it is provable in Tarski's system, and this provability can be automatically checked with Tarski's algorithm. This, for instance, applies to all theorems in [[Euclid's Elements]], Book I. An example of a theorem of Euclidean geometry which cannot be so formulated is the [[Archimedean property]]: to any two positive-length line segments ''S''<sub>1</sub> and ''S''<sub>2</sub> there exists a natural number ''n'' such that ''nS''<sub>1</sub> is longer than ''S''<sub>2</sub>. (This is a consequence of the fact that there are real-closed fields that contain infinitesimals.<ref>Greenberg 2010</ref>) Other notions that cannot be expressed in Tarski's system are the [[Straightedge and compass construction|constructability with straightedge and compass]] and statements that talk about "all polygones" etc.<ref>{{cite journal |author=McNaughton, Robert |year=1953 |title=Review: ''A decision method for elementary algebra and geometry'' by A. Tarski |url=https://www.ams.org/journals/bull/1953-59-01/S0002-9904-1953-09664-1/S0002-9904-1953-09664-1.pdf |journal=Bull. Amer. Math. Soc. |volume=59 |issue=1 |pages=91–93 |doi=10.1090/s0002-9904-1953-09664-1 |doi-access=free}}</ref>
Gupta (1965) proved the above axioms independent, ''Pasch'' and ''Reflexivity of Congruence'' excepted.▼
▲Gupta (1965) proved the
Negating the Axiom of Euclid yields [[hyperbolic geometry]], while eliminating it outright yields [[absolute geometry]]. Full (as opposed to elementary) Euclidean geometry requires giving up a first order axiomatization: replace φ(''x'') and ψ(''y'') in the axiom schema of Continuity with ''x'' ∈ ''A'' and ''y'' ∈ ''B'', where ''A'' and ''B'' are universally quantified variables ranging over sets of points.
==Comparison with Hilbert's system==
[[Hilbert's axioms]] for plane geometry number 16, and include Transitivity of Congruence and a variant of the Axiom of Pasch. The only notion from intuitive geometry invoked in the remarks to Tarski's axioms is [[triangle]]. (Versions '''B''' and '''C''' of the Axiom of Euclid refer to "circle" and "angle," respectively.) Hilbert's axioms also require "ray," "angle," and the notion of a triangle "including" an angle. In addition to betweenness and congruence, Hilbert's axioms require a primitive [[binary relation]] "on," linking a point and a line.
Hilbert Hilbert's system is therefore considerably stronger: every [[Model theory|model]] is isomorphic to the real plane <math>\R^2</math> (using the standard notions of points and lines). By contrast, Tarski's system has many non-isomorphic models: for every real-closed field ''F'', the plane ''F<sup>2</sup>'' provides one such model (where betweenness and congruence are defined in the obvious way).<ref>Schwabhäuser 1983, section I.16</ref>
The first four groups of axioms of [[Hilbert's axioms]] for plane geometry are bi-interpretable with Tarski's axioms minus continuity.
Line 159 ⟶ 173:
==Notes==
{{reflist}}
==References==
Line 172 ⟶ 186:
|url = https://archive.org/details/gdelstheoreminco0000fran
}}
*{{cite journal |last1=Givant
* {{Cite journal |last=Greenberg |first=Marvin Jay |date=2010 |title=Old and New Results in the Foundations of Elementary Plane Euclidean and Non-Euclidean Geometries |url=https://maa.org/sites/default/files/pdf/upload_library/22/Ford/Greenberg2011.pdf |journal=The American Mathematical Monthly |volume=117 |issue=3 |pages=198 |doi=10.4169/000298910x480063}}
* {{cite thesis |last1=Gupta |first1=H. N. |title=Contributions to the Axiomatic Foundations of Geometry |date=1965 |publisher=University of California-Berkeley |isbn= |edition= |url=https://www.proquest.com/openview/afb5fc16333dd3ea8370405ab8cd5886/1?pq-origsite=gscholar&cbl=18750&diss=y |access-date= |language=en |format= |type= Ph.D. thesis |chapter=}}
*{{Citation
| last1=Tarski
Line 186 ⟶ 201:
| year=1959
| chapter=What is elementary geometry?
| pages=16–29}}.
**Available as a 2007 [https://books.google.com/books?id=eVVKtnKzfnUC&pg=PA16 reprint], Brouwer Press, {{isbn|1-4437-2812-8}} *{{Citation |doi=10.2307/421089 |last1=Tarski |first1=Alfred |author1-link=Alfred Tarski |archive-date= |last2=Givant |first2=Steven |title=Tarski's system of geometry |mr=1791303 |year=1999 |archive-url= |url=https://citeseerx.ist.psu.edu/document?repid=rep1&type=pdf&doi=ae7daa12902dd37449fbfd21ff25e9a611e83212 |journal=The Bulletin of Symbolic Logic |issn=1079-8986 |volume=5 |issue=2 |pages=175–214 |jstor=421089 |citeseerx=10.1.1.27.9012 |s2cid=18551419}}
* {{cite book |last1=Schwabhäuser |first1=W. |last2=Szmielew |first2=W. |author2-link=Wanda Szmielew | last3=Tarski | first3=Alfred |author3-link=Alfred Tarski |title=Metamathematische Methoden in der Geometrie |date=1983 |publisher=Springer-Verlag}}
*{{cite journal | last1 = Szczerba | first1 = L. W. | year = 1986 | title = Tarski and Geometry | journal = Journal of Symbolic Logic | volume = 51 | issue = 4| pages = 907–12 | url=https://www.jstor.org/stable/pdf/2273904.pdf| doi=10.2307/2273904| jstor = 2273904 | s2cid = 35275962 }}▼
{{Mathematical logic}}
{{Authority control}}
▲*{{cite journal | last1 = Szczerba | first1 = L. W. | year = 1986 | title = Tarski and Geometry | journal = Journal of Symbolic Logic | volume = 51 | issue = 4| pages = 907–12 | doi=10.2307/2273904| jstor = 2273904 }}
[[Category:Elementary geometry]]
|