[6, 5765] finitely based
[6, 5765] is a commutative semigroup with 1 idempotent. It is finitely based: 3 identities in 4 variables define its variety, which 1 other semigroup of order at most six also generates.
Cayley table
| · | 1 | 2 | 3 | 4 | 5 | 6 |
|---|---|---|---|---|---|---|
| 1 | 1 | 1 | 1 | 1 | 5 | 6 |
| 2 | 1 | 1 | 1 | 3 | 5 | 6 |
| 3 | 1 | 1 | 1 | 1 | 5 | 6 |
| 4 | 1 | 3 | 1 | 2 | 5 | 6 |
| 5 | 5 | 5 | 5 | 5 | 6 | 1 |
| 6 | 6 | 6 | 6 | 6 | 1 | 5 |
The product of the row element and the column element, numbered as in Smallsemi. Blue: idempotents on the diagonal.
Structure
- Smallsemi
- SmallSemigroup(6, 5765)
- Idempotents
- 1
- Zero
- none
- Identity
- none
- Nilpotent
- no
- Commutative
- yes
- Regular
- no
- Group
- no
- 𝒥-classes
- 4
- Rank
- 2, generated by {4, 5}
- Self-dual
- yes: anti-isomorphic to itself
Identity basis
Fewest variables: 3 identities in 4 variables
- xy ≈ yx
- x⁴ ≈ xy³
- xyzt ≈ xyzt⁴
Every basis uses at least 3 variables: the semigroup of order 12 shown below satisfies every identity of V[6, 5765] in 2 variables, but not xyzt ≈ xyzt⁴, which holds in V[6, 5765]. 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. Irredundant: none of these identities follows from the others; for each, a semigroup satisfies the others but not it. 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 12 that shows the lower bound
| · | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 1 | 4 | 9 | 10 | 6 | 7 | 7 | 7 | 6 | 5 | 11 | 7 | 8 |
| 2 | 9 | 11 | 12 | 5 | 7 | 7 | 7 | 7 | 7 | 8 | 6 | 7 |
| 3 | 10 | 12 | 5 | 11 | 6 | 7 | 7 | 7 | 8 | 7 | 7 | 7 |
| 4 | 6 | 5 | 11 | 7 | 7 | 7 | 7 | 7 | 7 | 7 | 7 | 6 |
| 5 | 7 | 7 | 6 | 7 | 7 | 7 | 7 | 7 | 7 | 7 | 7 | 7 |
| 6 | 7 | 7 | 7 | 7 | 7 | 7 | 7 | 7 | 7 | 7 | 7 | 7 |
| 7 | 7 | 7 | 7 | 7 | 7 | 7 | 7 | 7 | 7 | 7 | 7 | 7 |
| 8 | 6 | 7 | 7 | 7 | 7 | 7 | 7 | 7 | 7 | 7 | 7 | 7 |
| 9 | 5 | 7 | 8 | 7 | 7 | 7 | 7 | 7 | 7 | 6 | 7 | 7 |
| 10 | 11 | 8 | 7 | 7 | 7 | 7 | 7 | 7 | 6 | 7 | 7 | 7 |
| 11 | 7 | 6 | 7 | 7 | 7 | 7 | 7 | 7 | 7 | 7 | 7 | 7 |
| 12 | 8 | 7 | 7 | 6 | 7 | 7 | 7 | 7 | 7 | 7 | 7 | 7 |
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, 5765] on 2 generators, and so every identity of V[6, 5765] in 2 variables, but not xyzt ≈ xyzt⁴.
Basis certified in Lean: 5 identities in 4 variables
- xy ≈ yx
- x⁴ ≈ xy³
- x⁵y² ≈ x²y²
- x⁵yz ≈ x²yz
- xyzt ≈ xyzt⁴
Lean proof
Endpoint theorem: SemigroupBasis.CoRoots.Order6GenericCASSubdirectS6_5765.basisFor
BasisFor SemigroupBasis.CoRoots.Order6GenericCASSubdirectS6_5765.rootSemigroup✝ SemigroupBasis.CoRoots.Order6GenericCASSubdirectS6_5765.rootBasis✝
- 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 25 Lean files with 8,412 lines: the endpoint theorem and everything it imports, the shared library included. All of it is shared with the proofs of other classes.
- Census
- SemiBase.Census.S6_5765 checks that the theorem is about the table of this class and concludes Classified; SemiBase.Catalogue.Order6.S6_5765 is the table, with the elements numbered 0 to 5.
Variety
[6, 5765] generates the variety V[6, 5765]; 2 semigroups of order at most six generate it, and 270 semigroups of order at most six lie in it. The class is self-dual, so its transpose generates the same variety. [6, 5765] lies in 1 of the 681 varieties, those whose basis it satisfies.
- Directly above
- none: a maximal variety of the census
- Directly below
V[6, 5765] in the inclusion graph, with the varieties above and below it.
Generating the same variety
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.