close Warning: Can't synchronize with repository "(default)" (The repository directory has changed, you should resynchronize the repository with: trac-admin $ENV repository resync '(default)'). Look in the Trac log for more information.

source: branches/f4grobner/ideal.lisp@ 1397

Last change on this file since 1397 was 1397, checked in by Marek Rychlik, 9 years ago

* empty log message *
File size: 9.5 KB
Line 
1;;; -*- Mode: Lisp -*-
2;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
3;;;
4;;; Copyright (C) 1999, 2002, 2009, 2015 Marek Rychlik <rychlik@u.arizona.edu>
5;;;
6;;; This program is free software; you can redistribute it and/or modify
7;;; it under the terms of the GNU General Public License as published by
8;;; the Free Software Foundation; either version 2 of the License, or
9;;; (at your option) any later version.
10;;;
11;;; This program is distributed in the hope that it will be useful,
12;;; but WITHOUT ANY WARRANTY; without even the implied warranty of
13;;; MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14;;; GNU General Public License for more details.
15;;;
16;;; You should have received a copy of the GNU General Public License
17;;; along with this program; if not, write to the Free Software
18;;; Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
19;;;
20;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
21
22;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
23;;
24;; Operations in ideal theory
25;;
26;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
27
28(defpackage "IDEAL"
29 (:use :cl :ring :monomial :order :term :polynomial :division :grobner-wrap :ring-and-order)
30 (:export "POLY-DEPENDS-P"
31 "RING-INTERSECTION"
32 "ELIMINATION-IDEAL"
33 "COLON-IDEAL"
34 "COLON-IDEAL-1"
35 "IDEAL-INTERSECTION"
36 "POLY-LCM"
37 "GROBNER-EQUAL"
38 "GROBNER-SUBSETP"
39 "GROBNER-MEMBER"
40 "IDEAL-SATURATION-1"
41 "IDEAL-SATURATION"
42 "IDEAL-POLYSATURATION-1"
43 "IDEAL-POLYSATURATION"
44 ))
45
46(in-package :ideal)
47
48;; Does the term depend on variable K?
49(defun term-depends-p (term k)
50 "Return T if the term TERM depends on variable number K."
51 (monom-depends-p (term-monom term) k))
52
53;; Does the polynomial P depend on variable K?
54(defun poly-depends-p (p k)
55 "Return T if the term polynomial P depends on variable number K."
56 (some #'(lambda (term) (term-depends-p term k)) (poly-termlist p)))
57
58(defun ring-intersection (plist k)
59 "This function assumes that polynomial list PLIST is a Grobner basis
60and it calculates the intersection with the ring R[x[k+1],...,x[n]], i.e.
61it discards polynomials which depend on variables x[0], x[1], ..., x[k]."
62 (dotimes (i k plist)
63 (setf plist
64 (remove-if #'(lambda (p)
65 (poly-depends-p p i))
66 plist))))
67
68(defun elimination-ideal (ring-and-order flist k &optional (top-reduction-only $poly_top_reduction_only) (start 0))
69 (ring-intersection (reduced-grobner ring-and-order flist start top-reduction-only) k))
70
71(defun colon-ideal (ring-and-order f g
72 &optional
73 (top-reduction-only $poly_top_reduction_only)
74 &aux
75 (ring (ro-ring ring-and-order)))
76 "Returns the reduced Grobner basis of the colon ideal Id(F):Id(G),
77where F and G are two lists of polynomials. The colon ideal I:J is
78defined as the set of polynomials H such that for all polynomials W in
79J the polynomial W*H belongs to I."
80 (declare (type ring-and-order ring-and-order))
81 (cond
82 ((endp g)
83 ;;Id(G) consists of 0 only so W*0=0 belongs to Id(F)
84 (if (every #'poly-zerop f)
85 (error "First ideal must be non-zero.")
86 (list (make-poly-from-termlist
87 (list (make-term
88 (make-monom :dimension (monom-dimension (poly-lm (find-if-not #'poly-zerop f))))
89 (funcall (ring-unit ring))))))))
90 ((endp (cdr g))
91 (colon-ideal-1 ring-and-order f (car g) top-reduction-only))
92 (t
93 (ideal-intersection ring-and-order
94 (colon-ideal-1 ring f (car g) top-reduction-only)
95 (colon-ideal ring-and-order f (rest g) top-reduction-only)
96 top-reduction-only))))
97
98(defun colon-ideal-1 (ring-and-order f g
99 &optional
100 (top-reduction-only $poly_top_reduction_only)
101 &aux
102 (ring (ro-ring ring-and-order)))
103 "Returns the reduced Grobner basis of the colon ideal Id(F):Id({G}), where
104F is a list of polynomials and G is a polynomial."
105 (mapcar #'(lambda (x)
106 (poly-exact-divide ring-and-order x g))
107 (ideal-intersection ring-and-order f (list g) top-reduction-only)))
108
109(defun ideal-intersection (ring-and-order f g
110 &optional
111 (top-reduction-only $poly_top_reduction_only)
112 &aux
113 (ring (ro-ring ring-and-order)))
114 (mapcar #'poly-contract
115 (ring-intersection
116 (reduced-grobner
117 ring-and-order
118 (append (mapcar #'(lambda (p) (poly-extend p (make-monom :dimension 1 :initial-exponent 1))) f)
119 (mapcar #'(lambda (p)
120 (poly-append (poly-extend (poly-uminus ring-and-order p)
121 (make-monom :dimension 1 :initial-exponent 1))
122 (poly-extend p)))
123 g))
124 0
125 top-reduction-only)
126 1)))
127
128(defun poly-lcm (ring-and-order f g &aux (ring (ro-ring ring-and-order)))
129 "Return LCM (least common multiple) of two polynomials F and G.
130The polynomials must be ordered according to monomial order PRED
131and their coefficients must be compatible with the RING structure
132defined in the COEFFICIENT-RING package."
133 (cond
134 ((poly-zerop f) f)
135 ((poly-zerop g) g)
136 ((and (endp (cdr (poly-termlist f))) (endp (cdr (poly-termlist g))))
137 (let ((m (monom-lcm (poly-lm f) (poly-lm g))))
138 (make-poly-from-termlist (list (make-term m (funcall (ring-lcm ring) (poly-lc f) (poly-lc g)))))))
139 (t
140 (multiple-value-bind (f f-cont)
141 (poly-primitive-part ring f)
142 (multiple-value-bind (g g-cont)
143 (poly-primitive-part ring g)
144 (scalar-times-poly
145 ring
146 (funcall (ring-lcm ring) f-cont g-cont)
147 (poly-primitive-part ring (car (ideal-intersection ring-and-order (list f) (list g) nil)))))))))
148
149;; Do two Grobner bases yield the same ideal?
150(defun grobner-equal (ring-and-order g1 g2)
151 "Returns T if two lists of polynomials G1 and G2, assumed to be Grobner bases,
152generate the same ideal, and NIL otherwise."
153 (declare (type ring-and-order ring-and-order))
154 (and (grobner-subsetp ring-and-order g1 g2) (grobner-subsetp ring-and-order g2 g1)))
155
156(defun grobner-subsetp (ring-and-order g1 g2)
157 "Returns T if a list of polynomials G1 generates
158an ideal contained in the ideal generated by a polynomial list G2,
159both G1 and G2 assumed to be Grobner bases. Returns NIL otherwise."
160 (declare (type ring-and-order ring-and-order))
161 (every #'(lambda (p) (grobner-member ring-and-order p g2)) g1))
162
163(defun grobner-member (ring-and-order p g)
164 "Returns T if a polynomial P belongs to the ideal generated by the
165polynomial list G, which is assumed to be a Grobner basis. Returns NIL otherwise."
166 (declare (type ring-and-order ring-and-order))
167 (poly-zerop (normal-form ring-and-order p g nil)))
168
169;; Calculate F : p^inf
170(defun ideal-saturation-1 (ring-and-order f p start
171 &optional
172 (top-reduction-only $poly_top_reduction_only))
173 "Returns the reduced Grobner basis of the saturation of the ideal
174generated by a polynomial list F in the ideal generated by a single
175polynomial P. The saturation ideal is defined as the set of
176polynomials H such for some natural number n (* (EXPT P N) H) is in the ideal
177F. Geometrically, over an algebraically closed field, this is the set
178of polynomials in the ideal generated by F which do not identically
179vanish on the variety of P."
180 (declare (type ring-and-order ring-and-order))
181 (mapcar
182 #'poly-contract
183 (ring-intersection
184 (reduced-grobner
185 ring-and-order
186 (saturation-extension-1 ring-and-order f p)
187 start top-reduction-only)
188 1)))
189
190
191;; Calculate F : p1^inf : p2^inf : ... : ps^inf
192(defun ideal-polysaturation-1 (ring-and-order f plist start
193 &optional
194 (top-reduction-only $poly_top_reduction_only))
195 "Returns the reduced Grobner basis of the ideal obtained by a
196sequence of successive saturations in the polynomials
197of the polynomial list PLIST of the ideal generated by the
198polynomial list F."
199 (cond
200 ((endp plist)
201 (reduced-grobner ring-and-order f start top-reduction-only))
202 (t (let ((g (ideal-saturation-1 ring-and-order f (car plist) start top-reduction-only)))
203 (ideal-polysaturation-1 ring-and-order g (rest plist) (length g) top-reduction-only)))))
204
205(defun ideal-saturation (ring-and-order f g start &optional (top-reduction-only $poly_top_reduction_only)
206 &aux
207 (k (length g)))
208 "Returns the reduced Grobner basis of the saturation of the ideal
209generated by a polynomial list F in the ideal generated a polynomial
210list G. The saturation ideal is defined as the set of polynomials H
211such for some natural number n and some P in the ideal generated by G
212the polynomial P**N * H is in the ideal spanned by F. Geometrically,
213over an algebraically closed field, this is the set of polynomials in
214the ideal generated by F which do not identically vanish on the
215variety of G."
216 (mapcar
217 #'(lambda (q) (poly-contract q k))
218 (ring-intersection
219 (reduced-grobner ring-and-order
220 (polysaturation-extension ring-and-order f g)
221 start
222 top-reduction-only)
223 k)))
224
225(defun ideal-polysaturation (ring-and-order f ideal-list start &optional (top-reduction-only $poly_top_reduction_only))
226 "Returns the reduced Grobner basis of the ideal obtained by a
227successive applications of IDEAL-SATURATION to F and lists of
228polynomials in the list IDEAL-LIST."
229 (cond
230 ((endp ideal-list) f)
231 (t (let ((h (ideal-saturation ring-and-order f (car ideal-list) start top-reduction-only)))
232 (ideal-polysaturation ring-and-order h (rest ideal-list) (length h) top-reduction-only)))))
Note: See TracBrowser for help on using the repository browser.