1 Definition and core properties
1.1 What “congruent” means for geometric figures
Two geometric figures in the same space are congruent if one can be moved so that it exactly matches the other. “Moved” here means through rigid motions that do not deform the figure: its size, shape, and internal geometry remain unchanged. In the plane, this corresponds to placing the original figure at a new location and orientation without stretching or squeezing.
1.2 Distance and angle preservation
A congruence transformation is an isometric transformation: it preserves the distance between any pair of points. Because angles can be defined using distances (for example, via the sides of triangles), preserving all distances forces angles to remain unchanged as well. Consequently, the metric relationships that determine geometric shape are maintained under the transformation.
1.3 Effects on lengths, areas, and orientations
Length preservation implies that every segment in the figure retains its length after the transformation. Areas are also preserved because they depend on lengths and angles; when both are preserved, the figure’s area stays the same. Orientation may or may not be preserved: rotations and translations keep orientation, while reflections (and some combinations) reverse it. This orientation behavior is captured algebraically by the determinant of the associated linear part.
1.4 Composition of congruence transformations
Congruence transformations form a closed system under composition. Performing one rigid motion and then another yields another rigid motion. The set also includes an identity transformation (doing nothing) and inverses (each rigid motion can be undone by a corresponding rigid motion), which makes congruence transformations naturally suited to group-theoretic interpretations.
2 Coordinate and vector formulation
2.1 Translation as a congruence transformation
A translation shifts every point by the same vector. In coordinates, a point \( (x,y) \) maps to \[ (x',y') = (x+a,\; y+b). \] Because differences between points are unchanged under addition of a constant vector, distances and angles remain identical.
2.2 Rotations in coordinates
A rotation moves points around a fixed center while preserving their distance from that center. In the plane, a counterclockwise rotation by angle \( \theta \) about the origin is written using coordinates: \[ (x',y')=(x\cos\theta - y\sin\theta,\; x\sin\theta + y\cos\theta). \] More generally, rotation about a point \( (h,k) \) is achieved by translating so the center is at the origin, rotating, then translating back.
2.3 Reflections in coordinates
A reflection flips points across a line, producing a mirror image. The coordinate formula depends on the reflecting line. For example, reflection across the \(x\)-axis sends \[ (x,y)\mapsto (x,-y), \] while reflection across the \(y\)-axis sends \[ (x,y)\mapsto (-x,y). \] Reflections preserve distances to points on the mirror line and across it, ensuring the overall rigidity of the transformation.
2.4 Glide reflections and combinations of motions
A glide reflection is a composition of a reflection across a line and a translation along that line. In geometric terms, points are first mirrored, then shifted parallel to the mirror axis. Glide reflections preserve distances and angles just as translations and reflections do, since both components are rigid motions and their composition remains rigid. Many rigid motions can also be expressed as combinations of simpler ones.
3 Matrix representation (linear algebra view)
3.1 Orthogonal transformations and inner-product preservation
In coordinate settings, congruence transformations are often written as an affine map \[ \mathbf{x}' = A\mathbf{x} + \mathbf{b}, \] where \(A\) is the linear part and \(\mathbf{b}\) is a translation vector. The defining linear property for distance preservation is preservation of the inner product: \[ (A\mathbf{u})\cdot(A\mathbf{v})=\mathbf{u}\cdot\mathbf{v}. \] This is equivalent to \(A\) being orthogonal, meaning \(A^T A = I\). Orthogonality ensures that norms and angles computed from dot products remain unchanged.
3.2 Rotation matrices
In two dimensions, the rotation matrix by angle \(\theta\) is \[ R(\theta)=\begin{pmatrix} \cos\theta & -\sin\theta\\ \sin\theta & \cos\theta \end{pmatrix}. \] This matrix is orthogonal and corresponds to orientation-preserving congruence motions. In higher dimensions, rotations are represented by orthogonal matrices whose action preserves a chosen subspace structure.
3.3 Reflection matrices
A reflection across a line through the origin can also be represented by an orthogonal matrix. One common viewpoint is that a reflection keeps one direction fixed (the normal-to-the-mirror or the mirror itself, depending on the convention) and reverses the orthogonal direction. For instance, reflection across the \(x\)-axis corresponds to \[ \begin{pmatrix} 1 & 0\\ 0 & -1 \end{pmatrix}. \] General reflections in the plane correspond to orthogonal matrices with a one-dimensional fixed subspace and a perpendicular direction sign-changed.
3.4 Determinant, orientation, and invariants
For orthogonal matrices, the determinant takes values \(\det(A)=1\) or \(\det(A)=-1\). Determinant \(1\) corresponds to orientation-preserving transformations (typical of rotations), while \(-1\) corresponds to orientation reversal (typical of reflections). Several invariants follow from orthogonality: dot products, squared distances, and lengths are fixed. In affine form, translations affect position but do not disturb those invariants computed from point differences.
4 Algebraic tests for congruence
4.1 Verifying equal distances using coordinate formulas
A practical way to test congruence between point sets is to compare all pairwise distances. If two figures are given by coordinates and there exists a rigid motion mapping one to the other, then for any two corresponding points \(P,Q\) and their images \(P',Q'\), the distance formula \[
| \|P-Q\|^2=(x_P-x_Q)^2+(y_P-y_Q)^2 |
|---|
\] will match with the corresponding squared distance in the transformed configuration. Using squared distances avoids square roots while preserving equality.
4.2 Preserving dot products and norm squares
Because an isometry preserves inner products, an equivalent algebraic test is that dot products between vectors formed from corresponding points match. Similarly, norm squares of difference vectors satisfy \[
| \|A(\mathbf{x}-\mathbf{y})\|^2=\|\mathbf{x}-\mathbf{y}\|^2 |
|---|
\] when \(A\) is orthogonal. These checks often reduce the problem to verifying identities under an assumed transformation form.
4.3 Mapping points and checking consistency
When a transformation is unknown, one can use correspondence information to determine the mapping. After proposing a candidate transformation (for example, from three non-collinear points in the plane), verifying it requires checking that it sends all points of the figure to their designated counterparts. Consistency is essential: a rigid motion determined by enough constraints must fit every point simultaneously.
4.4 Invariant quantities under congruence
Some quantities do not change under congruence. Examples include side lengths, angle measures, and the set of distances between all pairs of vertices (up to correspondence). For figures like polygons, congruence implies equality of perimeters and the same sequence of edge lengths with matching angles. For circles and other symmetric objects, center-to-point distances and radii remain fixed.
5 Congruence in coordinate geometry
5.1 Congruent figures on the Cartesian plane
On the Cartesian plane, congruence is realized by explicitly moving one set of points to another using coordinate operations. Translations shift the entire configuration; rotations reorient it; reflections mirror it. In typical school and contest settings, the problem is to decide whether two described figures are congruent and, if so, how.
5.2 Transforming lines, segments, and circles
Rigid motions act on geometric objects in a predictable manner. A line remains a line, a segment remains a segment with the same endpoints distance, and a circle remains a circle with the same radius; its center moves according to the transformation. Under an affine rigid motion, the defining equations can be transformed by mapping enough points on the object (or by transforming the equation using substitution when convenient).
5.3 Transforming polygons (vertex mapping)
Polygons are often handled through vertex correspondence. If the vertices of one polygon map to vertices of the other in a consistent order, then the entire boundary follows. This approach works particularly well when vertex coordinates are provided: one can attempt to match a transformation by aligning one edge (or a pair of edges) and then confirming that all remaining vertices land correctly.
5.4 Using symmetry to simplify problems
When a figure has symmetry, congruence questions can be simplified. For instance, mirror symmetry can suggest a reflection candidate; rotational symmetry can suggest a rotation about a natural center; translational patterns in tilings suggest translations or glide reflections. Recognizing these structures reduces the number of possible rigid motions that must be checked algebraically.
6 Congruence transformation vs. similarity transformation
6.1 Similarity transformations and scaling
Similarity transformations allow stretching or shrinking while preserving shape, meaning angles are preserved but lengths may change by a common scale factor. Unlike congruence, which keeps absolute distances fixed, similarity permits uniform scaling combined with rigid motion. In coordinates, a similarity map can be represented using a scalar factor multiplied by an orthogonal matrix, plus a translation.
6.2 What changes (scales) vs. what stays fixed
Under similarity, ratios of lengths remain the same, and angles are unchanged, so geometric figures keep their form. However, absolute lengths change according to the scale factor, and therefore areas scale by the square of that factor. Under congruence, both lengths and angles stay fixed, so areas and all scale-dependent measures are preserved without adjustment.
6.3 Comparing matrix conditions for each type
For congruence, the linear part \(A\) must be orthogonal: \(A^T A = I\). For similarity, the corresponding condition becomes \[ A^T A = kI \]
| for some positive scalar \(k\), capturing the uniform scaling. Thus, congruence corresponds to \(k=1\), while similarity corresponds to a general \(k\). Determinants also differ: for congruence, \(\det(A)=\pm 1\); for similarity, \( | \det(A) | \) incorporates the scaling effect. |
|---|
7 Worked examples and problem-solving strategies
7.1 Translating a figure defined by coordinates
Suppose a set of points defines a triangle, and the translated triangle is known to have a corresponding vertex shift. If one point \( (x,y) \) maps to \( (x+a, y+b) \), then every vertex follows the same rule. A typical strategy is to identify the translation vector from one matched pair of points, apply it to all other vertices, and verify equality with the target coordinates.
7.2 Rotating a figure about a point
To rotate a point set about a center \( (h,k) \) by angle \(\theta\), use three steps: translate the center to the origin, apply the rotation matrix, then translate back. For each vertex \( (x,y) \), compute \( (x-h, y-k) \), rotate via the standard trigonometric formulas, then add \( (h,k) \) to return to the original coordinate system. Verification is done by checking that each rotated vertex equals the corresponding given vertex.
7.3 Reflecting a figure across a line
If the reflecting line is one of the coordinate axes, reflection formulas are immediate. For example, across \(y=mx+b\), one can proceed by converting to a coordinate system where the line becomes an axis, reflecting, then transforming back. In practice, many problems choose axis-aligned mirrors to keep computations straightforward. After applying the reflection to key vertices, the full figure congruence follows.
7.4 Finding an unknown transformation from constraints
When the transformation is not explicitly given, constraints from point correspondences determine it. Common methods include:
- Translation: use a single matched pair to obtain the displacement vector.
- Rotation or reflection: use alignment constraints such as mapping one segment to another. In the plane, two distinct point pairs can determine whether the motion is a rotation, reflection, or a composition, while ensuring distances match.
- Consistency check: once a candidate rigid motion is constructed, apply it to additional points (or compute images of lines/circles) to confirm that all constraints are satisfied simultaneously.
This approach turns geometric structure into solvable algebra: rigid motions preserve distance relations, so mismatches quickly rule out incorrect candidates.