|
|
|
last edited 17 years ago by Bill Page |
| 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 | ||
|
Editor: Bill Page
Time: 2008/06/18 16:46:48 GMT-7 |
||
| Note: simplified Automorphism | ||
changed: -Automorphism(R:Ring): Join(Group, Eltable(R, R)) with Automorphism(R:Ring): Join(SetCategory, Eltable(R, R)) with removed: - morphism: ((R, Integer) -> R) -> % - ++ morphism(f) returns the morphism given by \spad{f^n(x) = f(x,n)}. removed: - err: R -> R - ident: (R, Integer) -> R removed: - iterat: (R -> R, R -> R, Integer, R) -> R removed: - 1 == ident - err r == error "Morphism is not invertible" - ident(r, n) == r added: apply(f, r, n) == (g := f pretend ((R, Integer) -> R); g(r, n)) changed: - inv f == apply(f, #1, - #2) - f ** n == apply(f, #1, n * #2) changed: - morphism(f:(R, Integer) -> R):% == f - morphism(f:R -> R):% == morphism(f, err) - morphism(f, g) == iterat(f, g, #2, #1) - apply(f, r, n) == (g := f pretend ((R, Integer) -> R); g(r, n)) - - iterat(f, g, n, r) == - n < 0 => iter(g, (-n)::NonNegativeInteger, r) - iter(f, n::NonNegativeInteger, r) - morphism(f:R -> R):% == iter(f, #2, #1) removed: - f * g == - f = g => f**2 - iterat(f g #1, (inv g)(inv f) #1, #2, #1)
(1) -> <spad>
)abbrev domain MORPH Morphism T ==> SetCategory Morphism(source:T,target:T): with domain:%->T codomain:%->T coerce:(source->target) -> % coerce:%->(source->target) coerce:%->OutputForm --elt:(%, source)->target == (source->target) add Rep == (source->target) domain(p:%):T == source codomain(p:%):T == target coerce(r:(source->target)):% == per(r) coerce(p:%):(source->target) == p pretend (source->target) coerce(p:%):OutputForm == p pretend OutputForm --elt(f, x) == (f::(source->target))(x)</spad>
Compiling FriCAS source code from file
/var/lib/zope2.10/instance/axiom-wiki/var/LatexWiki/2396666756253990559-25px001.spad
using old system compiler.
MORPH abbreviates domain Morphism
------------------------------------------------------------------------
initializing NRLIB MORPH for Morphism
compiling into NRLIB MORPH
************* USER ERROR **********
available signatures for Rep:
NONE
NEED Rep: () -> ?
****** comp fails at level 1 with expression: ******
((DEF (|Rep|) (NIL) (|Mapping| |target| |source|)))
****** level 1 ******
x:= (DEF (Rep) (NIL) (Mapping target source))
m:= $EmptyMode
f:=
((((~= #) (= #) (|coerce| #) (|latex| #) ...)))
>> Apparent user error:
unspecified errorIf we define elt (commented out above), then f(1.1) gives the following:
Error: Caught fatal error [memory may be damaged] Fast links are on: do (si::use-fast-links nil) for debugging Error signalled by RETURN. Broken at APPLY. Type :H for Help. BOOT>> Error: The variable QUIT is unbound. Fast links are on: do (si::use-fast-links nil) for debugging Error signalled by EVALHOOK. Backtrace: system:universal-error-handler > evalhook > lambda > lambda-closure > block > apply > APPLY
But the same coercion works in the interpreter.
)show Morphism(Float,Integer)
Morphism is an unknown constructor and so is unavailable. Did you mean to use -> but type something different instead?
Next let's study how this sort of thing is accomplished in a similar domain.
)abbrev domain AUTOMOR Automorphism ++ Author: Manuel Bronstein ++ Date Created: 31 January 1994 ++ Date Last Updated: 31 January 1994 ++ References: ++ Description: ++ Automorphism R is the multiplicative group of automorphisms of R. -- In fact,non-invertible endomorphism are allowed as partial functions. -- This domain is noncanonical in that f*f^{-1} will be the identity -- function but won't be equal to 1. Automorphism(R:Ring): Join(SetCategory, Eltable(R, R)) with morphism: (R -> R) -> % ++ morphism(f) returns the non-invertible morphism given by f. morphism: (R -> R, R -> R) -> % ++ morphism(f, g) returns the invertible morphism given by f, where ++ g is the inverse of f.. == add iter: (R -> R, NonNegativeInteger, R) -> R apply: (%, R, Integer) -> R
Rep := ((R,Integer) -> R)
f = g == EQ(f,g)$Lisp
apply(f,r, n) == (g := f pretend ((R, Integer) -> R); g(r, n)) elt(f, r) == apply(f, r, 1)
coerce(f:%):OutputForm == message("R -> R") morphism(f:R -> R):% == iter(f,#2, #1) iter(f, n, r) == for i in 1..n repeat r := f r r
Compiling FriCAS source code from file
/var/lib/zope2.10/instance/axiom-wiki/var/LatexWiki/3769892657891673976-25px003.spad
using old system compiler.
AUTOMOR abbreviates domain Automorphism
------------------------------------------------------------------------
initializing NRLIB AUTOMOR for Automorphism
compiling into NRLIB AUTOMOR
compiling exported = : (%, %) -> Boolean
AUTOMOR;=;2%B;1 is replaced by EQ
Time: 0 SEC.
compiling local apply : (%, R, Integer) -> R
Time: 0 SEC.
compiling exported elt : (%, R) -> R
Time: 0 SEC.
compiling exported coerce : % -> OutputForm
Time: 0 SEC.
compiling exported morphism : R -> R -> %
****** comp fails at level 2 with expression: ******
error in function morphism
(|iter| |f| | << | (|#| 2) | >> | |#1|)
****** level 2 ******
x:= (# 2)
m:= $EmptyMode
f:=
((((|f| # #) (|Rep| #) (|apply| #) (|iter| #) ...)))
>> Apparent user error:
cannot compile (# 2)p:=morphism((x:Integer):Integer +-> x+1)$Automorphism(Integer)
| (1) |
p(2)
| (2) |