Polynomial interpolation of partial functions in finite algebras with a Mal'cev term

Abstract: We provide polynomial completeness results for finite algebras in congruence permutable varieties. In 2001, Idziak and Słomczy{ń}ska introduced the completeness concept of being \emph{polynomially rich}: a finite algebra is polynomially rich if every function preserving congruences and the Tame Congruence Theory labelling of prime quotients in the congruence lattice is a polynomial function of the algebra. We call a finite algebra \emph{strictly polynomially rich} if every partial congruence and type preserving function is a polynomial function, and we describe strictly polynomially rich algebras in congruence permutable varieties.

• The paper presents a novel concept of strict polynomial richness, proving that every type-preserving partial function in finite Mal'cev algebras can be interpolated by a polynomial.
• It employs clone theory and module-theoretic techniques to derive necessary and sufficient conditions for polynomial interpolation tied to TCT and congruence structure.
• The study classifies strictly k-polynomially rich algebras, demonstrating that structural constraints like distributive congruence lattices are essential for complete interpolation.

Polynomial Interpolation of Partial Functions in Finite Algebras with a Mal'cev Term

Introduction and Background

The paper investigates the problem of polynomial interpolation for partial functions in the setting of finite algebras possessing a Mal'cev term. The focus is on algebras in congruence permutable varieties, enabled by the presence of a Mal'cev term, and situates the inquiry at the confluence of universal algebra, clone theory, and tame congruence theory (TCT). The classical question—given a partial function $f: T \to A$ defined on a finite subset $T \subseteq A^k$ of an algebra $A$, is $f$ the restriction of a polynomial function?—is given a refined structural characterization, extending concepts of rich and complete polynomial behavior from total to partial functions, and from congruence preservation to TCT-type preservation.

Idziak and Słomczyńska (2001) previously introduced the notion of polynomially rich algebras, in which every total function that preserves congruences and the TCT-type labeling of prime quotients is necessarily a polynomial function. This paper introduces the notion of strict polynomial richness for finite algebras: every partial function that is both congruence and type preserving can be interpolated by a polynomial function.

Framework and Key Definitions

The study rests on several layers of algebraic structure and congruence interaction:

1. Polynomial Functions and Clones: For a finite algebra $A$, the clone of polynomial operations is central for representing term functions, with the interpolation problem cast as the existence of solutions in this clone.
2. Congruence and Commutator Theory: The Mal'cev condition, congruence permutability, and the use of commutators $[\cdot, \cdot]$, centralizers $(\cdot : \cdot)$, and their distributivity properties are critical to the fine structure of the congruence lattice and polynomial completeness behavior.
3. Type and Type-Preserving Functions: The behavior of polynomial functions on prime quotients and their labeling via TCT types (particularly types 2 and 3) constitutes the basis for the definition of type-preserving functions. Partial functions are said to be type-preserving if they preserve congruences and all characteristic 4-ary relations $\rho(\alpha, \beta)$ associated to type-2 quotients with $[\beta, \beta] \leq \alpha$.
4. Strictly Polynomially Rich Algebras: An algebra is strictly polynomially rich if all partial functions preserving congruence and type relations can be interpolated by polynomial functions—a significant strengthening over the total function case.

Main Results

Interaction with Near-Unanimity Terms and Distributivity

The paper establishes that various strong partial polynomial completeness properties (such as strict affine completeness and strict polynomial richness) force significant structural constraints, notably that the congruence lattice of the algebra must be distributive when the signature admits near-unanimity terms. This links the function-theoretic property tightly to the TCT structure of the algebra, generalizing previous completeness characterizations.

Classification of Strictly $k$-Polynomially Rich Algebras

A systematic classification is achieved via the notion of strictly $T \subseteq A^k$0-polynomially rich algebras for $T \subseteq A^k$1:

• The key theorem shows: a finite Mal'cev algebra $T \subseteq A^k$2 is strictly polynomially rich if and only if all its homomorphic images are strictly $T \subseteq A^k$3-polynomially rich.
• For $T \subseteq A^k$4, complete characterizations are established for Mal'cev algebras whose homomorphic images are strictly $T \subseteq A^k$5-polynomially rich.
• The result is optimal: for instance, $T \subseteq A^k$6 is strictly $T \subseteq A^k$7-polynomially rich but not strictly $T \subseteq A^k$8-polynomially rich.

The classification involves intricate algebraic and module-theoretic techniques: the module structure of classes modulo congruences with projective and distributive sublattices is crucial, with linear algebraic tools used to explicitly solve interpolation problems on modules over matrix rings.

The (SC1) and (ABp) Conditions

The paper leverages and extends the (SC1) condition (used previously for polynomially rich algebras) as a necessary component for strict polynomial richness. Further, a refined (AB$T \subseteq A^k$9) property on abelian prime quotients is introduced to resolve cases involving module structure and subtypes, parameterizing the interpolation property via the prime decomposition of the underlying module.

• The main structural theorems identify precisely which chains of homogeneous congruences, combined with type and subtype data, allow for strict polynomial richness of given arity.
• These results are strongly module-theoretic for the abelian case: strictly $A$0-polynomially rich modules are fully classified, with only explicit small-dimensional modules (over $A$1, $A$2, $A$3 or their full matrix rings) admitting this property for $A$4.

Homogeneous Series and Lattice-Theoretic Decomposition

A central technique for structuring the congruence lattice is the use of homogeneous series—chains of congruences with highly regular projectivity and distributivity properties—allowing for a stepwise reduction of the interpolation problem to canonical cases (neutral blocks, abelian blocks with certain subtype, etc.). This lattice-theoretic approach permits a modular and inductive proof structure, covering all Mal'cev algebras by their decomposition into congruence-homogeneous factors.

Implications

These results establish that partial polynomial interpolation is a much stricter property than total function interpolation or mere congruence preservation. The interplay with TCT means that strong form polynomial completeness can only occur in very "tame" algebras with sharply restricted congruence and centralizer structure—mostly, these are products of finite fields or their matrix rings in small dimension. The fine-grained module-theoretic analysis yields not only necessary and sufficient conditions but also strong non-completeness results: increasing arity or the presence of higher-dimensional modules or larger primes immediately preclude strict polynomial richness.

The techniques and structure theorems enable algorithmic checks for strict completeness in specific finite algebras, though the paper notes unresolved questions regarding the decidability of (non-strict) affine completeness for finite groups.

Future Directions

Potential developments include:

• Extending the classification to varieties lacking a Mal'cev term but with weaker conditions (e.g., congruence modular or $A$5-permutable varieties).
• Investigating the complexity of deciding strict polynomial richness or strict affine completeness for finite algebras in broader classes.
• Studying connections to clone theory and the complexity of polynomial closures under other relational or operational constraints, as well as implications for CSP-related algebraic dichotomy theorems.

Conclusion

This work provides a comprehensive structural and module-theoretic description of the finite Mal'cev algebras in which every partial type-preserving function is polynomial, introducing and classifying strictly polynomially rich algebras. The main results demonstrate that strict polynomial richness is possible only in a highly constrained class of algebras, closely tied to the structure of their congruence lattices and their TCT types, with module decompositions providing the key to understanding and resolving the interpolation of partial functions. The paper advances the theoretical understanding of polynomial function interpolation in universal algebra, especially in relation to congruence structure and Mal'cev conditions.

Reference:

"Polynomial interpolation of partial functions in finite algebras with a Mal'cev term" (2603.29589)