SemiBase
← [5, 193][5, 195] →

[5, 194] finitely based

order 5nilpotent of class 5commutativeself-dualfamily proof

[5, 194] is a commutative nilpotent semigroup: every product of 5 elements is equal to the zero. It is finitely based: 3 identities in 5 variables define its variety, which 7 other semigroups of order at most six also generate.

Cayley table

·12345
111111
211111
311112
411123
511234

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, 194)
Idempotents
1
Zero
1
Identity
none
Nilpotent
yes, of class 5
Commutative
yes
Regular
no
Group
no
𝒥-classes
5
Rank
1, generated by {5}
Self-dual
yes: anti-isomorphic to itself

Identity basis

Fewest variables: 3 identities in 5 variables

  1. xy ≈ yx
  2. x²yz ≈ xy²z
  3. x⁵ ≈ xyztu

Every basis uses at least 3 variables: the semigroup of order 12 shown below satisfies every identity of V[5, 194] in 2 variables, but not x²yz ≈ xy²z, which holds in V[5, 194]. 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. Found by a search among the identities of the variety in 5 variables: they hold in its generator, and Vampire derives from them a certified basis, so they are a basis. This rests on Vampire's proofs, not on Lean.

The semigroup of order 12 that shows the lower bound
·123456789101112
145104444611447
2589464411121174
31091141174127444
4444444444444
54611444447444
6447444444444
7444444444444
861112444474744
911127474444444
104114444474444
11474444444444
12744444444444

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, 194] on 2 generators, and so every identity of V[5, 194] in 2 variables, but not x²yz ≈ xy²z.

Basis certified in Lean: 3 identities in 6 variables

  1. xy ≈ yx
  2. x²yz ≈ xy²z
  3. xyztu ≈ vxyztu

Lean proof

Theorem: SemigroupBasis.CoRoots.S5_194.representative_basis

BasisFor SemigroupBasis.CoRoots.S5_194.table.semigroup SemigroupBasis.CoRoots.S5_194.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 8 Lean files with 3,787 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, in a later revision of the file than the one the audit checked.
Transpose
SemigroupBasis.CoRoots.S5_194.representative_basis.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, 194] generates the variety V[5, 194]; 8 semigroups of order at most six generate it, and 246 semigroups of order at most six lie in it. The class is self-dual, so its transpose generates the same variety. [5, 194] lies in 8 of the 681 varieties, those whose basis it satisfies.

Directly above
Directly below

V[5, 194] in the inclusion graph, with the varieties above and below it.

Generating the same variety