login  home  contents  what's new  discussion  bug reports     help  links  subscribe  changes  refresh  edit

Edit detail for LinearOperator revision 12 of 63

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63
Editor: page
Time: 2011/04/09 07:58:14 GMT-7
Note: Monoidal Prop

changed:
-Linear transformations (operators) over n-dimensional cartesian vector spaces oveer a commutative ring $K$. Members of this domain are morphisms $K^n \to K^m$. Products, co-products and composition (grafting) of morphisms is implemented.  Operators are represented internally as tensors.
Linear transformations (operators) over n-dimensional cartesian vector spaces over a commutative ring $K$. Members of this domain are morphisms $K^n \to K^m$. Products, co-products and composition (grafting) of morphisms is implemented.  Operators are represented internally as tensors.

added:

We try to start the **right way** by defining the concept of a monoidal category.

\begin{spad}
)abbrev category MONAL Monoidal
Monoidal(R:AbelianSemiGroup):Category == BasicType with
    dom: % -> R
      ++ domain
    cod: % -> R
      ++ co-domain
    _*: (%,%) -> %
      ++ composition
    _/: (%,%) -> %
      ++ vertical composition f/g = g*f
    elt:(%,%) -> %
      ++ horizontal composition (product)
  add
    (f:% / g:%):% == g*f
\end{spad}

The initial object in this category is the domain Prop (Products and Permutations).

\begin{spad}
)abbrev domain PROP Prop
Prop(R:AbelianSemiGroup): Join(Monoidal R, CoercibleTo OutputForm) with
    _/:(R,R) -> %
  == add
    Rep == Record(domain:R,codomain:R)
    rep(x:%):Rep == x pretend Rep
    per(x:Rep):% == x pretend %

    dom(f:%):R == rep(f).domain
    cod(f:%):R == rep(f).codomain

    coerce(f:%):OutputForm == dom(f)::OutputForm / cod(f)::OutputForm
    (f:R / g:R):% == per [f,g]
    (g:% * f:%):% ==
      cod(f) ~= dom(g) => error "arity"
      per [dom f,cod g]
    elt(f:%,g:%):% == per [dom(f)+dom(g),cod(f)+cod(g)]
\end{spad}

The LinearOperator domain is Moniodal over NonNegativeInteger

changed:
-LinearOperator(dim:NonNegativeInteger,K:CommutativeRing): Join(Ring,BiModule(K,K)) with
-    arity: % -> DirectProduct(2,NonNegativeInteger)
-    elt: (%,%) -> %
-      ++ tensor product
-    _/: (%,%) -> %
-      ++ operator composition
LinearOperator(dim:NonNegativeInteger,K:CommutativeRing): Exports == Implementation where
  NNI ==> NonNegativeInteger

  Exports ==> Join(Ring, BiModule(K,K), Monoidal NNI, CoercibleTo Prop NNI) with

changed:
-  == add
-    import List NonNegativeInteger

  Implementation ==> add
    import List NNI

removed:
-    NNI ==> NonNegativeInteger

added:


changed:
-    arity(f:%):DirectProduct(2,NonNegativeInteger) == directProduct [dom f,cod f]
    coerce(f:%):Prop(NNI) == dom(f)/cod(f)

changed:
-    (f:% / g:%):% ==
    (g:% * f:%):% ==

removed:
-    (g:% * f:%):% == f/g
-

changed:
-      q case NonNegativeInteger => f^q * f
      q case NNI => f^q * f

changed:
-      q case NonNegativeInteger => f*q + f
      q case NNI => f*q + f

changed:
-Products
Composition

changed:
-f*g : A^n \to A^{m+p} = f:A^n \to A^m * g:A^n \to A^p
g/f : A^n \to A^{m+p} = f:A^n \to A^m * g:A^n \to A^p

changed:
-A12p := A1 * A2; A12p::OutputForm = A1::OutputForm * A2::OutputForm
-arity(A12p)::OutputForm = arity(A1)::OutputForm * arity(A2)::OutputForm
-B12p := B1 * B2; B12p::OutputForm = B1::OutputForm * B2::OutputForm
-arity(B12p)::OutputForm = arity(B1)::OutputForm * arity(B2)::OutputForm
-\end{axiom}
AB2 := A2 / B2; AB2::OutputForm = A2::OutputForm / B2::OutputForm
arity(AB2)::OutputForm = arity(A2)::OutputForm / arity(B2)::OutputForm
BA1 := B1 / A1; BA1::OutputForm = B1::OutputForm / A1::OutputForm
arity(BA1)::OutputForm = arity(B1)::OutputForm / arity(A1)::OutputForm
AB1 := A1 / B1; AB1::OutputForm = A1::OutputForm / B1::OutputForm
arity(AB1)::OutputForm = arity(A1)::OutputForm / arity(B1)::OutputForm
\end{axiom}

