# How is addition different than multiplication?

Is there a fundamental difference in the things we call multiplication and those we call addition?

In a field, both binary operations obey exactly the same rules (commutativity, associativity, identity element, and inverse element [actually this one is the same for all but 1 element: namely $0$]). In a ring, some of the multiplicative rules of a field are relaxed, but it seems like we could just as easily have relaxed the additive rules.
It seems that even the distributive law could also be defined so that addition distributes over multiplication (opposite to the normal way), and thus is only a distinguishing property -- when it even applies -- because we've decided it should be.

Other than the fact that often we require both operations on whatever set of "numbers" we're considering, is there some property of addition that is never shared by multiplication (and vice versa), no matter which generalization of each we choose? That is, can we define the necessary and sufficient conditions for a binary operation to be called "addition" or "multiplication"?

-
How can the distributive law be rewritten? I thought that this was the distinguishing property. Consider that $0\cdot a = 0$ but there is no such analog in addition. It is true that in every other way, multiplication and addition are interchangeable, but this distrubitive law makes a distinction between them. –  Myridium Jul 1 '14 at 21:38
What do you mean by generalization? –  Enjoys Math Jul 1 '14 at 21:38
In such a case, we have defined a multiplication operation denoted by $+$ and addition denoted by $\cdot$, no? –  Myridium Jul 1 '14 at 21:41
Even if two operations have isomorphic laws they can qualify as different. For example, the two binary operations of Boolean Algebra or also Lattice Theory both have a set of laws for operation A which are isomorphic to those for operation B (the principle of duality). But, A is still distinct from B. –  Doug Spoonwood Jul 2 '14 at 5:47
@hello: An example you might find interesting is that addition distributes over maximum: $x+\max(y,z)=\max(x+y,x+z)$. –  Steven Taschuk Jul 6 '14 at 23:37

