Transformation Sequences — I can model a transformation sequence that maps one figure onto another. - Math 1

SECTION 1

Historical Context & Motivation

Long before we had coordinate planes or graphing calculators, mathematicians noticed something powerful: shapes can be moved, flipped, and spun without changing their fundamental structure. Ancient Greek geometers like Euclid described congruence — two figures having the same shape and size — but they lacked a formal language for describing how one figure could be repositioned to land exactly on another. The story of transformation sequences is the story of building that language.

~300 BCE • Euclid's Elements

Euclid defines congruence by superposition — mentally "placing" one figure on top of another — but never formalizes the motions needed to get it there.

1872 • Klein's Erlangen Program

Felix Klein proposes that all of geometry can be understood through groups of transformations, shifting the focus from static shapes to the motions that preserve their properties.

1900s • Coordinate Geometry Merges with Transformations

Mathematicians develop algebraic rules for translations, reflections, and rotations on the coordinate plane, making it possible to describe transformation sequences with precise formulas.

2010 • Common Core Adopts Transformation-Based Congruence

Modern math standards define congruence through rigid motions (transformation sequences), replacing the older "side-side-side" first approach with a dynamic, visual framework.

The central question this lesson addresses is deceptively simple: given two congruent figures on a plane, what specific sequence of transformations maps one figure exactly onto the other? Answering this question requires you to think of geometry not as a collection of frozen shapes, but as a world of motion and precision.

SECTION 2

Core Principles & Definitions

Before you can chain transformations together, you need a solid grasp of each individual move. A rigid motion (also called an isometry) is any transformation that preserves distances and angle measures — the figure's shape and size remain unchanged. The three rigid motions you will work with are translations, reflections, and rotations.

Translation (Slide)

Every point of the figure moves the same distance in the same direction. Defined by a direction vector ⟨a, b⟩ that specifies horizontal and vertical shift.

Reflection (Flip)

Every point flips across a line of reflection. The line acts like a mirror — each point lands the same perpendicular distance on the opposite side.

Rotation (Turn)

Every point swings around a fixed center of rotation by a specified angle and direction (clockwise or counterclockwise).

Transformation Sequence

Two or more rigid motions performed in order. The composition of rigid motions is itself a rigid motion, so the final image is always congruent to the original.

✦

KEY TAKEAWAY

Think of a transformation sequence like GPS directions: "Drive 3 blocks north, turn left 90°, then make a U-turn." Each instruction is simple on its own, but following them in order takes you from your starting point to your exact destination. Similarly, chaining a translation, rotation, and reflection in the right order maps a pre-image precisely onto its image.

⚠

Order Matters!

Transformation sequences are not commutative in general. Reflecting first and then translating can produce a different result than translating first and then reflecting. Always pay attention to the order in which transformations are applied.

SECTION 3

Visual Explanation

The diagram below shows a triangle (the pre-image) being mapped onto a second triangle (the final image) through a two-step transformation sequence: first a translation, then a reflection. Notice how each vertex moves in the same way during the translation, and then each vertex flips symmetrically across the line of reflection.

Triangle ABC (cyan) is first translated 5 units right to produce the intermediate image A′B′C′ (amber dashed). Then A′B′C′ is reflected over the vertical line x = 6 (violet dashed line) to produce the final image A″B″C″ (pink). The pre-image and final image are congruent.

In the diagram, notice three key features. First, during the translation every vertex shifts the same distance and direction — that's what makes a translation uniform. Second, the reflection line acts as a mirror: corresponding points on either side are equidistant from it. Third, the final image has the same side lengths and angle measures as the original, confirming that a sequence of rigid motions preserves congruence.

SECTION 4

Mathematical Framework

Each rigid motion can be described with a coordinate rule. When you compose transformations, you apply one rule after another — the output of the first becomes the input of the second. Here are the essential formulas.

TRANSLATION

T⟨a, b⟩: (x, y) → (x + a, y + b)

a = horizontal shift (positive → right), b = vertical shift (positive → up). Every point shifts by the same vector ⟨a, b⟩.

REFLECTION OVER THE X-AXIS

rₓ: (x, y) → (x, −y)

The x-coordinate stays the same; the y-coordinate is negated. For reflection over the y-axis: (x, y) → (−x, y). For reflection over the line y = x: (x, y) → (y, x).

