divisors: add note how to use code for reducing [P] - [Q]

2026-01-09 14:48:08 -05:00 · 2022-07-20 12:49:29 +02:00
parent cd030a3c69
commit 6b2cb4380b
1 changed files with 5 additions and 0 deletions
--- a/script/research/ec/unique-y-intersect.sage
+++ b/script/research/ec/unique-y-intersect.sage
@@ -27,3 +27,8 @@ for i in range(100):
    assert V[0][x] == Px
    assert V[0][y] == Py

+# Note: to reduce D = [P] - [Q], just note that
+# D = [P] - [Q]
+#   = ([P] - [∞]) - ([Q] - [∞])
+#   = div(f) - div(g) = div(f/g)
+