A set of points \(A\) has symmetry of type \(T\) for some transformation \(T\) if and only if \(T(A)=A.\)
Checkpoint4.4.2.
Confirm \(T(x,y)=(-y,x)\) is a symmetry of the set \(\{ (1,1), (-1,1), (-1,-1), (1,-1) \}.\)
Checkpoint4.4.3.
Demonstrate \(T(x,y)=(-y,x)\) is not a symmetry of the set \(\{ (0,0), (1,0), (1,1), (0,1) \}.\)
Checkpoint4.4.4.
What points do you have to add to \(\{ (1,1), (-1,1), (-1,-1), (1,-1), (1,0) \}\) so \(T(x,y)=(-y,x)\) is a symmetry of this set?
Checkpoint4.4.5.
List all symmetries of a square by labeling the vertices and giving the type and parameters for the transformations.
Checkpoint4.4.6.
List all symmetries of a regular \(n\)-sided polygon (\(n\)-gon) by labeling the vertices and giving the type and parameters for the transformations.
Checkpoint4.4.7.
For one of the regular \(n\)-gons check the following.
What is the composition of two rotational symmetries?
What is the composition of two reflectional symmetries?
What is the smallest number of symmetries you can use to generate all the symmetries?
Checkpoint4.4.8.
Draw some regular \(n\)-gon. Color in the \(n\)-gon so that the colored figure maintains the rotational symmetries, but not the reflectional symmetries.
Checkpoint4.4.9.
Draw some regular \(n\)-gon. Color in the \(n\)-gon so that the colored figure maintains the reflectional symmetries, but not the rotational symmetries.
Checkpoint4.4.10.
Draw a figure that has translational symmetry.
Checkpoint4.4.11.
Draw a figure that has translational symmetry and exactly one reflectional symmetry.
Checkpoint4.4.12.
Draw a figure that has translational symmetry and rotational symmetry.
Checkpoint4.4.13.
Draw a figure that has dilational symmetry.
Subsection4.4.2Explore Tesselations
Definition4.4.14.Tesselation.
A covering of the plane is a tesselation if and only if it consists of a single shape infinitely reproduced using a finite set of transformations.
Definition4.4.15.Tiling.
A covering of the plane is a tiling if and only if it consists of a finite set of shapes infinitely reproduced using a finite set of transformations.
Checkpoint4.4.16.
Analyze the tesselation in Figure 4.4.21 as follows.
Identify the generating shape.
Identify the smallest set of transformations that can generate the tesselation.
List all symmetries of the tesselation.
Identify the smallest set of symmetries of the tesselation that can generate all the symmetries of the tesselation.
Definition4.4.17.Conway Label.
The following labeling of tesselations derives from the book The Symmetries of Things by John Conway, Heidi Burgiel, and Chaim Goodman-Strauss. Follow these steps in order to identify and label the type of symmetry group of a tesselation. The resulting notation is called the signature
Identify all lines of reflection.
If two or more lines of reflection intersect in a point, write \(*n_1n_2 \ldots\) where \(n_1,\)\(n_2,\) are the number of lines intersecting at each unique point of intersection.
If any line of reflection does not intersect other lines of reflection, just write one \(*\) for each of these.
Identify any rotations that are not the composition of reflections already listed.
Write \(n_1n_2 \ldots \) in front of any \(*\) for each rotation where \(n_1,\)\(n_2\) are the order of the rotations.
Identify any glide reflections that are not the composition of reflections or rotations already listed.
Write \(\times\) at the end of the signature for each of these glide reflections.
Identify any translations that are not the composition of other symmetries already listed.
Write \(\circ\) at the front of the signature for each pair of these translations.