Changeset 906458 in git for Singular/LIB/algebra.lib
- Timestamp:
- Apr 7, 2009, 6:18:06 PM (15 years ago)
- Branches:
- (u'spielwiese', 'fe61d9c35bf7c61f2b6cbf1b56e25e2f08d536cc')
- Children:
- 5d98f437864469b655868be585350eeb57da2863
- Parents:
- 2ae96e40fc5453bcb155aec76d376d79dd549cbe
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
Singular/LIB/algebra.lib
r2ae96e r906458 3 3 //new proc nonZeroEntry(id), used to fix a bug in proc finitenessTest 4 4 /////////////////////////////////////////////////////////////////////////////// 5 version="$Id: algebra.lib,v 1.2 0 2009-04-03 20:58:53 motsakExp $";5 version="$Id: algebra.lib,v 1.21 2009-04-07 16:18:05 seelisch Exp $"; 6 6 category="Commutative Algebra"; 7 7 info=" … … 252 252 nonlinear relation h(p,i[1],...,i[k])=0. 253 253 @end format 254 NOTE: the proc algebra_containment tests the same witha different254 NOTE: the proc algebra_containment tests the same using a different 255 255 algorithm, which is often faster 256 256 if l[1] == 0 then l[2] may contain more than one relation h(y(0),y(1),...,y(k)), … … 622 622 NOTE: The algorithm returns 1 iff all the variables of the basering are 623 623 contained in the polynomial subalgebra generated by the polynomials 624 defining phi. Hence, i f the basering has local or mixed ordering625 or if the preimage ring is a quotient ring (in which case the map626 may not be well defined) then the return value 1 means \"surjectivity\"627 in this sense.624 defining phi. Hence, it tests surjectivity in the case of a global odering. 625 If the basering has local or mixed ordering or if the preimage ring is a 626 quotient ring (in which case the map may not be well defined) then the return 627 value 1 needs to be interpreted with care. 628 628 EXAMPLE: example is_surjective; shows an example 629 629 " … … 687 687 "USAGE: is_bijective(phi,pr); phi map to basering, pr preimage ring 688 688 RETURN: an integer, 1 if phi is bijective, 0 if not 689 NOTE: The algorithm checks first injectivity and then surjectivity 689 NOTE: The algorithm checks first injectivity and then surjectivity. 690 690 To interprete this for local/mixed orderings, or for quotient rings 691 691 type help is_surjective; and help is_injective; … … 795 795 @end format 796 796 NOTE: Designed for characteristic 0.It works also in char k > 0 if it 797 terminates,but may result in an infinite loop in small characteristic 797 terminates,but may result in an infinite loop in small characteristic. 798 798 EXAMPLE: example noetherNormal; shows an example 799 799 "
Note: See TracChangeset
for help on using the changeset viewer.