SMB-Structure: Semilattice of Mal’cev Blocks

• SMB-Structure is a hybrid algebraic framework that combines a meet-semilattice quotient with individual Mal’cev blocks to model both semilattice and group-like behavior.
• This construction uses a two-level design where the semilattice determines the interaction block and each fiber exhibits full Mal’cev (group-like) operations, crucial for CSP tractability.
• Canonical examples, including two-element, chain, and flat semilattice models, demonstrate how this structured approach underlies algorithmic methods in the CSP dichotomy.

SMB-structure denotes the internal organization of a semilattice of Mal’cev blocks, or SMB algebra: an algebra obtained by “blowing up” each element of a meet-semilattice into a Mal’cev algebra, with the semilattice operation determining the block in which each basic operation is evaluated (Marković et al., 6 Apr 2026). In this construction, the quotient by the canonical block congruence is a semilattice, each block is itself a Mal’cev algebra, and the resulting hybrid combines semilattice-type and Mal’cev-type local behavior. In the formulation studied in “SMB algebras II: On the Constraint Satisfaction Problem over Semilattices of Mal'cev Blocks” (Marković et al., 6 Apr 2026), this structure is central both algebraically and in the analysis of tractable CSP templates.

1. Formal definition

Let $(L,\wedge)$ be a meet-semilattice and, for each $\ell\in L$, let $B_\ell$ be a Mal’cev algebra of the same signature $\tau$ with its Mal’cev term $d_\ell$. The carrier set is defined as

$$A=\bigcup_{\ell\in L}\bigl(\{\ell\}\times B_\ell\bigr),$$

and elements of $A$ are written as pairs $(\ell,b)$ with $\ell\in L$ and $b\in B_\ell$ (Marković et al., 6 Apr 2026).

If $\ell\in L$0 is an $\ell\in L$1-ary basic operation symbol in $\ell\in L$2, then for all $\ell\in L$3,

$\ell\in L$4

In particular, the distinguished ternary term $\ell\in L$5 on $\ell\in L$6 is

$\ell\in L$7

An algebra $\ell\in L$8 is called a semilattice of Mal’cev blocks if it is isomorphic to one obtained by this construction. The defining feature is therefore two-level: a semilattice on the index set and Mal’cev structure on each fiber. The summary in (Marković et al., 6 Apr 2026) emphasizes that this is precisely a way of combining semilattice control with “full Mal’cev (i.e. group-like) behavior” inside each block.

2. Quotient semilattice, fibers, and interaction of levels

The canonical equivalence relation is

$\ell\in L$9

This relation is a congruence of $B_\ell$0, the quotient satisfies $B_\ell$1 as a semilattice, and each block $B_\ell$2 is a Mal’cev algebra isomorphic to $B_\ell$3 (Marković et al., 6 Apr 2026).

Writing $B_\ell$4, the interaction between the semilattice quotient and the fibers is explicit. Each fiber $B_\ell$5 inherits exactly the operations of $B_\ell$6; in particular, $B_\ell$7 is a Mal’cev algebra. If all inputs lie in the same block $B_\ell$8, then $B_\ell$9, so the output remains in $\tau$0. This yields the lemma that each fiber is a subalgebra of $\tau$1 (Marković et al., 6 Apr 2026).

If inputs come from different blocks $\tau$2 and $\tau$3, then any operation first computes $\tau$4 in the quotient semilattice and only then applies the relevant block operation in that lower block. In this sense, the semilattice level determines where interaction occurs, while the Mal’cev level determines how interaction occurs once the destination block has been selected. The source also states that $\tau$5 is the least congruence making the quotient a semilattice and that no smaller congruence yields Mal’cev blocks (Marković et al., 6 Apr 2026).

This organization makes the quotient/fiber decomposition intrinsic rather than accidental. A plausible implication is that many structural arguments on SMB algebras proceed by alternating between global semilattice reasoning and local Mal’cev reasoning, exactly as happens in their CSP analysis.

3. Structural theorems and regularization

The source records several structural results. First, the theorem labeled “SMB-variety” attributes to Marković–Maróti–McKenzie–Prokić the statement that the class of all SMB algebras of signature $\tau$6 is a variety $\tau$7 with a Taylor term (Marković et al., 6 Apr 2026). This places SMB algebras inside the Taylor-algebra framework that is central to the CSP dichotomy.

Second, every finite SMB algebra $\tau$8 has a term-reduct $\tau$9 in which the semilattice operation and the Mal’cev term satisfy additional regularity identities, with the example

$d_\ell$0

and with the SMB-congruence $d_\ell$1 unchanged (Marković et al., 6 Apr 2026). Consequently, one may assume all SMB algebras are “regular.” This regularization does not alter the block decomposition, but it changes the term language so that structural manipulations become more uniform.

Third, the “unital fiber” proposition states that if $d_\ell$2 is an SMB algebra and some fiber $d_\ell$3 has a two-sided neutral element $d_\ell$4 for the semilattice operation, then $d_\ell$5 and $d_\ell$6 is the greatest element of the quotient semilattice (Marković et al., 6 Apr 2026). This is a strong restriction on how neutral elements can appear: they cannot support a nontrivial Mal’cev block.

