For even functions, this transformation can be found over the y-axis without changing the graph.
In Euclidean geometry, the finite groups formed by this type of mapping are equivalent to the finite Coxeter groups.  In computer science, this term refers to the ability of a program to treat itself as data, allowing the program to modify itself. Matrices that perform this operation in two-space often take the form with top row cosine two theta, sine two theta and bottom row sine two theta, negative cosine two theta; those matrices have a determinant of negative one.  This term also refers to certain relations that relate f of the quantity a minus x end quantity to f of x. When this type of transformation is combined with a translation, the result is its glide type. For even functions, this transformation can be found over the y-axis without changing the graph. Name this transformation that finds a mirror image.
In Euclidean geometry, the finite groups formed by this type of mapping are equivalent to the finite Coxeter groups.  
reflection [accept word forms]