Keyboard shortcuts

Press or to navigate between chapters

Press S or / to search in the book

Press ? to show this help

Press Esc to hide this help

Coordinatization and the Theory of

The independence proof closed the logical question about the parallel postulate using models. This page pushes the model-theoretic viewpoint to its sharpest conclusion: elementary Euclidean geometry and the first-order theory of the real numbers are the same object. Descartes' analytic geometry made points into coordinate pairs; Hilbert showed the coordinate field can be built from the synthetic axioms themselves; and Tarski proved the resulting theory — the theory of real closed fields — is complete and decidable. The upshot is a dictionary in which geometric figures are semialgebraic sets, geometric truth is polynomial algebra, and Euclid's Elements is, in principle, a decidable theory. This page is the bridge from the synthetic and logical half of the spine to the coordinate/metric half, and it deepens the model-theory connection sketched in independence.md §5.

References: Hilbert, Grundlagen der Geometrie, chs. 3, 5–6 (segment arithmetic); Tarski, A Decision Method for Elementary Algebra and Geometry (1948/1951); Schwabhäuser–Szmielew–Tarski, Metamathematische Methoden in der Geometrie; Marker, Model Theory: An Introduction, ch. 3; Bochnak–Coste–Roy, Real Algebraic Geometry.

1. Coordinatization: Building the Field from the Axioms

Descartes (1637) supplied the informal bridge — a point is a pair — but the substantive result is Hilbert's segment arithmetic (Streckenrechnung): starting from the synthetic axioms alone, with no numbers assumed, one constructs an ordered field and a bijection of the plane onto its square. We first fix the target notion (the same one used in analysis/real-numbers.md):

Definition (ordered field). A field is a set equipped with two binary operations and and two distinguished elements such that

  • is an abelian group (associative, commutative, identity , inverses );
  • is an abelian group (associative, commutative, identity , inverses );
  • multiplication distributes over addition: .

An ordered field is a field together with a total order compatible with the operations: for all ,

1.1 The construction