ROTATION ABOUT THE ORIGIN

R₉₀° CCW: (x, y) → (−y, x)

Common rotations about the origin: 90° counterclockwise → (−y, x), 180° → (−x, −y), 270° counterclockwise (or 90° clockwise) → (y, −x).

COMPOSITION NOTATION

T₂ ∘ T₁ means "apply T₁ first, then T₂"

Read right to left: T₂ ∘ T₁ applied to point P gives T₂(T₁(P)). The inner transformation is executed first.

💡

Reading Composition Notation

When you see rₓ ∘ T⟨3, 2⟩, read it from right to left: first translate by ⟨3, 2⟩, then reflect over the x-axis. Think of it like putting on socks then shoes — the order you write them is the reverse of the order you perform them.

SECTION 5

Building & Classifying Transformation Sequences

Not all transformation sequences look the same. Sometimes you need just one step; other times three or more moves are required. Importantly, certain combinations of rigid motions can always be replaced by a simpler equivalent. The diagram below classifies common sequences and shows how they relate to one another.

A classification tree of rigid motions. The three fundamental transformations (translation, reflection, rotation) can be composed to form glide reflections, double reflections, and multi-step sequences. The key theorem at the bottom shows that reflections are the building blocks of all rigid motions.

A glide reflection is a special two-step sequence: a translation followed by a reflection across a line parallel to the direction of the translation. You see glide reflections in footprint patterns — left foot, right foot, each shifted forward and flipped. A double reflection over two parallel lines is equivalent to a single translation, and a double reflection over two intersecting lines is equivalent to a single rotation. These shortcuts help you simplify complex sequences.

Sequence	Equivalent Single Transformation	Preserves Orientation?
Translation + Translation	A single translation (add the vectors)	Yes
Rotation + Rotation (same center)	A single rotation (add the angles)	Yes
Reflection + Reflection (parallel lines)	A translation (perpendicular to lines, distance = 2× gap)	Yes
Reflection + Reflection (intersecting lines)	A rotation (center = intersection, angle = 2× angle between lines)	Yes
Translation + Reflection (along that line)	A glide reflection (cannot simplify further)	No

Common sequences and their single-transformation equivalents

SECTION 6

Worked Example

Let's work through a complete problem. Triangle DEF has vertices D(1, 2), E(4, 2), and F(4, 5). Triangle D″E″F″ has vertices D″(−2, −1), E″(−2, −4), and F″(−5, −4). Find a sequence of transformations that maps △DEF onto △D″E″F″.

Mapping △DEF to △D″E″F″

1
Step 1 — Analyze Orientation

List the vertices of △DEF in order: D(1, 2) → E(4, 2) → F(4, 5). Walking this path, the interior is to the left — that's a counterclockwise orientation. Now check △D″E″F″: D″(−2, −1) → E″(−2, −4) → F″(−5, −4). Walking this path, the interior is to the right — clockwise orientation. Because the orientation has reversed, at least one reflection must be part of the sequence.

Orientation changed → reflection needed
2
Step 2 — Try a Rotation of 90° Clockwise About the Origin

Apply the rule (x, y) → (y, −x): D(1, 2) → (2, −1), E(4, 2) → (2, −4), F(4, 5) → (5, −4). This gives us D′(2, −1), E′(2, −4), F′(5, −4). Compare these with the target: D″(−2, −1), E″(−2, −4), F″(−5, −4). The y-coordinates match, but the x-coordinates are negated.

After rotation: D′(2, −1), E′(2, −4), F′(5, −4)
3
Step 3 — Apply a Reflection Over the Y-Axis

Reflect each intermediate point over the y-axis using (x, y) → (−x, y): D′(2, −1) → (−2, −1) ✓, E′(2, −4) → (−2, −4) ✓, F′(5, −4) → (−5, −4) ✓. Every vertex now matches the target.

D″(−2, −1), E″(−2, −4), F″(−5, −4) — matches target!
4
Step 4 — State the Full Sequence

The transformation sequence is: First, rotate 90° clockwise about the origin. Then, reflect over the y-axis. In composition notation: $r_y$ ∘ R₋₉₀°. This is a valid sequence because both steps are rigid motions, so △DEF ≅ △D″E″F″.

$r_y$ ∘ R₋₉₀° (rotate 90° CW, then reflect over y-axis)

