#426 ⟨a, b, c | ab=aa, aac=1⟩
Contents
- Properties
- Rewriting system
- Isomorphic instances
- Sum of relation sides is 7
- Infinite non-cancellative non-commutative monoid
- Element a has infinite order
- Not left cancellative, because left multiplication by a is not injective:
-
a ⋅ b = a2 and a ⋅ a = a2, however b ≠ a
- Not right cancellative, because right multiplication by ac is not injective:
-
aca ⋅ ac = ac and 1 ⋅ ac = ac, however aca ≠ 1
- Reduction order:
- Left-to-right shortlex with a < b < c
- Certificate: derivations of all rewriting rules from the defining relations.
# abc:ab=aa,aac=1 abc - -
ab=aa
aac=1
The mapping is from the listed presentation's alphabet to the current rewriting system's alphabet.
1 total
| Σ | # | Presentation | Mapping |
| 7 | 427 | ⟨a, b, c | ab=aa, abc=1⟩ | φ(a) = a, φ(b) = b, φ(c) = c |