Skip to content
Free public beta until December 4, 2026: every course is open, no card needed. After that, the first chapter of each course stays free and full access is a one-time $39 ($19 for up to 100 founding members chosen for helpful feedback). Your progress is kept. How the beta works

Recipe

Find the identity and an element's inverse

Use when: you have a set with an operation and need the identity element, or a specific element's inverse under that operation

Goal: the identity element (if one exists) and the inverse of a given element (if it exists)

Taught in Identity and inverses

Quick recipe

  1. Identify a candidate for the identity
  2. Verify e works on both sides for every element
  3. For a given element a, solve a * x = e for x
  4. Check whether that x actually lives in the set
  1. 1

    Look for one element e that seems to leave every other element unchanged when combined with it.

    Example

    In (\mathbb{Z}_6, +): try 0. Adding 0 to 1, 2, and every other element leaves it unchanged, so 0 is a candidate.

    Why: every later check in this recipe depends on having a single fixed element to test, so it has to be located first.

  2. 2

    Confirm e \ast a = a AND a \ast e = a hold for every a in the set, not just one example.

    • the operation is commutative (like ordinary addition) — checking one side automatically confirms the other.
    • the operation is not commutative (like composing symmetries) — both sides must be checked separately, since a \ast e = a doesn't guarantee e \ast a = a.

    Why: the definition of identity requires both e \ast a = a and a \ast e = a, and a non-commutative operation can behave differently on each side.

  3. 3

    Set up the equation using the specific operation and solve directly for the unknown x.

    Example

    Invert 4 in (\mathbb{Z}_6, +): solve 4 + x \equiv 0 \pmod 6; x=2 works, since 4+2=6\equiv 0.

    Why: this equation is exactly the defining property an inverse must satisfy, just rearranged to isolate the unknown.

  4. 4

    An inverse only counts if the value found in the previous step is itself a member of the set the operation acts on.

    Example

    In (\mathbb{N}, +), invert 3: solving 3+x=0 gives x=-3, which is not a natural number, so 3 has no inverse here.

    • x is in the set — a has an inverse; confirm x \ast a = e too before finalizing.
    • x is not in the set, or no solution exists at all — a has no inverse, even though an identity exists for the whole set.

    Why: this is the exact trap the definition warns about, an identity existing says nothing about whether every element's inverse also exists.

Common mistakes

  • Assuming an identity found by testing one element works for the whole set without checking the general case.
  • Checking only a \ast x = e and skipping x \ast a = e in a non-commutative setting.
  • Concluding an inverse doesn't exist just because the solved value "looks wrong," instead of checking set membership directly.
  • Forgetting that an identity's existence says nothing about whether every element also has an inverse.