💡

Strategy Tip

When modeling a transformation sequence, start by checking orientation. If it changes, you know a reflection (or an odd number of reflections) is involved. Then look at the positions and try a rotation or translation to get close to the target before fine-tuning with the remaining transformation.

SECTION 7

Strengths, Limitations & Common Errors

The transformation-sequence approach is powerful, but understanding its boundaries will help you avoid common pitfalls. Below is a comparison of what this framework handles well and where you should be careful.

Strengths	Limitations / Common Errors
Works for any pair of congruent figures — not just triangles.	Cannot map a figure onto a non-congruent figure (different size or shape).
Provides a precise, repeatable description of how to move a figure.	The sequence is not unique — many correct sequences exist for the same mapping.
Coordinate rules make it easy to verify with algebra.	Students often forget that order matters: T₂ ∘ T₁ ≠ T₁ ∘ T₂ in general.
Orientation check quickly narrows down which transformations are needed.	Mixing up clockwise vs. counterclockwise, or reflecting over the wrong axis.
Connects directly to proofs of congruence in formal geometry.	Dilations (scaling) are NOT rigid motions — they belong to similarity, not congruence.

Strengths vs. common limitations of the transformation-sequence approach

✦

KEY TAKEAWAY

Think of the non-uniqueness of transformation sequences like driving directions: there might be five different routes from your house to school, and all of them get you there. What matters isn't finding the only correct sequence — it's finding a correct sequence and verifying that it works by checking every vertex.

SECTION 8

Connections to Advanced Theory

Transformation sequences are your gateway to several advanced ideas in mathematics. The table below contrasts what you're learning now with where these ideas lead in future courses.

This Course (Rigid Motions)	Advanced Extension
Translations, reflections, rotations preserve size and shape.	In similarity transformations, you add dilations (scaling). Two figures are similar if one maps to the other through a sequence of rigid motions and a dilation.
Coordinate rules like (x, y) → (−y, x).	In linear algebra, these rules become 2×2 matrices. Composing transformations becomes matrix multiplication.
Any rigid motion equals at most 3 reflections.	This is a theorem in group theory — the set of rigid motions forms a mathematical group under composition.
Transformation sequences prove congruence.	In formal proof writing (Geometry honors / proofs), you use transformation-based reasoning alongside classical postulates (SAS, ASA, SSS).

Current concepts and their advanced extensions

You don't need to master these extensions now, but it's worth knowing that the transformation framework you're building is foundational to higher mathematics. From computer graphics and robotics to crystallography and quantum physics, describing how objects move through space using compositions of transformations is one of the most widely applied ideas in all of math and science.

SECTION 9

Practice Problems

Question 1: CONCEPTUAL

Triangle PQR has a counterclockwise orientation, and triangle P′Q′R′ has a clockwise orientation. What does this tell you about the transformation sequence that maps △PQR to △P′Q′R′?

Show answer

A change in orientation means the transformation sequence must include an odd number of reflections (most commonly, exactly one reflection). Translations and rotations preserve orientation, so they alone cannot reverse it. If the orientation stayed the same, the sequence could consist entirely of translations and rotations. The orientation check is a quick diagnostic step that narrows down which transformations to consider.

Question 2: BASIC CALCULATION

Point A(3, −1) is first translated by ⟨−5, 4⟩ and then reflected over the x-axis. What are the coordinates of A″?

Show answer

First, apply the translation: A′ = (3 + (−5), −1 + 4) = (−2, 3). Then apply the reflection over the x-axis, which negates the y-coordinate: A″ = (−2, −3). The final coordinates are A″(−2, −3). Always apply transformations in the order given — translating first moves the point to (−2, 3), and reflecting second flips it below the x-axis.

Question 3: INTERMEDIATE

Quadrilateral ABCD has vertices A(0, 0), B(2, 0), C(2, 3), D(0, 3). Quadrilateral A″B″C″D″ has vertices A″(0, 0), B″(0, −2), C″(−3, −2), D″(−3, 0). Determine a transformation sequence that maps ABCD onto A″B″C″D″. Verify your answer for all four vertices.

Show answer

