Why is ring addition commutative?

Yes, there is a deeper reason, at least in my opinion. Most abstract axiomatic constructions in mathematics are inspired by or even equivalent to concrete examples. One of the most basic algebraic objects one can think of is the set $S^S$ of mappings from a set $S$ into itself, which has a natural associative multiplication (composition) and a unit (the identity map). Taking these properties as abstract axioms, one obtains the definition of a unital monoid. However, an element $m\in M$ of an abstractly defined unital monoid $M$ can be viewed as the map $[l_m:M\rightarrow M]\in M^M$ given by $l_m(x)=mx$. Mapping $m\in M$ to $l_m\in M^M$ induces an injective homomorphism of monoids so the abstract definition is really just language (albeit quite helpful) since $M$ is isomorphic to a submonoid of a mapping monoid. One can also consider submonoids of $S^S$ which contain only bijective maps. Again, taking this additional property (i.e. existence of inverses) as another axiom, one obtains the definition of a group - but every group can be viewed as a subgroup of a group of bijective maps on a set, so the abstract definition is really just language since it does not provide you with anything that truly generalizes the guiding example.

Now for unital rings the story is essentially the same, but whereas for unital monoids the basic model is $S^S$ and its submonoids, the basic model for rings is $\operatorname{End}(G)$ and its subrings, where $G$ is a abelian group. $\operatorname{End}(G)$ is the submonoid of the mapping monoid $G^G$ which contains only those maps which are group homomorphisms. The restriction to abelian groups is necessary since the pointwise product $(\varphi,\psi)\mapsto [x\mapsto \varphi(x)\psi(x)]$ (which is the addition in the ring $\operatorname{End}(G)$) of endomorphisms is another endomorphism only if $G$ is assumed to be abelian, in general. As with unital monoids and groups, an abstract unital ring $R$ embeds homomorphically and injectively into its own endomorphism ring $\operatorname{End}(R)$ by multiplication operators, and this is a homomorphism of unital rings (not just of unital monoids).

Thus, generalizing the definition of a ring in a manner which is suggested by the question is tantamount to generalizing the example $\operatorname{End}(G)$ to nonabelian $G$. As for how this could be done, there are two possibilities (actually more... see below in the edit). First, one could attempt to define a group structure on $\operatorname{End}(G)$ other than the pointwise product. This seems somewhat unnatural since the whole point of using $\operatorname{End}(G)$ is to exploit the presence of the group product in the first place. Still, one might speculate that for certain nonabelian groups there are structures on $\operatorname{End}(G)$ which are somehow derived from the group product and interact well with the composition - such a structure would be quite bizarre since at the very least, the distributive property will be lost, as explained in the other answers. The other avenue of generalization is to continue using the pointwise product, which as you may have noticed makes the entire mapping monoid $G^G$ into a group. Thus, it is possible to consider subsets of $G^G$ which are closed under both operations: pointwise product and composition. This is the guiding example of a "near ring" as described on Wikipedia. In general, a submonoid $M\subset G^G$ such that $M\subset \operatorname{End}(G)\subset G^G$ can be one of these only when $G$ is abelian, and these examples are the traditionally defined rings.

EDIT 12/23/2013 Earlier today I realized that there is an easy way to create an example of a "ring with nonabelian underlying group": just take your favorite nonabelian group $G$ written with $+$ (which is horrible, I know) and impose a second law of composition $\ast$ given by $(x,y)\mapsto x\ast y=e_G$. It is easily verified that $\ast$ is associative and distributes over $+$ so $(G,+,\ast)$ satisfies all ring axioms with the exception of the commutativity of $(G,+)$.

Now there is no conflict with the other answers here because the weird ring I've just described has no multiplicative identity. Thus, I have tried to insert the word "unital" = "possessing a two-sided identity" in various appropriate places in the above text in order to emphasize the assumption that an identity exists. Now if one does not assume the existence of an identity things can get complicated rather quickly. For instance, an arbitrary set $M$ can be made into a non-unital monoid by choosing a point $x\in M$ and imposing the law of composition $(m,n)\mapsto x$ for every pair $(m,n)\in M\times M$. This is clearly an associative law of composition, but there is no identity and, perhaps more importantly, the canonical homomorphism $m\in M\mapsto l_m\in M^M$ as defined above has only one point in its image (the point map onto $x$).

The point is that if $M$ does not contain an identity then $m\mapsto l_m$ is not necessarily injective so one does not necessarily see an exact copy of $M$ inside of $M^M$ - only a quotient. This means that the abstract definition of a (not necessarily unital) monoid can produce examples which are not canonically equivalent to the guiding example of $S^S$ and its submonoids, so in this case the definition is not "just language", as I wrote above.

