#45 ⟨
a
,
b
,
c
|
ba
=
ac
,
ca
=1⟩
Up:
Monoid enumeration
Prev:
#44
⟨
a
,
b
,
c
|
ba
=
ac
,
bc
=1⟩
Next:
#47
⟨
a
,
b
,
c
|
bb
=
aa
,
bc
=1⟩
Contents
Properties
Rewriting system
Properties
Sum of relation sides is 6
Infinite non-cancellative non-commutative monoid
Element
a
has infinite order
Not left cancellative, because left multiplication by
c
is not injective:
c
⋅
ac
=
c
and
c
⋅ 1 =
c
, however
ac
≠ 1
Not right cancellative, because right multiplication by
a
is not injective:
ac
⋅
a
=
a
and 1 ⋅
a
=
a
, however
ac
≠ 1
Rewriting system
Format:
Pretty
Plain
Word:
Enter a word above to compute its normal form. Tips:
Lowercase letters stand for generators.
Spaces are ignored.
Numbers repeat the previous letter, e.g.
b90
.
Strategy:
Leftmost
Rightmost
Result:
1
1
Reduction order:
Left-to-right shortlex with
a
<
b
<
c
Certificate
: derivations of all rewriting rules from the defining relations.
#
Rule
Proof
1.
ba
⇒
ac
[1]
2.
ca
⇒ 1
[2]
# abc:ba=ac,ca=1 abc - - ba=ac ca=1