SemiBase
← [6, 5685][6, 5687] →

[6, 5686] finitely based

order 6not self-dualfamily proof

[6, 5686] is a semigroup with 3 idempotents. It is finitely based: 3 identities in 4 variables define its variety, which no other semigroup of order at most six generates.

Cayley table

·123456
1111111
2111311
3111111
4131215
5555555
6666666

The product of the row element and the column element, numbered as in Smallsemi. Blue: idempotents on the diagonal.

Structure

Smallsemi
SmallSemigroup(6, 5686)
Idempotents
1, 5, 6
Zero
none
Identity
none
Nilpotent
no
Commutative
no
Regular
no
Group
no
𝒥-classes
4
Rank
2, generated by {4, 6}
Self-dual
no: the class also stands for the opposite semigroup, with the transposed table

Identity basis

Fewest variables: 3 identities in 4 variables

  1. xyx ≈ xy²
  2. x⁴ ≈ x²yx
  3. xy²zt ≈ xyzt

No basis uses fewer variables: the semigroup of order 11 shown below satisfies every identity of V[6, 5686] in 3 variables, but not xy²zt ≈ xyzt, which holds in V[6, 5686]. 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 11 that shows the lower bound
·1234567891011
175777777687
2991067777779
3766117777777
466777777777
566877777776
677777777777
777777777777
877767777777
977777777777
1077797777777
1177777777777

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, 5686] on 3 generators, and so every identity of V[6, 5686] in 3 variables, but not xy²zt ≈ xyzt.

Basis certified in Lean: 7 identities in 4 variables

  1. xyx ≈ xy²
  2. x⁴ ≈ x³y
  3. x⁴ ≈ x²yx
  4. x⁴ ≈ x²yz
  5. xyx² ≈ xyxz
  6. xyx² ≈ xyzx
  7. xy²zt ≈ xyzt

Lean proof

Endpoint theorem: SemigroupBasis.CoRoots.Order6Day10.Rank084SigmaPlus.Rank084SigmaPlusClassEndpoints.S6_5686.basisFor

BasisFor CoRoots.Order6Day10.Rank084SigmaPlus.Rank084SigmaPlusClassEndpoints.S6_5686.table.semigroup
  CoRoots.Order6Day10.Rank084SigmaPlus.Rank084SigmaPlusIntersection.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 20 Lean files with 5,106 lines: the endpoint theorem and everything it imports, the shared library included. Of these, 238 lines are used by the proof of this class and of no other.
Census
SemiBase.Census.S6_5686 checks that the theorem is about the table of this class and concludes Classified; SemiBase.Catalogue.Order6.S6_5686 is the table, with the elements numbered 0 to 5.

Variety

[6, 5686] generates the variety V[6, 5686]; 1 semigroup of order at most six generates it, and 5,325 semigroups of order at most six lie in it. The transposed table, the opposite semigroup, generates the dual variety V[6, 5686]ᵒᵖ. [6, 5686] 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, 5686] in the inclusion graph, with the varieties above and below it.

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.