#2584 ⟨
a
,
b
|
abaaba
=
abba
⟩
Up:
Monoids with two generators and one relation
Prev:
#2583
⟨
a
,
b
|
abaaba
=
abab
⟩
Next:
#2585
⟨
a
,
b
|
abaaba
=
abbb
⟩
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
⋅
b
a
2
ba
=
a
b
2
a
and
a
⋅
b
2
a
=
a
b
2
a
, however
b
a
2
ba
≠
b
2
a
Not right cancellative, because right multiplication by
a
is not injective:
ab
a
2
b
⋅
a
=
a
b
2
a
and
a
b
2
⋅
a
=
a
b
2
a
, however
ab
a
2
b
≠
a
b
2
Enveloping group is isomorphic to ℤ
2
∗ ℤ
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.
(
aba
)
2
⇒
a
b
2
a
[1]
2.
a
b
2
a
2
ba
⇒
ab
a
2
b
2
a
[2]
# ab:abaaba=abba ab abaaba=abba abbaaba=abaabba