Skip to Main Content
Algebraic Operads
book

Algebraic Operads

by Murray R. Bremner, Vladimir Dotsenko
April 2016
Intermediate to advanced content levelIntermediate to advanced
383 pages
11h 46m
English
Chapman and Hall/CRC
Content preview from Algebraic Operads
Noncommutative Associative Algebras 27
Example 2.3.2.7. Let X = {a, b}, and let s
1
= a
2
1, s
2
= ab a, and
f = a
2
b. Then r
s
1
(f) = b, and r
s
2
(f) = a
2
. Therefore, if we order S = {s
1
, s
2
}
in a way that s
1
< s
2
, then the long division terminates after just one reduc-
tion, and returns b. If we order S = {s
1
, s
2
} in a way that s
1
> s
2
, then the
long division takes two reductions, and returns 1.
Lemma 2.3.2.8. For every f T (X), the long division algorithm terminates
in a finite number of steps. Its output is an element
˜
f reduced with respect to
S, for which lt(
˜
f) lt(f) and f + (S) =
˜
f + (S).
Proof. By Lemma 2.3.2.5, the leading monomial of the dividend ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Start your free trial

You might also like

Reinventing the Organization for GenAI and LLMs

Reinventing the Organization for GenAI and LLMs

Ethan Mollick
Algebraic and Stochastic Coding Theory

Algebraic and Stochastic Coding Theory

Dave K. Kythe, Prem K. Kythe

Publisher Resources

ISBN: 9781482248579