Inner Product

From APL Wiki
Jump to navigation Jump to search

Inner Product (.) is a dyadic operator that produces a dyadic function when applied with two dyadic functions. It's a generalisation of the matrix product, allowing not just addition-multiplication, but any dyadic functions given as operands.


      x  1 2 3
      y  4 5 6
      x ,.(⊂,) y ⍝ visualizing of pairing
││1 42 53 6││
      x {,'+',}.{,'×',} y ⍝ visualizing function application in matrix multiplication
│││1 × 4+│┌─────┬─┬─────┐│││
│││      ││2 × 5+3 × 6││││
│││      │└─────┴─┴─────┘│││
      x+.×y ⍝ matrix multiplication

The shapes of the arguments must be compatible with each other: The last axis of the left argument must have the same length as the first axis of the right argument, or formally, for X f.g Y it must be that (¯1↑⍴X)(1↑⍴Y). Although this rule differs from conformability, the arguments may also be subject to scalar or singleton extension. The shape of the result is (¯1↓⍴X),(1↓⍴Y).

For example, when applying inner product on two matrices, the number of columns in the left array must match with number of rows in the right array, otherwise we will get an error.

         x  2 3⍴⍳10
1 2 3
4 5 6
        y  4 2⍴⍳10
1 2
3 4
5 6
7 8
        y  3 2⍴⍳10 ⍝ reshape y to be compatible with x
22 28
49 64


Inner product appeared in early Iverson Notation as and applied even to non-scalar functions, like Compress, Iverson bringing:[1]

When the inner product notation was linearised (made to fit on a single line of code) the glyph . was chosed to denote what was previously indicated by positioning the two operands vertically aligned. Thus, the above correspond to the following modern APL:

⍝ For example, if
      A3 41 3 2 0 2 1 0 1 4 0 0 2
      B4 24 1 0 3 0 2 2 0
⍝ then
      A +.× B
 4 14
10  5
20  4
      A .= B
0 1
0 0
1 0
      A . B
1 0
1 1
0 1
      (A  0) +./ B
4 6
6 4
6 1

Note that some dialects implement Compress (/) as a monadic operator rather than as a function, which means it cannot be an operand in the inner product. Instead, a cover function is necessary:

za Compress b

Differences between dialects

Implementations differ on the exact behaviour of inner product when the right operand is not a scalar function. It follows from page 121 of the ISO/IEC 13751:2001(E) standard specifies that X f.g Y is equivalent to f ([⍴⍴x]x)∘.g [1]y. This is indeed what APL2, APLX, APL+Win, and ngn/apl follow, while Dyalog APL, NARS2000 and GNU APL differ as described by Roger Hui:[2]

The following dop models inner product in Dyalog APL, with caveats. If you find a case where f.g differs from f IP g, not covered by the caveats, I'd be interested.

  0  () ∘.(⍺⍺/⍵⍵¨) (¯1⌽⍳⍴⍴)    

assert{'assertion failure'  0⍵:⍺ ⎕SIGNAL 8  shy0}

(Explanation: What's with the 0 in IP? It's because ∘.f has an implicit each, applying to each item of its result. But the ⍺⍺/ in (⍺⍺/⍵⍵¨) also has an implicit each. So the 0 gets rid of one of those encloses.)


  • You can not use the hybrid / directly as an operand as it runs afoul of the parser in weird and wonderful ways. Instead, you have to use {/}. The same goes for \ and {\} I guess.
  • It differs from ISO/IEC 13751:2001(E) in using ⍵⍵¨ instead of just ⍵⍵ in the central key expression (i.e. (⍺⍺/⍵⍵¨) instead of (⍺⍺/⍵⍵)). So does the primitive f.g.
  • It differs from ISO/IEC 13751:2001(E) in doing full-blown single extension instead of just scalar and 1-element vector extension (as in APL2). So does the primitive f.g. e.g.
       (3 45)+.×1 1 1 16  ⍝ works in Dyalog, not in ISO or APL2
  • It differs from NARS2000 or APL\360 in not permitting unit axis extension. So does the primitive f.g. e.g.
       (3 45)+.×1 56  ⍝ works in NARS2000 or APL\360, not in Dyalog APL

External links


Discussion of differences between dialects


  1. Ken Iverson. A Programming Language. §1.11 The language.
  2. Roger Hui. inner product. Internal Dyalog email. 24 July 2020.
APL built-ins [edit]
Primitive functions
Monadic ConjugateNegateSignumReciprocalMagnitudeExponentialNatural LogarithmFloorCeilingFactorialNotPi TimesRollTypeImaginarySquare Root
Dyadic AddSubtractTimesDivideResiduePowerLogarithmMinimumMaximumBinomialComparison functionsBoolean functions (And, Or, Nand, Nor) ∙ GCDLCMCircularComplexRoot
Structural ShapeReshapeTallyDepthRavelEnlistTableCatenateReverseRotateTransposeRazeMixSplitEncloseNestCut (K)PairLinkPartitioned EnclosePartition
Selection FirstPickTakeDropUniqueIdentitySelectReplicateExpandSet functions (IntersectionUnionWithout) ∙ Bracket indexingIndex
Selector Index generatorGradeIndex OfInterval IndexIndicesDeal
Computational MatchNot MatchMembershipFindNub SieveEncodeDecodeMatrix InverseMatrix DivideFormatExecuteMaterialiseRange
Primitive operators Monadic EachCommuteConstantReplicateExpandReduceWindowed ReduceScanOuter ProductKeyI-beamSpawnFunction axis
Dyadic BindCompositions (Compose, Reverse Compose, Beside, Withe, Atop, Over) ∙ Inner ProductPowerAtUnderRankDepthVariantStencilCut (J)
Quad names
Arrays Index originMigration levelAtomic vector
Functions Name classCase convertUnicode convert
Operators SearchReplace