Math 2.0

General algebraic systems Quasivarieties and model classes Theorem

Reiterman's theorem

Builds on PseudovarietyHomomorphismIdentity

Statement

Let σ\sigma be a finite algebraic signature and let ℱ\mathcal{F} be the class of all finite σ\sigma-algebras. For n≥1n \ge 1, an nn-ary implicit operation π\pi assigns to each A∈ℱA \in \mathcal{F} a map πA ⁣:An→A\pi_A \colon A^n \to A, subject to one condition. For every homomorphism f ⁣:A→Bf \colon A \to B in ℱ\mathcal{F} and all a1,…,an∈Aa_1, \ldots, a_n \in A, it requires f(πA(a1,…,an))=πB(f(a1),…,f(an))f(\pi_A(a_1, \ldots, a_n)) = \pi_B(f(a_1), \ldots, f(a_n)). A pseudoidentity is a pair π≈ρ\pi \approx \rho of nn-ary implicit operations, and A∈ℱA \in \mathcal{F} satisfies it if πA=ρA\pi_A = \rho_A. Let V⊆ℱV \subseteq \mathcal{F}. Then VV is a pseudovariety if and only if there is a set Σ\Sigma of pseudoidentities with the following property. An algebra A∈ℱA \in \mathcal{F} is in VV exactly when it satisfies every member of Σ\Sigma.

Remarks

Each term gives an implicit operation, so every identity is a pseudoidentity, but there are many more. The nn-ary implicit operations are the elements of the free profinite σ\sigma-algebra on nn generators, the inverse limit of all nn-generated finite σ\sigma-algebras. The easy direction holds because satisfaction of a pseudoidentity passes to quotients, subalgebras and finite products. For the converse, one takes as Σ\Sigma all pseudoidentities true in VV. A finite algebra AA satisfying them is a continuous image of a free pro-VV algebra. By compactness this map factors through a finite quotient of it that lies in VV, so A∈VA \in V.

Example: in finite semigroups, each element xx has a unique idempotent power, written xωx^\omega; it is the limit of xn!x^{n!}, and x↦xωx \mapsto x^\omega is a unary implicit operation. The pseudovariety of finite groups is defined by xωy≈yx^\omega y \approx y and yxω≈yy x^\omega \approx y. The pseudovariety of finite aperiodic semigroups is defined by xω≈xω+1x^\omega \approx x^{\omega + 1}. 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
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Homomorphism concept
  2. Identity concept
  3. Pseudovariety concept
  4. Reiterman's theorem statement

Further reading

  1. Web https://en.wikipedia.org/wiki/Variety_(universal_algebra)
About this page
TagNT8W7R2KDR
URIm2://NT8W7R2KDR
Kindstatement, theorem
WritingW0 stub
MSC08B99, 20M07
StatusThis copy of the site has no build data. Run m2 status NT8W7R2KDR.
AboutPseudovariety
UsesPseudovariety, 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.