Debian Codegraph @

doc/bergman1.0.man/#kantor_example.tex#

raw
1
2 \subsection {Using eliminating ordering}
3
4 Despite the fact that {\bf bergman} works with graded algebras only,
5 it can be successfully applied to the non-graded case. The idea is to
6 homogenize the
7 ideal (using an additional commuting homogenizing variable $h$) and to
8 perform calculations
9 in the eliminating ordering and then dehomogenize the result setting $h=1.$
10
11 Let us consider an example suggested by Prof. I.Kantor.
12 Let $A$ be the following algebra:
13 $$A= < r,l,q| r^2-q^2+lr-r,
14 rq-qr+lq-q,
15 lr-rl,
16 lq+ql-2q,
17 rr-rl-2lr+2l^2-r+l>$$
18 It was important to find the minimal polynomial for $q.$
19 Here is the solution achieved by {\bf bergman}:
20
21 \begin{footnotesize}
22 \begin{verbatim}
23 2 lisp> (noncommify)
24 nil
25 3 lisp> (elimorder)
26 nil
27 4 lisp> (simple)
28 Now input in-variables and ideal generators
29 in algebraic form, thus:
30 vars v1, ..., vn;
31 r1, ..., rm;
32 where v1, ..., vn are the variables,
33 and r1, ..., rm the generators.
34 algebraic form input> vars r,l,q,h;
35 algebraic form input> r*r-q*q+l*r-r*h,r*q-q*r+l*q-q*h,
36 algebraic form input> l*r-r*l,l*q+q*l-2*q*h,
37 algebraic form input> r*r-r*l-2*l*r+2*l*l-r*h+l*h,
38 algebraic form input> r*h-h*r,q*h-h*q,l*h-h*l;
39
40 % 2
41 -h*q+q*h,
42 -h*l+l*h,
43 q*l+l*q-2*q*h,
44 -h*r+r*h,
45 -q*r+r*q+l*q-q*h,
46 -4*r*l+2*l^2+l*h+q^2,
47 4*l*r-2*l^2-l*h-q^2,
48 4*r^2-4*r*h+2*l^2+l*h-3*q^2,
49
50 % 3
51 4*r*q*h-4*l^2*q+10*l*q*h-q^3-9*q*h^2,
52 4*r*q^2+12*l^3-10*l*q^2-3*l*h^2-3*q^2*h,
53
54 % 4
55 l*q^3-3*l*q*h^2-q^3*h+3*q*h^3,
56 -12*l^3*h-4*l^2*q^2+20*l*q^2*h+3*l*h^3-q^4-6*q^2*h^2,
57 -4*l^3*q+12*l^2*q*h-11*l*q*h^2+3*q*h^3,
58 12*l^4-8*l^2*q^2-3*l^2*h^2-2*l*q^2*h+q^4,
59
60 % 5
61 -48*l^2*q*h^2+96*l*q*h^3-q^5+10*q^3*h^2-57*q*h^4,
62
63 % 6
64 -48*l^2*q^2*h^2+96*l*q^2*h^3-q^6+10*q^4*h^2-57*q^2*h^4,
65
66 % 7
67 -q^7+13*q^5*h^2-39*q^3*h^4+27*q*h^6,
68
69 \end{verbatim}
70 \end{footnotesize}
71
72 If we look at the last element of the obtained Gr\"{o}bner basis and
73 put $h=1$ we get the desired equation:
74 $$q^7-13q^5+39q^3-27q=0$$
75 The secret is in the command {\bf elimorder}: now if two words are compared,
76 they are compared first as the commutative words in pure left lexicographical
77 ordering and after that (if commutatively they are equal) as usual. That is
78 why if the minimal polynomial exists its homogenized variant should belong to
79 the Gr\"{o}bner basis: if the leading monomial is $q^n$ all other terms
80 should contain the letters $h$ and $q$ only, $h$ being in the end because it
81 commutes with $q.$ To obtain the minimal polynomial for $l$ it is sufficient
82 to put $l$ before the homogenizing variable (which should remain the last)
83 in the list of the variables, e.g. {\bf vars} r,q,l,h;