{
  "id": "group-homomorphism",
  "title": "Group Homomorphism",
  "lang": "en",
  "source_lang": "en",
  "summary": "A group homomorphism is a map between groups that preserves their operations, allowing algebraic structure to be compared, represented, and simplified.",
  "category": "mathematics",
  "subcategory": "algebra",
  "type": "concept",
  "aliases": [
    "Homomorphism of groups",
    "group morphism"
  ],
  "generated_at": "2026-11-05",
  "model": "pro/gpt-6.1-sol",
  "url": "https://aiwiki.page/en/group-homomorphism/",
  "translations": {
    "zh-Hans": {
      "url": "https://aiwiki.page/zh/group-homomorphism/",
      "json": "https://aiwiki.page/zh/group-homomorphism.json"
    }
  },
  "sections": [
    {
      "heading": "",
      "text": "A group homomorphism is a function between two groups that preserves their group operations. If \\(G\\) and \\(H\\) are groups, a map \\(\\varphi:G\\to H\\) is a homomorphism when\n\n\\[\\varphi(xy)=\\varphi(x)\\varphi(y) \\qquad\\text{for all }x,y\\in G.\\]\n\nThe product on the left is computed in \\(G\\), while the product on the right is computed in \\(H\\). Group homomorphisms describe how one group can be embedded in another, collapsed to a simpler group, or realized as transformations of another mathematical object. They are a principal example of the broader notion of a homomorphism in algebra."
    },
    {
      "heading": "Definition and basic properties",
      "text": "More explicitly, if the operations of \\(G\\) and \\(H\\) are denoted by \\(*\\) and \\(\\circ\\), respectively, the defining condition is\n\n\\[\\varphi(x*y)=\\varphi(x)\\circ\\varphi(y).\\]\n\nThe operations need not have the same notation or interpretation. For example, a homomorphism may take addition in one group to multiplication in another.\n\nThe operation-preserving condition automatically implies preservation of the identity and inverses:\n\n\\[\\varphi(e_G)=e_H, \\qquad \\varphi(x^{-1})=\\varphi(x)^{-1}.\\]\n\nFor the first identity, the equation\n\n\\[\\varphi(e_G)=\\varphi(e_G)\\varphi(e_G)\\]\n\nallows cancellation in \\(H\\). Applying \\(\\varphi\\) to \\(xx^{-1}=e_G\\) then proves the second identity. Thus, unlike in some other algebraic settings, identity preservation does not have to be imposed separately.\n\nMore generally,\n\n\\[\\varphi(x^n)=\\varphi(x)^n \\qquad(n\\in\\mathbb Z).\\]\n\nConsequently, if \\(x\\) has finite order \\(m\\), the order of \\(\\varphi(x)\\) divides \\(m\\). If \\(\\varphi\\) is injective, the order is preserved exactly. An element of infinite order, however, can have an image of finite order under a noninjective homomorphism.\n\nFor groups written additively, the defining equation becomes\n\n\\[\\varphi(x+y)=\\varphi(x)+\\varphi(y).\\]\n\nWhen the source is additive and the target multiplicative, it becomes\n\n\\[\\varphi(x+y)=\\varphi(x)\\varphi(y).\\]"
    },
    {
      "heading": "Kernel and image",
      "text": "Two associated subgroups describe what a homomorphism loses and what it reaches.\n\nThe kernel is\n\n\\[\\ker\\varphi=\\{g\\in G:\\varphi(g)=e_H\\}.\\]\n\nIt consists of all elements sent to the identity. It is a normal subgroup of \\(G\\): if \\(k\\in\\ker\\varphi\\) and \\(g\\in G\\), then\n\n\\[\\varphi(gkg^{-1}) =\\varphi(g)e_H\\varphi(g)^{-1} =e_H.\\]\n\nThe image is\n\n\\[\\operatorname{im}\\varphi =\\{\\varphi(g):g\\in G\\}.\\]\n\nIt is a subgroup of \\(H\\), though it need not be normal in \\(H\\).\n\nThese constructions characterize injectivity and surjectivity:\n\n- \\(\\varphi\\) is injective if and only if \\(\\ker\\varphi=\\{e_G\\}\\).\n- \\(\\varphi\\) is surjective if and only if \\(\\operatorname{im}\\varphi=H\\).\n\nThe kernel also determines precisely when two elements have the same image:\n\n\\[\\varphi(x)=\\varphi(y) \\quad\\Longleftrightarrow\\quad x^{-1}y\\in\\ker\\varphi.\\]\n\nEvery nonempty fiber is therefore a coset of the kernel. If \\(\\varphi(x)=h\\), then\n\n\\[\\varphi^{-1}(\\{h\\})=x\\ker\\varphi.\\]\n\nIn particular, when \\(G\\) is finite,\n\n\\[|G|=|\\ker\\varphi|\\,|\\operatorname{im}\\varphi|.\\]\n\nImages of subgroups are subgroups, and inverse images of subgroups are subgroups. Inverse images also preserve normality: if \\(N\\) is normal in \\(H\\), then \\(\\varphi^{-1}(N)\\) is normal in \\(G\\)."
    },
    {
      "heading": "Quotient groups and the first isomorphism theorem",
      "text": "For a normal subgroup \\(N\\) of \\(G\\), the quotient group \\(G/N\\) has cosets as its elements and multiplication\n\n\\[(gN)(hN)=ghN.\\]\n\nThe canonical projection\n\n\\[\\pi:G\\to G/N,\\qquad \\pi(g)=gN\\]\n\nis a surjective homomorphism with kernel \\(N\\). Thus every normal subgroup occurs as the kernel of a group homomorphism.\n\nThe first isomorphism theorem states that every homomorphism \\(\\varphi:G\\to H\\) induces an isomorphism\n\n\\[G/\\ker\\varphi\\cong\\operatorname{im}\\varphi.\\]\n\nThe induced map is\n\n\\[g\\ker\\varphi\\longmapsto\\varphi(g).\\]\n\nIt is well-defined because two representatives belong to the same coset exactly when they have the same image.\n\nAccordingly, every group homomorphism factors as\n\n\\[G \\xrightarrow{\\ \\pi\\ } G/\\ker\\varphi \\xrightarrow{\\ \\cong\\ } \\operatorname{im}\\varphi \\hookrightarrow H.\\]\n\nThis separates the map into a quotient, an isomorphism, and an inclusion.\n\nMore generally, if \\(N\\) is normal in \\(G\\), a homomorphism \\(\\varphi:G\\to H\\) factors through \\(G/N\\) if and only if \\(N\\subseteq\\ker\\varphi\\). In that case there is a unique homomorphism\n\n\\[\\overline{\\varphi}:G/N\\to H\\]\n\nsuch that \\(\\varphi=\\overline{\\varphi}\\circ\\pi\\). This is the universal property of the quotient group."
    },
    {
      "heading": "Examples",
      "text": "Reduction modulo an integer\n\nFor a positive integer \\(n\\), reduction modulo \\(n\\) gives a homomorphism of additive groups:\n\n\\[\\varphi:\\mathbb Z\\to\\mathbb Z/n\\mathbb Z, \\qquad \\varphi(k)=[k].\\]\n\nIts kernel is \\(n\\mathbb Z\\), and it is surjective. This connects modular arithmetic with the quotient construction.\n\nEvery homomorphism from the additive group \\(\\mathbb Z\\) to a group \\(H\\) is determined by the image of \\(1\\). For any \\(h\\in H\\), the formula\n\n\\[\\varphi(k)=h^k\\]\n\ndefines such a homomorphism. A homomorphism from \\(\\mathbb Z/n\\mathbb Z\\) to \\(H\\) is similarly determined by an element \\(h\\) satisfying \\(h^n=e_H\\).\n\nExponential maps\n\nThe ordinary exponential function defines an isomorphism\n\n\\[\\exp:(\\mathbb R,+)\\to(\\mathbb R_{>0},\\times),\\]\n\nbecause \\(e^{x+y}=e^xe^y\\), and every positive real number has a unique real logarithm.\n\nA related homomorphism is\n\n\\[\\varphi:(\\mathbb R,+)\\to S^1, \\qquad \\varphi(t)=e^{2\\pi it},\\]\n\nwhere \\(S^1\\) is the group of complex numbers of absolute value \\(1\\) under multiplication. It is surjective with kernel \\(\\mathbb Z\\), giving\n\n\\[\\mathbb R/\\mathbb Z\\cong S^1.\\]\n\nDeterminants\n\nFor a field \\(F\\), let \\(\\operatorname{GL}_n(F)\\) be the group of invertible \\(n\\times n\\) matrices. The determinant defines a homomorphism\n\n\\[\\det:\\operatorname{GL}_n(F)\\to F^\\times,\\]\n\nsince\n\n\\[\\det(AB)=\\det(A)\\det(B).\\]\n\nHere \\(F^\\times\\) denotes the multiplicative group of nonzero field elements. The kernel is the special linear group\n\n\\[\\operatorname{SL}_n(F) =\\{A\\in\\operatorname{GL}_n(F):\\det A=1\\}.\\]\n\nFor \\(n\\geq1\\), the determinant map is surjective.\n\nThe sign of a permutation\n\nThe sign map on the symmetric group is a homomorphism\n\n\\[\\operatorname{sgn}:S_n\\to\\{1,-1\\},\\]\n\nwhere the target operation is multiplication. Its kernel is the alternating group \\(A_n\\), consisting of even permutations. For \\(n\\geq2\\), it is surjective and gives\n\n\\[S_n/A_n\\cong\\{1,-1\\}.\\]"
    },
    {
      "heading": "Important types",
      "text": "A group homomorphism is called:\n\n- A monomorphism if it is injective.\n- An epimorphism if it is surjective.\n- An isomorphism if it is bijective.\n- An endomorphism if its domain and codomain are the same group.\n- An automorphism if it is an isomorphism from a group to itself.\n\nThe inverse function of a bijective group homomorphism is automatically a homomorphism. Thus an isomorphism preserves the complete group structure in both directions.\n\nFor each \\(g\\in G\\), conjugation defines an automorphism\n\n\\[c_g:G\\to G,\\qquad c_g(x)=gxg^{-1},\\]\n\ncalled an inner automorphism.\n\nThe trivial map \\(G\\to H\\), sending every element to \\(e_H\\), is always a homomorphism. By contrast, inversion \\(g\\mapsto g^{-1}\\) is a homomorphism from \\(G\\) to itself exactly when \\(G\\) is abelian, because\n\n\\[(xy)^{-1}=y^{-1}x^{-1}.\\]"
    },
    {
      "heading": "Composition and categorical structure",
      "text": "If \\(\\varphi:G\\to H\\) and \\(\\psi:H\\to K\\) are homomorphisms, their composition is a homomorphism:\n\n\\[(\\psi\\circ\\varphi)(xy) =(\\psi\\circ\\varphi)(x)(\\psi\\circ\\varphi)(y).\\]\n\nIdentity maps are also homomorphisms. Groups together with their homomorphisms therefore form the category \\(\\mathbf{Grp}\\) in category theory.\n\nThe set of homomorphisms \\(G\\to H\\) is denoted by \\(\\operatorname{Hom}(G,H)\\). When \\(H\\) is an abelian group, pointwise multiplication gives this set an abelian group structure:\n\n\\[(\\varphi\\psi)(g)=\\varphi(g)\\psi(g).\\]\n\nFor a nonabelian target, the pointwise product of homomorphisms need not be a homomorphism."
    },
    {
      "heading": "Applications and additional structure",
      "text": "A group action of \\(G\\) on a set \\(X\\) is equivalently a homomorphism\n\n\\[G\\to\\operatorname{Sym}(X),\\]\n\nwhere \\(\\operatorname{Sym}(X)\\) is the group of all permutations of \\(X\\). Its kernel consists of the elements acting trivially on every point. An action is faithful precisely when this homomorphism is injective.\n\nIn representation theory, a linear representation is a homomorphism\n\n\\[\\rho:G\\to\\operatorname{GL}(V),\\]\n\nwhere \\(\\operatorname{GL}(V)\\) is the group of invertible linear transformations of a vector space \\(V\\). This expresses abstract group operations through linear transformations.\n\nEvery linear map is a homomorphism between the underlying additive groups of its vector spaces. The converse is not generally true: a group homomorphism preserves addition but need not preserve scalar multiplication.\n\nIn algebraic topology, a basepoint-preserving continuous map induces a homomorphism between fundamental groups. Such induced maps translate questions about spaces and continuous maps into questions about groups.\n\nAdditional structure requires additional conditions. A homomorphism between topological groups is not necessarily continuous; a continuous group homomorphism must satisfy both requirements. For Lie groups, smooth homomorphisms also interact with the associated Lie algebras. An abstract group isomorphism alone therefore does not guarantee an isomorphism of topological or smooth structures."
    }
  ],
  "links": [
    "mathematical-function",
    "group-theory",
    "homomorphism",
    "normal-subgroup",
    "injective-function",
    "surjective-function",
    "coset",
    "first-isomorphism-theorem",
    "isomorphism",
    "universal-property",
    "modular-arithmetic",
    "exponential-function",
    "field-mathematics",
    "determinant",
    "symmetric-group",
    "bijective-function",
    "automorphism",
    "function-composition",
    "category-theory",
    "abelian-group",
    "group-action",
    "representation-theory",
    "linear-map",
    "algebraic-topology",
    "fundamental-group",
    "lie-group"
  ],
  "sources": [],
  "license": "https://creativecommons.org/licenses/by/4.0/"
}