Midpoint¶
The point that divides a specified segment between two endpoints into equal halves, expressed by affine averaging or half-length along a chosen geodesic when those structures apply.
Core Idea¶
A midpoint divides a specified segment between endpoints A and B into equal halves. On a Euclidean straight segment, it lies on AB with equal subsegment lengths, as in Euclid's construction. In real affine coordinates it is the equal-weight combination M=(A+B)/2. On a chosen metric geodesic, it lies halfway along the distance-realizing path. These are related geometric realizations, but the coordinate formula requires affine structure and uniqueness across paths requires additional hypotheses.[ref-1a169ba940ae][ref-e9e4ed1ccd5f][^ref-faae92cbeae4]
The point must lie on the segment: equal distance from A and B alone does not identify it. A geodesic metric space can have more than one shortest segment between the same endpoints and hence more than one midpoint. CAT(0) geometry supplies a unique connecting geodesic; ordinary metric geometry does not automatically do so.[^ref-faae92cbeae4]
Scope of Application¶
Euclid I.10 bisects a finite straight line AB at D and proves AD=DB. In real affine coordinates, A=(0,0) and B=(4,2) give M=(2,1). These numbers are an illustrative deduction from the midpoint rule, not Euclid's own notation. The coordinate-affine notes also define (a+b)/2 over fields where 2 is invertible, but an arbitrary field need not provide real betweenness or length.[ref-1a169ba940ae][ref-e9e4ed1ccd5f]
Bridson and Haefliger give R-trees as CAT(kappa) examples and prove unique connecting geodesics in CAT(0) spaces. Place A one unit from a tree junction on one branch and B three units from it on another. The connecting path has length four; its midpoint is two units from either endpoint, one unit into B's branch beyond the junction. That numerical tree is an editorial worked case. No vector average of the tree points is presumed.[^ref-faae92cbeae4]
Clarity¶
The test is endpoints → chosen connecting segment → halfway point on that segment. In real affine geometry, choose parameter t=½ in P(t)=(1-t)A+tB. In a metric geodesic with distance parameter from zero to L, take the point at L/2. These operations need their respective structures; a metric alone does not define (A+B)/2.[ref-e9e4ed1ccd5f][ref-faae92cbeae4]
For a near miss, (2,3) is equidistant from (0,0) and (4,0) but is off their straight segment. For a uniqueness boundary, antipodal endpoints on a circle with its intrinsic arc-length metric have two shortest semicircular segments and two different midpoints. The latter remains a valid midpoint on each chosen arc; it only defeats an endpoint-only uniqueness claim.[^ref-faae92cbeae4]
Manages Complexity¶
A midpoint replaces a whole segment with a reproducible geometric reference point. It supports further constructions such as Euclidean medians or recursive subdivision of unique tree geodesics, but those applications do not define the point. Stating the segment and geometry prevents an attractive arithmetic shortcut from being applied where addition, length or unique paths are absent.[ref-1a169ba940ae][ref-e9e4ed1ccd5f][^ref-faae92cbeae4]
Abstract Reasoning¶
Given endpoints in real affine space, calculate M=A+(B-A)/2, the equal-weight affine point on the straight segment. Given a selected metric geodesic c:[0,L]→X parameterized by distance, take M=c(L/2), so each endpoint is at distance L/2 along that path. If several shortest paths connect the endpoints, repeat the procedure for the chosen path; do not assert a unique endpoint-determined answer without a unique-geodesic theorem.[ref-e9e4ed1ccd5f][ref-faae92cbeae4]
The coordinate formula can extend algebraically to fields of characteristic not two, as the notes state. That extension by itself does not supply an ordered real segment or metric half-length. Likewise, a metric tree supplies half-length without supplying affine vector addition.[ref-e9e4ed1ccd5f][ref-faae92cbeae4]
Knowledge Transfer¶
The Euclidean plane and a branching R-tree share the same role structure: two endpoints, a designated connecting segment, and one point dividing that segment equally. The plane uses straight affine interpolation and Euclidean lengths; the tree uses its unique path and intrinsic path length. The relation transfers, but the plane's arithmetic formula does not.[ref-1a169ba940ae][ref-e9e4ed1ccd5f][^ref-faae92cbeae4]
Both positive cases remain mathematical geometry. A broader nongeometric halfway-placement abstraction is a future-Prime question, not an approved parent of this specialist entry. The live Geodesic and Path entries classify paths, whereas Midpoint classifies a point. Partition and Balance are related ideas but no all-instance typed parent passed review; the graph currently records Midpoint as an approved unparented root.
Example¶
Euclidean segment. A=(0,0), B=(4,2) → endpoints; straight AB → specified segment; M=(2,1) → parameter ½; equal displacement and Euclidean lengths → equal halves. Euclid I.10 supplies the classical bisection proof, while the coordinates display the same relation.[ref-1a169ba940ae][ref-e9e4ed1ccd5f]
Branching R-tree. A and B lie one and three units from a junction on different branches → endpoints; unique length-four tree route → chosen geodesic; a point one unit along B's branch from the junction → midpoint two units from both ends. CAT(0) uniqueness applies, but no point addition is used.[^ref-faae92cbeae4]
Neighborhood in Abstraction Space¶
Midpoint sits in a sparse region of the domain-specific corpus (70th percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.
Family — Coordinate Systems & Spatial Measures (29 abstractions)
Nearest neighbors
- Non-Archimedean geometry — 0.84
- Nine-Point Conic — 0.84
- Ordered geometry — 0.83
- Smallest-Circle Problem — 0.83
- Centerpoint (Geometry) — 0.83
Computed from structural-signature embeddings · 2026-10-08
Not to Be Confused With¶
Equidistant locus: may contain points off the segment. Any interior point: only halfway qualifies. Triangle centroid: a different multi-vertex average. Unique midpoint in every metric space: multiple shortest segments may produce different points. Arithmetic mean of arbitrary metric points: undefined without an affine operation. Generic balance or partition: these broad notions do not turn the segment-relative point into a path or process.[ref-e9e4ed1ccd5f][ref-faae92cbeae4]
References¶
[^ref-1a169ba940ae]: Euclid, “Elements of Geometry, Book I, Proposition 10: To Bisect a Given Finite Straight Line”, edited and translated by T. L. Heath (1908), Trinity College Dublin text witness, full proposition and proof.
[^ref-e9e4ed1ccd5f]: “Essential Concepts of Projective Geometry”, course notes, Purdue University 1973, revised at the University of California, Riverside (2007), §II.4, printed p.25/PDF p.34, affine midpoint definition and Theorem II.24 discussion. The inspected title page does not name an author.
[^ref-faae92cbeae4]: M. R. Bridson and A. Haefliger, “Metric Spaces of Non-Positive Curvature”, Springer (1999), DOI 10.1007/978-3-662-12494-9, Chapter II.1 Proposition 1.4(1) on unique CAT(0) geodesic segments and Example 1.15 on R-trees. Numeric tree placement and intrinsic-circle two-arc counterexample are editorial deductions.