[Paper Review] Local structure of idempotent algebras I

Andreǐ A. Bulatov|arXiv (Cornell University)|Jun 17, 2020

Advanced Algebra and Logic4 citations

TL;DR

This paper introduces a refined graph-based structure for finite idempotent algebras, classifying edges into four types—set, semilattice, majority, and affine—based on local term operations. It establishes connectivity and thinning properties for edges in algebras omitting type 1, enabling stronger structural control and simplifying proofs of CSP-related results, including a streamlined proof of the Dichotomy Conjecture in subsequent work.

ABSTRACT

We refine and advance the study of the local structure of idempotent finite algebras started in [A.Bulatov, The Graph of a Relational Structure and Constraint Satisfaction Problems, LICS, 2004]. We introduce a graph-like structure on an arbitrary finite idempotent algebra including those admitting type 1. We show that this graph is connected, its edges can be classified into 4 types corresponding to the local behavior (set, semilattice, majority, or affine) of certain term operations. We also show that if the variety generated by the algebra omits type 1, then the structure of the algebra can be `improved' without introducing type 1 by choosing an appropriate reduct of the original algebra. Taylor minimal idempotent algebras introduced recently is a special case of such reducts. Then we refine this structure demonstrating that the edges of the graph of an algebra omitting type 1 can be made `thin', that is, there are term operations that behave very similar to semilattice, majority, or affine operations on 2-element subsets of the algebra. Finally, we prove certain connectivity properties of the refined structures. This research is motivated by the study of the Constraint Satisfaction Problem, although the problem itself does not really show up in this paper.

Motivation & Objective

• To refine the local structure theory of finite idempotent algebras, extending it to include algebras that admit type 1.
• To define a graph on the algebra’s elements where edges are classified by the behavior of term operations (semilattice, majority, affine, or set-type).
• To demonstrate that algebras omitting type 1 can be restructured via reducts to improve local behavior without reintroducing type 1.
• To introduce and analyze 'thin' edges—where term operations satisfy identities only on specific variable assignments—enabling stronger connectivity results.
• To establish foundational connectivity and permutation properties in the refined edge structure for use in Constraint Satisfaction Problem (CSP) theory.

Proposed method

• Define a graph on the elements of a finite idempotent algebra, where an edge $ ab $ exists if a factor algebra of $ ext{Sg}(a,b) $ supports a semilattice, majority, or affine operation on the blocks containing $ a $ and $ b $.
• Extend edge classification to include 'unary type' (set-type) edges, where the factor is a set, and allow multiple edge types per pair if multiple operations witness different behaviors.
• Introduce 'thin' edges by requiring term operations to satisfy identities (e.g., $ m(a,b,b) = b $) only for specific variable assignments, not symmetrically.
• Define 'oriented thin' edges to distinguish directionality in operations, enabling stronger connectivity arguments in the graph.
• Use tame congruence theory and term operation identities to prove that thin edges support operations that project or permute elements in factor algebras modulo congruences.
• Construct term operations (e.g., $ t_{ab}(x,y) = r(x, g(x,y,y)) $) that preserve edge types and induce desired behavior on affine or majority edges in factor algebras.

Experimental results

Research questions

• RQ1 How can the local structure of finite idempotent algebras be refined to include those admitting type 1, and what new structural invariants emerge?
• RQ2 Can the edge classification in the algebra’s graph be extended to include set-type edges and multiple edge types per pair?
• RQ3 What properties do 'thin' edges—where identities hold only for specific variable orders—exhibit, and how do they improve connectivity?
• RQ4 How can oriented thin edges be used to strengthen connectivity results in the graph of an algebra?
• RQ5 What is the role of reducts in improving algebraic structure without reintroducing type 1, and how do they relate to Taylor minimal algebras?

Key findings

• The graph of a finite idempotent algebra is connected, with edges classified into four types based on local term operation behavior: set, semilattice, majority, or affine.
• For algebras omitting type 1, a reduct can be chosen that preserves the algebra’s structure while eliminating type 1, and such reducts include Taylor minimal algebras as a special case.
• Edges in algebras omitting type 1 can be made 'thin', meaning there exist term operations satisfying semilattice, majority, or affine identities only on specific variable assignments, not symmetrically.
• Oriented thin edges allow for stronger connectivity results, as demonstrated by the existence of term operations that project or permute elements in factor algebras modulo congruences.
• The paper constructs specific term operations (e.g., $ t_{ab}(x,y) = r(x, g(x,y,y)) $) that satisfy required identities on thin edges and preserve behavior across different edge types.
• The refined structure supports a stronger version of connectivity, enabling a simplified proof of prior results on CSPs, including the characterization of solvability by consistency algorithms.