Minion Homomorphism in CSP & PCSP

• Minion homomorphism is an arity-preserving map between minions or clones that preserves minors and encodes height-one identities.
• It plays a pivotal role in classifying CSP and PCSP problems by underpinning algebraic reductions, pp-constructability, and order-theoretic analyses.
• Both concrete and abstract formulations connect polymorphism structures to categorical constructions, enabling canonical core and multisorted generalizations.

Searching arXiv for recent and foundational papers on minion homomorphisms to ground the article. A minion homomorphism is an arity-preserving map between minions or clones that preserves minors, equivalently preserving the height-1 identities encoded by variable identification, permutation, and repetition. In the algebraic theory of constraint satisfaction and promise constraint satisfaction, minion homomorphisms function as the principal morphisms governing reductions, pp-constructability, and the comparison of polymorphism structures. They arise both concretely, as maps between polymorphism minions of relational templates, and abstractly, as natural transformations between functors from finite ordinals to sets (Juhrich, 17 Mar 2025). Recent work places minion homomorphisms at the center of several classification programs: the organization of relaxation hierarchies for PCSPs (Ciardo et al., 2022), the structure of pp-constructability posets (Meyer et al., 2024, Fioravanti et al., 9 Aug 2025), the analysis of multisorted minions (Lehtonen et al., 2020), and canonicalization via minion cores (Barto et al., 2024).

1. Definition and basic formalism