changed:
-A3p:=(A1*A1)*A1
-arity(A3p)
-test(A3p=A1*(A1*A1))
-test(A3p=A1^3)
-\end{axiom}
AB3:=(AB1/AB1)/AB1
arity(AB3)
test(AB3=AB1/(AB1/AB1))
test(AB3=AB1^3)
\end{axiom}

Linear transformations (operators) over n-dimensional cartesian vector spaces over a commutative ring K. Members of this domain are morphisms K^n \to K^m. Products, co-products and composition (grafting) of morphisms is implemented. Operators are represented internally as tensors.

Operator composition and products can be visualized by directed graphs (read from top to bottom) such as:

      n = 3     inputs

      \  |  /         \  /   /         \              |
       \ | /           \/   /           \            / \
        \|/             \  /           / \          /   \
        / \              \/           /   \         \   /
       /   \              \          /   / \         \ /
      /     \              \        /   /   \         |

      m = 2     outputs

Lines (edges) in the graph represent vectors, nodes represent operators. Horizontal juxtaposition represents product. Vertical juxtaposition represents composition.

We try to start the right way by defining the concept of a monoidal category.

spad
)abbrev category MONAL Monoidal
Monoidal(R:AbelianSemiGroup):Category == BasicType with
    dom: % -> R
      ++ domain
    cod: % -> R
      ++ co-domain
    _*: (%,%) -> %
      ++ composition
    _/: (%,%) -> %
      ++ vertical composition f/g = g*f
    elt:(%,%) -> %
      ++ horizontal composition (product)
  add
    (f:% / g:%):% == g*f
spad
   Compiling FriCAS source code from file 
      /var/zope2/var/LatexWiki/1467253716425331323-25px001.spad using 
      old system compiler.
   MONAL abbreviates category Monoidal 
------------------------------------------------------------------------
   initializing NRLIB MONAL for Monoidal 
   compiling into NRLIB MONAL 
;;; *** |Monoidal| REDEFINED Time: 0.06 SEC.
MONAL- abbreviates domain Monoidal& ------------------------------------------------------------------------ initializing NRLIB MONAL- for Monoidal& compiling into NRLIB MONAL- compiling exported / : (S,S) -> S Time: 0.32 SEC.
(time taken in buildFunctor: 0)
;;; *** |Monoidal&| REDEFINED Time: 0.01 SEC.
Cumulative Statistics for Constructor Monoidal& Time: 0.33 seconds
finalizing NRLIB MONAL- Processing Monoidal& for Browser database: --------(dom (R %))--------- --------(cod (R %))--------- --------(* (% % %))--------- --------(/ (% % %))--------- --->-->Monoidal&((/ (% % %))): Improper first word in comments: vertical "vertical composition \\spad{f/g} = \\spad{g*f}" --------(elt (% % %))--------- --->-->Monoidal&((elt (% % %))): Improper first word in comments: horizontal "horizontal composition (\\spad{product})" --->-->Monoidal&(constructor): Not documented!!!! --->-->Monoidal&(): Missing Description ; compiling file "/var/zope2/var/LatexWiki/MONAL-.NRLIB/MONAL-.lsp" (written 09 APR 2011 07:57:49 AM):
; /var/zope2/var/LatexWiki/MONAL-.NRLIB/MONAL-.fasl written ; compilation finished in 0:00:00.071 ------------------------------------------------------------------------ Monoidal& is now explicitly exposed in frame initial Monoidal& will be automatically loaded when needed from /var/zope2/var/LatexWiki/MONAL-.NRLIB/MONAL- finalizing NRLIB MONAL Processing Monoidal for Browser database: --------(dom (R %))--------- --------(cod (R %))--------- --------(* (% % %))--------- --------(/ (% % %))--------- --->-->Monoidal((/ (% % %))): Improper first word in comments: vertical "vertical composition \\spad{f/g} = \\spad{g*f}" --------(elt (% % %))--------- --->-->Monoidal((elt (% % %))): Improper first word in comments: horizontal "horizontal composition (\\spad{product})" --->-->Monoidal(constructor): Not documented!!!! --->-->Monoidal(): Missing Description ; compiling file "/var/zope2/var/LatexWiki/MONAL.NRLIB/MONAL.lsp" (written 09 APR 2011 07:57:49 AM):
; /var/zope2/var/LatexWiki/MONAL.NRLIB/MONAL.fasl written ; compilation finished in 0:00:00.018 ------------------------------------------------------------------------ Monoidal is now explicitly exposed in frame initial Monoidal will be automatically loaded when needed from /var/zope2/var/LatexWiki/MONAL.NRLIB/MONAL
>> System error: The bounding indices 163 and 162 are bad for a sequence of length 162. See also: The ANSI Standard, Glossary entry for "bounding index designator" The ANSI Standard, writeup for Issue SUBSEQ-OUT-OF-BOUNDS:IS-AN-ERROR