There is a sufficient condition for the injectivity of $m\mapsto l_m$ which is more general than the existence of an identity element: if the right anti-representation $x\mapsto r_x\in M^M$ of $M$ is defined as usual ($r_x(m)=mx$) then $m\mapsto l_m$ will be injective provided that there is at least one $x\in M$ such that $r_x\in M^M$ is an injective map, for then $l_m=l_n$ implies $$ r_x(m)=l_m(x)=l_n(x)=r_x(n) $$ and therefore $m=n$ by the injectivity of $r_x$. I have a feeling that this is a manifestation of some more general phenomenon involving monomorphisms in the category of sets but I don't know enough about category theory to discuss this in any detail (maybe @Martin Brandenburg would like to leave a comment). In particular, if $M$ contains a two-sided identity $1$ then $r_1\in M^M$ is injective so $m\mapsto l_m$ injective.

At the level of rings, this means that in an abstractly defined ring, not necessarily with identity, the presence of at least one $x\in R$ such that $r_x\in \operatorname{End}(R)$ is injective forces the canonical representation $m\mapsto l_m$ to be injective and therefore to faithfully reproduce $R$ inside of $\operatorname{End}(R)$.

Now alot has been said on this thread about how the distributive property in a ring forces the underlying group to be abelian and the computation presented by Bill Dubuque and drhab uses the existence of a ring identity to show this. In fact, this can be proved assuming only that the canonical representation is injective:

Proposition. If $(R,+,\ast)$ satisfies all the ring axioms except the commutativity of the group $(R,+)$, then the canonical representation $x\mapsto [z\mapsto l_x(z)=x\ast z]$ is a homomorphism of both products into $R^R$ which takes values in $\operatorname{End}(R)$ and if this homomorphism is injective then $(R,+)$ is abelian.

Remark. Since the proposition requires two-sided distributivity of $\ast$ over $+$, the hypotheses are somewhat stronger than simply stating that $(R,+,\ast)$ is a near ring.

Proof.

1."$x\mapsto l_x$ takes values in $\operatorname{End}(G)$" uses distributivity from the left: $$ l_x(y+ z)=x\ast (y+ z)=(x\ast y) + (x\ast z)=l_x(y)+ l_x(z). $$

2."$x\mapsto l_x$ is a homomorphism $\ast\rightarrow \circ$" uses associativity of $\ast$: $$ l_{x\ast y}(z)=(x\ast y)\ast z=x\ast (y\ast z)=l_x\circ l_y(z). $$

3."$x\mapsto l_x$ is a homomorphism $+\rightarrow +$" uses distributivity from the right: $$ l_{x+ y}(z)=(x+ y)\ast z=(x\ast z)+ (y\ast z)=l_x(z)+ l_y(z)=(l_x+l_y)(z). $$

4.(R,+) is abelian if $x\mapsto l_x$ is injective: $$ l_{x+y}(z+z)=l_x(z+z)+l_y(z+z)=l_x(z)+l_x(z)+l_y(z)+l_y(z) =l_x(z)+l_{x+y}(z)+l_y(z) $$ but also $$ l_{x+y}(z+z)=l_{x+y}(z)+l_{x+y}(z)=l_x(z)+l_y(z)+l_x(z)+l_y(z)=l_x(z)+l_{y+x}(z)+l_y(z). $$ Canceling the outer terms (which is valid since $(R,+)$ is assumed to be a group), we have $l_{x+y}(z)=l_{y+x}(z)$. This being true for all $z$, we conclude that $x+y=y+x$ provided that $x\mapsto l_x$ is injective. The proposition is proved.

What if we drop the assumption that the canonical representation is injective? Then we can produce examples of "rings with nonabelian underlying groups" as I did at the beginning of the edit - to reiterate: just take your favorite nonabelian group $G$ written with $+$ (which is atrocious, I know) and impose a second law of composition $\ast$ given by $(x,y)\mapsto x\ast y=e_G$. It is easily verified that $\ast$ is associative and distributes over $+$ so $(G,+,\ast)$ satisfies all ring axioms with the exception of the commutativity of $(G,+)$. The proposition shows that the canonical representation cannot be injective and sure enough, it takes values only on a single point: the trivial endomorphism $[x\mapsto e_G]\in \operatorname{End}(G)$.

