|
|
|
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 17:15:56 GMT-7 |
||
| Note: Automorph | ||
changed: -++ Author: Manuel Bronstein -++ Date Created: 31 January 1994 -++ Date Last Updated: 31 January 1994 -++ References: ++ Based on Automorphism by: Manuel Bronstein changed: -++ Automorph R is the domain of automorphisms on R. ++ Automorph R is the domain of automorphisms of R. changed: - - Rep := (R -> R) - err: R -> R iter: (R -> R, NonNegativeInteger, R) -> R iterat: (R -> R, R -> R, Integer, R) -> R apply: (%, R, Integer) -> R Rep := ((R, Integer) -> R) err r == error "Morphism is not invertible" changed: - - elt(f, r) == (g := f pretend (R -> R); g(r)) - - coerce(f:%):OutputForm == message("R -> R") - morphism(f:R -> R):% == f elt(f, r) == apply(f, r, 1) coerce(f:%):OutputForm == message("S -> S") 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) iter(f, n, r) == for i in 1..n repeat r := f r r changed: -p:=morphism((x:Integer):Integer +-> x+1)$Automorphism(Integer) p:=morphism((x:Integer):Integer +-> x+1)$Automorph(Integer)
(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 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 AUTOM Automorph ++ Based on Automorphism by: Manuel Bronstein ++ Description: ++ Automorph R is the domain of automorphisms of R. Automorph(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 err: R -> R iter: (R -> R, NonNegativeInteger, R) -> R iterat: (R -> R, R -> R, Integer, R) -> R apply: (%, R, Integer) -> R
Rep := ((R,Integer) -> R)
err r == error "Morphism is not invertible" f = g == EQ(f,g)$Lisp elt(f, r) == apply(f, r, 1) coerce(f:%):OutputForm == message("S -> S") 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)
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/9051781234674846065-25px003.spad
using system compiler.
AUTOM abbreviates domain Automorph
------------------------------------------------------------------------
initializing NRLIB AUTOM for Automorph
compiling into NRLIB AUTOM
compiling local err : R -> R
AUTOM;err is replaced by errorMorphism is not invertible
Time: 0 SEC.
compiling exported = : (%, %) -> Boolean
AUTOM;=;2%B;2 is replaced by EQ
Time: 0 SEC.
compiling exported elt : (%, R) -> R
Time: 0 SEC.
compiling exported coerce : % -> OutputForm
Time: 0 SEC.
compiling exported morphism : R -> R -> %
Time: 0 SEC.
compiling exported morphism : (R -> R, R -> R) -> %
****** comp fails at level 2 with expression: ******
error in function morphism
(|iterat| |f| |g| | << | (|#| 2) | >> | |#1|)
****** level 2 ******
x:= (# 2)
m:= $EmptyMode
f:=
((((|g| # . #1=#) (|f| # . #2=#) (|g| . #1#) (|f| . #2#) ...)))
>> Apparent user error:
cannot compile (# 2)p:=morphism((x:Integer):Integer +-> x+1)$Automorph(Integer)
Automorph is an unknown constructor and so is unavailable. Did you mean to use -> but type something different instead?