The initial object in this category is the domain Prop (Products and Permutations).

spad
)abbrev domain PROP Prop
Prop(R:AbelianSemiGroup): Join(Monoidal R, CoercibleTo OutputForm) with
    _/:(R,R) -> %
  == add
    Rep == Record(domain:R,codomain:R)
    rep(x:%):Rep == x pretend Rep
    per(x:Rep):% == x pretend %
dom(f:%):R == rep(f).domain cod(f:%):R == rep(f).codomain
coerce(f:%):OutputForm == dom(f)::OutputForm / cod(f)::OutputForm (f:R / g:R):% == per [f,g] (g:% * f:%):% == cod(f) ~= dom(g) => error "arity" per [dom f,cod g] elt(f:%,g:%):% == per [dom(f)+dom(g),cod(f)+cod(g)]
spad
   Compiling FriCAS source code from file 
      /var/zope2/var/LatexWiki/3672717930539873036-25px002.spad using 
      old system compiler.
   PROP abbreviates domain Prop 
------------------------------------------------------------------------
   initializing NRLIB PROP for Prop 
   compiling into NRLIB PROP 
   compiling local rep : $ -> Record(domain: R,codomain: R)
      PROP;rep is replaced by x 
Time: 0.02 SEC.
compiling local per : Record(domain: R,codomain: R) -> $ PROP;per is replaced by x Time: 0 SEC.
compiling exported dom : $ -> R Time: 0 SEC.
compiling exported cod : $ -> R Time: 0 SEC.
compiling exported coerce : $ -> OutputForm Time: 0 SEC.
compiling exported / : (R,R) -> $ Time: 0 SEC.
compiling exported * : ($,$) -> $ Time: 0 SEC.
compiling exported elt : ($,$) -> $ Time: 0 SEC.
(time taken in buildFunctor: 0)
;;; *** |Prop| REDEFINED
;;; *** |Prop| REDEFINED Time: 0.01 SEC.
Cumulative Statistics for Constructor Prop Time: 0.03 seconds
finalizing NRLIB PROP Processing Prop for Browser database: --->-->Prop((/ (% R R))): Not documented!!!! --->-->Prop(constructor): Not documented!!!! --->-->Prop(): Missing Description ; compiling file "/var/zope2/var/LatexWiki/PROP.NRLIB/PROP.lsp" (written 09 APR 2011 07:57:50 AM):
; /var/zope2/var/LatexWiki/PROP.NRLIB/PROP.fasl written ; compilation finished in 0:00:00.086 ------------------------------------------------------------------------ Prop is now explicitly exposed in frame initial Prop will be automatically loaded when needed from /var/zope2/var/LatexWiki/PROP.NRLIB/PROP
>> System error: The bounding indices 163 and 162 are bad for a sequence of length 162. See also: The ANSI Standard, Glossary entry for "bounding index designator" The ANSI Standard, writeup for Issue SUBSEQ-OUT-OF-BOUNDS:IS-AN-ERROR

The LinearOperator? domain is Moniodal over NonNegativeInteger?

spad
)abbrev domain LIN LinearOperator
LinearOperator(dim:NonNegativeInteger,K:CommutativeRing): Exports == Implementation where
  NNI ==> NonNegativeInteger
