Jump to content

Isomorphism

From Wikipedia, the free encyclopedia
Fifth roots of unity
Rotations of a pentagon
Thegroupof fifthroots of unityunder multiplication is isomorphic to the group of rotations of the regular pentagon under composition.

Inmathematics,anisomorphismis a structure-preservingmappingbetween twostructuresof the same type that can be reversed by aninverse mapping.Two mathematical structures areisomorphicif an isomorphism exists between them. The word isomorphism is derived from theAncient Greek:ἴσοςisos"equal", andμορφήmorphe"form" or "shape".

The interest in isomorphisms lies in the fact that two isomorphic objects have the same properties (excluding further information such as additional structure or names of objects). Thus isomorphic structures cannot be distinguished from the point of view of structure only, and may be identified. In mathematical jargon, one says that two objects arethe sameup toan isomorphism.[citation needed]

Anautomorphismis an isomorphism from a structure to itself. An isomorphism between two structures is acanonical isomorphism(acanonical mapthat is an isomorphism) if there is only one isomorphism between the two structures (as is the case for solutions of auniversal property), or if the isomorphism is much more natural (in some sense) than other isomorphisms. For example, for everyprime numberp,allfieldswithpelements are canonically isomorphic, with a unique isomorphism. Theisomorphism theoremsprovide canonical isomorphisms that are not unique.

The termisomorphismis mainly used foralgebraic structures.In this case, mappings are calledhomomorphisms,and a homomorphism is an isomorphismif and only ifit isbijective.

In various areas of mathematics, isomorphisms have received specialized names, depending on the type of structure under consideration. For example:

Category theory,which can be viewed as a formalization of the concept of mapping between structures, provides a language that may be used to unify the approach to these different aspects of the basic idea.

Examples

[edit]

Logarithm and exponential

[edit]

Letbe themultiplicative groupofpositive real numbers,and letbe the additive group of real numbers.

Thelogarithm functionsatisfiesfor allso it is agroup homomorphism.Theexponential functionsatisfiesfor allso it too is a homomorphism.

The identitiesandshow thatandareinversesof each other. Sinceis a homomorphism that has an inverse that is also a homomorphism,is an isomorphism of groups.

Thefunction is an isomorphism which translates multiplication of positive real numbers into addition of real numbers. This facility makes it possible to multiply real numbers using arulerand atable of logarithms,or using aslide rulewith a logarithmic scale.

Integers modulo 6

[edit]

Consider the groupthe integers from 0 to 5 with additionmodulo6. Also consider the groupthe ordered pairs where thexcoordinates can be 0 or 1, and the y coordinates can be 0, 1, or 2, where addition in thex-coordinate is modulo 2 and addition in they-coordinate is modulo 3.

These structures are isomorphic under addition, under the following scheme: or in general

For example,which translates in the other system as

Even though these two groups "look" different in that the sets contain different elements, they are indeedisomorphic:their structures are exactly the same. More generally, thedirect productof twocyclic groupsandis isomorphic toif and only ifmandnarecoprime,per theChinese remainder theorem.

Relation-preserving isomorphism

[edit]

If one object consists of a setXwith abinary relationR and the other object consists of a setYwith a binary relation S then an isomorphism fromXtoYis a bijective functionsuch that:[1]

S isreflexive,irreflexive,symmetric,antisymmetric,asymmetric,transitive,total,trichotomous,apartial order,total order,well-order,strict weak order,total preorder(weak order), anequivalence relation,or a relation with any other special properties, if and only if R is.

For example, R is anordering≤ and S an orderingthen an isomorphism fromXtoYis a bijective functionsuch that Such an isomorphism is called anorder isomorphismor (less commonly) anisotone isomorphism.

Ifthen this is a relation-preservingautomorphism.

Applications

[edit]

Inalgebra,isomorphisms are defined for allalgebraic structures.Some are more specifically studied; for example:

Just as theautomorphismsof analgebraic structureform agroup,the isomorphisms between two algebras sharing a common structure form aheap.Letting a particular isomorphism identify the two structures turns this heap into a group.

Inmathematical analysis,theLaplace transformis an isomorphism mapping harddifferential equationsinto easieralgebraicequations.