Taken together, these results show that SMB-structure is not merely a loose amalgam. It is stable under passage to a suitable term-reduct, constrained by congruence-theoretic conditions, and compatible with Taylor-term methods.

4. Canonical examples

The paper summary gives three concrete patterns for SMB-structure (Marković et al., 6 Apr 2026).

Example	Semilattice shape	Block behavior
1	$d_\ell$7 with $d_\ell$8	Two blocks; mixed inputs go to the bottom block
2	Chain $d_\ell$9	Three levels; operations respect the chain order
3	Flat semilattice $$A=\bigcup_{\ell\in L}\bigl(\{\ell\}\times B_\ell\bigr),$$0	Minimal block trivial; maximal blocks are Mal’cev groups

In the two-element example, $$A=\bigcup_{\ell\in L}\bigl(\{\ell\}\times B_\ell\bigr),$$1 and $$A=\bigcup_{\ell\in L}\bigl(\{\ell\}\times B_\ell\bigr),$$2 may be arbitrary Mal’cev algebras. The resulting algebra consists of a “bottom” block and a “top” block, and any operation on elements from different blocks lands in the bottom block. This is the simplest instance of meet-controlled collapse.

In the three-level chain, the source takes $$A=\bigcup_{\ell\in L}\bigl(\{\ell\}\times B_\ell\bigr),$$3 to be a one-point algebra, $$A=\bigcup_{\ell\in L}\bigl(\{\ell\}\times B_\ell\bigr),$$4 to be any group-algebra, and $$A=\bigcup_{\ell\in L}\bigl(\{\ell\}\times B_\ell\bigr),$$5 to be another Mal’cev algebra. The meets $$A=\bigcup_{\ell\in L}\bigl(\{\ell\}\times B_\ell\bigr),$$6, and similarly for lower levels, ensure that operations respect the chain order. This example isolates the role of stratification.

In the flat semilattice example, $$A=\bigcup_{\ell\in L}\bigl(\{\ell\}\times B_\ell\bigr),$$7 is the bottom element and the $$A=\bigcup_{\ell\in L}\bigl(\{\ell\}\times B_\ell\bigr),$$8 are pairwise incomparable. With $$A=\bigcup_{\ell\in L}\bigl(\{\ell\}\times B_\ell\bigr),$$9 trivial and each $A$0 any group, the algebra is flat with a trivial minimal block and multiple maximal Mal’cev blocks. This configuration emphasizes branching rather than layering.

These examples show that SMB-structure can encode both linear and non-linear quotient geometry while keeping the same local Mal’cev mechanism on fibers.

5. SMB-structure in the CSP dichotomy

The source places SMB algebras directly in the algebra–CSP correspondence of Jeavons–Bulatov–Krokhin and states that the complexity of $A$1 depends only on the algebraic structure of the polymorphisms of $A$2 (Marković et al., 6 Apr 2026). In this setting, SMB algebras admit precisely the two “bad” types of local behavior: the semilattice type from the quotient $A$3 and the Mal’cev type in each fiber $A$4.

Special subcases—linear semilattice, flat semilattice, and tree-ordered semilattice—can be handled by combining local Mal’cev algorithms for single-block CSPs with systematic elimination of minimal blocks via the semilattice (Marković et al., 6 Apr 2026). For the full SMB case, tractability is obtained either by Bulatov’s semilattice-of-Mal’cev-block algorithm or by an alternative approach combining link partitions, hypergraph connectivity, consistent maps, retractions, and the concept of $A$5-irreducibility to reduce to Mal’cev CSPs on each fiber.

The same source states that these techniques mirror the two independent proofs of the CSP dichotomy, Bulatov’s and Zhuk’s, and that SMB algebras are the “universal” hard core common to both methods (Marković et al., 6 Apr 2026). This suggests that SMB-structure functions as a distilled model of the interaction between semilattice and Mal’cev phenomena that both proofs must ultimately control.

6. Conceptual role and research context

The 2026 paper presents SMB algebras as a class in which each semilattice element is expanded into a Mal’cev algebra and notes that the paper is the second in a series investigating SMB algebras, as well as a precursor to further research on similarities between the proofs of the Dichotomy Theorem (Marković et al., 6 Apr 2026). Within that context, SMB-structure is used as a common testbed for comparing the two general proofs of the CSP dichotomy.

From the structural point of view, the summary gives a compact synthesis: the semilattice operation controls which block one operates in, while inside each block one has Mal’cev behavior; this mixture yields the only two nontrivial Tame-Congruence-Theory types needed for the CSP dichotomy (Marković et al., 6 Apr 2026). That formulation explains why SMB algebras repeatedly appear as a stepping-stone from special cases to general Taylor-algebra tractability results.

A plausible implication is that SMB-structure is valuable precisely because it is rich enough to exhibit the essential obstruction patterns, but rigid enough to admit explicit decomposition into quotient semilattice and Mal’cev fibers. In the cited work, that balance underlies both its algebraic interest and its algorithmic tractability.