Lemma 14.2.3. Let a be a word ordering on (X>, and let a be the restriction of a to (X>. Then also a is a word ordering.
Now we are ready to state and prove the main theorem of this section.
Theorem 14.2.4 (Computation of Elimination Ideals). LetL c X, let a be an elimination ordering for L, and let a be the restriction of a to (X>. Given a two-sided ideal I c K (X> and a a-Gröbner basis G of I, the set G = G n K(X> isaa-Gröbner basis of the elimination ideal 7 = I n K(X>.
Proof. It is clear that G is contained in 7 We have to show that the leading words of the polynomials in G generate the leading word ideal Lw5(/). For f ϵ 7 \{0|,we have Lwa (f) = Lwa (f) ϵ (X). Since G is a a -Gröbner basis of I, we find words w1, w2 ϵ (X> and g ϵ G such that ...
Get A Course in Mathematical Cryptography now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
