A mapping in geometry is a rule that takes every point in one set and assigns it to exactly one point in another set (or the same set). If you’ve encountered terms like “transformation,” “function,” or “map” in a geometry class, they all describe this same core idea: a systematic way of moving or converting geometric objects from one position, shape, or space to another. Mappings are the foundation for understanding how shapes translate, rotate, reflect, scale, and even stretch into entirely new forms.
How a Mapping Works
Every mapping has three parts. The domain is the set of all valid inputs, typically the points of a shape or an entire plane. The codomain is the set of all possible outputs, the space where the results live. And the range is the subset of the codomain the mapping actually hits. A rotation of a triangle, for instance, has the triangle’s points as its domain, the plane as its codomain, and the rotated triangle’s points as its range.
When a mapping takes a point and produces a new point, the new point is called the image of the original. The original point is called the pre-image. So if you reflect a point across a line, the reflected point is the image, and the starting point is the pre-image. This vocabulary shows up constantly in geometry problems, especially when describing what happens to each vertex of a polygon after a transformation.
Types of Geometric Mappings
Not all mappings treat shapes the same way. The differences come down to what properties they preserve.
Isometries (Rigid Motions)
An isometry preserves distance. The distance between any two points before the mapping is identical to the distance between their images afterward. Translations, rotations, reflections, and glide reflections are all isometries. Because distance is preserved, so are angle measures, side lengths, and overall shape. Two figures related by an isometry are congruent.
Similarities
A similarity multiplies all distances by the same positive constant, called the ratio. If the ratio is 2, every distance in the image is twice what it was in the pre-image. The shape stays the same, but the size changes. Formally, a similarity of ratio r maps any two points P and Q so that the distance between their images equals r times the original distance. When r equals 1, the similarity is just an isometry. Every similarity can be broken down into a uniform scaling (called a “stretch”) followed by an isometry. Stretch rotations and stretch reflections are both examples of similarities that combine scaling with a rigid motion.
Affine Transformations
Affine mappings preserve straight lines and parallelism but not necessarily distances or angles. A square mapped by an affine transformation becomes a parallelogram. Shearing, where a shape slants as if you pushed the top edge sideways, is a classic affine transformation. Every isometry and every similarity is also affine, but the reverse is not true.
Topological Mappings (Homeomorphisms)
At the loosest end of the spectrum, a topological mapping (homeomorphism) only requires that the function be continuous, reversible, and that its reverse is also continuous. Think of it as reshaping a figure made of perfectly elastic rubber: you can stretch, compress, twist, and bend it however you like, but you cannot tear it or glue separate points together. A square, a circle, and a triangle are all equivalent under a homeomorphism because each can be continuously deformed into the others. This is why topology is sometimes called “rubber sheet geometry.” These mappings preserve connectedness and basic structural relationships but throw away distances, angles, and straight lines entirely.
One-to-One, Onto, and Bijective Mappings
Three properties describe how a mapping connects its domain and codomain, and they matter for understanding when a mapping can be reversed.
A mapping is one-to-one (injective) if no two different input points produce the same output point. Every point in the image traces back to exactly one pre-image. A mapping is onto (surjective) if every point in the codomain is the image of at least one input. Nothing in the target space gets skipped. When a mapping is both one-to-one and onto, it is called bijective, and it creates a perfect pairing between the domain and codomain. Bijective mappings are the ones that can be fully reversed: for every output, there is one and only one input.
Isometries and similarities acting on the entire plane are bijective. That’s why you can always “undo” a rotation or a reflection. Projections, on the other hand, are typically not one-to-one, because multiple points in three-dimensional space can project to the same point on a flat surface.
Representing Mappings With Coordinates
In coordinate geometry, mappings are often written as formulas or matrices. A rotation of 90 degrees counterclockwise around the origin, for example, sends the point (x, y) to (-y, x). A scaling by factor 3 sends (x, y) to (3x, 3y). These rules make it easy to compute exactly where every point ends up.
Matrices are especially useful for linear transformations, which include rotations, reflections, scaling, and shearing. Each of these can be represented as a grid of numbers that you multiply against a point’s coordinates to get the image coordinates. A 2×2 matrix handles transformations in the plane; a 3×3 matrix handles three-dimensional space. By multiplying matrices together, you can combine transformations into a single operation. Rotating and then scaling, for instance, becomes one matrix that does both steps at once. This is why matrix math shows up so often in computer graphics and engineering: it provides a compact, computable way to chain multiple geometric mappings together.
Composition of Mappings
Applying one mapping after another is called composition. If mapping f sends point A to point B, and mapping g sends point B to point C, then the composition “g after f” sends A directly to C. Composition is how complex geometric operations are built from simpler ones. Translating a shape and then reflecting it, for example, produces a glide reflection. Every similarity can be decomposed into a scaling followed by an isometry, and every isometry can be decomposed into at most three reflections. Breaking mappings into chains of simpler steps is one of the central strategies in geometric reasoning.
Why Mappings Matter in Geometry
Mappings give geometry a precise language for comparing shapes. Instead of saying two triangles “look the same,” you can say there exists an isometry that maps one onto the other, meaning they are congruent. If there exists a similarity, they are similar. This reframing turns visual intuition into something provable. It also unifies large parts of geometry: Euclidean geometry studies properties preserved by isometries, affine geometry studies properties preserved by affine maps, and topology studies properties preserved by homeomorphisms. The type of mapping you allow determines which geometry you’re doing.
In practical terms, mappings are the math behind GPS coordinate conversions, 3D modeling software, medical imaging alignment, and robotics. Any time a system needs to translate between two representations of space, or move an object while tracking what happens to every point, a geometric mapping is doing the work.