Pith. sign in

REVIEW 3 major objections 4 minor 21 references

The class of congruence meet semidistributive varieties is not strong Maltsev

T0 review · 3 major / 4 minor · reviewed 2026-08-07 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read This paper proves that no single finite package of identities characterizes the class of congruence meet semidistributive varieties.

desk verdict A credible negative answer to Olšák's last open question, but Lemma 3 is not fully verified as written. read the letter →

arxiv 2506.07881 v2 pith:ZXOQPJRN submitted 2025-06-09 math.RA

Andrew Moorhead This is my paper · ORCID
classification math.RA MSC 08B0508B10
keywords congruencemeetsemidistributivestrongMaltsevconditionhigher-dimensionaltermcommutatorfreealgebravarietyofalgebrasconstraintsatisfaction
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

Congruence meet semidistributive varieties are the algebras whose congruence lattices satisfy the implication $\gamma \wedge \alpha = \gamma \wedge \beta \Rightarrow \gamma \wedge (\alpha \vee \beta) = \gamma \wedge \alpha$; they matter in universal algebra because they are exactly the varieties with neutral commutators and, on finite templates, the varieties behind constraint satisfaction problems of bounded width. This paper proves that no single finite package of identities, no strong Maltsev condition, characterizes this class. The proof constructs an infinite chain of finite identity packages $\Sigma_1, \Sigma_2, \ldots$ that together form a Maltsev condition for congruence meet semidistributivity, and then exhibits congruence meet semidistributive varieties $W_l$ that have no $\Sigma_N$-terms for any fixed $N$. If the proof is correct, the last open case among the classical congruence conditions is closed, and any equational description of congruence meet semidistributivity must be genuinely infinite.

What carries the argument

The machinery has two parts. The first is the theory of (2)-congruences, which are compatible equivalence relations on $2\times 2$ matrices; the paper uses the relation $\Delta(\theta_1,\theta_2)$ generated from term-condition commutator matrices and the operators $H$ and $V$ for horizontal and vertical relational composition. From this it derives the condition that the matrix with first row $x,y$ and second row $x,x$ belongs to $(V \circ H)^n(E_V(x,y))$, which is packaged into the finite identity condition $\Sigma_n$. The second part is the family $W_l$ of congruence meet semidistributive varieties whose defining identities $\Lambda_l$ form a ladder of operation symbols $s_0, \ldots, s_{2l+1}$ forcing the same matrix into $\Delta(\gamma,\gamma)$. The load-bearing step is Lemma 3, which states that if a set of terms uses only operation symbols whose indices are at distance at least $2$ from some deleted index $i$, then equality of their outputs in the free algebra $F_l$ is equivalent to equality in the reduced variety $W_{l,i}$; that transfer lets the proof replace the outer operations by projections and contradict the minimality of a hypothetical $\Sigma_N$-witness.

What would settle it

Compute, for $N=1$ and $l=5$, whether the variety $W_l$ has six $6$-ary terms satisfying the identities of $\Sigma_1$; any such terms would refute Theorem 4. A more local test is to enumerate equalities in the free algebra $F_l$ for a small $l$ and check whether every equality among terms whose outer operation indices avoid an index $i$ by distance at least $2$ is already derivable from $\Lambda_{l,i}$; a single equality that is not derivable is a counterexample to Lemma 3.

Watch

Extended reading notes

Core claim

The central claim is that congruence meet semidistributivity is not a strong Maltsev class: there is no finite package of identities in auxiliary operations such that a variety has the package exactly when it is congruence meet semidistributive. Working with higher-dimensional congruences, the paper shows that a variety $V$ is congruence meet semidistributive exactly when the $2\times 2$ matrix with first row $x,y$ and second row $x,x$ lies in the (2)-congruence generated by the elementary $(x,y)$-matrices in the two-generated free algebra of $V$. That membership is then reformulated as a level-$n$ condition $\Sigma_n$ using the vertical and horizontal relational product operators $V$ and $H$. The paper defines varieties $W_l$ presented by identities $\Lambda_l$ on operation symbols $s_0, \ldots, s_{2l+1}$, shows each $W_l$ is congruence meet semidistributive, and proves that whenever $l > 2 \cdot 4^N$, the variety $W_l$ lacks $\Sigma_N$-terms. Since a single strong Maltsev condition would force every $W_l$ to satisfy one fixed $\Sigma_N$, this contradiction establishes the theorem.