A minion is a graded set of operations equipped with minor maps. In the formulation used for CSPs and PCSPs, a minion $\mathscr{M}$ consists of sets $\mathscr{M}^{(L)}$ of $L$-ary operations together with minor operations indexed by maps $\pi : [L] \to [L']$, satisfying identity and associativity axioms for minors (Ciardo et al., 2022). For clones over a finite domain, the same minor structure is obtained by taking finitary operations and closing under projections and composition; from the viewpoint of minion homomorphisms, only the minor structure is retained (Meyer et al., 2024).

A minion homomorphism $\xi : \mathscr{M} \to \mathscr{N}$ is an arity-preserving map such that for every operation $M \in \mathscr{M}^{(L)}$ and every minor map $\pi : [L] \to [L']$,

$\xi(M_{/\pi}) = \xi(M)_{/\pi}.$

For clones $\mathcal{C}$ and $\mathcal{D}$, the same condition is commonly written as

$\mathscr{M}^{(L)}$0

where $\mathscr{M}^{(L)}$1 (Meyer et al., 2024). This expresses preservation of minors but not of arbitrary composition, and therefore minion homomorphisms are weaker than clone homomorphisms (Fioravanti et al., 9 Aug 2025).

An equivalent viewpoint, emphasized in the abstract-functorial treatment, is that minion homomorphisms are precisely natural transformations between functors $\mathscr{M}^{(L)}$2, where $\mathscr{M}^{(L)}$3 is the category of nonzero finite ordinals and set-maps (Juhrich, 17 Mar 2025). In this formulation, the compatibility condition becomes

$\mathscr{M}^{(L)}$4

for every $\mathscr{M}^{(L)}$5. The same source states that a map is a minion homomorphism iff it preserves height-one identities, namely identities of the form $\mathscr{M}^{(L)}$6 (Juhrich, 17 Mar 2025).

This distinction is fundamental. A clone remembers composition, whereas a minion records only minor behavior. A plausible implication is that minion homomorphisms isolate the part of universal algebra most directly relevant to primitive positive reductions and PCSP polymorphism transfer.

2. Concrete and abstract minions

Concrete minions arise from polymorphisms between relational structures. For finite relational structures $\mathscr{M}^{(L)}$7, the polymorphism minion $\mathscr{M}^{(L)}$8 consists of all functions $\mathscr{M}^{(L)}$9 preserving the relations of $L$0 to those of $L$1, with minor operations given by variable substitutions (Juhrich, 17 Mar 2025). In the special case $L$2, this becomes the usual polymorphism clone viewed as a minion (Ciardo et al., 2022).

Abstract minions are defined as functors $L$3, with minors given functorially by maps between finite ordinals (Juhrich, 17 Mar 2025). This abstract viewpoint makes available categorical constructions such as products, coproducts, quotients, exponentials, and lattice operations, all internal to the category of minions (Juhrich, 17 Mar 2025).

The concrete–abstract correspondence is not merely terminological. The thesis “On abstract and concrete minions” states that every abstract minion is isomorphic to a set-polymorphism minion over a countable set, and that an abstract minion arises as a concrete minion over a finite domain exactly under finite representability conditions (Juhrich, 17 Mar 2025). It further states that every finitely generated minion is finitely representable (Juhrich, 17 Mar 2025). This gives a structural criterion for when abstract minor data can be realized by finite-domain polymorphisms.

The same work locates minion homomorphisms within an order-theoretic setting. The homomorphism order $L$4, defined by the existence of a minion homomorphism $L$5, forms a complete bounded distributive lattice for abstract minions and for locally finite minions, with products as meets and coproducts as joins; moreover, the resulting order is a bi-Heyting algebra (Juhrich, 17 Mar 2025). This places minion homomorphisms in a categorical environment substantially richer than the classical clone lattice.

3. Relation to CSP, PCSP, and reductions

Minion homomorphisms are a central algebraic mechanism in the modern theory of CSPs and PCSPs. For PCSP templates, the thesis on abstract and concrete minions states that if there is a minion homomorphism

$L$6

then there is a log-space reduction

$L$7

(Juhrich, 17 Mar 2025). The same source also records that bounded essential arity targets imply NP-hardness when such a homomorphism exists (Juhrich, 17 Mar 2025).

In the hierarchy framework of “Hierarchies of Minion Tests for PCSPs through Tensors,” minion homomorphisms characterize the soundness of algebraically defined relaxations. The paper states that, for a minion $L$8 and a PCSP template $L$9, the minion test $\pi : [L] \to [L']$0 solves $\pi : [L] \to [L']$1 iff there is a minion homomorphism

$\pi : [L] \to [L']$2

(Ciardo et al., 2022). This is presented as a central algebraic characterization.

That framework unifies several standard hierarchies by associating a base minion to each. The paper explicitly lists bounded width, Sherali–Adams LP, affine IP, Sum-of-Squares SDP, and the combined “LP + affine IP” hierarchy as instances captured by minion tests (Ciardo et al., 2022). The corresponding minions are $\pi : [L] \to [L']$3, $\pi : [L] \to [L']$4, $\pi : [L] \to [L']$5, $\pi : [L] \to [L']$6, and the semi-direct product $\pi : [L] \to [L']$7 (Ciardo et al., 2022). It further states that higher tensor levels strengthen the associated tests and that if one level is sound, then all higher levels are sound (Ciardo et al., 2022).

The conceptual consequence is that minion homomorphisms serve as exact algebraic barriers for entire algorithmic paradigms. Rather than merely witnessing a reduction between templates, they determine whether a specific hierarchy—local consistency, LP, affine, SDP, or hybrid—captures the polymorphism structure required for a given PCSP (Ciardo et al., 2022).

4. pp-constructability and structural thresholds

For finite relational structures, minion homomorphisms coincide with primitive positive constructability comparisons. The paper “Finite Simple Groups in the Primitive Positive Constructability Poset” states that

$\pi : [L] \to [L']$8

in the pp-constructability poset iff there is a minion homomorphism $\pi : [L] \to [L']$9, equivalently iff $\xi : \mathscr{M} \to \mathscr{N}$0 pp-constructs $\xi : \mathscr{M} \to \mathscr{N}$1 (Meyer et al., 2024). The 2025 classification of Mal'cev clones over a three-element set states the same correspondence and uses it as the organizing principle for classification up to pp-constructability (Fioravanti et al., 9 Aug 2025).

A central threshold theorem in (Meyer et al., 2024) concerns the clone $\xi : \mathscr{M} \to \mathscr{N}$2 of all idempotent operations on a two-element set. The paper proves that if a finite-domain clone has a quasi Maltsev operation and fully symmetric operations of all arities, then there exists a minion homomorphism

$\xi : \mathscr{M} \to \mathscr{N}$3

(Meyer et al., 2024). The quasi Maltsev identities are stated there as

$\xi : \mathscr{M} \to \mathscr{N}$4

The proof proceeds by constructing generalized pairing operations, generalized minority operations of all odd arities, and totally symmetric operations of all arities, then invoking a characterization due to Vucaj and Zhuk (Meyer et al., 2024).

This theorem is used to determine lower covers in the pp-constructability poset immediately below the class represented by the structure with all $\xi : \mathscr{M} \to \mathscr{N}$5-invariant relations. According to the same paper, the lower covers are exactly the transitive tournament on three vertices $\xi : \mathscr{M} \to \mathscr{N}$6 and one structure $\xi : \mathscr{M} \to \mathscr{N}$7 for each finite simple group $\xi : \mathscr{M} \to \mathscr{N}$8 (Meyer et al., 2024). These covers are pairwise incomparable, and the classification is tied to finite simple groups and their primitive actions (Meyer et al., 2024).

This suggests that minion homomorphisms do more than encode local identities: they detect global order-theoretic boundaries in the landscape of finite templates. In (Meyer et al., 2024), the presence or absence of a minion homomorphism from $\xi : \mathscr{M} \to \mathscr{N}$9 governs the passage from symmetric/quasi-Maltsev behavior to finite-simple-group obstructions.

5. Classification programs up to minion homomorphism

A major use of minion homomorphisms is coarse classification: many distinct clones collapse into a smaller number of minor-equivalence classes. The 2025 paper on Mal'cev clones over a three-element set states that every Mal'cev clone over a three-element set is minion-homomorphism equivalent to exactly one of 10 canonical classes (Fioravanti et al., 9 Aug 2025). The representatives listed there are $M \in \mathscr{M}^{(L)}$0, $M \in \mathscr{M}^{(L)}$1, $M \in \mathscr{M}^{(L)}$2, $M \in \mathscr{M}^{(L)}$3, $M \in \mathscr{M}^{(L)}$4, $M \in \mathscr{M}^{(L)}$5, $M \in \mathscr{M}^{(L)}$6, $M \in \mathscr{M}^{(L)}$7, $M \in \mathscr{M}^{(L)}$8, and $M \in \mathscr{M}^{(L)}$9 (Fioravanti et al., 9 Aug 2025). The same paper states that these classes are partially ordered by the existence of minion homomorphisms, and that separations are witnessed by specific minor identities such as cyclicity, majority, minority, and specialized systems $\pi : [L] \to [L']$0 (Fioravanti et al., 9 Aug 2025).

A related 2024 paper classifies clones determined by binary relations whose projections to both coordinates have at most two elements. It states that every such clone is, up to minion homomorphisms, equivalent to exactly one canonical multisorted Boolean minion core among $\pi : [L] \to [L']$1, with the entire order explicitly described (Barto et al., 2024). The classification proceeds by translating the problem to multisorted Boolean clones determined by binary relations and reducing descriptions to canonical minion cores (Barto et al., 2024).

For Boolean near-unanimity-closed minions, the 2023 paper “Near-unanimity-closed minions of Boolean functions” gives an order-theoretic description via the minorant-minor partial order. It states that the relevant clonoids correspond to order ideals in the poset of Boolean functions with at most $\pi : [L] \to [L']$2 true points, and that the sets $\pi : [L] \to [L']$3 form a lattice isomorphic to the lattice of order ideals $\pi : [L] \to [L']$4 (Lehtonen, 2023). Although this paper is formulated in terms of clonoids and order ideals, it is part of the same classification program in which minor structure, rather than full composition, is decisive.

These results collectively indicate that classification up to minion homomorphism is often tractable even where inclusion-based clone classification is not. In the three-element Mal'cev setting, the full clone lattice is described as intractable because of continuum many clones, whereas minion homomorphism collapses the family to 10 classes (Fioravanti et al., 9 Aug 2025). In the small-projection binary-relation setting, infinitely many clones reduce to a countable family of canonical cores (Barto et al., 2024).

6. Multisorted generalizations and closure theorems

Minion homomorphisms extend naturally to multisorted settings. In “Reflections and powers of multisorted minions,” a multisorted minion is a minor-closed set of operations between sorted powers, and a multisorted minion homomorphism is a map preserving declarations and minors (Lehtonen et al., 2020). The paper states a multisorted analogue of the Wonderland theorem: $\pi : [L] \to [L']$5 (Lehtonen et al., 2020).

Here $\pi : [L] \to [L']$6 denotes closure under extensions, reflections, and direct powers. The same paper characterizes these closure operations via invariant multisorted relation pairs. In particular, extension closure corresponds to inclusion after minor-closure of relation pairs, reflection closure to existence of a suitable reflection/coreflection satisfying two inclusions, direct power closure to a lifting identity $\pi : [L] \to [L']$7, and combined ERP-closure to the existence of $\pi : [L] \to [L']$8 and a reflection $\pi : [L] \to [L']$9 such that

$\xi(M_{/\pi}) = \xi(M)_{/\pi}.$0

(Lehtonen et al., 2020).

This generalization matters for two reasons. First, many templates and reductions in PCSP naturally involve multiple sorts. Second, the relational description shows that minion homomorphisms are not merely operation-level maps; they correspond to closure-theoretic constructions on invariant relation pairs. A plausible implication is that multisorted minion homomorphisms provide the correct ambient language for comparing heterogeneous templates without forcing artificial one-sorted encodings.

7. Canonical representatives, order structure, and common misconceptions

One recurring theme is that equivalence up to minion homomorphism is best studied through canonical representatives. The notion of a minion core, introduced and applied in the 2024 classification of multisorted Boolean clones, is a minion whose every endomorphism is an automorphism (Barto et al., 2024). That paper states that every finite minion, in a suitable finiteness sense, has a minion core unique up to isomorphism and equivalent to the original minion under minion homomorphisms (Barto et al., 2024). This parallels the role of cores in relational structures and provides a normal form for minor-equivalence classes.

A second theme is the large-scale order structure induced by minion homomorphisms. The thesis on abstract and concrete minions states that some homomorphism orders are uncountable distributive bounded lattices and bi-Heyting algebras (Juhrich, 17 Mar 2025). It also identifies the projection minion as the unique atom and the constant minion as the unique coatom in the abstract setting described there (Juhrich, 17 Mar 2025). This situates minion homomorphism orders among established algebraic and categorical structures rather than treating them as ad hoc reducibility preorders.

Several misconceptions are ruled out by the cited literature.

First misconception: a minion homomorphism is just a clone homomorphism with weaker terminology. This is incorrect. The three-element Mal'cev classification explicitly distinguishes minion homomorphisms from clone homomorphisms by noting that only minor identities are preserved, not those generated by full composition (Fioravanti et al., 9 Aug 2025).

Second misconception: minion homomorphisms are only relevant for ordinary CSPs. The tensor-hierarchy paper shows that they control the soundness of major PCSP relaxations, including Sherali–Adams and Sum-of-Squares (Ciardo et al., 2022), and the abstract/concrete thesis connects them directly to log-space reductions between PCSPs (Juhrich, 17 Mar 2025).

Third misconception: the concept is inherently concrete and domain-bound. The functorial treatment shows that abstract minions and minion homomorphisms exist independently of any fixed finite domain, and categorical constructions such as exponentials and Heyting implication can be formed at that level (Juhrich, 17 Mar 2025).

Taken together, these developments portray minion homomorphism as the natural morphism notion for minor-based algebraic complexity. It mediates between universal algebra, finite model theory, category theory, and the structural theory of CSP and PCSP templates, while also supporting explicit classification theorems, canonical core constructions, and order-theoretic analysis (Meyer et al., 2024, Barto et al., 2024, Juhrich, 17 Mar 2025).