Exports ==> Join(Ring, BiModule(K,K), Monoidal NNI, CoercibleTo Prop NNI) with inp: List K -> % ++ incoming vector inp: List % -> % out: List K -> % ++ output vector out: List % -> % coerce: SquareMatrix(dim,K) -> % _*: (%,NonNegativeInteger) -> %
Implementation ==> add import List NNI T ==> CartesianTensor(1,dim,K) Rep == Record(domain:NNI, codomain:NNI, data:T) rep(x:%):Rep == x pretend Rep per(x:Rep):% == x pretend %
dom(f:%):NNI == rep(f).domain cod(f:%):NNI == rep(f).codomain
dat(f:%):T == rep(f).data
coerce(f:%):Prop(NNI) == dom(f)/cod(f)
0 == per [0,0,0]
-- -- f+g : A^{n+m} -> A^p = f:A^n -> A^p + g:A^m -> A^p -- (f:% + g:%):% == dom(f) ~= dom(g) or cod(f) ~= cod(g) => error "arity" per [dom(f),cod(f),dat(f)+dat(g)]
(f:% - g:%):% == dom(f) ~= dom(f) or cod(g) ~= cod(g) => error "arity" per [dom(f),cod(f),dat(f)-dat(g)]
-- -- f/g : A^n -> A^p = f:A^n -> A^m / g:A^m -> A^p -- g*f : A^n -> A^p = g:A^m -> A^p * f:A^n -> A^m -- (g:% * f:%):% == cod(f) ~= dom(g) => error "arity" r:T := product(dat(f), dat(g)) n:=dom(f)+1 m:=n+cod(f) while m>n repeat r := contract(r,n,m) m:=m-1 per [dom f,cod g,r]
1:% == per [1,1,kroneckerDelta()$T]
-- repeated composition (f:% ^ p:NNI):% == cod(f) ~= dom(f) => error "arity" q:=subtractIfCan(p,1) q case NNI => f^q * f 1
-- repeated sum (f:% * p:NNI):% == q:=subtractIfCan(p,1) q case NNI => f*q + f 0
(x:% = y:%):Boolean == dom(x) ~= dom(y) or cod(x) ~= cod(y) => error "arity" dat(x) = dat(y)
(x:K * y:%):% == per [dom(y),cod(y),x*dat(y)]
(x:% * y:K):% == per [dom(x),cod(x),dat(x)*y]
inp(x:List K):% == per [1,0,entries(x)::T]
inp(x:List %):% == #removeDuplicates([dom(y) for y in x])~=1 or #removeDuplicates([cod(y) for y in x])~=1 => error "arity" per [dom(first x)+1,cod(first x),[dat(y) for y in x]::T]$Rep
out(x:List K):% == per [0,1,entries(x)::T]
out(x:List %):% == #removeDuplicates([dom(y) for y in x])~=1 or #removeDuplicates([cod(y) for y in x])~=1 => error "arity" per [dom(first x),cod(first x)+1,[dat(y) for y in x]::T]$Rep
coerce(x:%):OutputForm == (dat(x))::OutputForm
spad
   Compiling FriCAS source code from file 
      /var/zope2/var/LatexWiki/4431927989007062318-25px003.spad using 
      old system compiler.
   LIN abbreviates domain LinearOperator 
------------------------------------------------------------------------
   initializing NRLIB LIN for LinearOperator 
   compiling into NRLIB LIN 
   importing List NonNegativeInteger
   processing macro definition T$ ==> CartesianTensor(One,dim,K) 
   compiling local rep : $ -> Record(domain: NonNegativeInteger,codomain: NonNegativeInteger,data: CartesianTensor(One,dim,K))
      LIN;rep is replaced by x 
Time: 0.06 SEC.
compiling local per : Record(domain: NonNegativeInteger,codomain: NonNegativeInteger,data: CartesianTensor(One,dim,K)) -> $ LIN;per is replaced by x Time: 0 SEC.
compiling exported dom : $ -> NonNegativeInteger Time: 0 SEC.
compiling exported cod : $ -> NonNegativeInteger Time: 0 SEC.
compiling local dat : $ -> CartesianTensor(One,dim,K) Time: 0.01 SEC.
compiling exported coerce : $ -> Prop NonNegativeInteger Time: 0 SEC.
compiling exported Zero : () -> $ Time: 0 SEC.
compiling exported + : ($,$) -> $ Time: 0 SEC.
compiling exported - : ($,$) -> $ Time: 0.01 SEC.
compiling exported * : ($,$) -> $ Time: 0.01 SEC.
compiling exported One : () -> $ Time: 0 SEC.
compiling exported ^ : ($,NonNegativeInteger) -> $ Time: 0.01 SEC.
compiling exported * : ($,NonNegativeInteger) -> $ Time: 0.01 SEC.
compiling exported = : ($,$) -> Boolean Time: 0.01 SEC.
compiling exported * : (K,$) -> $ Time: 0 SEC.
compiling exported * : ($,K) -> $ Time: 0 SEC.
compiling exported inp : List K -> $ Time: 0.05 SEC.
compiling exported inp : List $ -> $ Time: 0.08 SEC.
compiling exported out : List K -> $ Time: 0 SEC.
compiling exported out : List $ -> $ Time: 0.16 SEC.
compiling exported coerce : $ -> OutputForm Time: 0.01 SEC.
(time taken in buildFunctor: 0)
;;; *** |LinearOperator| REDEFINED
;;; *** |LinearOperator| REDEFINED Time: 0.01 SEC.
Cumulative Statistics for Constructor LinearOperator Time: 0.43 seconds
finalizing NRLIB LIN Processing LinearOperator for Browser database: --------(inp (% (List K)))--------- --->-->LinearOperator((inp (% (List %)))): Not documented!!!! --------(out (% (List K)))--------- --->-->LinearOperator((out (% (List %)))): Not documented!!!! --->-->LinearOperator((coerce (% (SquareMatrix dim K)))): Not documented!!!! --->-->LinearOperator((* (% % (NonNegativeInteger)))): Not documented!!!! --->-->LinearOperator(constructor): Not documented!!!! --->-->LinearOperator(): Missing Description ; compiling file "/var/zope2/var/LatexWiki/LIN.NRLIB/LIN.lsp" (written 09 APR 2011 07:57:51 AM):
; /var/zope2/var/LatexWiki/LIN.NRLIB/LIN.fasl written ; compilation finished in 0:00:00.371 ------------------------------------------------------------------------ LinearOperator is now explicitly exposed in frame initial LinearOperator will be automatically loaded when needed from /var/zope2/var/LatexWiki/LIN.NRLIB/LIN
>> System error: The bounding indices 163 and 162 are bad for a sequence of length 162. See also: The ANSI Standard, Glossary entry for "bounding index designator" The ANSI Standard, writeup for Issue SUBSEQ-OUT-OF-BOUNDS:IS-AN-ERROR