Ingraph theory,an isomorphism between two graphsGandHis abijectivemapffrom the vertices ofGto the vertices ofHthat preserves the "edge structure" in the sense that there is an edge fromvertexuto vertexvinGif and only if there is an edge fromtoinH.Seegraph isomorphism.

In mathematical analysis, an isomorphism between twoHilbert spacesis a bijection preserving addition, scalar multiplication, and inner product.

In early theories oflogical atomism,the formal relationship between facts and true propositions was theorized byBertrand RussellandLudwig Wittgensteinto be isomorphic. An example of this line of thinking can be found in Russell'sIntroduction to Mathematical Philosophy.

Incybernetics,thegood regulatoror Conant–Ashby theorem is stated "Every good regulator of a system must be a model of that system". Whether regulated or self-regulating, an isomorphism is required between the regulator and processing parts of the system.

Category theoretic view

[edit]

Incategory theory,given acategoryC,an isomorphism is a morphismthat has an inverse morphismthat is,andFor example, a bijectivelinear mapis an isomorphism betweenvector spaces,and a bijectivecontinuous functionwhose inverse is also continuous is an isomorphism betweentopological spaces,called ahomeomorphism.

Two categoriesCandDareisomorphicif there existfunctorsandwhich are mutually inverse to each other, that is,(the identity functor onD) and(the identity functor onC).

Isomorphism vs. bijective morphism

[edit]

In aconcrete category(roughly, a category whose objects are sets (perhaps with extra structure) and whose morphisms are structure-preserving functions), such as thecategory of topological spacesor categories of algebraic objects (like thecategory of groups,thecategory of rings,and thecategory of modules), an isomorphism must be bijective on theunderlying sets.In algebraic categories (specifically, categories ofvarieties in the sense of universal algebra), an isomorphism is the same as a homomorphism which is bijective on underlying sets. However, there are concrete categories in which bijective morphisms are not necessarily isomorphisms (such as the category of topological spaces).

Relation to equality

[edit]

Although there are cases where isomorphic objects can be considered equal, one must distinguishequalityandisomorphism.[2]Equality is when two objects are the same, and therefore everything that is true about one object is true about the other. On the other hand, isomorphisms are related to some structure, and two isomorphic objects share only the properties that are related to this structure.

For example, the sets areequal;they are merely different representations—the first anintensionalone (inset builder notation), and the secondextensional(by explicit enumeration)—of the same subset of the integers. By contrast, the setsandare notequalsince they do not have the same elements. They are isomorphic as sets, but there are many choices (in fact 6) of an isomorphism between them: one isomorphism is

while another is

and no one isomorphism is intrinsically better than any other.[note 1]On this view and in this sense, these two sets are not equal because one cannot consider themidentical:one can choose an isomorphism between them, but that is a weaker claim than identity—and valid only in the context of the chosen isomorphism.

Also,integersandeven numbersare isomorphic asordered setsandabelian groups(for addition), but cannot be considered equal sets, since one is aproper subsetof the other.

On the other hand, when sets (or othermathematical objects) are defined only by their properties, without considering the nature of their elements, one often considers them to be equal. This is generally the case with solutions ofuniversal properties.

For example, therational numbersare usually defined asequivalence classesof pairs of integers, although nobody thinks of a rational number as a set (equivalence class). The universal property of the rational numbers is essentially that they form afieldthat contains the integers and does not contain any proper subfield. It results that given two fields with these properties, there is a unique field isomorphism between them. This allows identifying these two fields, since every property of one of them can be transferred to the other through the isomorphism. For example thereal numbersthat are obtained by dividing two integers (inside the real numbers) form the smallest subfield of the real numbers. There is thus a unique isomorphism from the rational numbers (defined as equivalence classes of pairs) to the quotients of two real numbers that are integers. This allows identifying these two sorts of rational numbers.

See also

[edit]

Notes

[edit]
  1. ^have a conventional order, namely the Alpha betical order, and similarly 1, 2, 3 have the usual order of the integers. Viewed as ordered sets, there is only one isomorphism between them, namely

References

[edit]
  1. ^Vinberg, Ėrnest Borisovich (2003).A Course in Algebra.American Mathematical Society. p. 3.ISBN9780821834138.
  2. ^Mazur 2007

Further reading

[edit]
[edit]