Load-bearing premise

The argument rests on Lemma 3, the transfer claim that equalities in the free algebra of $W_l$ can be verified inside the reduced variety $W_{l,i}$ whenever the relevant operation indices stay at distance at least $2$ from the deleted index; the lemma's proof is a table-driven case analysis, and a gap there would break the contradiction argument.

Editorial extensions

If this is right

  • The class of congruence meet semidistributive varieties has no finite equational characterization; every proposed strong Maltsev condition must fail for some variety in the family $W_l$.
  • The conditions $\Sigma_1, \Sigma_2, \ldots$ form a Maltsev condition for congruence meet semidistributivity whose chain does not collapse, so the class cannot be defined by any single finite stage of the chain.
  • The last unresolved case among the classical congruence conditions is settled: congruence meet semidistributivity is known not to be a strong Maltsev class.
  • The obstruction is witnessed by an explicit family: for each $N$, the variety $W_l$ with $l > 2\cdot 4^N$ is a congruence meet semidistributive variety that omits $\Sigma_N$.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The same ladder-and-projection strategy may apply to other properties defined by higher-dimensional congruence closure, such as hypercentrality or related commutator conditions, potentially showing that they too are not strong Maltsev classes.
  • The bound $l > 2\cdot 4^N$ suggests that any finite equational approximation to congruence meet semidistributivity must grow at least exponentially in the number of operation symbols, which could be made into a concrete lower-bound question.
  • For constraint satisfaction, this implies that bounded-width solvability of finite templates cannot be characterized by a fixed finite package of identities on the polymorphism algebra, although the paper does not spell out this CSP-side corollary.
  • Formalizing the case analysis in Lemma 3 would turn the proof into a checkable computation for small values of $l$ and $N$, giving an independent verification of the negative result.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

3 major / 4 minor

Summary. The paper claims to prove that congruence meet semidistributivity is not a strong Maltsev condition: there is no single finite package of identities defining exactly the congruence meet semidistributive varieties. The proof first derives, from the higher-dimensional commutator characterization of congruence meet semidistributivity, a chain of finitely presented conditions Sigma_1, Sigma_2, ... forming a Maltsev condition for the class. It then constructs, for each l, a variety W_l of 4-ary algebras satisfying a package Lambda_l of identities, argues that W_l is congruence meet semidistributive, and builds its free algebra on two generators explicitly. The main combinatorial lemma, Lemma 3, is meant to show that certain term equalities in the free algebra of W_l can be transferred to the free algebra of a reduct W_{l,i} after deleting one operation symbol s_i whose index is far from the indices appearing at the roots of the terms. Theorem 4 uses this transfer, together with a sparse-index argument, to show that for l > 2*4^N the variety W_l does not interpret the variety presented by Sigma_N. Corollary 1 then concludes that no strong Maltsev condition can characterize congruence meet semidistributivity.

Significance. If the proof is correct, it settles an open question highlighted by Olsak and others: whether congruence meet semidistributivity can be characterized by a strong Maltsev condition. The negative answer would be an important contribution to the taxonomy of Maltsev classes in universal algebra and is directly relevant to constraint satisfaction problems, where congruence meet semidistributivity is connected to bounded width. The paper has genuine strengths: Theorem 2 gives a concrete and elegant translation of congruence meet semidistributivity into a statement about membership in iterated (V circle H) of a set of elementary matrices, yielding a plausible Maltsev chain; the construction of W_l and of its free algebra is explicit and substantive; and the overall strategy of using a sparse-index lemma to force a contradiction is coherent. The main weakness is that the proof of Lemma 3, which is load-bearing for Theorem 4, is incomplete as written and is partly delegated to visual inspection of operation tables.