Construction operators: input and output

axiom
L:=LIN(2,FRAC POLY INT)

\label{eq1}\hbox{\axiomType{LinearOperator}\ } (2, \hbox{\axiomType{Fraction}\ } (\hbox{\axiomType{Polynomial}\ } (\hbox{\axiomType{Integer}\ })))(1)
Type: Type
axiom
A1:L:=inp[script(a,[[1,i]]) for i in 1..2]

\label{eq2}\left[{a_{1, \: 1}}, \:{a_{1, \: 2}}\right](2)
Type: LinearOperator?(2,Fraction(Polynomial(Integer)))
axiom
arity A1
There are 1 exposed and 0 unexposed library operations named arity having 1 argument(s) but none was determined to be applicable. Use HyperDoc Browse, or issue )display op arity to learn more about the available operations. Perhaps package-calling the operation or using coercions on the arguments will allow you to apply the operation.
Cannot find a definition or applicable library operation named arity with argument type(s) LinearOperator(2,Fraction(Polynomial(Integer)))
Perhaps you should use "@" to indicate the required return type, or "$" to specify which version of the function you need. A2:L:=inp[script(a,[[2,i]]) for i in 1..2]

\label{eq3}\left[{a_{2, \: 1}}, \:{a_{2, \: 2}}\right](3)
Type: LinearOperator?(2,Fraction(Polynomial(Integer)))
axiom
A:L:=inp[A1,A2]

\label{eq4}\left[ 
\begin{array}{cc}
{a_{1, \: 1}}&{a_{1, \: 2}}
\
{a_{2, \: 1}}&{a_{2, \: 2}}
(4)
Type: LinearOperator?(2,Fraction(Polynomial(Integer)))
axiom
arity A
There are 1 exposed and 0 unexposed library operations named arity having 1 argument(s) but none was determined to be applicable. Use HyperDoc Browse, or issue )display op arity to learn more about the available operations. Perhaps package-calling the operation or using coercions on the arguments will allow you to apply the operation.
Cannot find a definition or applicable library operation named arity with argument type(s) LinearOperator(2,Fraction(Polynomial(Integer)))
Perhaps you should use "@" to indicate the required return type, or "$" to specify which version of the function you need. B1:L:=out[script(b,[[],[1,i]]) for i in 1..2]

\label{eq5}\left[{b^{1, \: 1}}, \:{b^{1, \: 2}}\right](5)
Type: LinearOperator?(2,Fraction(Polynomial(Integer)))
axiom
arity B1
There are 1 exposed and 0 unexposed library operations named arity having 1 argument(s) but none was determined to be applicable. Use HyperDoc Browse, or issue )display op arity to learn more about the available operations. Perhaps package-calling the operation or using coercions on the arguments will allow you to apply the operation.
Cannot find a definition or applicable library operation named arity with argument type(s) LinearOperator(2,Fraction(Polynomial(Integer)))
Perhaps you should use "@" to indicate the required return type, or "$" to specify which version of the function you need. B2:L:=out[script(b,[[],[2,i]]) for i in 1..2]

\label{eq6}\left[{b^{2, \: 1}}, \:{b^{2, \: 2}}\right](6)
Type: LinearOperator?(2,Fraction(Polynomial(Integer)))
axiom
B:L:=out[B1,B2]

\label{eq7}\left[ 
\begin{array}{cc}
{b^{1, \: 1}}&{b^{1, \: 2}}
\
{b^{2, \: 1}}&{b^{2, \: 2}}
(7)
Type: LinearOperator?(2,Fraction(Polynomial(Integer)))
axiom
arity B
There are 1 exposed and 0 unexposed library operations named arity having 1 argument(s) but none was determined to be applicable. Use HyperDoc Browse, or issue )display op arity to learn more about the available operations. Perhaps package-calling the operation or using coercions on the arguments will allow you to apply the operation.
Cannot find a definition or applicable library operation named arity with argument type(s) LinearOperator(2,Fraction(Polynomial(Integer)))
Perhaps you should use "@" to indicate the required return type, or "$" to specify which version of the function you need.

Composition


