Add: Difference between revisions

From APL Wiki
Jump to navigation Jump to search
Miraheze>Marshall
(Created page with "{{Primitive|+|Add}}, '''Plus''', '''Addition''', or '''Sum''', is a dyadic scalar function that [https://en.wikipedia.org/wiki/Addition adds] numbers together. As a ...")
 
m (9 revisions imported: Migrate from miraheze)
(8 intermediate revisions by 2 users not shown)
Line 1: Line 1:
{{Primitive|+|Add}}, '''Plus''', '''Addition''', or '''Sum''', is a [[dyadic]] [[scalar function]] that [https://en.wikipedia.org/wiki/Addition adds] numbers together. As a [[basic arithmetic]] operation, Add is subject to the language's [[number]] specification. Add shares the glyph <source lang=apl inline>+</source> with the [[monadic]] function [[Conjugate]], and is closely related to [[Subtract]] (<source lang=apl inline>-</source>).
{{Built-in|Add|+}}, '''Plus''', '''Addition''', or '''Sum''', is a [[dyadic]] [[scalar function]] that [[wikipedia:Addition|adds]] numbers together. As a [[basic arithmetic]] operation, Add is subject to the language's [[number]] specification. Add shares the glyph <source lang=apl inline>+</source> with the [[monadic]] function [[Conjugate]], and is closely related to [[Subtract]] (<source lang=apl inline>-</source>).


== Examples ==
== Examples ==
Line 12: Line 12:
== Properties ==
== Properties ==


Addition is [https://en.wikipedia.org/wiki/Commutative_property commutative] in almost all number systems. It is [https://en.wikipedia.org/wiki/Associative_property associative] when performed with no rounding, but is unlikely to be associative when rounded to an inexact precision (see [[#Floating point error|Floating point error]]).
Addition is [[wikipedia:Commutative property|commutative]] in almost all number systems. It is [[wikipedia:Associative property|associative]] when performed with no rounding, but is unlikely to be associative when rounded to an inexact precision (see [[#Floating point error|Floating point error]]).


The [[identity element]] for Add is <source lang=apl inline>0</source>. The [[inverse]] of the function <source lang=apl inline>n∘+</source> or the equivalent function <source lang=apl inline>+∘n</source> is <source lang=apl inline>-∘n</source>. Using [[Commute]] (<source lang=apl inline>⍨</source>), we can write <source lang=apl inline>+⍣¯1 ←→ -⍨</source>.
The [[identity element]] for Add is <source lang=apl inline>0</source>. The [[inverse]] of the function <source lang=apl inline>n∘+</source> or the equivalent function <source lang=apl inline>+∘n</source> is <source lang=apl inline>-∘n</source>. Using [[Commute]] (<source lang=apl inline>⍨</source>), we can write <source lang=apl inline>+⍣¯1</source> {{←→}} <source lang=apl inline>-⍨</source>.
 
Since adding a number to itself is equivalent to doubling that number, we can express the ''double'' function as <source lang=apl inline>+⍨</source>.


== Scalar mapping ==
== Scalar mapping ==


In mathematics, addition of two identical structures almost always follows the same rules as in APL: it maps over the structures element-wise. This is a fundamental property of a (finite-dimensional) [https://en.wikipedia.org/wiki/Vector_space vector space], in which addition of two vectors is equivalent to adding the coefficients of basis vectors one by one. This property likely inspired APL's definition of a scalar function.
In mathematics, addition of two identical structures almost always follows the same rules as in APL: it maps over the structures element-wise. This is a fundamental property of a (finite-dimensional) [[wikipedia:vector space|vector space]], in which addition of two vectors is equivalent to adding the coefficients of basis vectors one by one. This property likely inspired APL's definition of a scalar function.


Addition of [[Complex number|complex]] and [[hypercomplex numbers]] can also be considered an element-wise operation, since each of these types of numbers forms a vector space over the reals. Addition of scalars is always performed within a single domain: mixed-type addition such as adding a real to a complex number treats the real number as complex with imaginary part zero.
Addition of [[Complex number|complex]] and [[hypercomplex numbers]] can also be considered an element-wise operation, since each of these types of numbers forms a vector space over the reals. Addition of scalars is always performed within a single domain: mixed-type addition such as adding a real to a complex number treats the real number as complex with imaginary part zero.
Line 42: Line 44:
=== Documentation ===
=== Documentation ===


[http://help.dyalog.com/latest/Content/Language/Primitive%20Functions/Add.htm Dyalog]
* [http://help.dyalog.com/latest/index.htm#Language/Primitive%20Functions/Add.htm Dyalog]
 
* [http://microapl.com/apl_help/ch_020_020_020.htm APLX]
[http://microapl.com/apl_help/ch_020_020_020.htm APLX]
* [https://www.jsoftware.com/help/dictionary/d100.htm J Dictionary], [https://code.jsoftware.com/wiki/Vocabulary/plus#dyadic J NuVoc]
 
J [https://www.jsoftware.com/help/dictionary/d100.htm Dictionary], [https://code.jsoftware.com/wiki/Vocabulary/plus#dyadic NuVoc]
 
{{APL built-ins}}
{{APL built-ins}}

Revision as of 14:49, 20 November 2019

+

Add (+), Plus, Addition, or Sum, is a dyadic scalar function that adds numbers together. As a basic arithmetic operation, Add is subject to the language's number specification. Add shares the glyph + with the monadic function Conjugate, and is closely related to Subtract (-).

Examples

      1 2 3 + 2 3 4
3 5 7
      0.1 + 3 4 5
3.1 4.1 5.1

Properties

Addition is commutative in almost all number systems. It is associative when performed with no rounding, but is unlikely to be associative when rounded to an inexact precision (see Floating point error).

The identity element for Add is 0. The inverse of the function n∘+ or the equivalent function +∘n is -∘n. Using Commute (), we can write +⍣¯1 -⍨.

Since adding a number to itself is equivalent to doubling that number, we can express the double function as +⍨.

Scalar mapping

In mathematics, addition of two identical structures almost always follows the same rules as in APL: it maps over the structures element-wise. This is a fundamental property of a (finite-dimensional) vector space, in which addition of two vectors is equivalent to adding the coefficients of basis vectors one by one. This property likely inspired APL's definition of a scalar function.

Addition of complex and hypercomplex numbers can also be considered an element-wise operation, since each of these types of numbers forms a vector space over the reals. Addition of scalars is always performed within a single domain: mixed-type addition such as adding a real to a complex number treats the real number as complex with imaginary part zero.

Addition in mathematics does not exhibit scalar extension: there is usually no way to add values of different types. The Multiply function on vector spaces does extend scalars, in that a scalar element of a field can be multiplied by a vector over that field.

Floating point error

When using a limited-precision format such as 8-byte floats, the results of addition are rounded in order to fit into the result type. This rounding can cause the results of adding several numbers to be different depending on the order in which they are added, that is, addition fails to be associative:

      1e20 + ¯1e20 + 1
0
      1e20 + (¯1e20 + 1)      ⍝ Equivalent
0
      (1e20 + ¯1e20) + 1      ⍝ Not equivalent
1

Addition of floating-point numbers may also be subject to overflow, resulting in a DOMAIN ERROR or an infinite result.

External Links

Documentation

APL built-ins [edit]
Primitives (Timeline) Functions
Scalar
Monadic ConjugateNegateSignumReciprocalMagnitudeExponentialNatural LogarithmFloorCeilingFactorialNotPi TimesRollTypeImaginarySquare Root
Dyadic AddSubtractTimesDivideResiduePowerLogarithmMinimumMaximumBinomialComparison functionsBoolean functions (And, Or, Nand, Nor) ∙ GCDLCMCircularComplexRoot
Non-Scalar
Structural ShapeReshapeTallyDepthRavelEnlistTableCatenateReverseRotateTransposeRazeMixSplitEncloseNestCut (K)PairLinkPartitioned EnclosePartition
Selection FirstPickTakeDropUniqueIdentityStopSelectReplicateExpandSet functions (IntersectionUnionWithout) ∙ Bracket indexingIndexCartesian ProductSort
Selector Index generatorGradeIndex OfInterval IndexIndicesDealPrefix and suffix vectors
Computational MatchNot MatchMembershipFindNub SieveEncodeDecodeMatrix InverseMatrix DivideFormatExecuteMaterialiseRange
Operators Monadic EachCommuteConstantReplicateExpandReduceWindowed ReduceScanOuter ProductKeyI-BeamSpawnFunction axis
Dyadic BindCompositions (Compose, Reverse Compose, Beside, Withe, Atop, Over) ∙ Inner ProductDeterminantPowerAtUnderRankDepthVariantStencilCutDirect definition (operator)
Quad names Index originComparison toleranceMigration levelAtomic vector