[5, 84] finitely based
[5, 84] is a semigroup with 2 idempotents and a zero, 1. It is finitely based: 4 identities in 3 variables define its variety, which 30 other semigroups of order at most six also generate.
Cayley table
| · | 1 | 2 | 3 | 4 | 5 |
|---|---|---|---|---|---|
| 1 | 1 | 1 | 1 | 1 | 1 |
| 2 | 1 | 1 | 1 | 1 | 1 |
| 3 | 1 | 1 | 1 | 1 | 1 |
| 4 | 1 | 1 | 2 | 1 | 1 |
| 5 | 1 | 2 | 2 | 4 | 5 |
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(5, 84)
- Idempotents
- 1, 5
- Zero
- 1
- Identity
- none
- Nilpotent
- no
- Commutative
- no
- Regular
- no
- Group
- no
- 𝒥-classes
- 5
- Rank
- 3, generated by {3, 4, 5}
- Self-dual
- no: the class also stands for the opposite semigroup, with the transposed table
Identity basis
Fewest variables: 4 identities in 3 variables
- x² ≈ x³
- xyx ≈ xy²
- xyx ≈ yx²
- x²yz ≈ xyz
No basis uses fewer variables: the semigroup of order 7 shown below satisfies every identity of V[5, 83] in 2 variables, but not x²yz ≈ xyz, which holds in V[5, 83]. Certified in Lean: the Lean theorems of 31 semigroups prove that these identities are a basis.
The semigroup of order 7 that shows the lower bound
| · | 1 | 2 | 3 | 4 | 5 | 6 | 7 |
|---|---|---|---|---|---|---|---|
| 1 | 6 | 4 | 6 | 6 | 6 | 6 | 5 |
| 2 | 6 | 6 | 7 | 6 | 6 | 6 | 6 |
| 3 | 6 | 6 | 6 | 6 | 6 | 6 | 6 |
| 4 | 6 | 6 | 5 | 6 | 6 | 6 | 6 |
| 5 | 6 | 6 | 6 | 6 | 6 | 6 | 6 |
| 6 | 6 | 6 | 6 | 6 | 6 | 6 | 6 |
| 7 | 6 | 6 | 6 | 6 | 6 | 6 | 6 |
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[5, 83] on 2 generators, and so every identity of V[5, 83] in 2 variables, but not x²yz ≈ xyz.
Basis certified in Lean
The Lean theorem below certifies the basis above.
Lean proof
Theorem: SemigroupBasis.CoRoots.S5_83Family.S5_84.basis_complete
BasisFor SemigroupBasis.Generated.Catalogue.S5_84.table.semigroup SemigroupBasis.CoRoots.S5_83.basis
- Table
- The theorem is about the semigroup with exactly this table, with the elements numbered from 0 in Lean.
- 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 13 Lean files with 5,529 lines: the endpoint theorem and everything it imports, the shared library included. All of it is shared with the proofs of other classes.
- Where
- In the public repository, which builds it as part of the proofs of order six.
- Transpose
- SemigroupBasis.CoRoots.S5_83Family.S5_84.basis_complete.oppositeReversed: the basis read backwards is a basis of the opposite semigroup, with the transposed table.
- Audit
- The campaign's audit of the orders one to five checked the statement of each of the 1,309 theorems, in both orientations, with the Lean kernel; for order five, a second replay by the bases-min tools read the bases back from Lean.
Variety
[5, 84] generates the variety V[5, 83]; 31 semigroups of order at most six generate it, and 1,104 semigroups of order at most six lie in it. The transposed table, the opposite semigroup, generates the dual variety V[5, 83]ᵒᵖ. [5, 84] lies in 213 of the 681 varieties, those whose basis it satisfies.
- Directly above
- Directly below
V[5, 83] 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.
- [5, 72]: 1 entry (4, 3), variety V[3, 6]
- [5, 83]: 1 entry (5, 3), the same variety
- [5, 71]: 2 entries (4, 3), (5, 4), variety V[3, 6]
- [5, 73]: 2 entries (4, 3), (5, 3), variety V[3, 6]
- [5, 79]: 2 entries (4, 3), (4, 5), variety V[4, 21]
- [5, 87]: 2 entries (4, 5), (5, 3), variety V[4, 21]
- [5, 108]: 2 entries (2, 5), (3, 5), variety V[5, 107]