#1309 ⟨
a
,
b
|
aaaabaaabb
=1⟩
Up:
Monoids with two generators and one relation
Prev:
#1307
⟨
a
,
b
|
aaaabaaaab
=1⟩
Next:
#1311
⟨
a
,
b
|
aaaabaabab
=1⟩
Quick links
Properties
Rewriting system
Properties
Presentation has sum-of-sides 10
Infinite non-cancellative non-commutative monoid
Not left cancellative, because left multiplication by
a
is not injective:
a
⋅ (
a
3
b
)
2
ba
=
a
and
a
⋅ 1 =
a
, however (
a
3
b
)
2
ba
≠ 1
Not right cancellative, because right multiplication by (
a
3
b
)
2
b
is not injective:
(
a
3
b
)
2
ba
⋅ (
a
3
b
)
2
b
= (
a
3
b
)
2
b
and 1 ⋅ (
a
3
b
)
2
b
= (
a
3
b
)
2
b
, however (
a
3
b
)
2
ba
≠ 1
Enveloping group: ⟨
a
,
b
|
aaabba
-1
b
⟩
Rewriting system
Format:
Pretty
Plain
Word to reduce:
Tips:
Lowercase letters stand for generators.
Spaces are ignored.
Numbers repeat the previous letter, e.g.
b90
.
Reduction strategy:
Leftmost
Rightmost
Path to normal form:
1
1
Reduction order:
Left-to-right shortlex with
a
<
b
Certificate
: derivations of all rewriting rules from the defining relations.
#
Rule
Proof
1.
a
4
b
a
3
b
2
⇒ 1
[1]
# ab:aaaabaaabb=1 ab aaaabaaabb=1