[6, 8486] finitely based
[6, 8486] is a semigroup with 4 idempotents and a zero, 1. It is finitely based: 6 identities in 3 variables define its variety, which 6 other semigroups of order at most six also generate.
Cayley table
| · | 1 | 2 | 3 | 4 | 5 | 6 |
|---|---|---|---|---|---|---|
| 1 | 1 | 1 | 1 | 1 | 1 | 1 |
| 2 | 1 | 1 | 1 | 1 | 2 | 2 |
| 3 | 1 | 1 | 1 | 3 | 3 | 3 |
| 4 | 1 | 2 | 1 | 4 | 4 | 4 |
| 5 | 1 | 2 | 3 | 4 | 5 | 5 |
| 6 | 1 | 2 | 3 | 4 | 6 | 6 |
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, 8486)
- Idempotents
- 1, 4, 5, 6
- Zero
- 1
- Identity
- none
- Nilpotent
- no
- Commutative
- no
- Regular
- no
- Group
- no
- 𝒥-classes
- 5
- Rank
- 5, generated by {2, 3, 4, 5, 6}
- Self-dual
- no: the class also stands for the opposite semigroup, with the transposed table
Identity basis
Fewest variables: 6 identities in 3 variables
- x² ≈ x³
- xyx ≈ x²yx
- xyx² ≈ xyx
- x²y² ≈ xy²x
- xyxzx ≈ xyzx
- xy²z² ≈ xzy²z
No basis uses fewer variables: [3, 16] satisfies every identity of V[6, 8206] in 2 variables, because its subsemigroups generated by 2 elements lie in V[6, 8206], but it is not in V[6, 8206]. 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.
Basis certified in Lean: 11 identities in 4 variables
- x² ≈ x³
- x²yx ≈ xyx
- xyx ≈ xyx²
- x²y² ≈ xyxy
- x²y² ≈ xy²x
- xyxzx ≈ xyzx
- xy²z² ≈ xzy²z
- xyzxy ≈ xyzyx
- xyxztz ≈ xyzxtz
- xyxztz ≈ xyzxtz
- xyztyz ≈ xzytyz
Lean proof
Endpoint theorem: SemigroupBasis.CoRoots.Order6Day11.FordLordPeriodOne.S6_8486.basisFor
BasisFor CoRoots.Order6Day11.FordLordPeriodOne.S6_8486.table.semigroup CoRoots.Order6Day11.FordLordPeriodOne.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 129 Lean files with 49,026 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_8486 checks that the theorem is about the table of this class and concludes Classified; SemiBase.Catalogue.Order6.S6_8486 is the table, with the elements numbered 0 to 5.
Variety
[6, 8486] generates the variety V[6, 8206]; 7 semigroups of order at most six generate it, and 6,981 semigroups of order at most six lie in it. The transposed table, the opposite semigroup, generates the dual variety V[6, 8206]ᵒᵖ. [6, 8486] lies in 11 of the 681 varieties, those whose basis it satisfies.
- Directly above
- Directly below
V[6, 8206] 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.
- [6, 8485]: 1 entry (6, 5), variety V[5, 400]
- [6, 8488]: 1 entry (4, 3), variety V[5, 793]
- [6, 7718]: 2 entries (2, 5), (2, 6), variety V[6, 7628]
- [6, 8267]: 2 entries (2, 5), (6, 5), variety V[5, 400]
- [6, 8406]: 2 entries (3, 4), (4, 2), variety V[4, 74]
- [6, 8417]: 2 entries (3, 4), (4, 3), variety V[5, 793]
- [6, 8422]: 2 entries (3, 4), (4, 3), variety V[5, 793]
- [6, 8484]: 2 entries (4, 2), (4, 3), variety V[4, 74]
- [6, 8487]: 2 entries (4, 3), (6, 5), variety V[4, 71]
- [6, 8558]: 2 entries (2, 4), (4, 3), variety V[4, 74]
- [6, 13255]: 2 entries (3, 3), (3, 4), variety V[5, 793]
- [6, 13298]: 2 entries (3, 3), (4, 3), variety V[5, 793]