g/f : A^n \to A^{m+p} = f:A^n \to A^m <em> g:A^n \to A^p
 
axiom
AB2 := A2 / B2; AB2::OutputForm = A2::OutputForm / B2::OutputForm

\label{eq8}\begin{array}{@{}l}
\displaystyle
{\left[ 
\begin{array}{cc}
{{b^{2, \: 1}}\ {a_{2, \: 1}}}&{{b^{2, \: 2}}\ {a_{2, \: 1}}}
\
{{b^{2, \: 1}}\ {a_{2, \: 2}}}&{{b^{2, \: 2}}\ {a_{2, \: 2}}}
(8)
Type: Equation(OutputForm?)
axiom
arity(AB2)::OutputForm = arity(A2)::OutputForm / arity(B2)::OutputForm
There are 1 exposed and 0 unexposed library operations named arity having 1 argument(s) but none was determined to be applicable. Use HyperDoc Browse, or issue )display op arity to learn more about the available operations. Perhaps package-calling the operation or using coercions on the arguments will allow you to apply the operation.
Cannot find a definition or applicable library operation named arity with argument type(s) LinearOperator(2,Fraction(Polynomial(Integer)))
Perhaps you should use "@" to indicate the required return type, or "$" to specify which version of the function you need. BA1 := B1 / A1; BA1::OutputForm = B1::OutputForm / A1::OutputForm

\label{eq9}{{{b^{1, \: 2}}\ {a_{1, \: 2}}}+{{b^{1, \: 1}}\ {a_{1, \: 1}}}}={{\left[{b^{1, \: 1}}, \:{b^{1, \: 2}}\right]}\over{\left[{a_{1, \: 1}}, \:{a_{1, \: 2}}\right]}}(9)
Type: Equation(OutputForm?)
axiom
arity(BA1)::OutputForm = arity(B1)::OutputForm / arity(A1)::OutputForm
There are 1 exposed and 0 unexposed library operations named arity having 1 argument(s) but none was determined to be applicable. Use HyperDoc Browse, or issue )display op arity to learn more about the available operations. Perhaps package-calling the operation or using coercions on the arguments will allow you to apply the operation.
Cannot find a definition or applicable library operation named arity with argument type(s) LinearOperator(2,Fraction(Polynomial(Integer)))
Perhaps you should use "@" to indicate the required return type, or "$" to specify which version of the function you need. AB1 := A1 / B1; AB1::OutputForm = A1::OutputForm / B1::OutputForm

