Outer Product: Difference between revisions
(Official explanation of ∘.) 
m (Qualify as *structured* Cartesian product; split long paragraph) Tags: Mobile edit Mobile web edit 

(15 intermediate revisions by 2 users not shown)  
Line 1:  Line 1:  
{{BuiltinOuter Product<nowiki>∘.</nowiki>}}, or '''Table''' is a [[monadic operator]], which will produce a [[dyadic function]] when applied with a [[dyadic function]]. Outer product applies the [[operand]] function on each [[element]] of the left array with each element of the right array. It can be described as a shortcut for constructing nested [[wikipedia:for loopfor loop]]s.  {{BuiltinOuter Product<nowiki>∘.</nowiki>}}, or '''Table''' is a [[monadic operator]], which will produce a [[dyadic function]] when applied with a [[dyadic function]]. Outer product applies the [[operand]] function on each [[element]] of the left array with each element of the right array. It can be described as a shortcut for constructing nested [[wikipedia:for loopfor loop]]s, and as a structured [[wikipedia:Cartesian productCartesian product]] generalized to operations other than [[catenatecatenation]].  
=== Syntax ===  === Syntax ===  
Outer Product differs from all other [[monadic operator]]s, which are written as a single [[glyph]], with the operand on the left. For [[backwards compatibilityhistorical reasons]], the outer product operator is a [[biglyph]] denoted as <  Outer Product differs from all other [[monadic operator]]s, which are written as a single [[glyph]], with the operand on the left. For [[backwards compatibilityhistorical reasons]], the outer product operator is a [[biglyph]] denoted as <syntaxhighlight lang=apl inline>∘.</syntaxhighlight>, and its operand appears on the right. This special notation is derived from the <syntaxhighlight lang=apl inline>f.g</syntaxhighlight> notation of [[inner product]]:<ref>[[Adin FalkoffFalkoff, A.D.]] and [[Ken IversonK.E. Iverson]]. [https://www.jsoftware.com/papers/APL360TerminalSystem1.htm#ip The APL\360 Terminal System: Inner and Outer Products]. Research Report RC1922. [[IBM]] Watson Research Center. 19671016.</ref>  
<blockquote>  <blockquote>  
The result of an inner product is an array with rank two less than the sum of the argument ranks. The result of an outer product, on the other hand, is always an array of rank equal to the sum of the argument ranks. This follows from the fact that the reduction operation, which collapses two dimensions in an inner product, is not used in the outer product. The notation for outer product reflects this by canonically using a small circle as the first symbol. Thus, the ordinary outer product is written as <code>a∘.×b</code> .  The result of an inner product is an array with rank two less than the sum of the argument ranks. The result of an outer product, on the other hand, is always an array of rank equal to the sum of the argument ranks. This follows from the fact that the reduction operation, which collapses two dimensions in an inner product, is not used in the outer product. The notation for outer product reflects this by canonically using a small circle as the first symbol. Thus, the ordinary outer product is written as <code>a∘.×b</code> .  
</blockquote>  </blockquote>  
This syntactical inconsistency is resolved in [[J]] and [[BQN]], where the outer product operator, called Table, and denoted <syntaxhighlight lang=j inline>/</syntaxhighlight> and <code>⌜</code> respectively, has the usual operator syntax.  
=== Model ===  
Outer Product can be modeled as <syntaxhighlight lang=apl inline>f¨⍤0 99</syntaxhighlight>.  
=== Examples ===  === Examples ===  
<  <syntaxhighlight lang=apl>  
x ← 1 2 3  x ← 1 2 3  
y ← 4 5 6  y ← 4 5 6  
Line 48:  Line 50:  
└───┴───┴───┘  └───┴───┴───┘  
</  </syntaxhighlight>  
=== Applications ===  === Applications ===  
Line 54:  Line 56:  
For example, suppose we want to find duplicated elements in an non[[nested array]]. Intuitively speaking, the easiest way to solve this problem is to compare each element of the array with all other elements, which is exactly what an outer product does.  For example, suppose we want to find duplicated elements in an non[[nested array]]. Intuitively speaking, the easiest way to solve this problem is to compare each element of the array with all other elements, which is exactly what an outer product does.  
<  <syntaxhighlight lang=apl>  
x ← 1 2 3 2  x ← 1 2 3 2  
⎕ ← matrix ← x∘.=x ⍝ compare elements with each other using equal  ⎕ ← matrix ← x∘.=x ⍝ compare elements with each other using equal  
Line 72:  Line 74:  
(⊢∪⍤/⍨2≤(+/∘.=⍨)) x ⍝ pointfree/tacit version  (⊢∪⍤/⍨2≤(+/∘.=⍨)) x ⍝ pointfree/tacit version  
2  2  
</  </syntaxhighlight>  
Using similar techniques, we can define a function that generates prime numbers by using an outer product of [[Residue]].  Using similar techniques, we can define a function that generates prime numbers by using an outer product of [[Residue]].  
<  <syntaxhighlight lang=apl>  
primes ← {x←1↓⍳⍵ ⋄ (2>+⌿0=x∘.x)/x}  primes ← {x←1↓⍳⍵ ⋄ (2>+⌿0=x∘.x)/x}  
primes 10  primes 10  
Line 80:  Line 82:  
primes 20  primes 20  
2 3 5 7 11 13 17 19  2 3 5 7 11 13 17 19  
</  </syntaxhighlight>  
Here there are faster solutions such as the [[wikipedia:Sieve of EratosthenesSieve of Eratosthenes]].  Here there are faster solutions such as the [[wikipedia:Sieve of EratosthenesSieve of Eratosthenes]].  
=== Differences between dialects ===  
[[J]]'s Table differs from APL's Outer Product by enabling Cartesian pairing between [[cell]]s of [[rank]]s other than 0, and between cells of different rank for the left vs. right arguments, without needing to first [[enclose]] the relevant cells. It is defined as <syntaxhighlight lang=j inline>u"(lu, _)</syntaxhighlight>, where <syntaxhighlight lang=j inline>lu</syntaxhighlight> is the left rank of operand <syntaxhighlight lang=j inline>u</syntaxhighlight> (<syntaxhighlight lang=j inline>"</syntaxhighlight> and <syntaxhighlight lang=j inline>_</syntaxhighlight> denote [[rank_(operator)Rank]] and infinity, respectively, in J).  
<syntaxhighlight lang=j>  
NB. Cartesian pairing of rows  
x=: 100+i.2 2  
y=: i.3 4  
x ,"1/ y NB. same as x ,"1"1 _ y  
100 101 0 1 2 3  
100 101 4 5 6 7  
100 101 8 9 10 11  
102 103 0 1 2 3  
102 103 4 5 6 7  
102 103 8 9 10 11  
NB. Cartesian pairing of xmatrices and ycubes  
x=: 100+i.2 2 2  
y=: i.2 2 2 4  
x ;"2 3/ y NB. same as x ;"2 3"2 _ y  
┌───────┬───────────┐  
│100 101│ 0 1 2 3│  
│102 103│ 4 5 6 7│  
│ │ │  
│ │ 8 9 10 11│  
│ │12 13 14 15│  
├───────┼───────────┤  
│100 101│16 17 18 19│  
│102 103│20 21 22 23│  
│ │ │  
│ │24 25 26 27│  
│ │28 29 30 31│  
└───────┴───────────┘  
┌───────┬───────────┐  
│104 105│ 0 1 2 3│  
│106 107│ 4 5 6 7│  
│ │ │  
│ │ 8 9 10 11│  
│ │12 13 14 15│  
├───────┼───────────┤  
│104 105│16 17 18 19│  
│106 107│20 21 22 23│  
│ │ │  
│ │24 25 26 27│  
│ │28 29 30 31│  
└───────┴───────────┘  
</syntaxhighlight>  
{{Works in[[J]]}}  
In APL this behavior can be accomplished by enclosing the relevant cells of each argument before applying the outer product operation (or by successive applications of Rank, e.g. <syntaxhighlight lang=apl inline>f⍤99 1⍤2 99</syntaxhighlight>). Conversely, the behavior of APL's Outer Product on nested inputs can be accomplished in terms of J's Table by adding the Each modifier, as in <syntaxhighlight lang=j inline>u&.>/</syntaxhighlight>.  
The results of the individual applications of u are collectively [[frame]]d by the catenation of the frames of the left and right arguments relative to their lu and rucells respectively, where lu and ru are the dyadic ranks of the operand u.  
Table does not allow for creating a Cartesian pairing involving cells of the left argument specified with negative rank (except trivially, in cases in which Table's application has no effect, e.g. <syntaxhighlight lang=j inline>u"_ _1"_2 _/</syntaxhighlight>). This is because negative assigned rank in J is encoded as infinite rank; in J's terminology, negative rank is "internal rank" only.  
<syntaxhighlight lang=j>  
}.+"_1 _2 b.0 NB. dyadic ranks of derived verb +"_1 _2 as seen by Table  
_ _  
</syntaxhighlight>  
== External links ==  == External links ==  
Line 93:  Line 156:  
* [https://mlochbaum.github.io/BQN/doc/map.html#table BQN]  * [https://mlochbaum.github.io/BQN/doc/map.html#table BQN]  
== References ==  
<references/>  
{{APL builtins}}[[Category:Primitive operators]]  {{APL builtins}}[[Category:Primitive operators]] 
Latest revision as of 23:14, 4 September 2023
∘.

Outer Product (∘.
), or Table is a monadic operator, which will produce a dyadic function when applied with a dyadic function. Outer product applies the operand function on each element of the left array with each element of the right array. It can be described as a shortcut for constructing nested for loops, and as a structured Cartesian product generalized to operations other than catenation.
Syntax
Outer Product differs from all other monadic operators, which are written as a single glyph, with the operand on the left. For historical reasons, the outer product operator is a biglyph denoted as ∘.
, and its operand appears on the right. This special notation is derived from the f.g
notation of inner product:^{[1]}
The result of an inner product is an array with rank two less than the sum of the argument ranks. The result of an outer product, on the other hand, is always an array of rank equal to the sum of the argument ranks. This follows from the fact that the reduction operation, which collapses two dimensions in an inner product, is not used in the outer product. The notation for outer product reflects this by canonically using a small circle as the first symbol. Thus, the ordinary outer product is written as
a∘.×b
.
This syntactical inconsistency is resolved in J and BQN, where the outer product operator, called Table, and denoted /
and ⌜
respectively, has the usual operator syntax.
Model
Outer Product can be modeled as f¨⍤0 99
.
Examples
x ← 1 2 3 y ← 4 5 6 x ∘., y ⍝ visualizing outer product ┌───┬───┬───┐ │1 4│1 5│1 6│ ├───┼───┼───┤ │2 4│2 5│2 6│ ├───┼───┼───┤ │3 4│3 5│3 6│ └───┴───┴───┘ ⍝ works for multidimensional arrays as well y←2 3 ⍴ 'abcdef' x←2 2 ⍴ ⍳4 x∘.,y ┌───┬───┬───┐ │1 a│1 b│1 c│ ├───┼───┼───┤ │1 d│1 e│1 f│ └───┴───┴───┘ ┌───┬───┬───┐ │2 a│2 b│2 c│ ├───┼───┼───┤ │2 d│2 e│2 f│ └───┴───┴───┘ ┌───┬───┬───┐ │3 a│3 b│3 c│ ├───┼───┼───┤ │3 d│3 e│3 f│ └───┴───┴───┘ ┌───┬───┬───┐ │4 a│4 b│4 c│ ├───┼───┼───┤ │4 d│4 e│4 f│ └───┴───┴───┘
Applications
Outer product is useful for solving problems that intuitively require a polynomial time algorithm. This may also indicate that such an algorithm is not the fastest solution.
For example, suppose we want to find duplicated elements in an nonnested array. Intuitively speaking, the easiest way to solve this problem is to compare each element of the array with all other elements, which is exactly what an outer product does.
x ← 1 2 3 2 ⎕ ← matrix ← x∘.=x ⍝ compare elements with each other using equal 1 0 0 0 0 1 0 1 0 0 1 0 0 1 0 1 ⎕ ← count ← +/matrix ⍝ get the number of occurence of each element 1 2 1 2 ⎕ ← indices ← count ≥ 2 ⍝ get the indices of elements which occured more than once 0 1 0 1 ⎕ ← duplicated ← ∪ indices/x 2 ∪((+/x∘.=x)≥2)/x ⍝ everything above in one line 2 (⊢∪⍤/⍨2≤(+/∘.=⍨)) x ⍝ pointfree/tacit version 2
Using similar techniques, we can define a function that generates prime numbers by using an outer product of Residue.
primes ← {x←1↓⍳⍵ ⋄ (2>+⌿0=x∘.x)/x} primes 10 2 3 5 7 primes 20 2 3 5 7 11 13 17 19
Here there are faster solutions such as the Sieve of Eratosthenes.
Differences between dialects
J's Table differs from APL's Outer Product by enabling Cartesian pairing between cells of ranks other than 0, and between cells of different rank for the left vs. right arguments, without needing to first enclose the relevant cells. It is defined as u"(lu, _)
, where lu
is the left rank of operand u
("
and _
denote Rank and infinity, respectively, in J).
NB. Cartesian pairing of rows x=: 100+i.2 2 y=: i.3 4 x ,"1/ y NB. same as x ,"1"1 _ y 100 101 0 1 2 3 100 101 4 5 6 7 100 101 8 9 10 11 102 103 0 1 2 3 102 103 4 5 6 7 102 103 8 9 10 11 NB. Cartesian pairing of xmatrices and ycubes x=: 100+i.2 2 2 y=: i.2 2 2 4 x ;"2 3/ y NB. same as x ;"2 3"2 _ y ┌───────┬───────────┐ │100 101│ 0 1 2 3│ │102 103│ 4 5 6 7│ │ │ │ │ │ 8 9 10 11│ │ │12 13 14 15│ ├───────┼───────────┤ │100 101│16 17 18 19│ │102 103│20 21 22 23│ │ │ │ │ │24 25 26 27│ │ │28 29 30 31│ └───────┴───────────┘ ┌───────┬───────────┐ │104 105│ 0 1 2 3│ │106 107│ 4 5 6 7│ │ │ │ │ │ 8 9 10 11│ │ │12 13 14 15│ ├───────┼───────────┤ │104 105│16 17 18 19│ │106 107│20 21 22 23│ │ │ │ │ │24 25 26 27│ │ │28 29 30 31│ └───────┴───────────┘
In APL this behavior can be accomplished by enclosing the relevant cells of each argument before applying the outer product operation (or by successive applications of Rank, e.g. f⍤99 1⍤2 99
). Conversely, the behavior of APL's Outer Product on nested inputs can be accomplished in terms of J's Table by adding the Each modifier, as in u&.>/
.
The results of the individual applications of u are collectively framed by the catenation of the frames of the left and right arguments relative to their lu and rucells respectively, where lu and ru are the dyadic ranks of the operand u.
Table does not allow for creating a Cartesian pairing involving cells of the left argument specified with negative rank (except trivially, in cases in which Table's application has no effect, e.g. u"_ _1"_2 _/
). This is because negative assigned rank in J is encoded as infinite rank; in J's terminology, negative rank is "internal rank" only.
}.+"_1 _2 b.0 NB. dyadic ranks of derived verb +"_1 _2 as seen by Table _ _
External links
 Outer Product as an Introduction to APL and a Pretty Cool Thing in General: website for LambdaConf talk by Marshall Lochbaum
Documentation
 Dyalog
 APLX
 J Dictionary, NuVoc
 BQN
References
 ↑ Falkoff, A.D. and K.E. Iverson. The APL\360 Terminal System: Inner and Outer Products. Research Report RC1922. IBM Watson Research Center. 19671016.