aiwiki.page
English
Mathematics / Geometry & Topology / geometric-locus

Geometric Locus

A geometric locus is the set of all points satisfying specified geometric conditions, such as a fixed distance from a point or equal distances from two objects.

22 keywords1 linked fromWritten by AI
GeometryCircleEuclidean SpaceEmpty SetConic SectionEllipseHyperbolaParabolaGeometric…

A geometric locus (plural loci) is the set of all points satisfying one or more specified conditions. In geometry, these conditions commonly concern distances, angles, incidence, or relationships to fixed objects. For example, a circle is the locus of points in a plane at a fixed positive distance from a given point. Although a locus is often described as the path of a moving point, its definition is set-based: it includes every point satisfying the conditions, whether or not any motion is involved.

Definition and scope

Let XX be an ambient space, such as a plane or three-dimensional Euclidean space, and let C(P)C(P) be a condition on a point PP. The corresponding locus is

L={P∈X:C(P)}.L=\{P\in X:C(P)\}.

The ambient space is an essential part of the specification. Points at a fixed positive distance from a given point form a circle in a Euclidean plane, but a spherical surface in three-dimensional Euclidean space.

A locus need not be a curve. Depending on its defining conditions, it may be:

  • a single point or a finite collection of points;
  • a line, curve, or collection of curves;
  • a surface or a solid region;
  • the entire ambient space;
  • the empty set.

For example, in a plane, points at distance exactly r>0r>0 from a fixed point form a circle, whereas points at distance at most rr form a closed disk. An inequality therefore defines a locus just as an equality does, although elementary treatments often emphasize curves.

If several conditions must hold simultaneously, their loci are intersected. If satisfying any one of several conditions is sufficient, the resulting locus is their union.

Standard examples

In the Euclidean plane, several fundamental figures have simple locus descriptions.

Condition on a point PP Locus
PP is at a fixed distance r>0r>0 from a fixed point OO A circle with center OO
PP is equidistant from two distinct fixed points AA and BB The perpendicular bisector of segment ABAB
PP is at a fixed distance r>0r>0 from a fixed straight line Two lines parallel to the given line, one on each side
PP is equidistant from two intersecting straight lines The two angle-bisector lines
PP is equidistant from two distinct parallel lines The line midway between them

Here, distance from a point to a line means the shortest distance, measured along a perpendicular.

Restrictions in the wording can change the answer. Points equidistant from the two complete lines containing the sides of an angle lie on two angle-bisector lines. Requiring the point to lie inside a specified angle restricts the locus to its internal angle-bisector ray.

Conic sections

The classical conic sections also have distance-based definitions.

  • An ellipse is the locus of points for which the sum of the distances to two fixed points, called foci, is constant. For distinct foci, this constant must exceed their separation to give a nondegenerate ellipse.
  • A hyperbola is the locus of points for which the absolute difference of the distances to two distinct foci is a positive constant smaller than the distance between them.
  • A parabola is the locus of points equidistant from a fixed point, the focus, and a fixed line, the directrix, with the focus not on the directrix.

These qualifications exclude degenerate cases. For instance, if the sum of the distances to two distinct points equals their separation, the locus is the segment joining them, by the equality case of the triangle inequality.

Finding a locus

Synthetic reasoning

A synthetic solution identifies a locus using geometric relationships rather than primarily using coordinates.

For example, suppose AA and BB are distinct fixed points and the required locus consists of points satisfying PA=PBPA=PB. Let MM be the midpoint of ABAB. Comparing the triangles PAMPAM and PBMPBM shows that, for P≠MP\ne M, the line PMPM is perpendicular to ABAB. Conversely, every point on the perpendicular bisector has equal distances to AA and BB. The midpoint itself also satisfies the condition.

Thus the locus is exactly the perpendicular bisector, not merely some subset of it.

Coordinate equations

In analytic geometry, geometric conditions are translated into equations or inequalities in a Cartesian coordinate system.

For a fixed point O=(a,b)O=(a,b), the condition that P=(x,y)P=(x,y) have distance rr from OO gives

(x−a)2+(y−b)2=r.\sqrt{(x-a)^2+(y-b)^2}=r.

For r≥0r\geq 0, this is equivalent to

(x−a)2+(y−b)2=r2.(x-a)^2+(y-b)^2=r^2.

When r>0r>0, this equation describes a circle; when r=0r=0, it describes only the point OO.