major comments (3)
  1. [Section 3, Lemma 3] Lemma 3 is the load-bearing step of the paper, but its proof is not complete. In the base case k = 0, the text explicitly says 'Suppose that i = 0' and then analyzes only that case; it does not treat the cases where the deleted index is internal or at the right endpoint, even though the connecting identities 3.-7. in the definition of Lambda_l have different shapes there. In the induction step, the proof repeatedly concludes that 'Lambda_{l,i} identities are adequate' or says 'We consult Figure 4' without enumerating the possible equalities that can arise when some argument lies in F_l^{k+1}\F_l^k. In particular, it is not shown that a derivation of an equality between outputs whose outer symbols are in Z can never pass through an identity involving s_i on a subterm. Since Theorem 4 chooses i only after Z has been fixed and uses Lemma 3 to transfer an entire diagram of equalities, this gap directly affects the central claim. A complete proof, or a detailed and exhaustive case analysis, is needed.
  2. [Section 2, definition of Sigma_n after Theorem 2] The paper defines Sigma_n only informally: it says 'we can label each square... assert the obvious identities' and 'the reader can consult Figure 1 for a diagram of the condition Sigma_2'. No explicit list or formal rule for the identities in Sigma_n is given. This matters because Theorem 3 claims that a variety is congruence meet semidistributive iff it has Sigma_n-terms for some n, and Theorem 4 assumes that if V_N interprets in W_l then the membership (V circle H)^N(E_W_l(x,y)) holds. Without an explicit presentation of Sigma_n, the reader cannot verify that the package is finitely presented, that it uses exactly 4n six-ary operation symbols, or that satisfaction of Sigma_n indeed gives the displayed factorization. I request a precise list or an algorithm generating the identities of Sigma_n.
  3. [Section 3, Theorem 4] The passage from matrices to terms in Theorem 4 needs clarification. The sets E_k contain 2-by-2 matrices with entries in F_l^k, and each matrix in E_k is obtained by applying a basic operation to four matrices from E_{k-1}. However, the set T is defined as {s_z(a_j,b_j,c_j,d_j) : z in Z and a_j,b_j,c_j,d_j in F^k}, and the final membership statement uses a union of the matrices alpha_w, beta_w, gamma_w, delta_w. The notation mixes entries with matrices. More importantly, the step 'apply this interpretation by projections to each of the r_1,...,r_{4N}' must transfer all coordinate equalities from W_l to G = F_{W_{l,i}}(F^k), and then to the projection algebra S, in order to produce a factorization of [x y; x x] at level k-1. This transfer is exactly what Lemma 3 is supposed to provide, so Theorem 4 inherits the incompleteness of Lemma 3. The proof should spell out how the equalities among coordinates of the matrices zeta_1,...,zeta_{4N} are preserved under the transfer and under the projection interpretation.
minor comments (4)
  1. [Section 3, definition of Lambda_l] In identity 6, 's_{2l}(xyxx) = s_{2+1}(xyxx)' should presumably read 's_{2l}(xyxx) = s_{2l+1}(xyxx)'.
  2. [Throughout] There are several typos and formatting artifacts: 'principle' should be 'principal', 'algbera', 'refleive', 'satsify', 'McKeznie', and the accents in Czédli and Olšák are corrupted in places. These should be corrected in a final revision.
  3. [Section 3, Figures 3 and 4] The notation p and q in Figure 4 is not explained; it appears that p and q range over elements of F_l^k, but the reader should be told whether the displayed tuples are schematic and how the entries are chosen.
  4. [Section 3, Theorem 4 statement] The theorem is stated as 'The variety V_N does not interpret in the variety W_l', but V_N is not defined before the proof and is only described in the proof as the class of algebras satisfying the Sigma_N-identities. The statement should introduce V_N explicitly.

Circularity Check

0 steps flagged · score 0.0 of 10

No circular steps; the negative strong-Maltsev result is derived from an independent higher-dimensional commutator characterization and a self-contained free-algebra construction.

full rationale

