SemiBase
← [5, 253][5, 255] →

[5, 254] finitely based

order 5monoidnot self-dualfamily proof

[5, 254] is a monoid with 2 idempotents, a zero, 1 and an identity element, 4. It is finitely based: 5 identities in 4 variables define its variety, which 22 other semigroups of order at most six also generate.

Cayley table

·12345
111111
211122
311133
412345
513254

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, 254)
Idempotents
1, 4
Zero
1
Identity
4
Nilpotent
no
Commutative
no
Regular
no
Group
no
𝒥-classes
3
Rank
2, generated by {2, 5}
Self-dual
no: the class also stands for the opposite semigroup, with the transposed table

Identity basis

Fewest variables: 5 identities in 4 variables

  1. x² ≈ x⁴
  2. x²y ≈ yx²
  3. x³yx ≈ xyx
  4. xyzxty ≈ yxzxty
  5. xyztxz ≈ xyztzx

Every basis uses at least 2 variables: [2, 4] satisfies every identity of V[5, 254] in 1 variable, because its subsemigroups generated by 1 element lie in V[5, 254], but it is not in V[5, 254]. Whether a basis in fewer than 4 variables exists is not known. A search with Vampire found neither a basis in fewer variables nor a semigroup that rules one out. Reduced as far as the search went: some identity may still follow from the others. 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: 15 identities in 4 variables

  1. x² ≈ x⁴
  2. x²y ≈ yx²
  3. x³yx ≈ xyx
  4. x²y² ≈ xyxy
  5. xyxy ≈ xy²x
  6. xyxy ≈ yx²y
  7. x²yzy ≈ xyxzy
  8. xyxzy ≈ yx²zy
  9. xyxz² ≈ xyzxz
  10. xyzxy ≈ xyzyx
  11. xyzxy ≈ yxzxy
  12. xyzxz ≈ xyz²x
  13. xyxztz ≈ xyzxtz
  14. xyzxty ≈ yxzxty
  15. xyztxz ≈ xyztzx

Lean proof

Theorem: SemigroupBasis.CoRoots.S5_254.basisFor

BasisFor SemigroupBasis.CoRoots.S5_254.table.semigroup SemigroupBasis.CoRoots.S5_254.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 19 Lean files with 9,063 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_254.basisFor.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, 254] generates the variety V[5, 254]; 24 semigroups of order at most six generate it, and 2,008 semigroups of order at most six lie in it. The transposed table, the opposite semigroup, generates the same variety: V[5, 254] is self-dual. [5, 254] lies in 14 of the 681 varieties, those whose basis it satisfies.

Directly above
Directly below

V[5, 254] 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.