Construction (Hilbert's segment arithmetic). Fix a line and two distinct points .

  • Carrier. Let be the set of points of . Set and . (Equivalently, a point names the congruence class of the directed segment , so is the set of signed segment-lengths along .)
  • Addition . For , let be the unique point of obtained by laying off the directed segment with its tail at (rigid transport, guaranteed by the congruence axioms III). The additive inverse is the reflection of across .
  • Multiplication . Fix an auxiliary line through with . For , define to be the unique point given by the intercept theorem is characterized by the proportion constructed by transferring to and drawing the parallel that cuts off on ; the required parallels exist by the parallel axiom.
  • Order . Declare iff lies on the ray from through strictly beyond — i.e. the betweenness relation of the order axioms II, restricted to .

Theorem (Hilbert, Grundlagen §§13–15). With these operations is an ordered field. Moreover:

The two roles of "point." Coordinatization does not define a point — it keeps the Hilbert primitive and merely assigns it a numerical name. Note the point wears two hats here: a point of the base line (call it a line-point, ) is a field element (the carrier is literally " = the points of ", so is the number ), while a point of the plane (a plane-point, ) becomes a pair under the map of §1.2. So the geometry manufactures its own number system out of the points of one line, then re-describes every plane-point by two such numbers.

To say precisely which field object represents a given point, name the representation maps explicitly. It is cleanest to present the carrier abstractly as the set

of congruence classes of directed segments of (with and ), so that "point" and "field element" are genuinely different kinds of object and the representation is a nontrivial map.

Definition (representation map on a line). The coordinate of a line-point is the class of the directed segment from the origin to . Then , , and is a bijection (injective because ; surjective because every class has a representative with tail ). The field object representing is .

The plane-point representation is assembled from two copies of (one per axis) in §1.2; we treat it there.

The map is not just a bijection of sets but an isomorphism of ordered fields onto its image: it carries the geometric segment operations to the field operations,

which is precisely what the Hilbert theorem above asserts. (Under the concrete presentation of the Construction, and a line-point simply is its own field object — the two presentations are isomorphic via , so nothing depends on the choice.) Thus "the field object represents a line-point" means exactly ; the plane case follows in §1.2.

The two named theorems are the coordinatization theorems: the geometry dictates the algebra. Verifying (O1)–(O2) and the group axioms is exactly the content of the segment-transport and similar-triangle lemmas.

1.2 The coordinate isomorphism

The field is built on one line; the whole plane is recovered by a bijection onto that turns geometric primitives into algebra.

The map. Fix two distinct lines through as axes (perpendicular, in Euclidean geometry), each carrying a copy of by §1.1 with the shared origin and a common unit point; write for their line-coordinates (§1.1). Given a point , the parallel axiom provides a unique line through parallel to ; it meets in a single point (incidence axioms), whose field-value is the abscissa . The ordinate is defined symmetrically using the parallel to . Uniqueness of these parallels — hence well-definedness of — is exactly Playfair's form of the parallel postulate; this is where the fifth postulate enters coordinatization. Define

Bijectivity. has an explicit inverse. Given , let be the line through the point parallel to , and the line through parallel to . Since , they meet in a unique point (incidence + parallel axiom), and . Thus is a bijection; the plane is set-theoretically .

Structure preserved. is not merely a bijection but an isomorphism of structures: it carries each geometric primitive to an algebraic condition on coordinates. Writing ,

Geometric relation on Algebraic condition on (via )
lies on a line for some
collinear
betweenness , some
equidistance

The affine rows (lines, collinearity, betweenness, ratios along a line) require only the incidence, order, and parallel axioms — they are consequences of respecting the linear structure of . The metric row (equidistance) is where the congruence axioms III do their work: they force the quadratic form to be the displayed sum of squares once the axes are chosen perpendicular with a common unit. With oblique axes or unequal units one still gets an isomorphic geometry, but the form becomes a general positive-definite quadratic ; choosing an orthonormal frame is precisely diagonalizing to .

What "isomorphism" means here. Let denote the set equipped with the algebraically defined betweenness and equidistance of the table. Then:

Representation theorem. is an isomorphism of relational structures. Consequently every model of the (first-order) plane-geometry axioms with coordinate field is isomorphic to the standard analytic plane over that field.

This is the exact sense in which "the plane maps to the field": the points of are in bijection with the elements of , and the points of are in bijection with , compatibly with all the geometric relations. It is one half of the bi-interpretation of §3 — the geometry is interpreted in the ordered field , and (§3) conversely.

Coordinate independence. The construction depends on choices — the origin , the axes, the unit — but the geometry does not. Two coordinatizations differ by a composite affine map , with ; restricting to frames that preserve the equidistance form gives and the Euclidean isometry group . So coordinates are a gauge: everything geometric is invariant under the change-of-frame group, exactly as in the Erlangen picture. The same construction in dimensions yields a bijection .

Representing lines and planes. A point is represented by a field tuple; the other Hilbert primitives get field representatives too — but of a dual kind, namely the coefficients of their defining equation, taken up to scaling.

  • Lines. Let be the set of lines of . By the table, sends a line to a solution set The triple is determined by only up to a common nonzero scalar (scaling the equation gives the same set), so the representation of lines is a bijection onto these classes — a subset of the projective plane (all of it except the class ). The field object representing a line is thus a projective coordinate triple , dual to the affine point-coordinates.
  • Incidence and duality. Homogenizing a point as , incidence becomes the symmetric vanishing pairing perfectly symmetric between the point triple and the line triple . This is the algebraic source of projective duality: points and lines are both classes of triples, interchanged by swapping the two roles.
  • Planes. In the plane there is only one plane, itself, represented by all of ; the primitive "plane" earns a nontrivial representative in solid geometry. There points are triples, , and a plane is a solution set represented up to scaling by . In general, in dimensions a hyperplane is represented by a class dual to the homogeneous point coordinates , with incidence the vanishing of the symmetric pairing . Lines in space are not hyperplanes and need a separate (Plücker/Grassmann) representation — beyond this page.

So the full dictionary of primitives is: a point a tuple in (§1.1–1.2), while a line or plane a projective class of equation coefficients — points and hyperplanes being dual species of the same field data.

1.3 Which field?

How rich is depends on how strong the axioms are:

Axioms assumedCoordinate field
incidence + order + congruence + parallelssome ordered field
… + straightedge-and-compass closureEuclidean field (closed under of positives)
… + Tarski's first-order continuity schemareal closed field (RCF)
… + full (second-order) Dedekind continuityexactly

Via the plane is , and Euclidean geometry becomes coordinate geometry over , with distance — the analytic form of Pythagoras that the metric-geometry page takes as its flat metric.

Worked example: the standard plane . Take , base line = the -axis, , . Every ingredient reduces to the familiar real operations:

  • Carrier & . The class of is the signed length, so , and the line coordinate reads it off: Under the concrete presentation this is the identity ; the -axis carries the symmetric copy .
  • Addition is transport along : , i.e. ordinary real ; the inverse is the reflection .
  • Order is betweenness on the axis — the usual on .
  • Multiplication is the intercept theorem. With auxiliary line = the -axis, put , on and on ; the parallel to through meets at , since gives . E.g. : line is , its parallel through is , meeting at — the construction returns .
  • Coordinate map . For , the parallel-projections are (meet of the -axis with the vertical through ) and , so With the standard axes is thus the identity (ordinary Cartesian coordinates); e.g. . The distance is the usual . That and come out as identities is an artifact of choosing the standard axes and the concrete presentation : a rotated/translated frame, or the abstract segment-class carrier, makes both genuine (nontrivial) bijections, with an affine map per §1.2.

The primitives, spelled out in this model:

  • Point a pair (in solid geometry, a triple in ). E.g. .
  • Line a solution set , — the usual lines and verticals — represented by the projective class . E.g. is , the -axis is , the vertical is .
  • Plane all of — there is only one. A nontrivial plane-object appears one dimension up: in a plane is ; e.g. is .
  • Incidence. lies on iff ; e.g. since .

is Dedekind-complete, so it sits in the last row of the table (and is in particular real closed). The point of the construction is that these real operations are recovered synthetically — from betweenness and congruence — with no numbers presupposed.

2. Real Closed Fields

An ordered field is real closed if it is first-order indistinguishable from . Equivalent characterizations:

  • every positive element has a square root and every odd-degree polynomial has a root; equivalently
  • is not algebraically closed but is (so sits "one step below" algebraically closed); equivalently
  • (same first-order theory) — this theory is RCF.

Crucially there are many real closed fields, all modelling RCF and so all carrying "the same" elementary Euclidean geometry:

  • itself;
  • the real algebraic numbers — countable and computable;
  • non-Archimedean fields: the hyperreals, Puiseux series, Hahn series, containing genuine infinitesimal segments.

That RCF has models other than is the Löwenheim–Skolem phenomenon, and it is why pinning down uniquely requires the second-order continuity axiom (last row of §1's table).

3. The Bi-Interpretation

The precise sense in which "geometry theory of " is bi-interpretability: each theory is definable inside the other, and the two translations are mutually inverse. Tarski's geometry uses one sort (points) and two primitives — betweenness and equidistance (the first-order axiomatization).

What is a point here? The only primitive. Unlike Hilbert's three sorts (points, lines, planes), Tarski's first-order geometry has a single sort: points. There is no primitive "line": a point is the sole primitive — in the standard model an element of , i.e. a pair of field elements — and a line is a definable set of points , as are circles, segments, and congruence. So "inside the theory of " a point is an element of and everything else is defined from points by polynomial conditions. This single-sort economy is what makes the interpretation below so clean: to interpret geometry in the field you need only say what a point is () and how the point-relations translate — there is no separate line object to account for. (The pair is a point's address relative to a chosen frame, not its intrinsic identity: changing the frame acts by an affine map, per §1.2.)

Geometry field. Fix an origin, a unit, and perpendicular axes (all definable from and ). Coordinates of points along an axis carry definable operations: segment addition gives , the similar-triangles product gives , betweenness gives . This interprets inside the geometry (§1 made this constructive).

Field geometry. Conversely, set points and define the primitives algebraically:

with betweenness the analogous polynomial condition. This interprets the geometry inside RCF.

Because the two interpretations are inverse (up to definable isomorphism), the theories share every model-theoretic invariant: completeness, decidability, quantifier elimination, o-minimality, the same definable sets, the same models. This is the exact content of the slogan.

4. Quantifier Elimination = Semialgebraic Geometry

Tarski's theorem (1930s): RCF admits quantifier elimination in the ordered-field language, and is therefore complete and decidable. Its geometric meaning is the Tarski–Seidenberg theorem. Call a set semialgebraic if it is a Boolean combination of polynomial equalities and inequalities. Then:

Tarski–Seidenberg. The projection of a semialgebraic set is semialgebraic.

Eliminating an existential quantifier is forgetting a coordinate, i.e. projecting a figure onto the remaining axes. Consequences:

  • the definable sets of the geometry are exactly the semialgebraic sets — lines, circles, conics, polygons, and everything built from them by finite unions, intersections, complements, and projections;
  • every first-order geometric statement is equivalent to a quantifier-free polynomial condition on the coordinates.

RCF is thereby the flagship example of o-minimality (see model-theory.md): definable subsets of a line are finite unions of points and intervals — the exact formalization of the classical intuition that a line meets a curve in finitely many points or lies along a whole segment. O-minimality is the modern model-theoretic theory of tame geometry.

5. Decidability and Its Limits

  • A decision procedure for Euclid. Because RCF is decidable, there is an algorithm (Tarski's procedure; in practice Collins' cylindrical algebraic decomposition) deciding the truth of any sentence of elementary geometry — "do the three perpendicular bisectors of a triangle always concur?" is mechanically checkable. Elementary geometry is, in principle, automatable.
  • A canonical smallest model. is the prime model of RCF: it elementarily embeds into every model. Every straightedge-and-compass point already lives there, which is why the decision procedure needs no genuine real analysis.
  • Not categorical. As in §2, non-Archimedean real closed fields give geometries with infinitesimal segments; first-order geometry cannot see the difference. Uniqueness of the Euclidean plane needs the second-order continuity axiom.
  • No conflict with Gödel. Elementary geometry is complete and decidable because it is too weak to define : there is no first-order way to say " is an integer" from and alone, so it cannot encode arithmetic. Adjoin a predicate for and becomes undecidable. The incompleteness theorems bite on arithmetic, not on geometry — a striking inversion of the usual worry.

6. One Field, All Three Geometries

Because everything is definable over the field, the coordinate picture is not special to the flat case. Over any real closed field :

So "the theory of " is a single model-theoretic home for the entire geometry spine, and the independence of the parallel postulate becomes a statement about which conic you interpret, not about which field you use. The next page keeps the coordinates but replaces the global polynomial distance with a local metric tensor, opening the door to variable curvature and the Riemannian synthesis.

7. Summary

Geometric sideAlgebraic / logical side
pointspairs
segment addition / multiplicationfield operations (Hilbert)
Pappus / Desarguescommutativity / associativity of
congruence, betweennessequidistance / order predicates
a figurea semialgebraic set
projecting / eliminating a pointquantifier elimination (Tarski–Seidenberg)
elementary geometrythe complete, decidable theory RCF
the Euclidean planethe model (second-order continuity)

Coordinatization turns Euclid's synthetic axioms into the algebra of a real closed field; Tarski's theorem turns that algebra into a decision procedure; and the whole of elementary geometry — Euclidean and non-Euclidean alike — becomes the study of semialgebraic sets over .