Every finite-template constraint satisfaction problem is in P or is NP-complete, with nothing in between, and which one is decided by whether the template's polymorphism algebra satisfies a Mal'cev condition.
Engineering · Mathematics11 min readKV-MATH-0260
NoteBeyond the source text
This page covers developments that postdate the 1981 source. It is included because it is the direct continuation of themes the source raises, and is marked so its provenance stays legible.
Learning objectives
Define the constraint satisfaction problem over a fixed template.
Define polymorphisms and the Galois connection with relations.
State the dichotomy conjecture and what it excludes.
State the algebraic criterion separating the two cases.
Recount the resolution and who obtained it.
See this as the vindication of the source's applied universal algebra prediction.
01The problem
Fix a finite relational structure — the template. The constraint satisfaction problem for that template asks whether a given instance admits a homomorphism into it.
CSP(B): given a finite structure A, is there a homomorphism A → B?
The template B is fixed; the input is A. Different templates give different computational problems, all in NP.
Familiar problems as CSPs
Template
Problem
Complexity
Complete graph on 2 vertices
2-colouring
in P
Complete graph on 3 vertices
3-colouring
NP-complete
Boolean template for 2-SAT
2-SATISFIABILITY
in P
Boolean template for 3-SAT
3-SATISFIABILITY
NP-complete
Linear equations over a finite field
solvability of a linear system
in P
Horn clauses
HORN-SAT
in P
The tractable cases look heterogeneous — graph colouring, linear algebra, Horn resolution — and the achievement of the algebraic programme was to show they are the same phenomenon.
02Polymorphisms
A polymorphism of a relational structure is an operation on its universe preserving every relation. The polymorphisms form a clone, and that clone is the algebraic invariant of the template.
f : Bn → B is a polymorphism of r ⊆ Bm iff applying f coordinatewise to n tuples of r yields a tuple of r
Exactly the condition that r is a subuniverse of the n-th power of the algebra ⟨B, f⟩. Polymorphisms and relations are polarities of a Galois connection.
Polymorphisms of a set of relations and invariant relations of a set of operations are the two polarities of a Galois connection. The closed sets are clones on one side and relational clones on the other. This is the same machinery Pixley's theorem uses, applied to a computational problem.
The key insight of the programme is that the complexity of CSP(B) depends only on the polymorphism clone of B. Two templates with the same polymorphisms give polynomial-time-equivalent problems, so the classification is an algebraic one.
03The dichotomy conjecture
1978
Schaefer's theorem
For Boolean templates — two-element universes — every CSP is in P or NP-complete, with an explicit list of the six tractable cases. A dichotomy in the smallest case.
1993–1998
Feder and Vardi
Conjectured the dichotomy holds for every finite template: CSP(B) is in P or NP-complete, with nothing in between. Notable because Ladner's theorem guarantees intermediate problems exist in NP generally — so the conjecture asserts CSPs avoid them.
2000s
The algebraic reformulation
Bulatov, Jeavons, Krokhin and others recast the conjecture in terms of polymorphism clones, converting a complexity question into a Mal'cev-condition question.
2017
Resolution
Bulatov and Zhuk independently announced proofs of the dichotomy, by different methods. The conjecture became a theorem.
Key resultWhat the dichotomy excludes
Ladner's theorem says that if P ≠ NP there are problems in NP that are neither in P nor NP-complete. The dichotomy theorem says no CSP over a finite template is such a problem. That is a strong structural statement about a natural class of problems, and it is why the result attracted attention well outside universal algebra.
04The algebraic criterion
The line between tractable and NP-complete is drawn by a Mal'cev condition on the polymorphism algebra.
ProcedureThe dichotomy criterion
in: finite template B → out: P or NP-complete, decidably
input: finite template B (a core, without loss of generality)
form the algebra A(B) whose operations are the polymorphisms of B
check whether A(B) has a Taylor polymorphism
equivalently, a weak near-unanimity (WNU) operation
equivalently, the associated variety omits type 1
if YES: CSP(B) is solvable in polynomial time
if NO: CSP(B) is NP-complete
the condition is decidable, since it is a finite search on a finite algebra
The criterion is a Mal'cev condition of exactly the kind Chapter II introduces. Caveat: 'core' means the template has no proper retract — every template reduces to a core without changing the problem.
A weak near-unanimity operation is an n-ary operation w satisfying w(y,x,…,x) ≈ w(x,y,x,…,x) ≈ ⋯ ≈ w(x,…,x,y) together with idempotency. It is a Mal'cev condition in precisely the sense of Chapter II §12, and the absence of one is exactly the presence of tame congruence type 1.
05Why this vindicates the source
The source's preface predicts that applied universal algebra will become much more prominent, on the evidence of Chapter III's two examples. The CSP programme is the largest instance of that prediction.
The method is Chapter III's method
Take a combinatorial or computational structure, find an algebraic encoding, and let the algebra do the classifying. Kleene's theorem and the syntactic monoid are the same move.
The tools are Chapter II's tools
Mal'cev conditions, clones, the operation–relation Galois connection, varieties. All present in the source, applied to a problem posed a decade later.
The refinement is post-source
Tame congruence theory supplies the type analysis that makes the criterion tractable, and it is a 1988 development.
The scale is new
A complete complexity classification of a natural class of computational problems, obtained by algebraic means. Nothing of this scope existed in 1981.
CautionThis page postdates the source entirely
The Feder–Vardi conjecture was posed more than a decade after the text and resolved more than three decades after it. Nothing here is in Burris and Sankappanavar. It is included because the source's own Section 6, Applications to Computer Science, points in this direction and is now the most dated part of the book.
Frequently asked
Is the dichotomy criterion practical to check?
It is decidable — searching for a weak near-unanimity polymorphism on a finite template is a finite search — and UACalc and related tools implement it. The cost grows quickly, so it is practical for small templates and expensive for larger ones.
Does the dichotomy extend to infinite templates?
No. The theorem is for finite templates. Infinite-domain CSP is an active area with a substantially different theory, and no general dichotomy is known or expected in that setting.
Why does the template need to be a core?
Because a template with a proper retract gives the same problem as its retract, so the classification would otherwise be stated for redundant data. Restricting to cores makes the algebraic criterion well posed, and every template reduces to a core in a way that preserves the problem.
Sources and further reading
S. Burris and H. P. Sankappanavar, A Course in Universal Algebra, Millennium Edition (a corrected re-typesetting of Springer GTM 78, 1981).
G. Grätzer, Universal Algebra, 2nd edition, Springer.
R. McKenzie, G. McNulty and W. Taylor, Algebras, Lattices, Varieties, Volume I.
Original KEVOS® explanatory article. Written from the topic map of the cited works; no text is reproduced from them.
Handbook application: from concept to controlled practice
Purpose. This expanded section turns the original page into a practical handbook. It preserves the supplied material and adds a repeatable way to apply, check and review The Algebraic Approach to Constraint Satisfaction. It does not replace a contract, legislation, a controlled standard, competent engineering judgement or specialist advice.
The operating aim is to turn a compact mathematical statement into a usable chain of definitions, claims, examples and checks. Read the original explanation first, then use the workflow and checks below to convert knowledge into evidence.
Treat The Algebraic Approach to Constraint Satisfaction as a network of definitions and implications, not as a list of formulas. The working vocabulary on this page—algebraic, constraint, satisfaction, dichotomy, problem—should be made explicit before any proof or computation begins. Record the ambient set or structure, the permitted operations and the equality or equivalence relation in use. A compact theorem often changes meaning when the base field, finiteness condition, commutativity assumption or direction of an action changes.
For a proof, write the hypotheses as a checklist and mark the line at which each one is used. For a computation, state the representation of the input, the arithmetic model, the termination condition and the output invariant. For a classification problem, distinguish existence from uniqueness and distinguish an object from its representation. These separations prevent a correct local calculation from being mistaken for the general result.
A useful worked example should be small enough to inspect completely but rich enough to exercise the main mechanism. Compute the result in two ways where practical: symbolically and by substitution, structurally and numerically, or directly and through a normal form. Then include one near-miss example in which a hypothesis fails. The contrast explains why the theorem is shaped as it is and gives the reader a diagnostic pattern for later problems.
Verification is part of the mathematics. Check domains and codomains, substitute proposed solutions, test identity and zero cases, compare dimensions or cardinalities, and confirm that maps respect the required operations. In numerical work, report precision, conditioning and a residual rather than digits alone. In algorithmic work, separate mathematical correctness from implementation complexity and resource limits.
Step-by-step operating method
Fix the setting. State the objects, ambient structure, notation and assumptions before manipulating symbols.
Separate claims. Distinguish definitions, hypotheses, conclusions, equivalent conditions and consequences.
Choose a method. Select proof, construction, calculation or algorithm according to the question actually asked.
Work a small case. Use the smallest non-trivial example to expose the mechanism and test edge behaviour.
Verify independently. Substitute back, check invariants, test boundary cases or use an alternative derivation.
Worked-example protocol
Illustrative method—not a source theorem. Start with a small admissible input and list the definitions it must satisfy. Carry out each transformation on a separate line, citing the property that permits it. Preserve exact values until approximation is necessary. At the end, verify the output against the original definition and one invariant such as dimension, degree, determinant, order, norm or residual. Then alter one hypothesis and observe which step ceases to be valid. This protocol creates a reusable example without inventing a theorem-specific numerical answer.
Stage
Record
Quality check
Input
Objects, domain, notation, assumptions
Every symbol is defined
Method
Permitted operation or cited result at each step
All hypotheses hold
Output
Exact result and representation
Correct type, domain and form
Verification
Substitution, invariant or alternative derivation
Independent agreement
Boundary test
Zero, identity, degenerate or failed hypothesis
Scope is understood
Common failure modes and recovery actions
1. Watch for
Using a theorem without checking every hypothesis.
Recovery: Return to the governing definition or requirement and restate the decision in one sentence.
2. Watch for
Treating a suggestive example as a proof of the general case.
Recovery: Separate evidence from assumption, assign an owner and set a date for validation.
3. Watch for
Changing notation or conventions part-way through an argument.
Recovery: Run a small counterexample, boundary test, pilot or independent check before proceeding.
4. Watch for
Hiding a division-by-zero, convergence, finiteness or commutativity assumption.
Recovery: Record the consequence, decision and rationale, then update the controlled baseline.
5. Watch for
Reporting a computed result without a residual, substitution or structural check.
Recovery: Escalate when the issue affects safety, compliance, acceptance, material value or an agreed tolerance.
Review checklist
Can every symbol be traced to a definition or prior result?
Which hypothesis does each major step use?
Does the method cover zero, identity, degenerate and boundary cases?
Can the conclusion be checked by a second representation or calculation?
Are mandatory requirements distinguished from recommendations and illustrative values?
Are sources, assumptions, units, dates and versions recorded closely enough to reproduce the decision?
Have safety, legal, ethical, stakeholder and operational consequences been considered at the appropriate level?
Is there a named owner and a trigger for review, escalation, change or retirement?
Questions for deeper application
What is the most important distinction a practitioner must preserve when applying The Algebraic Approach to Constraint Satisfaction?
Answer with a fact or cited source where available. Where evidence is incomplete, record the assumption, consequence, responsible owner and next validation action.
Which assumption about algebraic would change the result most if it proved false?
Answer with a fact or cited source where available. Where evidence is incomplete, record the assumption, consequence, responsible owner and next validation action.
What evidence would allow an independent reviewer to reproduce or challenge the conclusion?
Answer with a fact or cited source where available. Where evidence is incomplete, record the assumption, consequence, responsible owner and next validation action.
Which boundary, exception or failure case has not yet been tested?
Answer with a fact or cited source where available. Where evidence is incomplete, record the assumption, consequence, responsible owner and next validation action.
What must be handed over, monitored or reviewed after the immediate work is complete?
Answer with a fact or cited source where available. Where evidence is incomplete, record the assumption, consequence, responsible owner and next validation action.
Authoritative references and use notes
The sources below were selected as institutional or primary guidance for the broader practice. They support the handbook method; they do not imply that every statement or clause in a source applies to every project. Confirm the current edition, jurisdiction, contract and application before treating any requirement as mandatory.
MIT OpenCourseWare — Algebra I — Massachusetts Institute of Technology. Used for groups, vector spaces, linear transformations and linear groups. Accessed 2026-08-13.
The Stacks Project — table of contents — The Stacks Project. Used for commutative algebra, homological algebra, modules and derived categories. Accessed 2026-08-13.