\label{eq10}\begin{array}{@{}l}
\displaystyle
{\left[ 
\begin{array}{cc}
{{b^{1, \: 1}}\ {a_{1, \: 1}}}&{{b^{1, \: 2}}\ {a_{1, \: 1}}}
\
{{b^{1, \: 1}}\ {a_{1, \: 2}}}&{{b^{1, \: 2}}\ {a_{1, \: 2}}}
(10)
Type: Equation(OutputForm?)
axiom
arity(AB1)::OutputForm = arity(A1)::OutputForm / arity(B1)::OutputForm
There are 1 exposed and 0 unexposed library operations named arity having 1 argument(s) but none was determined to be applicable. Use HyperDoc Browse, or issue )display op arity to learn more about the available operations. Perhaps package-calling the operation or using coercions on the arguments will allow you to apply the operation.
Cannot find a definition or applicable library operation named arity with argument type(s) LinearOperator(2,Fraction(Polynomial(Integer)))
Perhaps you should use "@" to indicate the required return type, or "$" to specify which version of the function you need.

Powers

axiom
AB3:=(AB1/AB1)/AB1

\label{eq11}\left[ 
\begin{array}{cc}
{{{b^{1, \: 1}}\ {{b^{1, \: 2}}^2}\ {a_{1, \: 1}}\ {{a_{1, \: 2}}^2}}+{2 \ {{b^{1, \: 1}}^2}\ {b^{1, \: 2}}\ {{a_{1, \: 1}}^2}\ {a_{1, \: 2}}}+{{{b^{1, \: 1}}^3}\ {{a_{1, \: 1}}^3}}}&{{{{b^{1, \: 2}}^3}\ {a_{1, \: 1}}\ {{a_{1, \: 2}}^2}}+{2 \ {b^{1, \: 1}}\ {{b^{1, \: 2}}^2}\ {{a_{1, \: 1}}^2}\ {a_{1, \: 2}}}+{{{b^{1, \: 1}}^2}\ {b^{1, \: 2}}\ {{a_{1, \: 1}}^3}}}
\
{{{b^{1, \: 1}}\ {{b^{1, \: 2}}^2}\ {{a_{1, \: 2}}^3}}+{2 \ {{b^{1, \: 1}}^2}\ {b^{1, \: 2}}\ {a_{1, \: 1}}\ {{a_{1, \: 2}}^2}}+{{{b^{1, \: 1}}^3}\ {{a_{1, \: 1}}^2}\ {a_{1, \: 2}}}}&{{{{b^{1, \: 2}}^3}\ {{a_{1, \: 2}}^3}}+{2 \ {b^{1, \: 1}}\ {{b^{1, \: 2}}^2}\ {a_{1, \: 1}}\ {{a_{1, \: 2}}^2}}+{{{b^{1, \: 1}}^2}\ {b^{1, \: 2}}\ {{a_{1, \: 1}}^2}\ {a_{1, \: 2}}}}
(11)
Type: LinearOperator?(2,Fraction(Polynomial(Integer)))
axiom
arity(AB3)
There are 1 exposed and 0 unexposed library operations named arity having 1 argument(s) but none was determined to be applicable. Use HyperDoc Browse, or issue )display op arity to learn more about the available operations. Perhaps package-calling the operation or using coercions on the arguments will allow you to apply the operation.
Cannot find a definition or applicable library operation named arity with argument type(s) LinearOperator(2,Fraction(Polynomial(Integer)))
Perhaps you should use "@" to indicate the required return type, or "$" to specify which version of the function you need. test(AB3=AB1/(AB1/AB1))

\label{eq12} \mbox{\rm true} (12)
Type: Boolean
axiom
test(AB3=AB1^3)

\label{eq13} \mbox{\rm true} (13)
Type: Boolean

axiom
B3p:=(B1*B1)*B1
>> Error detected within library code: arity

Sums


f+g : A^{n+m} \to A^p = f:A^n \to A^p + g:A^m \to A^p
 
axiom
A12s := A1 + A2; A12s::OutputForm = A1::OutputForm + A2::OutputForm

\label{eq14}{\left[{{a_{2, \: 1}}+{a_{1, \: 1}}}, \:{{a_{2, \: 2}}+{a_{1, \: 2}}}\right]}={{\left[{a_{1, \: 1}}, \:{a_{1, \: 2}}\right]}+{\left[{a_{2, \: 1}}, \:{a_{2, \: 2}}\right]}}(14)
Type: Equation(OutputForm?)
axiom
arity(A12s)::OutputForm = arity(A1)::OutputForm + arity(A2)::OutputForm
There are 1 exposed and 0 unexposed library operations named arity having 1 argument(s) but none was determined to be applicable. Use HyperDoc Browse, or issue )display op arity to learn more about the available operations. Perhaps package-calling the operation or using coercions on the arguments will allow you to apply the operation.
Cannot find a definition or applicable library operation named arity with argument type(s) LinearOperator(2,Fraction(Polynomial(Integer)))
Perhaps you should use "@" to indicate the required return type, or "$" to specify which version of the function you need. B12s := B1 + B2; B12s::OutputForm = B1::OutputForm + B2::OutputForm

\label{eq15}{\left[{{b^{2, \: 1}}+{b^{1, \: 1}}}, \:{{b^{2, \: 2}}+{b^{1, \: 2}}}\right]}={{\left[{b^{1, \: 1}}, \:{b^{1, \: 2}}\right]}+{\left[{b^{2, \: 1}}, \:{b^{2, \: 2}}\right]}}(15)
Type: Equation(OutputForm?)
axiom
arity(B12s)::OutputForm = arity(B1)::OutputForm + arity(B2)::OutputForm
There are 1 exposed and 0 unexposed library operations named arity having 1 argument(s) but none was determined to be applicable. Use HyperDoc Browse, or issue )display op arity to learn more about the available operations. Perhaps package-calling the operation or using coercions on the arguments will allow you to apply the operation.
Cannot find a definition or applicable library operation named arity with argument type(s) LinearOperator(2,Fraction(Polynomial(Integer)))
Perhaps you should use "@" to indicate the required return type, or "$" to specify which version of the function you need.

Multiplication

axiom
A3s:=(A1+A1)+A1

\label{eq16}\left[{3 \ {a_{1, \: 1}}}, \:{3 \ {a_{1, \: 2}}}\right](16)
Type: LinearOperator?(2,Fraction(Polynomial(Integer)))
axiom
arity(A3s)
There are 1 exposed and 0 unexposed library operations named arity having 1 argument(s) but none was determined to be applicable. Use HyperDoc Browse, or issue )display op arity to learn more about the available operations. Perhaps package-calling the operation or using coercions on the arguments will allow you to apply the operation.
Cannot find a definition or applicable library operation named arity with argument type(s) LinearOperator(2,Fraction(Polynomial(Integer)))
Perhaps you should use "@" to indicate the required return type, or "$" to specify which version of the function you need. test(A3s=A1+(A1+A1))

\label{eq17} \mbox{\rm true} (17)
Type: Boolean
axiom
test(A3s=A1*3)
>> Error detected within library code: arity

