In abstract algebra, a group isomorphism is a function between two groups that sets up a one-to-one correspondence between the elements of the groups in a way that respects the given group operations. If there exists an isomorphism between two groups, then the groups are called isomorphic. From the standpoint of group theory, isomorphic groups have the same properties and need not be distinguished.
Given two groups and a group isomorphism from to is a bijective group homomorphism from to Spelled out, this means that a group isomorphism is a bijective function such that for all and in it holds that
The two groups and are isomorphic if there exists an isomorphism from one to the other. This is written
Often shorter and simpler notations can be used. When the relevant group operations are understood, they are omitted and one writes
Sometimes one can even simply write Whether such a notation is possible without confusion or ambiguity depends on context. For example, the equals sign is not very suitable when the groups are both subgroups of the same group. See also the examples.
Conversely, given a group a set and a bijection we can make a group by defining
If and then the bijection is an automorphism (q.v.).
Intuitively, group theorists view two isomorphic groups as follows: For every element of a group there exists an element of such that "behaves in the same way" as (operates with other elements of the group in the same way as ). For instance, if generates then so does This implies, in particular, that and are in bijective correspondence. Thus, the definition of an isomorphism is quite natural.
An isomorphism of groups may equivalently be defined as an invertible group homomorphism (the inverse function of a bijective group homomorphism is also a group homomorphism).
In this section some notable examples of isomorphic groups are listed.
The group of all real numbers under addition, , is isomorphic to the group of positive real numbers under multiplication :
via the isomorphism .
Cette page est générée automatiquement et peut contenir des informations qui ne sont pas correctes, complètes, à jour ou pertinentes par rapport à votre recherche. Il en va de même pour toutes les autres pages de ce site. Veillez à vérifier les informations auprès des sources officielles de l'EPFL.
This course is an introduction to the theory of Riemann surfaces. Riemann surfaces naturally appear is mathematics in many different ways: as a result of analytic continuation, as quotients of complex
Singular cohomology is defined by dualizing the singular chain complex for spaces. We will study its basic properties, see how it acquires a multiplicative structure and becomes a graded commutative a
vignette|Les manipulations possibles du Rubik's Cube forment un groupe. En mathématiques, un groupe est une des structures algébriques fondamentales de l'algèbre générale. C'est un ensemble muni d'une loi de composition interne associative admettant un élément neutre et, pour chaque élément de l'ensemble, un élément symétrique. La structure de groupe est commune à de nombreux ensembles de nombres — par exemple les nombres entiers relatifs, munis de la loi d'addition.
En mathématiques, le théorème de factorisation est un principe général qui permet de construire un morphisme d'une structure quotient dans un autre espace à partir d'un morphisme de vers , de façon à factoriser ce dernier par la surjection canonique de passage au quotient. Soit un ensemble muni d'une relation d'équivalence et la surjection canonique. L'unicité de g est immédiate et guide la preuve de son existence, dont voici plusieurs variantes : Preuve « naïve » : pour tout élément , on pose .
En mathématiques et plus précisément en théorie des groupes, un groupe cyclique est un groupe qui est à la fois fini et monogène, c'est-à-dire qu'il existe un élément a du groupe tel que tout élément du groupe puisse s'exprimer sous forme d'un multiple de a (en notation additive, ou comme puissance en notation multiplicative) ; cet élément a est appelé générateur du groupe. Il n'existe, à isomorphisme près, pour tout entier n > 0, qu'un seul groupe cyclique d'ordre n : le groupe quotient Z/nZ — également noté Z ou C — de Z par le sous-groupe des multiples de n.
The beginning of 21st century provided us with many answers about how to reach the channel capacity. Polarization and spatial coupling are two techniques for achieving the capacity of binary memoryless symmetric channels under low-complexity decoding algor ...
A hallmark of graph neural networks is their ability to distinguish the isomorphism class of their inputs. This study derives hardness results for the classification variant of graph isomorphism in the message-passing model (MPNN). MPNN encompasses the maj ...
We show that the finitely generated simple left orderable groups G(rho) constructed by the first two authors in Hyde and Lodha [Finitely generated infinite simple groups of homeomorphisms of the real line. Invent. Math. (2019), doi:10.1007/s00222-01900880- ...