Math 2.0

General algebraic systems Terms, identities and equational logic Theorem

Birkhoff's completeness theorem

Builds on Equational logicIdentityEquational theory

Statement

Let σ\sigma be a signature with only function symbols and let XX be an infinite set of variables. Let Σ\Sigma be a set of identities over σ\sigma and XX. For every identity s≈ts \approx t over σ\sigma and XX, the following are equivalent:

  1. Σ⊢s≈t\Sigma \vdash s \approx t, that is, s≈ts \approx t is derivable from Σ\Sigma in equational logic;
  2. Σ⊨s≈t\Sigma \models s \approx t, that is, every algebra of signature σ\sigma that satisfies all identities of Σ\Sigma satisfies s≈ts \approx t.

Remarks

Soundness, from 1 to 2, holds because each rule of equational logic preserves truth in every algebra. For completeness, let θ\theta be the set of pairs (u,v)(u, v) of terms with Σ⊢u≈v\Sigma \vdash u \approx v. The rules say that θ\theta is a congruence of the term algebra that is invariant under substitutions, and the quotient of the term algebra by θ\theta satisfies Σ\Sigma. Evaluating ss and tt in this quotient at the assignment x↦x/θx \mapsto x/\theta gives s/θs/\theta and t/θt/\theta, so if Σ⊨s≈t\Sigma \models s \approx t then (s,t)∈θ(s, t) \in \theta. The quotient is the free algebra on XX of the variety defined by Σ\Sigma.

Consequence: a set of identities is an equational theory exactly when it contains all identities t≈tt \approx t and is closed under the rules of symmetry, transitivity, replacement and substitution.

Going deeper

For a student

This is the equational analogue of Gödel's completeness theorem, with a much simpler set of rules. The proof builds a canonical model: the term algebra divided by provable equality, which is the free algebra of the variety defined by Σ\Sigma. Together with Birkhoff's HSP theorem, it sets up the correspondence between varieties of algebras and equational theories. It also justifies term rewriting: a rewriting proof of s≈ts \approx t is a derivation in equational logic, and every true consequence has such a derivation, though finding it may be undecidable.

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. Equational logic concept
  2. Equational theory concept
  3. Identity concept
  4. Birkhoff's completeness theorem statement

Where this leads

1 page builds on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Equational_logic
About this page
TagWDHWCQ6Y2Y
URIm2://WDHWCQ6Y2Y
Kindstatement, theorem
WritingW0 stub
MSC08B05, 03C05
StatusThis copy of the site has no build data. Run m2 status WDHWCQ6Y2Y.
AboutEquational logic
UsesEquational logic, Identity, Equational theory

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

Used by