The claimed derivation chain is not circular. The target is the absence of a finite strong Maltsev characterization of congruence meet semidistributive varieties. Section 2 builds a Maltsev condition Sigma_n from Theorem 1, which is quoted from the author's earlier paper [15]. That theorem (CMS iff Delta(alpha,alpha)=R(alpha,alpha)) is load-bearing for the construction, but it is an independent published result about the commutator and higher-dimensional congruences; its statement does not include the target result and it is not used as a self-justifying uniqueness claim. Under the stated rules, such a citation is real evidence and does not, by itself, make the derivation circular. The equivalence in Theorem 2 is proved directly from the definition of Delta and the relation operators, and Theorem 3 only labels matrices to extract the identities Sigma_n. The negative result then rests on the explicit free algebra F_l (Lemma 2), the transfer Lemma 3, and the projection interpretation of Lemma 1; none of these is a renamed version of the conclusion. In particular, Lemma 3 is a nontrivial transfer statement rather than a restatement of the definition of W_{l,i}; even if its proof is incomplete (the base case is only shown for i=0 and the inductive step refers to unenumerated figure checks), an omitted case check is a correctness risk, not circularity. There are no fitted parameters, no quantity is called a prediction after being used as an input, and no known empirical pattern is repackaged as a new result. The paper's self-citations are substantial but do not force the conclusion.

Assumptions & free parameters 0 free parameters · 3 assumptions · 0 invented entities

No numerical parameters are fitted to data. The construction depends on integer parameters l and N, but these are combinatorial indices, not fitted constants. No new physical or ontological entities are introduced; the operation symbols and varieties W_l are proof-theoretic constructions, not postulates with independent empirical evidence.

assumptions (3)
  • domain assumption Theorem 5.2 of Moorhead [15], used as Theorem 1: V is congruence meet semidistributive if and only if Delta(alpha,alpha)=R(alpha,alpha) for every congruence alpha of every algebra in V.
    Invoked at the start of Section 2 as the characterization of CMS that generates the Maltsev condition; not reproved in this paper and imported from the author's own earlier work.
  • domain assumption The term condition commutator is neutral on CMS varieties: [alpha,beta]=alpha meet beta for all congruences, and conversely (Kearnes-Szendrei; Lipparini).
    Cited in the introduction to connect CMS with commutator neutrality; the paper's proof assumes this background from the literature.
  • standard math Standard universal algebra facts: varieties have free algebras, and term interpretations compose to give new interpretations.
    Used throughout Sections 2 and 3 without proof.

how reviews work

0 comments
Cite this review

Pith. "Pith review of The class of congruence meet semidistributive varieties is not strong Maltsev." pith.science (2026). https://pith.science/paper/ZXOQPJRN

@misc{pith2026250607881,
  author       = {Pith},
  title        = {Pith review of: The class of congruence meet semidistributive varieties is not strong Maltsev},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/ZXOQPJRN}},
  note         = {Machine review of arXiv:2506.07881}
}
read the original abstract

We present a proof that there is no single finite package of identities which characterizes the class of congruence meet semidistributive varieties.

Figures

Figures reproduced from arXiv: 2506.07881 by the authors.

Figure 1
Figure 1. Diagram of the condition Σ2 We also have the following matrix which is a generator of ∆(α, α): a c a c ∈ ∆(α, α). Hence, we have the following three matrices (the first matrix is obtained by applying (2)-reflexivity): b a a a , a c a c c d c c ∈ ∆(α, α). Applying (2)-transitivity leads to the desired conclusion, i.e. that ∆(α, α) = R(α, α). Item 3. of Theorem 2 leads to a Maltsev condition that characterizes congrue… view at source ↗
Figure 2
Figure 2. The condition Λl where, as usual, γ is the congruence of FWl (x, y) generated by the pair (x, y). The reader can consult [PITH_FULL_IMAGE:figures/full_fig_p008_2.png] view at source ↗
Figure 3
Figure 3. The operation definitions for the partial [PITH_FULL_IMAGE:figures/full_fig_p009_3.png] view at source ↗
Figures from the paper (1 more)
Figure 4
Figure 4. Figure 4: The operation definitions for the partial [PITH_FULL_IMAGE:figures/full_fig_p009_4.png]

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

