{
  "aliases": null,
  "backlinks": [
    {
      "field": "illustrates",
      "target": "7GEXM87S0H"
    },
    {
      "field": "proves",
      "target": "D05NAAC3XK"
    },
    {
      "field": "uses",
      "target": "H4QSPK0XTZ"
    }
  ],
  "body": "\n## Statement\n\nLet $G$ and $H$ be [[groups|G5S1M9]], let $e_G$ be the identity element of $G$, and let $\\varphi \\colon G \\to H$ be a [[group homomorphism|0JYTG5K9Y4]].\nThen $\\varphi$ is injective if and only if $\\ker \\varphi = \\{e_G\\}$.\n\n## Remarks\n\nIf $\\varphi(a) = \\varphi(b)$, then $\\varphi(a^{-1}b) = e_H$, so $a^{-1}b \\in \\ker \\varphi$.\nMore generally, $\\varphi(a) = \\varphi(b)$ exactly when $a$ and $b$ lie in the same coset of $\\ker \\varphi$.\n\n## Explanations\n\n### L1 human\n\nTo check that a homomorphism is injective, you only need to check one fibre: the elements that go to the identity.\nIf only the identity goes to the identity, then no two elements can go to the same place.\nThis is much easier than comparing all pairs of elements.\n\n### L2 agent\n\nFor a map of sets, injectivity needs a check on each pair of points. For a homomorphism, it is enough to look at one fibre, the kernel.\n\nThe proof uses the group structure to move any pair to the identity:\n\n1. If $\\varphi$ is injective, then only $e$ maps to $e$, because $\\varphi(e) = e$.\n2. Conversely, suppose that $\\ker \\varphi = \\{e\\}$ and $\\varphi(a) = \\varphi(b)$.\n3. Then $\\varphi(a^{-1}b) = \\varphi(a)^{-1}\\varphi(b) = e$.\n4. Thus $a^{-1}b = e$, and $a = b$.\n\nA worked example with $\\varphi : \\mathbb{Z} \\to \\mathbb{Z}$, $\\varphi(n) = 3n$:\n\n1. The map is a homomorphism, because $3(m + n) = 3m + 3n$.\n2. If $3n = 0$, then $n = 0$. Thus the kernel is $\\{0\\}$.\n3. By the result, $\\varphi$ is injective. There is no need to compare pairs.\n\nA non-example is reduction modulo $3$, $\\mathbb{Z} \\to \\mathbb{Z}/3\\mathbb{Z}$. Its kernel is $3\\mathbb{Z}$, which is not trivial. Thus the map is not injective: for example, $0$ and $3$ have the same image.\n\nMore generally, $\\varphi(a) = \\varphi(b)$ exactly when $a^{-1}b \\in \\ker\\varphi$, that is, when $a$ and $b$ are in the same coset of the kernel. Thus each fibre of $\\varphi$ is a coset of the kernel, or it is empty.\n\nA common error is to use the test for a map that is not a homomorphism. The map $x \\mapsto x^2$ on $\\mathbb{R}$ sends only $0$ to $0$, but it is not injective.\n",
  "commit": "4da93a4f525f10adcd3643fb06f785669846f797",
  "front": {
    "about": [
      "0JYTG5K9Y4",
      "0W88CEGQP1"
    ],
    "formal": [
      {
        "adapter": "Math2.Match.injective_iff_ker",
        "decl": "MonoidHom.ker_eq_bot_iff",
        "library": "mathlib",
        "match": "stronger",
        "system": "lean4"
      }
    ],
    "kind": "statement",
    "msc": [
      "20A05"
    ],
    "name": "A homomorphism is injective iff its kernel is trivial",
    "role": "proposition",
    "sources": [
      {
        "locator": "Group homomorphisms",
        "url": "https://en.wikipedia.org/wiki/Kernel_(algebra)"
      }
    ],
    "tag": "0N2P0XRTDF",
    "uses": [
      "0Z424HK8CQ",
      "08FKQD7NJ3"
    ]
  },
  "kind": "statement",
  "link": "https://math2.tamnd.com/node/0N2P0XRTDF/",
  "links": [
    {
      "field": "about",
      "target": "0JYTG5K9Y4"
    },
    {
      "field": "about",
      "target": "0W88CEGQP1"
    },
    {
      "field": "uses",
      "target": "0Z424HK8CQ"
    },
    {
      "field": "uses",
      "target": "08FKQD7NJ3"
    }
  ],
  "markdown": "https://math2.tamnd.com/node/0N2P0XRTDF.md",
  "msc": [
    "20A05"
  ],
  "name": "A homomorphism is injective iff its kernel is trivial",
  "prov": null,
  "role": "proposition",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/0N2/0N2P0XRTDF.md",
  "status": null,
  "tag": "0N2P0XRTDF",
  "uri": "m2://0N2P0XRTDF",
  "url": "https://math2.tamnd.com/wiki/a-homomorphism-is-injective-iff-its-kernel-is-trivial/",
  "writing": {
    "tag": "0N2P0XRTDF",
    "kind": "statement",
    "level": "W0",
    "next": [
      {
        "what": "an inventory row",
        "note": "the row of the inventory that the node accounts for",
        "have": 0,
        "want": 1
      }
    ]
  }
}