Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

If ker $f = \{ (1), (12)(34), (14)(23), (13)(24) \}$, which is the Klein 4 group, how do I prove that it is an Abelian group? Do I just show that each element in the ker $f$ is commutative to prove this?

share|cite|improve this question
Elements are not commutative. Elements can commute, and if all elements commute, the operation is commutative. In this case yes, just check all the compositions. – Tobias Kildetoft Aug 26 '13 at 19:35

Let $G$ be a non-abelian group. Then $ab\ne ba$ for some $a,b\in G$. Then clearly $a\ne 1$ and $b\ne 1$ and $a\ne b$. Also $ab\notin\{1,a,b\}$ and $ba\notin\{1,a,b\}$. That already makes five distinct elements $1,a,b,ab,ba$.

share|cite|improve this answer
(One can then conclude that all groups of order four are abelian.) – user1729 Aug 27 '13 at 18:44
@user1729 In fact, all groups of order $\le 4$. And since $5$ is a prime, ... – Hagen von Eitzen Aug 27 '13 at 21:04
Well, yeah, but you haven't proven that... – user1729 Aug 27 '13 at 21:25

There are only $4$ elements, so just check by hand that $ab = ba$ for any $a, b$. It's true automatically if either $a$ or $b$ is $1$ so actually there are only three pairs to check.

share|cite|improve this answer
So, for example would I check that $(12)(34) = (34)(12)$? – user91154 Aug 26 '13 at 19:39
No, that's true and shows you that $(1 \ 2)$ and $(3 \ 4)$ commute, but these aren't elements in your group. You have to show, for example, that $(1 \ 2)(3 \ 4)(1 \ 4)(2 \ 3) = (1 \ 4)(2 \ 3)(1 \ 2)(3 \ 4)$ so that you can conclude that $(1 \ 2)(3 \ 4)$ and $(1 \ 4)(2 \ 3)$ commute. – Jim Aug 26 '13 at 19:41
oh okay. I see what you mean. – user91154 Aug 26 '13 at 19:43

You don't need to prove it for this particular group, because ALL 4 element groups are abelian, you can prove that like this:

Suppose that for all $a\in G$, we have that $a^2=1$, or equivalently $a=a^{-1}$, then the group is abelian:


If our supposition is not true, then there exist an element $a$ such that $a^2\neq 1$ different from $1$, and the group generated by this element, by Lagrange's theorem, must have order $4$, so $\langle a\rangle=G$, so the group is cyclic and abelian.

share|cite|improve this answer
You can, of course shorten this by observing that the OP's group satisfies the property that $a^2=1$ for all $a\in G$. – Donkey_2009 Aug 31 '13 at 17:57

This is a slightly less direct approach--one you probably would not think of if you were attempting a problem like this for the first time)--but hopefully you (or others) will find this alternative solution to be instructive.

Theorem: Let $G$ be a group such that every element of $G$ other than the identity has order $2$. Then $G$ is abelian.

Proof: Let $x$ and $y$ be any two elements of $G$. Then we must show that $xy=yx$. I will write $e$ to indicate the identity element. $$e=(xy)^2=xyxy$$ $$x^{-1}=x^{-1}e=x^{-1}xyxy=yxy$$ $$y^{-1}x^{-1}=y^{-1}yxy=xy$$ Now note that since $x$ and $y$ each have order $2$, $x=x^{-1}$ and $y=y^{-1}$, so $yx=xy$.

I leave it up to you to verify that the non-identity elements of the group in question have order $2$.

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.