SemiBase
← [6, 4102][6, 4104] →

[6, 4103] finitely based

order 6inverseself-dualfamily proof

[6, 4103] is a inverse semigroup. It has 3 idempotents. It is finitely based: 4 identities in 3 variables define its variety, which 1 other semigroup of order at most six also generates.

Cayley table

·123456
1111411
2115412
3161431
4444144
5121451
6113416

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

Structure

Smallsemi
SmallSemigroup(6, 4103)
Idempotents
1, 5, 6
Zero
none
Identity
none
Nilpotent
no
Commutative
no
Regular
yes, inverse
Group
no
𝒥-classes
2
Rank
3, generated by {2, 3, 4}
Self-dual
yes: anti-isomorphic to itself

Identity basis

Fewest variables: 4 identities in 3 variables

  1. x² ≈ x⁴
  2. xyx ≈ xyxyxyx
  3. xyxz² ≈ xz²yx
  4. xyzxzy ≈ zyxzxy

Every basis uses at least 2 variables: [2, 4] satisfies every identity of V[6, 4103] in 1 variable, because its subsemigroups generated by 1 element lie in V[6, 4103], but it is not in V[6, 4103]. Whether a basis in fewer than 3 variables exists is not known. A search with Vampire found neither a basis in fewer variables nor a semigroup that rules one out. 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.

Basis certified in Lean: 15 identities in 3 variables

  1. x² ≈ x⁴
  2. x²yx ≈ xyx²
  3. x²yx ≈ yxy²
  4. x²y² ≈ xy²x
  5. x²y² ≈ yx²y
  6. x³yx ≈ xy³x
  7. xyx ≈ xyxyxyx
  8. xyx ≈ xyxyxyx
  9. x²yzy ≈ yzx²y
  10. xyxzx ≈ xzxyx
  11. xyxzy ≈ xzyxy
  12. xyxz² ≈ xz²yx
  13. x²y²z² ≈ xyxzyz
  14. xyxzyz ≈ xyzxzy
  15. xyzxzy ≈ zyxzxy

Lean proof

Endpoint theorem: SemigroupBasis.CoRoots.Order6Day7.S2_2.Rank040.DiagonalCompletion.s6_4103_representative_basis

BasisFor CoRoots.Order6Day7.S2_2.Rank040.S6_4103.table.semigroup CoRoots.Order6Day7.S2_2.Rank040.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 154 Lean files with 65,338 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_4103 checks that the theorem is about the table of this class and concludes Classified; SemiBase.Catalogue.Order6.S6_4103 is the table, with the elements numbered 0 to 5.

Variety

[6, 4103] generates the variety V[6, 4103]; 2 semigroups of order at most six generate it, and 3,591 semigroups of order at most six lie in it. The class is self-dual, so its transpose generates the same variety. [6, 4103] 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, 4103] 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.