The Setting
Given a finite lattice , for instance the five-element lattice with three pairwise incomparable atoms, is there a finite algebra whose congruences, ordered by inclusion, form a lattice isomorphic to ? Which finite lattices arise in this way is the finite lattice representation problem.
The graph criterion of the paper Finite congruence lattices: characterization and undecidability (OpenAI, preprint, 2026) answers the question with colorings of the edges of a finite complete graph by the elements of .
Algebras and Congruences
An algebra on a set consists of finitely many operations on , the operation having an arity and sending every -tuple of elements of to an element of ; constants, of arity , are allowed, and so is .✦
A congruence of is an equivalence relation on that is compatible with every operation of : whenever satisfy for every , also . The congruence lattice of is the set of its congruences, ordered by inclusion.✦
A partially ordered set is representable, written , when there are an integer , an algebra on and an order isomorphism of onto all of .✦
Colorings and Graph Witnesses
Let be an ordered set and a set. An -coloring of is a map , with the color of the edge and loops counted as edges. A self-map of is admissible for when for all .✦
Fix a finite set of seed edges, ordered pairs of points of . A marked edge of is an ordered pair with and an admissible self-map of , and is the graph on whose edges are the marked edges.✦ Two points and of are connected in when they lie in one class of the equivalence closure of the marked edges.✦
Now let be a lattice with least element , and for a nonempty finite set of seed edges write . An -coloring of is a graph witness when it is symmetric, gives the color to the loops and to no other edge, satisfies the triangle inequality, separates each pair of by an edge whose color lies below and not below , and, for every nonempty finite set of seed edges, connects in every pair of points whose color lies below : for all , all and all such , (1)✦
A lattice with least element has a graph witness when, for some , some -coloring of is a graph witness.✦
The Claim
Theorem 1. Let be a finite lattice with least element . Then (2)✦
In the paper, the result reads: a finite nonempty lattice with least element is the full congruence lattice of a finite algebra if and only if there is an -colored complete graph such that (i) for and , (ii) whenever in , some vertices have and , and (iii) for every nonempty edge set , vertices with lie in one connected component of ; for each fixed these conditions involve only lattice inequalities, finite vertex labelings and paths.
What Is Checked
The claim (2) is stated over finite lattices with least element , algebras with finitely many operations on the sets , their congruences, the ordered set and the property , and over the -colorings of these sets with their admissible self-maps, marked edges, connectivity in , graph witnesses (1) and the lattices that have one.
Let be an ordered set, an -coloring of a set and a finite set of seed edges. A closed marking for is an equivalence relation on that contains every marked edge of .✦ The library proves, for all , (3)✦
For a finite lattice with least element and a finite set , the library defines a decision procedure that assigns to each -coloring of , in finitely many steps, a truth value with (4)✦