The Center, Centralizer, and Normalizer
Beneath this mask there is more than flesh. Beneath this mask there is an idea, Mr. Creedy, and ideas are bulletproof. — V for Vendetta
In an Abelian group, every element commutes ($ab = ba$). In a non-Abelian group, commutativity is not guaranteed. However, even in highly non-commutative groups, there are always some elements that commute with others.
To measure “how commutative” a group is, mathematicians define three specific subgroups: the Center (global commutativity), the Centralizer (element-wise commutativity), and the Normalizer (set-wise commutativity).
1. The Centralizer
Suppose you have a group $G$ and you single out a specific subset of elements, $A$. We want to find all the elements in the entire group that play nicely (commute) with everything inside $A$.
Definition: Let $G$ be a group, and let $A$ be a non-empty subset of $G$. The centralizer of $A$ in $G$, denoted $C_G(A)$, is the set of all elements in $G$ that commute with every single element in $A$. Formally, $C_G(A) = \{g \in G \mid ga = ag \quad \forall a \in A\}$.
By multiplying both sides by $g^{-1}$ on the right, this is frequently written as: $C_G(A) = \{g \in G \mid gag^{-1} = a \quad \forall a \in A\}$.
Proposition: The centralizer $C_G(A)$ is always a valid subgroup of $G$.
Proof (Using the One-Step Subgroup Test):
- Non-empty: The identity element $e$ commutes with everything ($ea = ae = a$). Thus, $e \in C_G(A)$, so the set is non-empty.
- One-Step Test: Let $x, y \in C_G(A)$. We must prove that $xy^{-1} \in C_G(A)$.
This means we must prove $(xy^{-1})a = a(xy^{-1})$ for any $a \in A$. First, because $y \in C_G(A)$, we know $ya = ay$.
Multiply on the left and right by $y^{-1}$: $y^{-1}(ya)y^{-1} =[\text{Since: } y \in C_G(A)] y^{-1}(ay)y^{-1} \implies ay^{-1} = y^{-1}a$
This proves that if an element commutes, its inverse also commutes.
Now, let $x, y \in C_G(A)$ and we test the combined element $xy^{-1}$:
$$\begin{aligned} (xy^{-1})a &= x(y^{-1}a) \quad &\text{[Associativity]} \\ &= x(ay^{-1}) \quad &\text{[Because } y^{-1} \text{ commutes with } a] \\ &= (xa)y^{-1} \quad &\text{[Associativity]} \\ &= (ax)y^{-1} \quad &\text{[Because } x \text{ commutes with } a] \\ &= a(xy^{-1}) \quad &\text{[Associativity]} \end{aligned}$$Because $(xy^{-1})a = a(xy^{-1})$, the element $xy^{-1}$ perfectly commutes with $A$, meaning $xy^{-1} \in C_G(A)$. By the One-Step test, $C_G(A) \le G$. $\blacksquare$
Note: If $G$ is an Abelian group, every element commutes with everything. Therefore, for any subset $A$, the centralizer is just the whole group: $C_G(A) = G$.
2. The Center of a Group
What if we want to find the elements that commute with the entire group?
Definition: The center of a group $G$, denoted $Z(G)$, is the set of elements that commute with absolutely every element in the group. $Z(G) = \{g \in G \mid gx = xg \quad \forall x \in G\}$
Notice that the Center is just the Centralizer where the subset $A$ is the entire group! $Z(G) = C_G(G)$
Because we just proved that the centralizer is always a subgroup, it immediately follows that the Center is always a subgroup: $Z(G) \le G$.
Examples.
The center of an Abelian group, G, is the group itself.
The Center of the Quaternion Group ($Q_8$).
The Quaternion group is defined by the presentation: $Q_8 = \langle a, b \mid a^4 = e, a^2 = b^2, ba = a^{-1}b \rangle$
Any element $x \in Q_8$ can be written as $x = a^i b^j$. For $x$ to be in the Center, it must commute with all generators, meaning $xa = ax$ and $xb = bx$.
Testing $xa = ax$: $(a^i b^j)a = a(a^i b^j) \implies a^i b^j a = a^{i+1}b^j$
Cancel $a^i$ on the left: $b^j a = a b^j$.
If $j=1$, this requires $ba = ab$. But our group rules state $ba = a^{-1}b$. This forces $a = a^{-1} \implies a^2 = e$, which is false (the order of $a$ is 4). Thus, $j \neq 1$. Therefore, $j=0$, which means $x = a^i$ (the element contains no $b$ components).Testing $xb = bx$: Since $x = a^i$, this requires $a^i b = b a^i$. Applying the rule $ba = a^{-1}b$ repeatedly gives $b a^i = a^{-i}b$. Thus, $a^i b = a^{-i} b \implies a^i = a^{-i} \implies a^{2i} = e$. In $Q_8$, $a^{2i} = e$ is only satisfied if $i = 0$ ($x = a^0 = e$) or $i = 2$ ($x = a^2$). Therefore, the center of the Quaternions is exactly two elements: $Z(Q_8) = \{e, a^2\}$. In standard notation, this is $\{\pm 1\}$.
- The Center of the Dihedral Group ($D_n$).
The Dihedral Group $D_n$ represents the symmetries of a regular polygon with $n$ vertices (where $n \ge 3$). It is generated by a single rotation $r$ and a single reflection $s$. $D_n = \langle r, s \mid r^n = e, s^2 = e, sr = r^{-1}s \rangle$
Because $D_n$ contains all possible combinations of rotations and reflections, every single element $x$ in the group can be written in a standard form: $x = r^i s^j$ where $0 \le i < n$ (the rotation power) and $j \in \{0, 1\}$ (whether the shape is flipped or not).
To find the Center of the group, $Z(D_n)$, we are looking for elements $x$ that commute with absolutely everything in the group. Because the group is entirely generated by $r$ and $s$, an element $x$ is in the Center if and only if it commutes with both generators: $xr = rx$ and $xs = sx$
Let’s test these two conditions slowly.
Condition 1: Commuting with Rotations ($xr = rx$)
Let’s plug our generic element $x = r^i s^j$ into this equation: $(r^i s^j)r = r(r^i s^j)$. To evaluate this, we must split it into two cases based on the value of $j$.
Case 1: $j = 0$ (The element is a pure rotation, $x = r^i$).
$$\begin{aligned} (r^i s^0)r &= r(r^i s^0) \\ r^i r &= r r^i \\ r^{i+1} &= r^{i+1} \end{aligned}$$This works perfectly. Pure rotations always commute with other pure rotations.
Case 2: $j = 1$ (The element includes a reflection, $x = r^i s$).
$$\begin{aligned} (r^i s^1)r &= r(r^i s^1) \\ r^i (sr) &= r^{i+1} s \end{aligned}$$Now, we use the core Dihedral rule $sr = r^{-1}s$ to swap the order on the left side:
$$\begin{aligned} r^i (r^{-1}s) &= r^{i+1} s \\ r^{i-1} s &= r^{i+1} s \end{aligned}$$By right-cancellation, we cancel the $s$: $r^{i-1} = r^{i+1}$
Multiply both sides by $r^{1-i}$: $e = r^2$ This equation requires the square of a rotation to be the identity. But by definition, $n \ge 3$, meaning it takes at least 3 rotations to return to the identity. Therefore, $r^2 \neq e$. This is a contradiction ($\bot$).
Conclusion from Condition 1: The element $x$ cannot contain a reflection. It is mathematically forced that $j=0$. The Center can only possibly contain pure rotations, so $x = r^i$.
Condition 2: Commuting with Reflections ($xs = sx$)
Now we take our surviving candidate, $x = r^i$, and force it to commute with the reflection $s$. $(r^i)s = s(r^i)$
We need to move the $s$ to the right side of the equation. We know that $sr = r^{-1}s$. If we apply this rule $i$ times, we get the generalized rule for pushing a reflection past a power of a rotation: $s r^i = r^{-i} s$.
Substitute this into the right side of our equation: $r^i s = r^{-i} s$
By right-cancellation, cancel the $s$: $r^i = r^{-i}$
Multiply both sides by $r^i$: $r^{2i} = e$
Solving the Order Equation
We are looking for an integer $i$ such that rotating $2i$ times yields the identity. In a cyclic group of order $n$, this means $2i$ must be a perfect multiple of $n$. $2i = k \cdot n \quad \text{for some integer } k$
Recall our strict bounds on $i$: $0 \le i < n$
Multiply the entire inequality by 2: $0 \le 2i < 2n$. Because $2i$ must be a multiple of $n$, and it must live strictly between $0$ and $2n$, there are only two mathematical possibilities for $2i$:
- $2i = 0 \implies i = 0$. This gives $x = r^0 = e$. The identity element is always in the Center.
- $2i = n \implies i = \frac{n}{2}$.
Does the second solution work? It depends entirely on the geometry of the polygon (whether $n$ is even or odd).
- If $n$ is odd (e.g., a triangle, $n=3$): The number $\frac{n}{2}$ is a fraction (like $1.5$). But $i$ must be an integer (you cannot perform 1.5 rotations). Therefore, this solution is invalid. The Center is trivial.
- If $n$ is even (e.g., a square, $n=4$): The number $\frac{n}{2}$ is a perfect integer (like $2$). The element $x = r^{n/2}$ exists and is perfectly valid.
Final Conclusion. The Center of the Dihedral Group depends strictly on the parity of $n$: $Z(D_n) = \begin{cases} \{e\}, & \text{if } n \text{ is odd} \\ \{e, r^{n/2}\}, & \text{if } n \text{ is even} \end{cases}$
Geometric Intuition: Why does parity matter? If you take an odd shape (a triangle) and flip it, the point facing “up” now faces “down.” No rotation can ever commute identically with this. However, if you take an even shape (a square), rotating it by exactly 180 degrees ($r^{n/2}$) possesses perfect point symmetry. Flipping a square horizontally and then rotating it 180 degrees yields the exact same visual orientation as rotating it 180 degrees and then flipping it. The 180-degree turn is completely immune to the order of reflections!
3. The Normalizer
The Centralizer demands strict element-by-element commutativity ($gag^{-1} = a$). What if we loosen this restriction? What if $g$ conjugates $a$ into a different element, but that new element is still inside the subset $A$?
This is set-wise commutativity, called the Normalizer.
Definition: The normalizer of a subset $A$ in $G$ is the set of all elements in $G$ that commute with the set $A$ as a whole. $N_G(A) = \{g \in G \mid gAg^{-1} = A\}$, or equivalently: $N_G(A) = \{g \in G \mid gA = Ag\}$.
Because $gag^{-1} = a$ implies $gAg^{-1} = A$, every element in the Centralizer is automatically in the Normalizer. Thus, we have a guaranteed hierarchy of subgroups: $Z(G) \le C_G(A) \le N_G(A) \le G$
- Normalizer vs Centralizer in $D_8$. Let $G = D_8$ (the symmetries of an octagon, generated by $r$ and $s$).
Let our subset be the group of all rotations: $A = \{e, r, r^2, \dots, r^7\} = \langle r \rangle$.
Finding the Centralizer, $C_G(A)$:
Which elements commute with every single rotation? We already know rotations commute with other rotations, so $A \subseteq C_G(A)$. Do reflections commute with rotations? No, because $sr = r^{-1}s \neq rs$. Therefore, no reflection is in the centralizer. Thus, $C_G(A) = A$.
Finding the Normalizer, $N_G(A)$: Which elements commute with the set of rotations? We already know $C_G(A) \le N_G(A)$, so all rotations are in the Normalizer.
What about reflections? Let’s conjugate the entire set $A$ by the reflection $s$: $sAs^{-1} = s \langle r \rangle s^{-1}$
Because $s r^k s^{-1} = r^{-k}$, conjugating any rotation just yields the opposite rotation. But the opposite rotation is still inside the set $A$! Therefore, $sAs^{-1} = A$. The reflection $s$ normalizes $A$. Because the Normalizer contains all rotations and at least one reflection, it generates the entire group. Thus, $N_G(A) = D_8$.
Bibliography
- NPTEL-NOC IITM, Introduction to Galois Theory.
- Algebra, Second Edition, by Michael Artin.
- LibreTexts, Abstract and Geometric Algebra, Abstract Algebra: Theory and Applications (Judson).
- Field and Galois Theory, by Patrick Morandi. Springer.
- Michael Penn (Abstract Algebra), and MathMajor.
- Contemporary Abstract Algebra, Joseph, A. Gallian.
- Andrew Misseldine: College Algebra and Abstract Algebra.

