[6, 11165] finitely based
[6, 11165] is a semigroup with 4 idempotents. It is finitely based: 3 identities define its variety, which 1 other semigroup of order six also generates.
Cayley table
| · | 1 | 2 | 3 | 4 | 5 | 6 |
|---|---|---|---|---|---|---|
| 1 | 1 | 1 | 1 | 1 | 1 | 1 |
| 2 | 1 | 1 | 1 | 1 | 1 | 5 |
| 3 | 1 | 2 | 3 | 4 | 5 | 1 |
| 4 | 1 | 2 | 4 | 3 | 5 | 1 |
| 5 | 5 | 5 | 5 | 5 | 5 | 5 |
| 6 | 6 | 6 | 6 | 6 | 6 | 6 |
The product of the row element and the column element, numbered as in Smallsemi. Blue: idempotents on the diagonal.
Structure
- Smallsemi
- SmallSemigroup(6, 11165)
- Idempotents
- 1, 3, 5, 6
- Zero
- none
- Identity
- none
- Nilpotent
- no
- Commutative
- no
- Regular
- no
- Group
- no
- 𝒥-classes
- 3
- Rank
- 3, generated by {2, 4, 6}
- Self-dual
- no: the class also stands for the opposite semigroup, with the transposed table
Identity basis
Shortest known basis: 3 identities irredundant
- x² ≈ x⁴
- xyx ≈ xyx³
- xyxzx ≈ xy²zy
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. Shortest known, not known to be minimal.
Basis certified in Lean
The Lean theorem certifies a longer basis, of 23 identities; the shortest known basis above is equivalent to it.
Lean proof
Endpoint theorem: SemigroupBasis.CoRoots.Order6Hull23_1PhaseParityB23Endpoints.S6_11165_basisFor
BasisFor Order6Subdirect.S6_11165.table.semigroup CoRoots.Order6Hull23_1PhaseParityB23Endpoints.displayedBasis
- Table
- The theorem is about a renumbering of this table; the census theorem checks the explicit permutation of the elements.
- 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 75 Lean files with 34,591 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_11165 checks that the theorem is about the table of this class and concludes Classified; SemiBase.Catalogue.Order6.S6_11165 is the table, with the elements numbered 0 to 5.
Variety
[6, 11165] generates the variety V[11165]; 1 other semigroup of order six generates it too, and 3,910 semigroups of order six lie in it. [6, 11165] lies in 1 of the 505 varieties of the census, those whose basis it satisfies.
- Directly above
- none: a maximal variety of the census
- Directly below
V[11165] in the inclusion graph, with the varieties above and below it.
Generating the same variety
Nearby tables
Semigroups whose Smallsemi table differs from this one in one or two entries (row, column), as the tables are listed, not up to renumbering.
- [6, 11163]: 2 entries (3, 4), (4, 3), variety V[7539]
- [6, 11166]: 2 entries (3, 6), (4, 6), the same variety