#7014 ⟨
a
,
b
|
ba
=
ab
,
aaaaa
=
a
⟩
Up:
Monoids with two generators and two relations
Prev:
#7013
⟨
a
,
b
|
ab
=
aa
,
bbbbb
=
b
⟩
Next:
#7016
⟨
a
,
b
|
ba
=
ab
,
aaaab
=
a
⟩
Quick links
Properties
Staircase diagram
Rewriting system
Properties
Presentation has sum-of-sides 10
Isomorphic to ℕ
(5 = 1)
⊕ ℕ
Infinite non-cancellative commutative monoid
Not cancellative, because multiplication by
ab
is not injective:
ab
⋅
a
4
=
ab
and
ab
⋅ 1 =
ab
, however
a
4
≠ 1
Commutative Gröbner basis: ⟨
a
,
b
|
a
5
=
a
⟩
Cancellative quotient is isomorphic to ℤ
4
⊕ ℕ
Enveloping group is isomorphic to ℤ
4
⊕ ℤ
Group of units is isomorphic to ℤ
1
4 Archimedian components:
1,
a
,
b
,
ab
Staircase diagram
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.
ba
⇒
ab
[1]
2.
a
5
⇒
a
[2]
# ab:ba=ab,aaaaa=a ab ba=ab aaaaa=a
