aboutsummaryrefslogtreecommitdiff
path: root/src/algebra/divisor.spad.pamphlet
diff options
context:
space:
mode:
Diffstat (limited to 'src/algebra/divisor.spad.pamphlet')
-rw-r--r--src/algebra/divisor.spad.pamphlet7
1 files changed, 5 insertions, 2 deletions
diff --git a/src/algebra/divisor.spad.pamphlet b/src/algebra/divisor.spad.pamphlet
index 05a201cc..adc98c0f 100644
--- a/src/algebra/divisor.spad.pamphlet
+++ b/src/algebra/divisor.spad.pamphlet
@@ -788,8 +788,11 @@ HyperellipticFiniteDivisor(F, UP, UPUP, R): Exports == Implementation where
reduce makeDivisor(a, bb, 1)
@
+
\section{domain FDIV FiniteDivisor}
+
<<domain FDIV FiniteDivisor>>=
+import Vector
)abbrev domain FDIV FiniteDivisor
++ Finite rational divisors on a curve
++ Author: Manuel Bronstein
@@ -825,7 +828,7 @@ FiniteDivisor(F, UP, UPUP, R): Exports == Implementation where
0 == 0$Rep
coerce(d:$):OutputForm == coerce(d)$Rep
d1 = d2 == d1 =$Rep d2
- n * d == n *$Rep d
+ n:Integer * d:% == n *$Rep d
d1 + d2 == d1 +$Rep d2
- d == -$Rep d
ideal d == ideal(d)$Rep
@@ -856,7 +859,7 @@ FiniteDivisor(F, UP, UPUP, R): Exports == Implementation where
ideal d == d.id
decompose d == [ideal d, 1]
d1 = d2 == basis(ideal d1) = basis(ideal d2)
- n * d == divisor(ideal(d) ** n)
+ n: Integer * d:% == divisor(ideal(d) ** n)
d1 + d2 == divisor(ideal d1 * ideal d2)
- d == divisor inv ideal d
divisor(h, d, dp, g, r) == makeDivisor(d, lift h - (r * dp)::RF::UPUP, g)