General algebraic systems Quasivarieties and model classes Theorem
Reiterman's theorem
Builds on PseudovarietyHomomorphismIdentity
Statement
Let be a finite algebraic signature and let be the class of all finite -algebras. For , an -ary implicit operation assigns to each a map , subject to one condition. For every homomorphism in and all , it requires . A pseudoidentity is a pair of -ary implicit operations, and satisfies it if . Let . Then is a pseudovariety if and only if there is a set of pseudoidentities with the following property. An algebra is in exactly when it satisfies every member of .
Remarks
Each term gives an implicit operation, so every identity is a pseudoidentity, but there are many more. The -ary implicit operations are the elements of the free profinite -algebra on generators, the inverse limit of all -generated finite -algebras. The easy direction holds because satisfaction of a pseudoidentity passes to quotients, subalgebras and finite products. For the converse, one takes as all pseudoidentities true in . A finite algebra satisfying them is a continuous image of a free pro- algebra. By compactness this map factors through a finite quotient of it that lies in , so .
Example: in finite semigroups, each element has a unique idempotent power, written ; it is the limit of , and is a unary implicit operation. The pseudovariety of finite groups is defined by and . The pseudovariety of finite aperiodic semigroups is defined by . Neither class is the class of finite members of a variety of semigroups, so ordinary identities do not suffice.
Going deeper
For a student
The theorem is the finite counterpart of Birkhoff's HSP theorem. It is a basic tool in the algebraic theory of regular languages: through Eilenberg's correspondence, a class of regular languages is described by pseudoidentities of its syntactic monoids. Decidability questions for pseudovarieties then become questions about the free profinite semigroup or monoid. An earlier description, due to Eilenberg and Schützenberger, defines each pseudovariety by a sequence of identities that is eventually satisfied.
Reading path
To understand this page from the ground up, read these 4 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Homomorphism concept
- Identity concept
- Pseudovariety concept
- Reiterman's theorem statement
Further reading
About this page
| Tag | NT8W7R2KDR |
|---|---|
| URI | m2://NT8W7R2KDR |
| Kind | statement, theorem |
| Writing | W0 stub |
| MSC | 08B99, 20M07 |
| Status | This copy of the site has no build data. Run m2 status NT8W7R2KDR. |
| About | Pseudovariety |
| Uses | Pseudovariety, Homomorphism, Identity |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.