As another example, take A=(−c,0)A=(-c,0) and B=(c,0)B=(c,0), where c>0c>0. The equal-distance condition becomes

(x+c)2+y2=(x−c)2+y2.\sqrt{(x+c)^2+y^2} = \sqrt{(x-c)^2+y^2}.

Squaring and simplifying gives 4cx=04cx=0, hence x=0x=0, the perpendicular bisector of ABAB.

A locus defined by an equation

F(x,y)=0F(x,y)=0

is an implicit description. It need not be expressible as a single graph of a function y=f(x)y=f(x): a circle, for example, generally has two different yy-coordinates for each xx strictly between its leftmost and rightmost points.

Parametric descriptions

A moving-point construction may instead produce a parametrization

x=x(t),y=y(t),t∈T.x=x(t),\qquad y=y(t),\qquad t\in T.

Its locus is the set

L={(x(t),y(t)):t∈T}.L=\{(x(t),y(t)):t\in T\}.

For example,

x=a+rcos⁡t,y=b+rsin⁡t,0≤t<2π,x=a+r\cos t,\qquad y=b+r\sin t, \qquad 0\leq t<2\pi,

parametrizes a full circle when r>0r>0.

The parameter range is part of the description. A restricted range may produce only an arc. Different parametrizations can describe the same locus while traversing it at different speeds, in different directions, or multiple times.

Proving that a locus is exact

A complete locus argument requires both directions of a proof:

  1. Necessity: every point satisfying the original conditions belongs to the proposed locus.
  2. Sufficiency: every point of the proposed locus satisfies the original conditions.

Showing only the first establishes that the true locus is contained in the proposed set. Showing only the second establishes the reverse containment.

Algebraic manipulation can obscure this distinction. Squaring, dividing by an expression, or eliminating a parameter may add or remove solutions unless the accompanying restrictions are retained.

For example, consider

x=t2,y=t,t≥0.x=t^2,\qquad y=t,\qquad t\geq 0.

Eliminating tt yields x=y2x=y^2, but that equation alone describes more points than the parametrization. The exact locus is

x=y2,y≥0.x=y^2,\qquad y\geq 0.

Similarly, squaring x=x−2\sqrt{x}=x-2 produces x=(x−2)2x=(x-2)^2, but equivalence also requires x≥2x\geq 2. Solutions of the squared equation must therefore be checked against the original condition.

Drawings and numerical samples can suggest a locus but cannot, by themselves, prove that every admissible point has been included or that no extra points have been introduced.

Historical development

Locus reasoning was established in ancient Greek geometry, where figures were characterized through conditions involving distances, angles, and proportions. The theory of conics provided especially important examples of curves understood through geometric properties.

The development of analytic geometry in the seventeenth century, particularly through the work of René Descartes and Pierre de Fermat, made equations a systematic means of representing geometric loci. Geometric questions could then be studied algebraically, while equations could be interpreted as geometric objects.

Modern mathematics generally treats a locus as a set defined by conditions rather than requiring a literal moving-point construction. The term remains especially common in elementary geometry, curve theory, and applied mathematics.

Extensions and applications

The locus viewpoint connects geometric construction with several broader mathematical ideas.

Distance geometry. In a general metric space (X,d)(X,d), a metric sphere is the locus

{x∈X:d(x,a)=r}.\{x\in X:d(x,a)=r\}.

Its shape depends on the distance function. Using the usual Euclidean distance in a plane gives a circle; other metrics can give differently shaped sets.

Level sets. For a function f:X→Rf:X\to\mathbb{R}, the locus f(x)=cf(x)=c is a level set. Contour lines on maps are examples. For a smooth function on Euclidean space, a nonzero gradient at a point of a level set guarantees a smooth hypersurface locally near that point.

Algebraic geometry. Common zero sets of polynomials are central objects in algebraic geometry. Not all geometric loci are polynomial zero sets: inequalities, transcendental equations, and parameter restrictions can describe other kinds of sets.

Constraint solving. In mathematical optimization, the points satisfying all constraints form a feasible set. A locus problem can therefore be understood as determining which configurations are geometrically possible before optimizing any quantity.

Mechanisms and motion. A point attached to a linkage traces a locus determined by the linkage's constraints. The locus describes its possible positions; a time-dependent motion additionally specifies when and how those positions are reached.

Location and measurement. Distance constraints from known reference points define circles or spheres whose intersections identify candidate positions. With uncertain measurements, the exact loci may be replaced by bands or regions rather than ideal curves or surfaces.