Concept

Group homomorphism

Summary
In mathematics, given two groups, (G, ∗) and (H, ·), a group homomorphism from (G, ∗) to (H, ·) is a function h : G → H such that for all u and v in G it holds that : h(u*v) = h(u) \cdot h(v) where the group operation on the left side of the equation is that of G and on the right side that of H. From this property, one can deduce that h maps the identity element eG of G to the identity element eH of H, : h(e_G) = e_H and it also maps inverses to inverses in the sense that : h\left(u^{-1}\right) = h(u)^{-1}. , Hence one can say that h "is compatible with the group structure". Older notations for the homomorphism h(x) may be xh or xh, though this may be confused as an index or a general subscript. In automata theory, sometimes homomorphisms are written to the right of their arguments without parentheses, so that h(x) becomes simply xh. In areas of mathematics where one considers groups endowed with additional structure, a h
About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.
Related publications

Loading

Related people

Loading

Related units

Loading

Related concepts

Loading

Related courses

Loading

Related lectures

Loading