Jump to content

Transformation (function)

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by Monkbot (talk | contribs) at 10:31, 17 December 2020 (Task 18 (cosmetic): eval 9 templates: del empty params (4×); del |url-status= (1×);). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

A composition of four mappings coded in SVG,
which transforms a rectangular repetitive pattern
into a rhombic pattern. The four transformations are linear.

In mathematics, a transformation is a function f (usually with some geometrical underpinning) that maps a set X to itself, i.e. f : XX.[1][2][3][4] In other areas of mathematics, a transformation may simply refer to any function, regardless of domain and codomain.[5] For this wider sense of the term, see function (mathematics).

Examples include linear transformations of vector spaces and geometric transformations, which include projective transformations, affine transformations, and specific affine transformations, such as rotations, reflections and translations.[6][7]

More generally, a transformation in mathematics means a mathematical function (synonyms: "map" or "mapping"). A transformation can be an invertible function from a set X to itself, or from X to another set Y. The choice of the term transformation may simply indicate that the geometric aspects of a function are being considered (for example, with respect to invariants).

Partial transformations

While it is common to use the term transformation for any function of a set into itself (especially in terms like "transformation semigroup" and similar), there exists an alternative form of terminological convention in which the term "transformation" is reserved only for bijections. When such a narrow notion of transformation is generalized to partial functions, then a partial transformation is a function f: AB, where both A and B are subsets of some set X.[8]

Algebraic structures

The set of all transformations on a given base set, together with function composition, forms a regular semigroup.

Combinatorics

For a finite set of cardinality n, there are nn transformations and (n+1)n partial transformations.[9]

See also

References

  1. ^ "The Definitive Glossary of Higher Mathematical Jargon — Transformation". Math Vault. 2019-08-01. Retrieved 2019-12-13.
  2. ^ Olexandr Ganyushkin; Volodymyr Mazorchuk (2008). Classical Finite Transformation Semigroups: An Introduction. Springer Science & Business Media. p. 1. ISBN 978-1-84800-281-4.
  3. ^ Pierre A. Grillet (1995). Semigroups: An Introduction to the Structure Theory. CRC Press. p. 2. ISBN 978-0-8247-9662-4.
  4. ^ The Grammar of Graphics (2nd ed.). Springer. 2005. p. 29. ISBN 978-0-387-24544-7. {{cite book}}: Unknown parameter |authors= ignored (help)
  5. ^ P. R. Halmos (1960). Naive Set Theory. Springer Science & Business Media. pp. 30–. ISBN 978-0-387-90092-6.
  6. ^ "Transformations". www.mathsisfun.com. Retrieved 2019-12-13.
  7. ^ "Types of Transformations in Math". Basic-mathematics.com. Retrieved 2019-12-13.
  8. ^ Christopher Hollings (2014). Mathematics across the Iron Curtain: A History of the Algebraic Theory of Semigroups. American Mathematical Society. p. 251. ISBN 978-1-4704-1493-1.
  9. ^ Olexandr Ganyushkin; Volodymyr Mazorchuk (2008). Classical Finite Transformation Semigroups: An Introduction. Springer Science & Business Media. p. 2. ISBN 978-1-84800-281-4.