[6, 5369] finitely based
[6, 5369] is a semigroup with 2 idempotents. It is finitely based: 3 identities in 5 variables define its variety, which no other semigroup of order at most six generates.
Cayley table
| · | 1 | 2 | 3 | 4 | 5 | 6 |
|---|---|---|---|---|---|---|
| 1 | 1 | 1 | 1 | 1 | 1 | 1 |
| 2 | 1 | 1 | 1 | 1 | 1 | 1 |
| 3 | 1 | 1 | 1 | 1 | 2 | 1 |
| 4 | 1 | 1 | 1 | 2 | 3 | 1 |
| 5 | 1 | 1 | 2 | 3 | 4 | 1 |
| 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, 5369)
- Idempotents
- 1, 6
- Zero
- none
- Identity
- none
- Nilpotent
- no
- Commutative
- no
- Regular
- no
- Group
- no
- 𝒥-classes
- 5
- Rank
- 2, generated by {5, 6}
- Self-dual
- no: the class also stands for the opposite semigroup, with the transposed table
Identity basis
Fewest variables: 3 identities in 5 variables
- xyz ≈ xzy
- x²yz ≈ xy²z
- x⁵ ≈ xyztu
Every basis uses at least 3 variables: the semigroup of order 7 shown below satisfies every identity of V[6, 5369] in 2 variables, but not xyz ≈ xzy, which holds in V[6, 5369]. Whether a basis in fewer than 5 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 7 that shows the lower bound
| · | 1 | 2 | 3 | 4 | 5 | 6 | 7 |
|---|---|---|---|---|---|---|---|
| 1 | 5 | 4 | 4 | 5 | 5 | 5 | 6 |
| 2 | 5 | 7 | 5 | 5 | 5 | 5 | 5 |
| 3 | 5 | 7 | 6 | 5 | 5 | 5 | 5 |
| 4 | 5 | 6 | 5 | 5 | 5 | 5 | 5 |
| 5 | 5 | 5 | 5 | 5 | 5 | 5 | 5 |
| 6 | 5 | 5 | 5 | 5 | 5 | 5 | 5 |
| 7 | 5 | 5 | 5 | 5 | 5 | 5 | 5 |
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, 5369] on 2 generators, and so every identity of V[6, 5369] in 2 variables, but not xyz ≈ xzy.
Basis certified in Lean: 8 identities in 5 variables
- x²y ≈ xyx
- x³y ≈ x²y²
- x³y ≈ xy³
- x⁵ ≈ x⁴y
- xyz ≈ xzy
- x²yz ≈ xy²z
- x⁵ ≈ x²yzt
- x⁵ ≈ xyztu
Lean proof
Endpoint theorem: SemigroupBasis.CoRoots.Order6Sunday.Msg0534S5369Completeness.representative_basis
BasisFor CoRoots.Order6Sunday.Msg0524S5369Evaluator.table.semigroup CoRoots.Order6Sunday.Msg0534S5369Derivations.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 43 Lean files with 17,235 lines: the endpoint theorem and everything it imports, the shared library included. Of these, 372 lines are used by the proof of this class and of no other.
- Census
- SemiBase.Census.S6_5369 checks that the theorem is about the table of this class and concludes Classified; SemiBase.Catalogue.Order6.S6_5369 is the table, with the elements numbered 0 to 5.
Variety
[6, 5369] generates the variety V[6, 5369]; 1 semigroup of order at most six generates it, and 5,255 semigroups of order at most six lie in it. The transposed table, the opposite semigroup, generates the dual variety V[6, 5369]ᵒᵖ. [6, 5369] 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, 5369] in the inclusion graph, with the varieties above and below it.