To sum things up I would say that

  1. Yes, the ring axioms can be relaxed to produce "rings with nonabelian underlying groups", however some nice property will have to be sacrificed: either

    • multiplication will not distribute from the left, which can give you a near-ring but then the image of the canonical representation will not lie in $\operatorname{End}(R)$, in general; or

    • the canonical representation will not be injective in which case you cannot adjoin an identity without severely disrupting the given algebraic structure (I assume that you will have to pass to some abelian quotient of the underlying group).

  2. In either case (and especially in the second case) these objects will not interact well with $\mathbb{Z}$, and in my estimation that is why they are mostly curiosities rather than the object of intense study.


In order to generalize rings to structures with noncommutative addition, one cannot simply delete the axiom that addition is commutative, since, in fact, other (standard) ring axioms force addition to be commutative (Hankel, 1867 [1]). The proof is simple: apply both the left and right distributive law in different order to the term $\rm\:(1\!+\!1)(x\!+\!y),\:$ viz.

$$\rm (1\!+\!1)(x\!+\!y) = \bigg\lbrace \begin{eqnarray}\rm (1\!+\!1)x\!+\!(1\!+\!1)y\, =\, x \,+\, \color{#C00}{x\!+\!y} \,+\, y\\ \rm 1(x\!+\!y)\!+1(x\!+\!y)\, =\, x\, +\, \color{#0A0}{y\!+\!x}\, +\, y\end{eqnarray}\bigg\rbrace\:\Rightarrow\: \color{#C00}{x\!+\!y}\,=\,\color{#0A0}{y\!+\!x}\ \ by\ \ cancel\ \ x,y$$

Thus commutativity of addition, $\rm\:x+y = y+x,\:$ is implied by these axioms:

$(1)\ \ *\,$ distributes over $\rm\,+\!:\ \ x(y+z)\, =\, xy+xz,\ \ (y+z)x\, =\, yx+zx$

$(2)\ \, +\,$ is cancellative: $\rm\ \ x+y\, =\, x+z\:\Rightarrow\: y=z,\ \ y+x\, =\, z+x\:\Rightarrow\: y=z$

$(3)\ \, +\,$ is associative: $\rm\ \ (x+y)+z\, =\, x+(y+z)$

$(4)\ \ *\,$ has a neutral element $\rm\,1\!:\ \ 1x = x$

Said more structurally, recall that a SemiRing is that generalization of a Ring whose additive structure is relaxed from a commutative Group to merely a SemiGroup, i.e. here the only hypothesis on addition is that it be associative (so in SemiRings, unlike Rings, addition need not be commutative, nor need every element $\rm\,x\,$ have an additive inverse $\rm\,-x).\,$ Now the above result may be stated as follows: a semiring with $\,1\,$ and cancellative addition has commutative addition. Such semirings are simply subsemirings of rings (as is $\rm\:\Bbb N \subset \Bbb Z)\,$ because any commutative cancellative semigroup embeds canonically into a commutative group, its group of differences (in precisely the same way $\rm\,\Bbb Z\,$ is constructed from $\rm\,\Bbb N,\,$ i.e. the additive version of the fraction field construction).

Examples of SemiRings include: $\rm\,\Bbb N;\,$ initial segments of cardinals; distributive lattices (e.g. subsets of a powerset with operations $\cup$ and $\cap$; $\rm\,\Bbb R\,$ with + being min or max, and $*$ being addition; semigroup semirings (e.g. formal power series); formal languages with union, concat; etc. For a nice survey of SemiRings and SemiFields see [2]. See also Near-Rings.

[1] Gerhard Betsch. On the beginnings and development of near-ring theory. pp. 1-11 in:
Near-rings and near-fields. Proceedings of the conference held in Fredericton, New Brunswick, July 18-24, 1993. Edited by Yuen Fong, Howard E. Bell, Wen-Fong Ke, Gordon Mason and Gunter Pilz. Mathematics and its Applications, 336. Kluwer Academic Publishers Group, Dordrecht, 1995. x+278 pp. ISBN: 0-7923-3635-6 Zbl review

[2] Hebisch, Udo; Weinert, Hanns Joachim. Semirings and semifields. $\ $ pp. 425-462 in: Handbook of algebra. Vol. 1. Edited by M. Hazewinkel. North-Holland Publishing Co., Amsterdam, 1996. xx+915 pp. ISBN: 0-444-82212-7 Zbl review, AMS review


$\left(1+1\right)\left(a+b\right)=1\left(a+b\right)+1\left(a+b\right)=a+b+a+b$

$\left(1+1\right)\left(a+b\right)=\left(1+1\right)a+\left(1+1\right)b=a+a+b+b$

So distributivity (on both sides) demands that $a+b=b+a$