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 center of a group

Use when: you're given a specific group G with a known generating set and asked for every element that commutes with all of G

Goal: the complete set Z(G), confirmed one candidate at a time

Taught in The center of a group

  1. 1

    List e as a confirmed member of Z(G) right away. No computation is needed for it.

    Example

    In any group, ge=eg=g for every g. So e passes every possible test, no exceptions.

    Why: the identity axiom guarantees e commutes with everything, in every group, no exceptions.

  2. 2

    For a candidate x\ne e, check whether x commutes with each generator of G. No need to check all |G| elements one at a time.

    Example

    In D_4=\langle r,s\rangle, test x=r^2 against s. (Testing r^2 against r itself is automatic, since powers of r always commute with each other.) Chapter 5's relation gives sr^2=r^2s, so r^2 commutes with s too.

    • x commutes with every generator — x belongs to Z(G).
    • x fails to commute with at least one generator — x is out; stop testing that candidate right away.

    ⚡ Shortcut

    If G is abelian, skip this whole step. Every element commutes with every generator automatically. So Z(G)=G outright, with no testing at all.

    Why: a candidate that commutes with the generators commutes with every element those generators build. That's the same fact, used step by step, that proved Z(G) is closed.

  3. 3

    Work through the rest of G's elements the same way, testing each against the generators. Gather everyone who passes, together with e from Step 1.

    Example

    Testing r,r^2,r^3,s,rs,r^2s,r^3s against \{r,s\} in D_4 leaves only r^2 standing, from Step 2's example. Together with e, that gives Z(D_4)=\{e,r^2\}.

    Why: Z(G) is defined as the full set of elements that commute with everything. So no candidate can be skipped without being checked.

Common mistakes

  • Testing a candidate against only one or two elements picked at random, instead of the full set of generators, and stopping on a false positive.
  • Confusing "commutes with some element" (cheap -- true for e and the element itself) with "commutes with every element" (the actual bar).
  • Assuming Z(G) must hold just the identity whenever G is non-abelian, when D_4 already shows a non-abelian group can have a bigger center.
  • Forgetting that non-abelian only rules out Z(G)=G. It says nothing about how much smaller than G the center has to be.