SemiBase
← [6, 5112][6, 5114] →

[6, 5113] finitely based

order 6commutativeself-dualfamily proof

[6, 5113] is a commutative semigroup with 1 idempotent. It is finitely based: 3 identities in 3 variables define its variety, which 2 other semigroups of order at most six also generate.

Cayley table

·123456
1121451
2212542
3121451
4454214
5545125
6121453

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

Structure

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

Identity basis

Fewest variables: 3 identities in 3 variables

  1. xy ≈ yx
  2. x⁵yz ≈ xyz
  3. x²y ≈ x²yz⁴

No basis uses fewer variables: the semigroup of order 8 shown below satisfies every identity of V[6, 5113] in 2 variables, but not x⁵yz ≈ xyz, which holds in V[6, 5113]. 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 8 that shows the lower bound
·12345678
154766665
245866656
378656666
466566666
566666666
666666666
765666666
856666666

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, 5113] on 2 generators, and so every identity of V[6, 5113] in 2 variables, but not x⁵yz ≈ xyz.

Basis certified in Lean: 8 identities in 3 variables

  1. x³ ≈ x⁷
  2. xy ≈ yx
  3. x⁴ ≈ y⁴
  4. x³ ≈ x³y⁴
  5. x⁶y ≈ x²y
  6. x²y ≈ x²y⁵
  7. x⁵yz ≈ xyz
  8. x²y ≈ x²yz⁴

Lean proof

Endpoint theorem: SemigroupBasis.CoRoots.Order6GenericCASSubdirectS6_5113.basisFor

BasisFor SemigroupBasis.CoRoots.Order6GenericCASSubdirectS6_5113.rootSemigroup✝
  SemigroupBasis.CoRoots.Order6GenericCASSubdirectS6_5113.rootBasis✝
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 24 Lean files with 7,062 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_5113 checks that the theorem is about the table of this class and concludes Classified; SemiBase.Catalogue.Order6.S6_5113 is the table, with the elements numbered 0 to 5.

Variety

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