SemiBase
← [6, 9752][6, 9754] →

[6, 9753] finitely based

not self-dualfamily proof

[6, 9753] is a semigroup with 4 idempotents and a zero, 6. It is finitely based: 2 identities define its variety, which 4 other semigroups of order six also generate.

Cayley table

·123456
1111116
2111116
3112146
4444446
5555556
6666666

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

Identity basis

Shortest known basis: 2 identities irredundant

  1. xyxz ≈ xyz
  2. x²yz ≈ x²zy

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. Shortest known, not known to be minimal.

Basis certified in Lean: 8 identities

  1. x³ ≈ x⁴
  2. xyx ≈ xy²
  3. x³y ≈ x²y
  4. x²y ≈ x²yx
  5. x²y ≈ x²y²
  6. xyx ≈ xyx²
  7. xyxz ≈ xyz
  8. x²yz ≈ x²zy

Lean proof

Endpoint theorem: SemigroupBasis.CoRoots.Order6Day10.SharedLevel3Section04.Section04ClassEndpoints.S6_9753.basisFor

BasisFor CoRoots.Order6Day10.SharedLevel3Section04.Section04ClassEndpoints.S6_9753.table.semigroup
  CoRoots.Order6Day10.SharedLevel3Section04.Section04Intersection.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 40 Lean files with 20,760 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_9753 checks that the theorem is about the table of this class and concludes Classified; SemiBase.Catalogue.Order6.S6_9753 is the table, with the elements numbered 0 to 5.

Variety

[6, 9753] generates the variety V[9699]; 4 other semigroups of order six generate it too, and 4,057 semigroups of order six lie in it. [6, 9753] lies in 2 of the 505 varieties of the census, those whose basis it satisfies.

Directly above
V[9726]
Directly below
V[5516] V[5535] V[7538]

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

Generating the same variety

[6, 9699] [6, 9700] [6, 9702] [6, 9787]

Nearby tables

Semigroups whose Smallsemi table differs from this one in one or two entries (row, column), as the tables are listed, not up to renumbering.