axiom
B3s:=(B1+B1)+B1

\label{eq18}\left[{3 \ {b^{1, \: 1}}}, \:{3 \ {b^{1, \: 2}}}\right](18)
Type: LinearOperator?(2,Fraction(Polynomial(Integer)))
axiom
arity(B3s)
There are 1 exposed and 0 unexposed library operations named arity having 1 argument(s) but none was determined to be applicable. Use HyperDoc Browse, or issue )display op arity to learn more about the available operations. Perhaps package-calling the operation or using coercions on the arguments will allow you to apply the operation.
Cannot find a definition or applicable library operation named arity with argument type(s) LinearOperator(2,Fraction(Polynomial(Integer)))
Perhaps you should use "@" to indicate the required return type, or "$" to specify which version of the function you need. test(B3s=B1+(B1+B1))

\label{eq19} \mbox{\rm true} (19)
Type: Boolean
axiom
test(B3s=B1*3)
>> Error detected within library code: arity

Expected error

axiom
B1A1:=B1*A1

\label{eq20}\left[ 
\begin{array}{cc}
{{b^{1, \: 1}}\ {a_{1, \: 1}}}&{{b^{1, \: 2}}\ {a_{1, \: 1}}}
\
{{b^{1, \: 1}}\ {a_{1, \: 2}}}&{{b^{1, \: 2}}\ {a_{1, \: 2}}}
(20)
Type: LinearOperator?(2,Fraction(Polynomial(Integer)))
axiom
arity(B1A1)
There are 1 exposed and 0 unexposed library operations named arity having 1 argument(s) but none was determined to be applicable. Use HyperDoc Browse, or issue )display op arity to learn more about the available operations. Perhaps package-calling the operation or using coercions on the arguments will allow you to apply the operation.
Cannot find a definition or applicable library operation named arity with argument type(s) LinearOperator(2,Fraction(Polynomial(Integer)))
Perhaps you should use "@" to indicate the required return type, or "$" to specify which version of the function you need.

Composition

axiom
AB11:=A1 B1
Internal Error The function elt with signature hashcode is missing from domain LinearOperator2(Fraction (Polynomial (Integer)))

Multiple inputs and outputs

axiom
W:L:=out[inp[inp([script(w,[[i,j],[k]]) for j in 1..2])$L for i in 1..2] for k in 1..2]

\label{eq21}\begin{array}{@{}l}
\displaystyle
\left[{\left[ 
\begin{array}{cc}
{w_{1, \: 1}^{1}}&{w_{1, \: 2}^{1}}
\
{w_{2, \: 1}^{1}}&{w_{2, \: 2}^{1}}
(21)
Type: LinearOperator?(2,Fraction(Polynomial(Integer)))
axiom
WB1:=W B1
Internal Error The function elt with signature hashcode is missing from domain LinearOperator2(Fraction (Polynomial (Integer)))

product and composition --Bill Page, Wed, 09 Mar 2011 18:53:36 -0800 reply
Another kind of diagram:
  ___ _       _        _  _
  ___ _)  =   _\_ _    _\/_
  _/          ___ _)   _/\_

Linear operators as morphisms --Bill Page, Thu, 10 Mar 2011 09:42:33 -0800 reply
If linear operators really are to be morphisms (in the sense of category theory) then they must have a domain and a co-domain that are vector spaces, not just an in-degree and out-degree. E.g.:
  Rep == Record(Dom:VectorSpace, Cod:VectorSpace, t:T)

But VectorSpace? is a category which would make Dom and Cod domains. The domains that currently satisfy VectorSpace? in Axiom are rather limited and seem oddly focused on number theory (finite fields). It is a good thing however that DirectProduct? is a conditional member of this cateogry.

axiom
DirectProduct(2,FRAC INT) has VectorSpace(FRAC INT)

\label{eq22} \mbox{\rm true} (22)
Type: Boolean

Unfortunately:

axiom
DirectProduct(2,DirectProduct(2,FRAC INT)) has VectorSpace(FRAC INT)

\label{eq23} \mbox{\rm false} (23)
Type: Boolean

The problem with VectorSpace? is that the domain [Vector]? is not a member of this category instead it satisfies VectoryCategory?.

Is it possible to treat tensors from CartesianTensor? as maps from VectorSpace? to VectorSpace?? We would like for example:

  T:DirectProduct(dim,DirectProduct(dim,FRAC INT)) -> DirectProduct(dim,FRAC INT))

To be a linear operator with two inputs and one output.

A [FreeModule]? over a [Field]? is a VectorSpace? unfortunately this is not currently understood by Axiom:
axiom
FreeModule(Fraction Integer,OrderedVariableList [e1,e1]) has VectorSpace(Fraction Integer)

\label{eq24} \mbox{\rm true} (24)
Type: Boolean