First, check orientation: ABCD is counterclockwise, and A″B″C″D″ is also counterclockwise, so no reflection is needed. Compare positions: A stays at (0, 0), B(2, 0) maps to (0, −2), C(2, 3) maps to (−3, −2), and D(0, 3) maps to (−3, 0). Each point (x, y) goes to (−y, x) — wait, let's check: (x, y) → (−y, x) gives B(2, 0) → (0, 2), not (0, −2). Try (x, y) → (y, −x) for a 90° clockwise rotation: A(0, 0) → (0, 0) ✓, B(2, 0) → (0, −2) ✓, C(2, 3) → (3, −2)... that gives (3, −2) not (−3, −2). So a single rotation doesn't work. Instead, apply a 90° counterclockwise rotation: (x, y) → (−y, x): A→(0,0)✓, B(2,0)→(0,2), C(2,3)→(−3,2), D(0,3)→(−3,0). Now reflect over the x-axis: (0,0)→(0,0)✓, (0,2)→(0,−2)✓, (−3,2)→(−3,−2)✓, (−3,0)→(−3,0)✓. The sequence is: rotate 90° CCW about the origin, then reflect over the x-axis.

Question 4: APPLIED

A game designer positions a spaceship sprite at vertices S(1, 1), T(3, 1), U(2, 4). The designer needs the ship to appear at S″(−1, −3), T″(−3, −3), U″(−2, −6) after an animation. Describe a transformation sequence the designer could program. Express each step as a coordinate rule.

Show answer

Compare corresponding vertices: S(1,1) → S″(−1,−3), so x changes from 1 to −1 (negated) and y changes from 1 to −3 (negated and shifted by −2... let's think differently). Check if (x, y) → (−x, −y) works: S(1,1) → (−1,−1), not (−1,−3). So try a rotation of 180° first: (x,y) → (−x, −y): S→(−1,−1), T→(−3,−1), U→(−2,−4). Then compare with the target: S″(−1,−3), T″(−3,−3), U″(−2,−6). The difference is a shift of (0, −2) in every case: (−1,−1+−2)=(−1,−3)✓, (−3,−1+−2)=(−3,−3)✓, (−2,−4+−2)=(−2,−6)✓. So the sequence is: rotate 180° about the origin, then translate by ⟨0, −2⟩. In coordinate rules: Step 1: (x, y) → (−x, −y); Step 2: (x, y) → (x, y − 2).

Question 5: CRITICAL THINKING

Marcus claims that any transformation sequence of a translation followed by a reflection can always be rewritten as a reflection followed by a translation (possibly with different parameters). Is Marcus correct? Justify your answer with a specific example or a general argument.

Show answer

Marcus is correct. Consider a translation T⟨a, b⟩ followed by a reflection rₗ over line ℓ. The composition rₗ ∘ T⟨a, b⟩ is a rigid motion that reverses orientation (because of the single reflection). Any orientation-reversing rigid motion can be expressed as a reflection or a glide reflection. Now, a glide reflection can be decomposed as a reflection followed by a translation (along the reflection line), meaning the order can be swapped if we adjust the line and vector. For a concrete example: translate by ⟨2, 0⟩ then reflect over x = 0 sends (1, 0) → (3, 0) → (−3, 0). We can achieve the same result by reflecting over x = 0 first: (1, 0) → (−1, 0), then translating by ⟨−2, 0⟩: (−1, 0) → (−3, 0). The translation vector changed from ⟨2, 0⟩ to ⟨−2, 0⟩, and the same line works. In general, if you reflect first, the reflection "reverses" the direction of the translation component perpendicular to the line, so you must adjust the vector accordingly, but a valid rewriting always exists.

SUMMARY

Lesson Summary

Summary

A transformation sequence is an ordered composition of rigid motions — translations, reflections, and rotations — that maps a pre-image onto a congruent image. Each transformation has a specific coordinate rule, and the output of one transformation becomes the input of the next. Because every step is a rigid motion, the composition preserves distances and angle measures, guaranteeing congruence between the original figure and its final image.

To model a transformation sequence, start by checking whether orientation is preserved or reversed — a reversal signals that a reflection is needed. Then use coordinate rules to test candidates (rotations, translations) until every vertex of the pre-image maps to the corresponding vertex of the target. Remember that order matters: performing transformations in a different sequence can yield a different result. Finally, know that correct sequences are not unique — there may be multiple valid paths from pre-image to image, and any one of them is a correct answer as long as it checks out for all vertices.