#20650 ⟨a, b | ba=ab, aaaaab=a⟩

Quick links

Presentation has sum-of-sides 11
Infinite non-cancellative commutative monoid
Not cancellative, because multiplication by ab is not injective:
- ab ⋅ a⁴b = ab and ab ⋅ 1 = ab, however a⁴b ≠ 1
Commutative Gröbner basis: ⟨a, b | a⁵b=a⟩
Cancellative quotient is isomorphic to ℤ
Enveloping group is isomorphic to ℤ
Group of units is isomorphic to ℤ₁
3 Archimedian components:
- 1, a, b

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

#	Rule	Proof
1.	ba ⇒ ab	[1]
2.	a⁵b ⇒ a	[2]

# ab:ba=ab,aaaaab=a ab
ba=ab
aaaaab=a

The mapping is from the listed presentation's alphabet to the current rewriting system's alphabet.

2 total

Σ	#	Presentation	Mapping
11	20652	⟨a, b \| ba=ab, aaaaba=a⟩	φ(a) = a, φ(b) = b
11	20656	⟨a, b \| ba=ab, aaabaa=a⟩	φ(a) = a, φ(b) = b

Up:	Monoids with two generators and two relations
Prev:	#20648 ⟨a, b \| ba=ab, aaaaaa=a⟩
Next:	#20651 ⟨a, b \| ba=ab, aaaaab=b⟩