Claude Shannon's master's thesis, a seminal contribution to Boolean algebra and electrical engineering, used the notation of addition and multiplication for the two operations that we now think of as AND (multiplication) and OR (addition), applied to the elements 0 and 1. In this case, not only does multiplication distribute over addition, $x(y+z)=xy+xz$, but addition also distributes over multiplication, $x+yz=(x+y)(x+z)$. (These are Shannon's equations 3a and 3b.)

Boolean algebra is completely symmetric in the two operations -- it doesn't matter which one you call addition and which one you call multiplication.

The usage of the terms "addition" and "multiplication" is like many issues of notation: Authors use whatever seems most natural to them, and as long as it's defined clearly, readers will deal with it.

-
Finally. I knew there had to be a system in which addition distributed over multiplication. I love the example. I love the explanation. +1 –  Bye_World Jul 9 '14 at 23:19
@Bye_World: You could accept the answer if you like it. ;-) –  Matt Nov 18 '14 at 18:10
Honestly I think this question should become a community wiki without one accepted answer. –  Bye_World Nov 19 '14 at 14:29
@Bye_World: According to this info (specifically point #3), this can be proposed by flagging the question, so I have done so. –  Matt Nov 20 '14 at 12:05

The property that distinguishes addition from multiplication is the distributive law. This is part of the convention of calling the operations addition and multiplication. If the distributive law wasn't there, we wouldn't call the operations by those names.

The fact that multiplication distributes over addition admits $0\cdot a = 0 \;\forall a$ where $0$ is the additive identity. There is no such analog for addition. This is one property that falls out of imposing the distributive law.

Another necessary property is that if every element has an additive inverse, then addition must be commutative. Observe the commutativity of addition derived from the distributive law and the existence of additive inverses: \begin{align}(1+1)(a+b)\quad &= 1(a+b) + 1(a+b)\\ &= (1+1)a + (1+1)b\end{align} $$a+b+a+b\quad =\quad a+a+b+b$$ $$b+a\quad=\quad a+b$$

Besides this, the addition and multiplication operations on a set $S$ are simply functions: \begin{align} +&\;:\;S\times S \rightarrow S\\ \cdot\:&\;:\;S\times S \rightarrow S \end{align}

They can be any mapping we choose so long as the distributive law is upheld.

The commutativity of multiplication can be relaxed, but as explained, commutativity of addition is required if every element has an additive inverse.

-
In a system that satisfies the distributive law, has $1$ and additive inverses, we have $(1+1)(a+b)=(1+1)a+(1+1)b=a+a+b+b$ but also $(1+1)(a+b)=1(a+b)+1(a+b)=a+b+a+b$, from which $a+b=b+a$ follows. This is well-known in the context of minimal axioms for vector spaces. See math.stackexchange.com/a/840644/589. –  lhf Jul 1 '14 at 21:53
Thank you! I've learnt something new here. –  Myridium Jul 1 '14 at 22:02
I notice that both the multiplicative and additive identities must also be defined for this proof to hold. So what is really says is that one can't relax JUST the commutativity of addition of a ring (or field) -- even though one can relax JUST the commutativity of multiplication of a field. That is pretty interesting. –  Bye_World Jul 7 '14 at 15:54
Yes that's right. Groups and rings, two of the most basic and well studied types of structures, have by definition additive inverses (and of course the additive identity). Rings are by definition algebraic structures with a binary operation (called multiplication) that distributes over another binary operation (addition) that is also invertible. This is the context (as I know it anyhow) in which the terms addition and multiplication are defined. –  Myridium Jul 7 '14 at 16:06
I think your answer is great for defining multiplication and addition in this sense. It doesn't quite get at why we call certain operations "addition" or "multiplication" when it is the only operation on a set -- but from the responses, it seems that there is no actual definition. Calling such an operation addition or multiplication seems to be to just give some analogy to operations we are all familiar with, even if it is somewhat arbitrary. BTW, if you're commenting to a person who is not the answerer, you should add an @[username] so that they are alerted. –  Bye_World Jul 7 '14 at 17:02

Sometimes multiplication isn't commutative (e.g. matrix multiplication), but it's a stretch to call something addition if it isn't commutative.

Edit: Below my comment that I don't think ordinal addition should be called addition seems to have been misinterpreted; my apologies for the confusion. I meant no offense, and in particular I didn't mean to imply that ordinal addition is not interesting or not worthy of study. I just don't think it should be called addition, in the same way that I don't think the free product should be called a product.

One basic intuitive model for where addition comes from is that it abstracts the properties of the coproduct in some category; for example, addition of natural numbers corresponds to the coproduct in $\text{FinSet}$ or even to the coproduct in $\text{FinVect}$. A distinguishing feature of the coproduct is that it treats its arguments symmetrically, and is in particular commutative, but that's just a way of stating a more fundamental property, which is that the coproduct, like any commutative and associative operation, takes as input a multiset of operands rather than an ordered list. Ordinal addition, of course, doesn't have this property; in particular it is not the coproduct in the category of ordinals, and it treats its inputs asymmetrically.

There's reason to believe that category theory has a special place in its heart for commutative and associative operations; see, for example, this blog post. I think it's valuable to use additive notation and terminology to refer to this cluster of ideas - e.g. when discussing additive categories and so forth - and that ordinal addition genuinely belongs to a different cluster of ideas which doesn't have a good name that I'm aware of.

-
Ordinal addition? –  Mathmo123 Jul 1 '14 at 21:52
I don't think ordinal addition deserves to be called addition. –  Qiaochu Yuan Jul 1 '14 at 21:55
I think that's petty. You can't say that it's a stretch to call something addition if it isn't commutative when we regularly do. I think the more accurate answer to this question is that there is no additive analogue of $0.a = 0$ $\forall a$ –  Mathmo123 Jul 1 '14 at 21:59
Great. So let's slag off another area of mathematics in order to labour a point when a better answer is available - and one that doesn't just boil down to picking and choosing our definitions... And let's not pretend that ordinals only have applications in set theory.... –  Mathmo123 Jul 1 '14 at 22:07
@Qiaochu: I'd be interested to hear why, at least if you have a proper reason other than "I donno, it's just not commutative" or some isomorphic argument. (Because your answer as it stands can be stretched into "Exponentiation is not commutative. It's a stretch to call multiplication something which isn't commutative".) –  Asaf Karagila Jul 1 '14 at 22:12

It is very standard to use additive notation only if the operation is commutative, whereas multiplicative notation may also denote noncommutative operations, as is standard in group theory. Multiplication (say of a ring, an algebra) often happens in important cases to be noncommutative (well unless you restrict to commutative rings and algebras of course), e.g. in quantum mechanics (canonical commutation relations) or the Weyl algebra. No one uses additive notation to denote noncommutative operations, which seems to suggest that we consider addition always to be commutative.

-
Ordinal addition? –  Mathmo123 Jul 1 '14 at 21:53