[6, 5686] finitely based
[6, 5686] is a semigroup with 3 idempotents. It is finitely based: 3 identities define its variety, which no other semigroup of order six generates.
Cayley table
| · | 1 | 2 | 3 | 4 | 5 | 6 |
|---|---|---|---|---|---|---|
| 1 | 1 | 1 | 1 | 1 | 1 | 1 |
| 2 | 1 | 1 | 1 | 3 | 1 | 1 |
| 3 | 1 | 1 | 1 | 1 | 1 | 1 |
| 4 | 1 | 3 | 1 | 2 | 1 | 5 |
| 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, 5686)
- Idempotents
- 1, 5, 6
- Zero
- none
- Identity
- none
- Nilpotent
- no
- Commutative
- no
- Regular
- no
- Group
- no
- 𝒥-classes
- 4
- Rank
- 2, generated by {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
- xyx ≈ xy²
- x⁴ ≈ x²yx
- xy²zt ≈ xyzt
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: 7 identities
- xyx ≈ xy²
- x⁴ ≈ x³y
- x⁴ ≈ x²yx
- x⁴ ≈ x²yz
- xyx² ≈ xyxz
- xyx² ≈ xyzx
- xy²zt ≈ xyzt
Lean proof
Endpoint theorem: SemigroupBasis.CoRoots.Order6Day10.Rank084SigmaPlus.Rank084SigmaPlusClassEndpoints.S6_5686.basisFor
BasisFor CoRoots.Order6Day10.Rank084SigmaPlus.Rank084SigmaPlusClassEndpoints.S6_5686.table.semigroup CoRoots.Order6Day10.Rank084SigmaPlus.Rank084SigmaPlusIntersection.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 20 Lean files with 5,106 lines: the endpoint theorem and everything it imports, the shared library included. Of these, 238 lines are used by the proof of this class and of no other.
- Census
- SemiBase.Census.S6_5686 checks that the theorem is about the table of this class and concludes Classified; SemiBase.Catalogue.Order6.S6_5686 is the table, with the elements numbered 0 to 5.
Variety
[6, 5686] generates the variety V[5686]; no other semigroup of order six generates it, and 3,060 semigroups of order six lie in it. [6, 5686] 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[5686] in the inclusion graph, with the varieties above and below it.
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.