# Why is associativity required for groups?

Why is associativity required for groups?

I'm doing a linear algebra paper and we're focusing on groups at the moment, specifically proving whether something is or is not a group. There are four axioms:

1. The set is closed under the operation.
2. The operation is associative.
3. The exists and identity in the group.
4. Each element in the group has an inverse which is also in the group.

Why does the operation need to be associative?

Thanks

-

The formalist's answer is: it is just a definition. You could just as well consider studying algebraic structures that satisfy all the axioms for a group except for associativity, and you would be then studying loops.

Now the question might be: why is the study of groups more ubiquitous than the study of loops? There are historical reasons (surely others with greater knowledge can expand upon this), and the fact that most loops that arise naturally when doing math are in fact groups is probably a reason too.

-
Thanks for the answer, I have one more question if you don't mind. Because of the associativity axiom we obviously need to check if the operation is associative. Does the associativity of the operation always "come from" the underlying set? How do you go about proving something is associative without prior knowledge that it is? For instance, how would one prove that $1 + (2 + 3)$ = $(1 + 2) + 3$ without simply accepting that it is? This has been confusing me because all proofs we do for associativity generally just state that it is. –  user1520427 Jul 19 '12 at 4:14
@user1520427: for example, I know that $2 + 3 = 5, 1 + 5 = 6$. I also know that $1 + 2 = 3, 3 + 3 = 6$. So I can verify associativity in this case. If you want to prove that integer addition is associative you would need to start from a particular definition of integer addition. –  Qiaochu Yuan Jul 19 '12 at 4:44
This is a good question! Generally, proving associativity of an operation is either very easy, because it comes immediately from the underlying structure, or it is very difficult/tedious, because you have to verify it for a large number of cases. This second situation can arise if you are trying to find all groups of a given order - particularly when the order is a power of a prime. –  Derek Holt Jul 19 '12 at 9:21

In short, because that's how we choose to define them, because adding associativity allows us to study certain things more robustly.

There are algebraic structures that are group-like but don't satisfy all those axioms. A quasi-group need not be associative, and a loop need not be associative, but must have unity.

So, it may sound circular, but a group must be associative because if it is not, then it is not a group. A more apt question may be "why do we study group theory and not quasi-group theory?" In some senses, associativity gives us more freedom and power.

-

The important thing to understand is that fulfilling these 4 axioms is all there is to being a group-in mathematics, we construct objects by imposing conditions on them and the underlying aggregates. (I'm not using the term "set" since mathematics doesn't always deal with sets,but you get the idea.) What allows us to build a theory around a particuar defined object is the fact that whatever we choose the properties to be,those properties must be consistent with each other. It's the consequences of those properties cooexisting consistently that gives any object it's distinctive properties spelled out in the body of theorums and corollaries. And that's the answer to your question: It turns out if you don't have associativity-that is, if axiom (2) is false, then axiom (4) is false because then you can have a set which has left inverses which are not right inverses and the definition assumes the inverse ( as well as the identity) is 2 sided. Consider an element x of a group G where there is a unique identity e and a left inverse l and a right inverse r for x. Then by axiom (4),they must be equal since both yield the unique identity and every inverse must be 2 sided. But:

l = l*e = 1*( x*r) = (1*x)*r = e*r= r.

But clearly the fact of l= r is dependent on the associativity of the operation. So whatever this algebraic structure is,it's not a group without it.

-
I see my fan club is back and busy randomly and anonymously downvoting me again. Have at it. –  Mathemagician1234 Jul 24 '12 at 8:29
Upvoted to even things out. I just wanted to note that it's strange to call axioms "false". Moreover, the last part of this is a bit strange, since you are saying that (2) "false" implies (4) "false", but in the case that we exclude (2), we will just get structures which satisfy (1), (3), and (4) --- the ordinary groups won't necessarily be part of these structures. This doesn't mean, though, that axiom (4) is false in some way, just that we must restrict our structures. –  james Jul 28 '12 at 22:32
@james It really depends on how both axiom (3) and (4) are interpreted.I assumed,as most algebraicists do, that an inverse for specific element and the identity for the entire group are 2 sided. We can weaken (3) and (4) so that the inverses and identities are assumed strictly one sided-indeed,we can assume there is AT LEAST ONE of each,which means it is not required the identity or inverses are 2 sided,let alone unique.But if we assumed this without associativity.But again,the resulting structures would not be groups unless we did a radical redefining and rederiving of their properties. –  Mathemagician1234 Jul 29 '12 at 4:59
I'm not really talking about the specific axioms here, I'm just talking in general --- axioms can't really be "false". If we don't include a particular axiom somewhere, we'll get different structures. –  james Jul 29 '12 at 19:54
@james We're really saying the same thing. What I tried to do with my response-that the OP really isn't getting-is to show why it MUST be so. The truth of ALL the axioms is ALL THAT IT MEANS to be a particular structure and the second we drop any of them,we have a different structure. That's what the OP didn't seem to grasp. –  Mathemagician1234 Aug 4 '12 at 2:36

Groups are an abstraction. What do they abstract? The idea of symmetry. Symmetries are functions from a set to itself that preserve some structure of that set; for example, the symmetries of a square are rotations and reflections, and they preserve "squareness" (to put it vaguely).

The multiplication in a group abstracts composition of symmetries (for example "rotate $90^{\circ}$, then reflect about the line $x = y$"), and composition of functions is always associative.

-