Addition is the mathematical process of putting things together. The
plus sign"+" means that two numbers are added together. For example, in the picture on the right, there are 3 + 2 apples — meaning three apples and two other apples — which is the same as five apples, since 3 + 2 = 5. Besides counts of fruit, addition can also represent combining other physical and abstract quantities using different kinds of numbers: negative numbers, fractions, irrational numbers, vectors, and more.
As a mathematical operation, addition follows several important patterns. It is commutative, meaning that order does not matter, and it is associative, meaning that one can add more than two numbers (see "
Summation"). Repeated addition of 1 is the same as counting; addition of 0 does not change a number. Addition also obeys predictable rules concerning related operations such as subtractionand multiplication. All of these rules can be proven, starting with the addition of natural numbersand generalizing up through the real numbers and beyond. General binary operationsthat continue these patterns are studied in abstract algebra.
Performing addition is one of the simplest numerical tasks. Addition of very small numbers is accessible to toddlers; the most basic task, 1 + 1, can be performed by infants as young as five months and even some animals. In
primary education, children learn to add numbers in the decimalsystem, starting with single digits and progressively tackling more difficult problems. Mechanical aids range from the ancient abacusto the modern computer, where research on the most efficient implementations of addition continues to this day.
Notation and terminology
Addition is written using the plus sign "+" between the terms; that is, in
infix notation. The result is expressed with an equals sign. For example,: (verbally, "one plus one equals two"): (verbally, "two plus two equals four"): (see "associativity" below): (see "multiplication" below)
There are also situations where addition is "understood" even though no symbol appears:
*A column of numbers, with the last number in the column
underlined, usually indicates that the numbers in the column are to be added, with the sum written below the underlined number.
*A whole number followed immediately by a fraction indicates the sum of the two, called a "mixed number". [Devine et al p.263] For example,
3½ = 3 + ½ = 3.5.
This notation can cause confusion since in most other contexts denotes
The numbers or the objects to be added are generally called the "terms", the "addends", or the "summands";this terminology carries over to the summation of multiple terms.This is to be distinguished from "factors", which are multiplied.Some authors call the first addend the "augend". In fact, during the
Renaissance, many authors did not consider the first addend an "addend" at all. Today, due to the symmetry of addition, "augend" is rarely used, and both terms are generally called addends. [Schwartzman p.19]
All of this terminology derives from
Latin. "" and "" are English words derived from the Latin verb"addere", which is in turn a compound of "ad" "to" and "dare" "to give", from the Indo-European root "do-" "to give"; thus to "add" is to "give to". [Schwartzman p.19] Using the gerundivesuffix "-nd" results in "addend", "thing to be added". ["Addend" is not a Latin word; in Latin it must be further conjugated, as in "numerus addendus" "the number to be added".] Likewise from "augere" "to increase", one gets "augend", "thing to be increased".
"Sum" and "summand" derive from the Latin
noun"summa" "the highest, the top" and associated verb "summare". This is appropriate not only because the sum of two positive numbers is greater than either, but because it was once common to add upward, contrary to the modern practice of adding downward, so that a sum was literally higher than the addends. [Schwartzman (p.212) attributes adding upwards to the Greeks and Romans, saying it was about as common as adding downwards. On the other hand, Karpinski (p.103) writes that Leonard of Pisa"introduces the novelty of writing the sum above the addends"; it is unclear whether Karpinski is claiming this as an original invention or simply the introduction of the practice to Europe.] "Addere" and "summare" date back at least to Boethius, if not to earlier Roman writers such as Vitruviusand Frontinus; Boethius also used several other terms for the addition operation. The later Middle Englishterms "adden" and "adding" were popularized by Chaucer. [Karpinski pp.150–153]
Addition is used to model countless physical processes. Even for the simple case of adding
natural numbers, there are many possible interpretations and even more visual representations.
Possibly the most fundamental interpretation of addition lies in combining sets:
*When two or more collections are combined into a single collection, the number of objects in the single collection is the sum of the number of objects in the original collections.
This interpretation is easy to visualize, with little danger of ambiguity. It is also useful in higher mathematics; for the
rigorous definition it inspires, see "Natural numbers" below. However, it is not obvious how one should extend this version of addition to include fractional numbers or negative numbers. [See [http://arxiv.org/abs/math.QA/0004133 this article] for an example of the sophistication involved in adding with sets of "fractional cardinality".]
One possible fix is to consider collections of objects that can be easily divided, such as
pies or, still better, segmented rods. ["Adding it up" (p.73) compares adding measuring rods to adding sets of cats: "For example, inches can be subdivided into parts, which are hard to tell from the wholes, except that they are shorter; whereas it is painful to cats to divide them into parts, and it seriously changes their nature."] Rather than just combining collections of segments, rods can be joined end-to-end, which illustrates another conception of addition: adding not the rods but the lengths of the rods.
Extending a length
A second interpretation of addition comes from extending an initial length by a given length:
*When an original length is extended by a given amount, the final length is the sum of the original length and the length of the extension.
The sum "a" + "b" can be interpreted as a
binary operationthat combines "a" and "b", in an algebraic sense, or it can be interpreted as the addition of "b" more units to "a". Under the latter interpretation, the parts of a sum "a" + "b" play asymmetric roles, and the operation "a" + "b" is viewed as applying the unary operation+"b" to "a". Instead of calling both "a" and "b" addends, it is more appropriate to call "a" the augend in this case, since "a" plays a passive role. The unary view is also useful when discussing subtraction, because each unary addition operation has an inverse unary subtraction operation. and "vice versa."
commutative, meaning that one can reverse the terms in a sum left-to-right, and the result will be the same. Symbolically, if "a" and "b" are any two numbers, then:"a" + "b" = "b" + "a".The fact that addition is commutative is known as the "commutative law of addition". This phrase suggests that there are other commutative laws: for example, there is a commutative law of multiplication. However, many binary operations are not commutative, such as subtraction and division, so it is misleading to speak of an unqualified "commutative law".
A somewhat subtler property of addition is
associativity, which comes up when one tries to define repeated addition. Should the expression:"a" + "b" + "c"be defined to mean ("a" + "b") + "c" or "a" + ("b" + "c")? That addition is associative tells us that the choice of definition is irrelevant. For any three numbers "a", "b", and "c", it is true that: ("a" + "b") + "c" = "a" + ("b" + "c").For example, (1 + 2) + 3 = 3 + 3 = 6 = 1 + 5 = 1 + (2 + 3).Not all operations are associative, so in expressions with other operations like subtraction, it is important to specify the order of operations.
Zero and one
When adding zero to any number, the quantity does not change; zero is the
identity elementfor addition, also known as the additive identity. In symbols, for any "a",:"a" + 0 = 0 + "a" = "a".This law was first identified in Brahmagupta's " Brahmasphutasiddhanta" in 628, although he wrote it as three separate laws, depending on whether "a" is negative, positive, or zero itself, and he used words rather than algebraic symbols. Later Indian mathematiciansrefined the concept; around the year 830, Mahavira wrote, "zero becomes the same as what is added to it", corresponding to the unary statement 0 + "a" = "a". In the 12th century, Bhaskara wrote, "In the addition of cipher, or subtraction of it, the quantity, positive or negative, remains the same", corresponding to the unary statement "a" + 0 = "a". [Kaplan pp.69–71]
In the context of integers, addition of one also plays a special role: for any integer "a", the integer ("a" + 1) is the least integer greater than "a", also known as the successor of "a". Because of this succession, the value of some "a" + "b" can also be seen as the successor of "a", making addition iterated succession.
In order to numerically add physical quantities with units, they must first be expressed with common unit. For example, if a measure of 5 feet is extended by 2 inches, the sum is 62 inches, since 60 inches is synonymous with 5 feet. On the other hand, it is usually meaningless to try to add 3 meters and 4 square meters, since those units are incomparable; this sort of consideration is fundamental in
Studies on mathematical development starting around the 1980s have exploited the phenomenon of
habituation: infants look longer at situations that are unexpected. [Wynn p.5] A seminal experiment by Karen Wynn in 1992 involving Mickey Mousedolls manipulated behind a screen demonstrated that five-month-old infants "expect" 1 + 1 to be 2, and they are comparatively surprised when a physical situation seems to imply that 1 + 1 is either 1 or 3. This finding has since been affirmed by a variety of laboratories using different methodologies. [Wynn p.15] Another 1992 experiment with older toddlers, between 18 to 35 months, exploited their development of motor control by allowing them to retrieve ping-pongballs from a box; the youngest responded well for small numbers, while older subjects were able to compute sums up to 5. [Wynn p.17]
Even some nonhuman animals show a limited ability to add, particularly
primates. In a 1995 experiment imitating Wynn's 1992 result (but using eggplants instead of dolls), rhesus macaques and cottontop tamarins performed similarly to human infants. More dramatically, after being taught the meanings of the Arabic numerals0 through 4, one chimpanzee was able to compute the sum of two numerals without further training. [Wynn p.19]
Typically children master the art of
countingfirst, and this skill extends into a form of addition called "counting-on"; asked to find three plus two, children count two past three, saying "four, "five", and arriving at five. This strategy seems almost universal; children can easily pick it up from peers or teachers, and some even invent it independently. [F. Smith p.130] Those who count to add also quickly learn to exploit the commutativity of addition by counting up from the larger number.
The prerequisite to addition in the
decimalsystem is the internalization of the 100 single-digit "addition facts". One could memorizeall the facts by rote, but pattern-based strategies are more enlightening and, for most people, more efficient: [Fosnot and Dolk p. 99]
*"One or two more": Adding 1 or 2 is a basic task, and it can be accomplished through counting on or, ultimately, intuition.
*"Zero": Since zero is the additive identity, adding zero is trivial. Nonetheless, some children are introduced to addition as a process that always increases the addends; word problems may help rationalize the "exception" of zero.
*"Doubles": Adding a number to itself is related to counting by two and to
multiplication. Doubles facts form a backbone for many related facts, and fortunately, children find them relatively easy to grasp. "near-doubles"...
*"Five and ten"...
*"Making ten": An advanced strategy uses 10 as an intermediate for sums involving 8 or 9; for example, 8 + 6 = 8 + 2 + 4 = 10 + 4 = 14.
traditional mathematics, to add multidigit numbers, one typically aligns the addends vertically and adds the columns, starting from the ones column on the right. If a column exceeds ten, the extra digit is "carried" into the next column. [The word "carry" may be inappropriate for education; Van de Walle (p.211) calls it "obsolete and conceptually misleading", preferring the word "trade".] For a more detailed description of this algorithm, see "". An alternate strategy starts adding from the most significant digit on the left; this route makes carrying a little clumsier, but it is faster at getting a rough estimate of the sum. There are many different standards-based mathematicsmethods, but many mathematics curricula such as TERComit any instruction in traditional methods familiar to parents or mathematics professionals in favor of exploration of new methods.
Analog computers work directly with physical quantities, so their addition mechanisms depend on the form of the addends. A mechanical adder might represent two addends as the positions of sliding blocks, in which case they can be added with an averaging lever. If the addends are the rotation speeds of two shafts, they can be added with a differential. A hydraulic adder can add the pressures in two chambers by exploiting Newton's second law to balance forces on an assembly of pistons. The most common situation for a general-purpose analog computer is to add two voltages (referenced to ground); this can be accomplished roughly with a resistornetwork, but a better design exploits an operational amplifier. [Truitt and Rogers pp.1;44–49 and pp.2;77–78]
Addition is also fundamental to the operation of digital computers, where the efficiency of addition, in particular the carry mechanism, is an important limitation to overall performance.
Adding machines, mechanical calculators whose primary function was addition, were the earliest automatic, digital computers. Wilhelm Schickard's 1623 Calculating Clock could add and subtract, but it was severely limited by an awkward carry mechanism. As he wrote to Johannes Keplerdescribing the novel device, "You would burst out laughing if you were present to see how it carries by itself from one column of tens to the next..." Adding 999,999 and 1 on Schickard's machine would require enough force to propagate the carries that the gears might be damaged, so he limited his machines to six digits, even though Kepler's work required more. By 1642 Blaise Pascalindependently developed an adding machine with an ingenious gravity-assisted carry mechanism. Pascal's calculatorwas limited by its carry mechanism in a different sense: its wheels turned only one way, so it could add but not subtract, except by the method of complements. By 1674 Gottfried Leibnizmade the first mechanical multiplier; it was still powered, if not motivated, by addition. [Williams pp.122–140]
Adders execute integer addition in electronic digital computers, usually using
binary arithmetic. The simplest architecture is the ripple carry adder, which follows the standard multi-digit algorithm taught to children. One slight improvement is the "carry skip" design, again following human intuition; one does not perform all the carries in computing 999 + 1, but one bypasses the group of 9s and skips to the answer. [Flynn and Overman pp.2, 8]
Since they compute digits one at a time, the above methods are too slow for most modern purposes.In modern digital computers, integer addition is typically the fastest arithmetic instruction, yet it has the largest impact on performance, since it underlies all the floating-point operations as well as such basic tasks as address generation during memory access and fetching instructions during branching. To increase speed, modern designs calculate digits in parallel; these schemes go by such names as carry select, carry lookahead, and the Ling pseudocarry. Almost all modern implementations are, in fact, hybrids of these last three designs. [Flynn and Overman pp.1–9]
Unlike addition on
paper, addition on a computer often changes the addends. On the ancient abacusand adding board, both addends are destroyed, leaving only the sum. The influence of the abacus on mathematical thinking was strong enough that early Latintexts often claimed that in the process of adding "a number to a number", both numbers vanish. [Karpinski pp.102–103] In modern times, the ADD instruction of a microprocessorreplaces the augend with the sum but preserves the addend. [The identity of the augend and addend varies with architecture. For ADD in x86see Horowitz and Hill p.679; for ADD in 68ksee p.767.] In a high-level programming language, evaluating "a" + "b" does not change either "a" or "b"; to change the value of "a" one uses the addition assignment operator "a" += "b".
Addition of natural and real numbers
In order to prove the usual properties of addition, one must first "define" addition for the context in question. Addition is first defined on the
natural numbers. In set theory, addition is then extended to progressively larger sets that include the natural numbers: the integers, the rational numbers, and the real numbers. [Enderton chapters 4 and 5, for example, follow this development.] (In mathematics education, [California standards; see grades [http://www.cde.ca.gov/be/st/ss/mthgrade2.asp 2] , [http://www.cde.ca.gov/be/st/ss/mthgrade3.asp 3] , and [http://www.cde.ca.gov/be/st/ss/mthgrade4.asp 4] .] positive fractions are added before negative numbers are even considered; this is also the historical route. [Baez (p.37) explains the historical development, in "stark contrast" with the set theory presentation: "Apparently, half an apple is easier to understand than a negative apple!"] )
There are two popular ways to define the sum of two natural numbers "a" and "b". If one defines natural numbers to be the cardinalities of finite sets, (the cardinality of a set is the number of elements in the set), then it is appropriate to define their sum as follows:
*Let N("S") be the cardinality of a set "S". Take two disjoint sets "A" and "B", with N("A") = "a" and N("B") = "b". Then "a" + "b" is defined as N("A" U "B"). [Begle p.49, Johnson p.120, Devine et al p.75] Here, "A" U "B" is the union of "A" and "B". An alternate version of this definition allows "A" and "B" to possibly overlap and then takes their
disjoint union, a mechanism which allows any common elements to be separated out and therefore counted twice.
The other popular definition is recursive:
*Let "n"+ be the successor of "n", that is the number following "n" in the natural numbers, so 0+=1, 1+=2. Define "a" + 0 = "a". Define the general sum recursively by "a" + ("b"+) = ("a" + "b")+. Hence 1+1=1+0+=(1+0)+=1+=2. [Enderton p.79] Again, there are minor variations upon this definition in the literature. Taken literally, the above definition is an application of the
Recursion Theoremon the posetN². [For a version that applies to any poset with the descending chain condition, see Bergman p.100.] On the other hand, some sources prefer to use a restricted Recursion Theorem that applies only to the set of natural numbers. One then considers "a" to be temporarily "fixed", applies recursion on "b" to define a function "a" + ", and pastes these unary operations for all "a" together to form the full binary operation. [Enderton (p.79) observes, "But we want one binary operation +, not all these little one-place functions."]
This recursive formulation of addition was developed by Dedekind as early as 1854, and he would expand upon it in the following decades. [Ferreirós p.223] He proved the associative and commutative properties, among others, through
mathematical induction; for examples of such inductive proofs, see " Addition of natural numbers".
The simplest conception of an integer is that it consists of an
absolute value(which is a natural number) and a sign (generally either positive or negative). The integer zero is a special third case, being neither positive nor negative. The corresponding definition of addition must proceed by cases:
*For an integer "n", let |"n"| be its absolute value. Let "a" and "b" be integers. If either "a" or "b" is zero, treat it as an identity. If "a" and "b" are both positive, define "a" + "b" = |"a"| + |"b"|. If "a" and "b" are both negative, define "a" + "b" = −(|"a"|+|"b"|). If "a" and "b" have different signs, define "a" + "b" to be the difference between |"a"| and |"b"|, with the sign of the term whose absolute value is larger. [K. Smith p.234, Sparks and Rees p.66] Although this definition can be useful for concrete problems, it is far too complicated to produce elegant general proofs; there are too many cases to consider.
A much more convenient conception of the integers is the
Grothendieck groupconstruction. The essential observation is that every integer can be expressed (not uniquely) as the difference of two natural numbers, so we may as well "define" an integer as the difference of two natural numbers. Addition is then defined to be compatible with subtraction:
*Given two integers "a" − "b" and "c" − "d", where "a", "b", "c", and "d" are natural numbers, define ("a" − "b") + ("c" − "d") = ("a" + "c") − ("b" + "d"). [Enderton p.92]
Rational numbers (Fractions)
rational numbers can be computed using the least common denominator, but a conceptually simpler definition involves only integer addition and multiplication:
*Define The commutativity and associativity of rational addition is an easy consequence of the laws of integer arithmetic. [The verifications are carried out in Enderton p.104 and sketched for a general field of fractions over a commutative ring in Dummit and Foote p.263.] For a more rigorous and general discussion, see "
field of fractions".
A common construction of the set of real numbers is the Dedekind completion of the set of rational numbers. A real number is defined to be a
Dedekind cutof rationals: a non-empty setof rationals that is closed downward and has no greatest element. The sum of real numbers "a" and "b" is defined element by element:
*Define [Enderton p.114] This definition was first published, in a slightly modified form, by
Richard Dedekindin 1872. [Ferreirós p.135; see section 6 of " [http://www.ru.nl/w-en-s/gmfw/bronnen/dedekind2.html Stetigkeit und irrationale Zahlen] ".] The commutativity and associativity of real addition are immediate; defining the real number 0 to be the set of negative rationals, it is easily seen to be the additive identity. Probably the trickiest part of this construction pertaining to addition is the definition of additive inverses. [The intuitive approach, inverting every element of a cut and taking its complement, works only for irrational numbers; see Enderton p.117 for details.]
Unfortunately, dealing with multiplication of Dedekind cuts is a case-by-case nightmare similar to the addition of signed integers. Another approach is the metric completion of the rational numbers. A real number is essentially defined to be the a limit of a
Cauchy sequenceof rationals, lim "a""n". Addition is defined term by term:
*Define [Textbook constructions are usually not so cavalier with the "lim" symbol; see Burrill (p. 138) for a more careful, drawn-out development of addition with Cauchy sequences.] This definition was first published by
Georg Cantor, also in 1872, although his formalism was slightly different. [Ferreirós p.128] One must prove that this operation is well-defined, dealing with co-Cauchy sequences. Once that task is done, all the properties of real addition follow immediately from the properties of rational numbers. Furthermore, the other arithmetic operations, including multiplication, have straigh­tforward, analogous definitions. [Burrill p.140]
:"There are many things that can be added: numbers, vectors, matrices, spaces, shapes, sets, functions, equations, strings, chains..." — [http://www.cut-the-knot.org/do_you_know/addition.shtml Alexander Bogomolny]
There are many binary operations that can be viewed as generalizations of the addition operation on the real numbers. The field of
abstract algebrais centrally concerned with such generalized operations, and they also appear in set theoryand category theory.
Addition in abstract algebra
linear algebra, a vector spaceis an algebraic structure that allows for adding any two vectors and for scaling vectors. A familiar vector space is the set of all ordered pairs of real numbers; the ordered pair ("a","b") is interpreted as a vector from the origin in the Euclidean plane to the point ("a","b") in the plane. The sum of two vectors is obtained by adding their individual coordinates::("a","b") + ("c","d") = ("a"+"c","b"+"d").This addition operation is central to classical mechanics, in which vectors are interpreted as forces.
modular arithmetic, the set of integers modulo 12 has twelve elements; it inherits an addition operation from the integers that is central to musical set theory. The set of integers modulo 2 has just two elements; the addition operation it inherits is known in Boolean logicas the " exclusive or" function. In geometry, the sum of two angle measures is often taken to be their sum as real numbers modulo 2π. This amounts to an addition operation on the circle, which in turn generalizes to addition operations on many-dimensional tori.
The general theory of abstract algebra allows an "addition" operation to be any
associativeand commutativeoperation on a set. Basic algebraic structures with such an addition operation include commutative monoids and abelian groups.
Addition in set theory and category theory
A far-reaching generalization of addition of natural numbers is the addition of
ordinal numbers and cardinal numbers in set theory. These give two different generalizations of addition of natural numbers to the transfinite.Unlike most addition operations, addition of ordinal numbers is not commutative.Addition of cardinal numbers, however, is a commutative operation closely related to the disjoint unionoperation.
category theory, disjoint union is seen as a particular case of the coproductoperation, and general coproducts are perhaps the most abstract of all the generalizations of addition. Some coproducts, such as " Direct sum" and " Wedge sum", are named to evoke their connection with addition.
Subtractioncan be thought of as a kind of addition—that is, the addition of an additive inverse. Subtraction is itself a sort of inverse to addition, in that adding "x" and subtracting "x" are inverse functions.
Given a set with an addition operation, one cannot always define a corresponding subtraction operation on that set; the set of natural numbers is a simple example. On the other hand, a subtraction operation uniquely determines an addition operation, an additive inverse operation, and an additive identity; for this reason, an additive group can be described as a set that is closed under subtraction. [The set still must be nonempty. Dummit and Foote (p.48) discuss this criterion written multiplicatively.]
Multiplicationcan be thought of as repeated addition. If a single term "x" appears in a sum "n" times, then the sum is the product of "n" and "x". If "n" is not a natural number, the product may still make sense; for example, multiplication by −1 yields the additive inverseof a number.
In the real and complex numbers, addition and multiplication can be interchanged by the
exponential function::"e""a" + "b" = "e""a" "e""b". [Rudin p.178] This identity allows multiplication to be carried out by consulting a table of logarithms and computing addition by hand; it also enables multiplication on a slide rule. The formula is still a good first-order approximation in the broad context of Lie groups, where it relates multiplication of infinitesimal group elements with addition of vectors in the associated Lie algebra. [Lee p.526, Proposition 20.9]
There are even more generalizations of multiplication than addition. [Linderholm (p.49) observes, "By "multiplication", properly speaking, a mathematician may mean practically anything. By "addition" he may mean a great variety of things, but not so great a variety as he will mean by 'multiplication'."] In general, multiplication operations always distribute over addition; this requirement is formalized in the definition of a ring. In some contexts, such as the integers, distributivity over addition and the existence of a multiplicative identity is enough to uniquely determine the multiplication operation. The distributive property also provides information about addition; by expanding the product (1 + 1)("a" + "b") in both ways, one concludes that addition is forced to be commutative. For this reason, ring addition is commutative in general. [Dummit and Foote p.224. For this argument to work, one still must assume that addition is a group operation and that multiplication has an identity.]
Division is an arithmetic operation remotely related to addition. Since "a"/"b" = "a"("b"−1), division is right distributive over addition: ("a" + "b") / "c" = "a" / "c" + "b" / "c". [For an example of left and right distributivity, see Loday, especially p.15.] However, division is not left distributive over addition; 1/ (2 + 2) is not the same as 1/2 + 1/2.
The maximum operation "max ("a", "b")" is a binary operation similar to addition. In fact, if two nonnegative numbers "a" and "b" are of different
orders of magnitude, then their sum is approximately equal to their maximum. This approximation is extremely useful in the applications of mathematics, for example in truncating Taylor series. However, it presents a perpetual difficulty in numerical analysis, essentially since "max" is not invertible. If "b" is much greater than "a", then a straigh­tforward calculation of ("a" + "b") − "b" can accumulate an unacceptable round-off error, perhaps even returning zero. See also " Loss of significance".
The approximation becomes exact in a kind of infinite limit; if either "a" or "b" is an infinite cardinal number, their cardinal sum is exactly equal to the greater of the two. [Enderton calls this statement the "Absorption Law of Cardinal Arithmetic"; it depends on the comparability of cardinals and therefore on the
Axiom of Choice.] Accordingly, there is no subtraction operation for infinite cardinals. [Enderton p.164]
Maximization is commutative and associative, like addition. Furthermore, since addition preserves the ordering of real numbers, addition distributes over "max" in the same way that multiplication distributes over addition::"a" + max ("b", "c") = max ("a" + "b", "a" + c").For these reasons, in
tropical geometryone replaces multiplication with addition and addition with maximization. In this context, addition is called "tropical multiplication", maximization is called "tropical addition", and the tropical "additive identity" is negative infinity. [Mikhalkin p.1] Some authors prefer to replace addition with minimization; then the additive identity is positive infinity. [Akian et al p.4]
Tying these observations together, tropical addition is approximately related to regular addition through the
logarithm::log ("a" + "b") ≈ max (log "a", log "b"),which becomes more accurate as the base of the logarithm increases. [Mikhalkin p.2] The approximation can be made exact by extracting a constant "h", named by analogy with Planck's constantfrom quantum mechanics, [Litvinov et al p.3] and taking the " classical limit" as "h" tends to zero::In this sense, the maximum operation is a "dequantized" version of addition. [Viro p.4]
Other ways to add
Incrementation, also known as the successor operation, is the addition of 1 to a number. Summationdescribes the addition of arbitrarily many numbers, usually more than just two. It includes the idea of the sum of a single number, which is itself, and the empty sum, which is zero. [Martin p.49] An infinite summation is a delicate procedure known as a series. [Stewart p.8] Countinga finite set is equivalent to summing 1 over the set.
Integration is a kind of "summation" over a continuum, or more precisely and generally, over a differentiable
manifold. Integration over a zero-dimensional manifold reduces to summation. Linear combinations combine multiplication and summation; they are sums in which each term has a multiplier, usually a real or complex number. Linear combinations are especially useful in contexts where straigh­tforward addition would violate some normalization rule, such as mixing of strategies in game theoryor superposition of states in quantum mechanics. Convolutionis used to add two independent random variables defined by distribution functions. Its usual definition combines integration, subtraction, and multiplication. In general, convolution is useful as a kind of domain-side addition; by contrast, vector addition is a kind of range-side addition.
*In chapter 9 of
Lewis Carroll's " Through the Looking-Glass", the White Queen asks Alice, "And you do Addition? ... What's one and one and one and one and one and one and one and one and one and one?" Alice admits that she lost count, and the Red Queen declares, "She can't do Addition".
George Orwell's " Nineteen Eighty-Four", the value of 2 + 2 is questioned; the State contends that if it declares 2 + 2 = 5, then it is so. See " Two plus two make five" for the history of this idea.
*cite book | author=Bunt, Jones, and Bedient | title=The historical roots of elementary mathematics | publisher=Prentice-Hall | year=1976 | id=ISBN 0-13-389015-5
*cite book | first=José | last=Ferreirós | title=Labyrinth of thought: A history of set theory and its role in modern mathematics | publisher=Birkhäuser | year=1999 | id=ISBN 0-8176-5749-5
*cite book | first=Robert | last=Kaplan | title=The nothing that is: A natural history of zero| publisher=Oxford UP | year=2000 | id=ISBN 0-19-512842-7
*cite book | first=Louis | last=Karpinski | authorlink=Louis Charles Karpinski | title=The history of arithmetic | publisher=Rand McNally | year=1925 | id=LCC|QA21.K3
*cite book | first=Steven | last=Schwartzman | title=The words of mathematics: An etymological dictionary of mathematical terms used in English | publisher=MAA | year=1994 | id=ISBN 0-88385-511-9
*cite book | first=Michael | last=Williams | title=A history of computing technology | publisher=Prentice-Hall | year=1985 | id=ISBN 0-13-389917-9
*cite book | author=Davison, Landau, McCracken, and Thompson | title=Mathematics: Explorations & Applications | edition = TE | publisher=Prentice Hall | year=1999 | id=ISBN 0-13-435817-1
*cite book | author=F. Sparks and C. Rees | title=A survey of basic mathematics | publisher=McGraw-Hill | year=1979 | id=ISBN 0-07-059902-5
*cite book | first=Edward | last=Begle | title=The mathematics of the elementary school | publisher=
McGraw-Hill| year=1975 | id=ISBN 0-07-004325-6
* [http://www.cde.ca.gov/be/st/ss/mthmain.asp California State Board of Education mathematics content standards] Adopted December 1997, accessed December 2005.
*cite book | author=D. Devine, J. Olson, and M. Olson | title=Elementary mathematics for teachers | edition=2e | publisher=Wiley | year=1991 | id=ISBN 0-471-85947-8
*cite book | author=National Research Council | title=Adding it up: Helping children learn mathematics | publisher=National Academy Press | year=2001 | id=ISBN 0-309-06995-5 | authorlink=United States National Research Council | url=http://www.nap.edu/books/0309069955/html/index.html
*cite book | first=John | last=Van de Walle | title=Elementary and middle school mathematics: Teaching developmentally | edition=5e | publisher=Pearson | year=2004 | id=ISBN 0-205-38689-X
*cite conference | author=Baroody and Tiilikainen | title=Two perspectives on addition development | booktitle=The development of arithmetic concepts and skills | year=2003 | pages=75 | id=ISBN 0-8058-3155-X
*cite book | author=Fosnot and Dolk | title=Young mathematicians at work: Constructing number sense, addition, and subtraction | publisher=Heinemann | year=2001 | id=ISBN 0-325-00353-X
*cite conference | first=J. Fred | last = Weaver | title=Interpretations of number operations and symbolic representations of addition and subtraction | booktitle=Addition and subtraction: A cognitive perspective | year=1982 | pages=60 | id=ISBN 0-89859-171-6
*cite conference | first=Karen | last = Wynn | title=Numerical competence in infants | booktitle=The development of mathematical skills | year=1998 | pages=3 | id=ISBN 0-86377-816-X
*cite web | author=Bogomolny, Alexander | year=1996| title=Addition | work=Interactive Mathematics Miscellany and Puzzles (cut-the-knot.org) | url=http://www.cut-the-knot.org/do_you_know/addition.shtml | accessmonthday=3 February | accessyear=2006
*cite book | first=William | last=Dunham | title=The mathematical universe | publisher=Wiley | year=1994 | id=ISBN 0-471-53656-3
*cite book | first=Paul | last=Johnson | title=From sticks and stones: Personal adventures in mathematics | publisher=Science Research Associates | year=1975 | id=ISBN 0-574-19115-1
*cite book | first = Carl | last = Linderholm | year = 1971 | title = Mathematics made difficult | publisher = Wolfe | id = ISBN 0-7234-0415-1
*cite book | first=Frank | last=Smith | title=The glass wall: Why mathematics can seem difficult | publisher=Teachers College Press | year=2002 | id=ISBN 0-8077-4242-2
*cite book | first=Karl | last=Smith | title=The nature of modern mathematics | edition=3e | publisher=Wadsworth | year=1980 | id=ISBN 0-8185-0352-1
*cite book | first=George | last=Bergman | title=An invitation to general algebra and universal constructions | edition=2.3e | publisher=General Printing | year=2005 | id=ISBN 0-9655211-4-1 | url=http://math.berkeley.edu/~gbergman/245/index.html
*cite book | first=Claude | last=Burrill | title=Foundations of real numbers | publisher=McGraw-Hill | year=1967 | id=LCC|QA248.B95
*cite book | author=D. Dummit and R. Foote | title=Abstract algebra | edition=2e | publisher=Wiley | year=1999 | id=ISBN 0-471-36857-1
*cite book | first=Herbert | last=Enderton | title=Elements of set theory | publisher=
Academic Press| year=1977 | id=ISBN 0-12-238440-7
*cite book | first=John | last=Lee | title=Introduction to smooth manifolds | publisher=Springer | year=2003 | id=ISBN 0-387-95448-1
*cite book | first=John | last=Martin | title=Introduction to languages and the theory of computation | publisher=McGraw-Hill | edition=3e | year=2003 | id=ISBN 0-07-232200-4
*cite book | first=Walter | last=Rudin | title=Principles of mathematical analysis | edition=3e | publisher=McGraw-Hill | year=1976 | id=ISBN 0-07-054235-X
*cite book | first=James | last=Stewart | title=Calculus: Early transcendentals | edition=4e | publisher=Brooks/Cole | year=1999 | id=ISBN 0-534-36298-2
*cite journal | author=Akian, Bapat, and Gaubert | title= Min-plus methods in eigenvalue perturbation theory and generalised Lidskii-Vishik-Ljusternik theorem | journal= INRIA reports | year=2005 | url=http://arxiv.org/abs/math.SP/0402090
*cite conference | author=J. Baez and J. Dolan | title=From Finite Sets to Feynman Diagrams | booktitle=Mathematics Unlimited— 2001 and Beyond | year=2001 | pages=29 | url=http://arxiv.org/abs/math.QA/0004133 | id=ISBN 3-540-66913-2
*Litvinov, Maslov, and Sobolevskii (1999). [http://arxiv.org/abs/math.SC/9911126 Idempotent mathematics and interval analysis] . " [http://www.springerlink.com/openurl.asp?genre=article&eissn=1573-1340&volume=7&issue=5&spage=353 Reliable Computing] ", Kluwer.
*cite journal | first=Jean-Louis | last=Loday | title= Arithmetree | journal= J. of Algebra | year=2002 | url=http://arxiv.org/abs/math/0112034 | doi= 10.1016/S0021-8693(02)00510-0 | volume= 258 | pages= 275
*cite journal | author=Mikhalkin, Grigory | title= Tropical Geometry and its applications | journal=To appear at the Madrid ICM | year=2006 | url=http://arxiv.org/abs/math.AG/0601041
*Viro, Oleg (2000). [http://arxiv.org/abs/math/0005163 Dequantization of real algebraic geometry on logarithmic paper] . ( [http://www.math.uu.se/~oleg/dequant/dequantH1.html HTML] ) Plenary talk at 3rd ECM, Barcelona.
*cite book | author=M. Flynn and S. Oberman | title=Advanced computer arithmetic design | publisher=Wiley | year=2001 | id=ISBN 0-471-41209-0
*cite book | author=P. Horowitz and W. Hill | title=The art of electronics | edition=2e | publisher=Cambridge UP | year=2001 | id=ISBN 0-521-37095-7
*cite book | first=Albert | last=Jackson | title=Analog computation | publisher=McGraw-Hill | year=1960 | id=LCC|QA76.4|J3
*cite book | author=T. Truitt and A. Rogers | title=Basics of analog computers | publisher=John F. Rider | year=1960 | id=LCC|QA76.4|T7
Wikimedia Foundation. 2010.