SemiBase
← [6, 5646][6, 5648] →

[6, 5647] finitely based

order 6monoidnot self-dualfamily proof

[6, 5647] is a monoid with 3 idempotents, a zero, 1 and an identity element, 6. It is finitely based: 12 identities in 4 variables define its variety, which no other semigroup of order at most six generates.

Cayley table

·123456
1111111
2111112
3111213
4111214
5123355
6123456

The product of the row element and the column element, numbered as in Smallsemi. Blue: idempotents on the diagonal; grey: the zero.

Structure

Smallsemi
SmallSemigroup(6, 5647)
Idempotents
1, 5, 6
Zero
1
Identity
6
Nilpotent
no
Commutative
no
Regular
no
Group
no
𝒥-classes
6
Rank
3, generated by {4, 5, 6}
Self-dual
no: the class also stands for the opposite semigroup, with the transposed table

Identity basis

Fewest variables: 12 identities in 4 variables

  1. x³ ≈ x⁴
  2. x²yx ≈ yx³
  3. xyx² ≈ yx³
  4. xyxy ≈ xy²x
  5. xyxy ≈ yx²y
  6. xyxzx ≈ yzx³
  7. xyxzy ≈ yx²zy
  8. xyzxy ≈ xyzyx
  9. xyzxy ≈ yxzxy
  10. xyzxz ≈ xyz²x
  11. xyzxty ≈ yxzxty
  12. xyztxz ≈ xyztzx

Every basis uses at least 3 variables: the semigroup of order 8 shown below satisfies every identity of V[6, 5647] in 2 variables, but not xyzxz ≈ xyz²x, which holds in V[6, 5647]. Whether a basis in fewer than 4 variables exists is not known. A search with Vampire found neither a basis in fewer variables nor a semigroup that rules one out. Reduced as far as the search went: some identity may still follow from the others. Obtained from a basis certified in Lean by removing identities that follow from the others, with the prover Vampire; the equivalence rests on Vampire's proofs, not on Lean.

The semigroup of order 8 that shows the lower bound
·12345678
164866656
276266666
312345678
456466666
566666666
666666666
766666666
864866656

Found by the finite model builder of Vampire and checked by evaluation: it is associative, satisfies the rules of a complete rewriting system of the free object of V[6, 5647] on 2 generators, and so every identity of V[6, 5647] in 2 variables, but not xyzxz ≈ xyz²x.

Basis certified in Lean: 15 identities in 4 variables

  1. x³ ≈ x⁴
  2. x²yx ≈ yx³
  3. xyx² ≈ yx³
  4. xyxy ≈ xy²x
  5. xyxy ≈ yx²y
  6. x²y³ ≈ xy³x
  7. x³y³ ≈ y³x³
  8. xyxzx ≈ yzx³
  9. xyxzy ≈ yx²zy
  10. xyzxy ≈ xyzyx
  11. xyzxy ≈ yxzxy
  12. xyzxz ≈ xyz²x
  13. xyxz³ ≈ xyz³x
  14. xyzxty ≈ yxzxty
  15. xyztxz ≈ xyztzx

Lean proof

Endpoint theorem: SemigroupBasis.CoRoots.Order6LeeLiProposition8A.S6_5647.representative_basis

BasisFor CoRoots.Order6LeeLiProposition8A.S6_5647.table.semigroup CoRoots.Order6LeeLiProposition8A.basis
Table
The theorem is about the semigroup with exactly this table.
Method
family proof. One basis is proved once to derive every identity of every semigroup of a family; on each table only the identities of the basis are checked, by computation.
Size
Checking this class alone compiles 31 Lean files with 15,592 lines: the endpoint theorem and everything it imports, the shared library included. Of these, 6,760 lines are used by the proof of this class and of no other.
Census
SemiBase.Census.S6_5647 checks that the theorem is about the table of this class and concludes Classified; SemiBase.Catalogue.Order6.S6_5647 is the table, with the elements numbered 0 to 5.

Variety

[6, 5647] generates the variety V[6, 5647]; 1 semigroup of order at most six generates it, and 7,783 semigroups of order at most six lie in it. The transposed table, the opposite semigroup, generates the dual variety V[6, 5647]ᵒᵖ. [6, 5647] lies in 2 of the 681 varieties, those whose basis it satisfies.

Directly above
Directly below

V[6, 5647] in the inclusion graph, with the varieties above and below it.

Nearby tables

Semigroups of the same order whose Smallsemi table differs from this one in one or two entries (row, column), as the tables are listed, not up to renumbering.