21 extracted references · 21 canonical work pages

  1. [1]

    Barto and M

    L. Barto and M. Kozik. Constraint satisfaction problems of bounded width. In Proceedings of the Annual Symposium on Foundations of Computer Science (FOCS) , pages 595–603, 2009

    work page 2009

  2. [2]

    S. N. Burris and H. P. Sankappanavar. A Course in Universal Algebra . Springer Verlag, Berlin, 1981

    work page 1981

  3. [3]

    Cz´ edli

    G. Cz´ edli. A characterization for congruence semidistributivity. InUniversal algebra and lattice theory (Puebla, 1982), volume 1004 of Lecture Notes in Math., pages 104–110. Springer, Berlin, 1983

    work page 1982

  4. [4]

    A. Day. A characterization of modularity for congruence lattices of algebras. Canad. Math. Bull., 12:167–173, 1969

    work page 1969

  5. [5]

    Freese and R

    R. Freese and R. McKenzie. Commutator theory for congruence modular varieties , volume 125 of CUP Archive. Cambridge University Press, 1987

    work page 1987

  6. [6]

    R. S. Freese, R. N. McKenzie, G. F. McNulty, and W. F. Taylor. Algebras, lattices, varieties. Vol. II, volume 268 of Mathematical Surveys and Monographs. American Mathematical Society, Providence, RI, 2022

    work page 2022

  7. [7]

    Hagemann and A

    J. Hagemann and A. Mitschke. On n-permutable congruences. Algebra Universalis , pages 8–12, 1973

    work page 1973

  8. [8]

    J´ onsson

    B. J´ onsson. Algebras whose congruence lattices are distributive. Mathematica Scandinavica, 21:110–121, 1967

    work page 1967

Show all 21 references
  1. [9]

    K. A. Kearnes and E. W. Kiss. The Shape of Congruence Lattices , volume 222 (1046) of Memoirs of the American Mathematical Society . American Mathematical Society, 2013

    2013

  2. [10]

    K. A. Kearnes and A. Szendrei. The relationship between two commutators. Internat. J. Algebra Comput., 8(4):497–531, 1998

    1998

  3. [11]

    K. A. Kearnes, A. Szendrei, and R. Willard. Characterizing the commutator in varieties with a difference term. Algebra Universalis, 83(2):Paper No. 17, 29, 2022

    2022

  4. [12]

    Kozik, A

    M. Kozik, A. Krokhin, M. Valeriote, and R. Willard. Characterizations of several Maltsev conditions. Algebra Universalis, 73(3-4):205–224, 2015

    2015

  5. [13]

    Lipparini

    P. Lipparini. A characterization of varieties with a difference term. II. Neutral = meet semi- distributive. Canad. Math. Bull. , 41(3):318–327, 1998

    1998

  6. [14]

    R. N. McKeznie, G. F. McNulty, and W. F. Taylor. Algebras, Lattices, Varieties (Volume 1) . American Mathematical Society, 1987

    1987

  7. [15]

    Moorhead

    A. Moorhead. Supernilpotent Taylor algebras are nilpotent. Trans. Amer. Math. Soc. , 374(2):1229–1276, 2021

    2021

  8. [16]

    Moorhead

    A. Moorhead. Higher Kiss terms. Internat. J. Algebra Comput. , 32(6):1233–1259, 2022

    2022

  9. [17]

    Moorhead

    A. Moorhead. Mal’cev complexes. Internat. J. Algebra Comput. , 34(6):919–936, 2024. 15

    2024

  10. [18]

    Olˇ s´ ak

    M. Olˇ s´ ak. The weakest nontrivial idempotent equations.Bulletin of the London Mathematical Society, 49(6):1028–1047, 2017

    2017

  11. [19]

    Olˇ s´ ak

    M. Olˇ s´ ak. Maltsev conditions for general congruence meet-semidistributive algebras.J. Symb. Log., 86(4):1432–1451, 2021

    2021

  12. [20]

    M. H. Siggers. A strong Mal’cev condition for varieties omitting the unary type. Algebra Universalis, 64(1):15–20, 2010

    2010

  13. [21]

    R. Willard. A finite basis theorem for residually finite, congruence meet-semidistributive vari- eties. J. Symbolic Logic, 65(1):187–200, 2000. 16

    2000

Pith tools

Reviewed August 7, 2026 · model on record in the stance chip above.