Pith. sign in

REVIEW 5 minor 36 references

The finite basis problem for matrix semirings $\mathbf{M}_n(S_7)$

T0 review · 0 major / 5 minor · reviewed 2026-07-14 · grok-4.5

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

Pith's one-line read Matrix semirings over the three-element nonfinitely based semiring S7 have no finite identity basis, and every variety between Sc(abc) and Mn(S7) is likewise nonfinitely based.

desk verdict Solid algebraic work: Mn(S7) and the whole interval above Sc(abc) are nonfinitely based, via a clean embedding and a careful matrix case analysis. read the letter →

arxiv 2607.09677 v1 pith:O4PMUY4E submitted 2026-06-12 math.RA

Jun Jiao , Miaomiao Ren This is my paper · ORCID
classification math.RA MSC 16Y6003C0508B15
keywords additivelyidempotentsemiringmatrixfinitebasisproblemnonfinitelybasedvarietyS7flatembeddingtheoremnilpotentmultiplicativereduct
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

The paper studies when a matrix semiring over an additively idempotent semiring can be defined by finitely many identities. It first proves that Mn(S) always embeds into M(n+1)(S) for n≥2, producing an ascending chain of varieties that is strictly ascending when S is the two-element distributive lattice. The main result then shows that every variety lying between the flat eight-element semiring Sc(abc) and the matrix semiring Mn(S7) fails to have a finite identity basis. In particular Mn(S7) itself is nonfinitely based for every n≥2, the interval from V(S7) to V(Mn(S7)) consists entirely of nonfinitely based varieties, and that interval already contains countably infinitely many distinct varieties. A final calculation shows that the multiplicative reduct of Mn(S7) without the constant all-ones matrix is 5-nilpotent, which the authors take as strong evidence that the ascending chain of matrix varieties may stabilize already at n=2.

What carries the argument

The hypergraph identities t_Hn ≈ t_Hn + x_vn, verified by exhaustive case analysis on matrix entries in Mn(S7) (using the Cayley tables of S7 and the non-2-colourability of high-girth 3-uniform hypergraphs), which together with the external Gao–Jackson–Ren criterion force every variety containing Sc(abc) and Mn(S7) to be nonfinitely based.

What would settle it

Exhibit a finite equational basis for Mn(S7) for some n≥2, or produce a concrete variety that contains Sc(abc), satisfies all the hypergraph identities t_Hn ≈ t_Hn + x_vn, yet is still finitely based.

Watch

Extended reading notes

Core claim

Every variety in the interval [V(Sc(abc)), V(Mn(S7))] is nonfinitely based for each n≥2. Consequently Mn(S7) is nonfinitely based, every variety between V(S7) and V(Mn(S7)) is nonfinitely based, and the latter interval contains at least countably infinitely many distinct varieties.

Load-bearing premise

The paper relies on an external criterion that any variety containing the flat semiring Sc(abc) and satisfying a family of hypergraph identities must automatically be nonfinitely based; if that criterion fails, the nonfinite-basis conclusions collapse.

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

0 major / 5 minor

Summary. The paper proves an embedding theorem: for any additively idempotent semiring S and n≥2, Mn(S) embeds into Mn+1(S) by duplicating the last row and column (Theorem 2.1), yielding the ascending chain V(Mn(S))≤V(Mn+1(S)). The chain is shown to be strictly ascending for the two-element distributive lattice D2 via Euler–Fermat-type identities that hold in Mn(D2) but fail in Mn+1(D2) (Proposition 2.3). The main result (Theorem 3.7) establishes that every variety in the interval [V(Sc(abc)),V(Mn(S7))] is nonfinitely based, by verifying that Mn(S7) satisfies the hypergraph identities tHn≈tHn+xvn of the Gao–Jackson–Ren criterion (Lemma 3.1) via exhaustive case analysis on matrix entries (using Propositions 3.2–3.6). Consequently Mn(S7) is nonfinitely based, every variety in [V(S7),V(Mn(S7))] is nonfinitely based, and the latter interval contains at least countably infinitely many distinct varieties (via flat semirings of linear words). The multiplicative reduct of M′n(S7) is shown to be 5-nilpotent but not 4-nilpotent.

Significance. The work advances the finite-basis programme for additively idempotent semirings by settling the status of all matrix semirings over the unique nonfinitely based three-element example S7, and by showing that nonfinite basability propagates throughout the entire interval [V(Sc(abc)),V(Mn(S7))]. This supplies a concrete affirmative answer to Problem 1.1 inside a natural family of algebras and produces an infinite ascending chain of nonfinitely based varieties. The embedding theorem is of independent structural interest and is applied both to D2 and to S7. The 5-nilpotency result for the multiplicative reduct of M′n(S7) is a clean elementary observation that usefully constrains the open question whether the chain stabilizes at n=2. The arguments are self-contained once the external Gao et al. criterion is granted, and the case analysis is fully written out.

minor comments (5)
  1. [Theorem 3.7, Case 3] In the proof of Theorem 3.7, Case 3, the claim that every entry of each A(v) is either 1 or a is asserted without a one-line justification; a brief appeal to the fact that a is additively minimal and that every triple product contributes a would make the argument fully transparent.
  2. [Proposition 5.8] The matrices A,B,C,D used to show that the multiplicative reduct is not 4-nilpotent (Proposition 5.8) are written with ellipsis notation that is slightly ambiguous for n=2; an explicit 2 imes2 display for the base case would remove any doubt.
  3. [Lemma 3.1] The paper repeatedly cites the preprint arXiv:2501.19049 for the key nonfinite-basis criterion. If that work has since appeared in a journal, the published reference should be substituted; otherwise a note that the criterion is used as a black box is already adequate.
  4. [Corollary 3.9] In Corollary 3.9 the embedding of S(5,5158) into a product of three copies of M2(S7) is verified only by the phrase “it is straightforward”; a short verification that the images of the five generators multiply and add correctly would strengthen the claim.
  5. [Abstract / Introduction] Typographical consistency: the abstract and introduction use both “nonfinitely based” and “non-finitely based”; the former is preferred throughout the body and should be standardized.

Circularity Check

1 steps flagged · score 2.0 of 10

Minor load-bearing self-citation of the Gao–Jackson–Ren criterion; independent case analysis that Mn(S7) satisfies the hypergraph identities supplies the genuine content of the nonfinite-basis theorems.

  1. self citation load bearing [Section 3, Lemma 3.1 and Theorem 3.7]
    "The following result is due to Gao et al. [10, Theorem 2.2]. Lemma 3.1. Let V be a variety of ai-semirings that contains the flat semiring Sc(abc). If for every n≥2 there exists a vertex vn∈Vn such that V satisfies the identity tHn≈tHn+xvn, then V is nonfinitely based. … Hence Mn(S7) satisfies the identity (3). By Lemma 3.1, every variety in the interval [V(Sc(abc)),V(Mn(S7))] is nonfinitely based."

    Nonfinite basability of the entire interval is concluded solely by invoking a general criterion whose coauthors include Ren (a coauthor of the present paper). While the paper independently verifies the premise of that criterion for Mn(S7), the decisive implication “satisfies the identities ⇒ nonfinitely based” rests on the self-cited theorem rather than a self-contained argument internal to the manuscript.

full rationale

The paper’s central nonfinite-basis results (Theorem 3.7 and Corollaries 3.8–3.9) are obtained by verifying, via exhaustive elementary case analysis on the possible values of matrix entries (Propositions 3.2–3.6 derived directly from the Cayley tables of S7), that Mn(S7) satisfies the family of hypergraph identities t_Hn ≈ t_Hn + x_vn. The leap from those identities to nonfinite basability is then supplied by the general criterion of Gao et al. (Lemma 3.1 / arXiv:2501.19049), whose author list overlaps with the present paper. That criterion is a parameter-free equational theorem whose hypotheses do not include the matrix constructions under study, so the citation is real external support rather than a definitional loop. All other main results—the embedding monomorphism of Theorem 2.1, the strict chain for D2, the countably infinite ascending chain of subvarieties inside [V(S7),V(M2(S7))], and the 5-nilpotency of the multiplicative reduct of M′n(S7)—are proved by direct constructions and matrix arithmetic with no circular reduction. No fitted parameters, self-definitional identities, smuggled ansätze or renamings of known empirical patterns appear. The score of 2 therefore records only the mild self-citation of the load-bearing criterion; the derivation chain itself is self-contained.

Assumptions & free parameters 0 free parameters · 4 assumptions · 2 invented entities

The paper is pure equational algebra. It relies on standard universal-algebra notions (varieties, free ai-semirings, Birkhoff’s theorem) and on two external results: the Gao–Jackson–Ren nonfinite-basis criterion and the existence of high-girth non-2-colourable 3-uniform hypergraphs. No free parameters are fitted; the only “invented” objects are the concrete matrix constructions and the auxiliary flat semirings S(wk), which are standard constructions already present in the literature.

assumptions (4)
  • domain assumption Gao et al. criterion: any variety of ai-semirings containing Sc(abc) and satisfying t_Hn ≈ t_Hn + x_vn for every n≥2 is nonfinitely based (Lemma 3.1).
    Invoked as a black-box in the proof of Theorem 3.7; the paper does not re-prove it.
  • standard math Existence of 3-uniform hypergraphs Hn that are not 2-colourable and have girth greater than 3inom{3n}{2} (Ham–Jackson).
    Cited from [18, Theorem 2.7] and used to build the identities that force nonfinite basis.
  • standard math Birkhoff’s HSP theorem: varieties of ai-semirings are precisely the equational classes.
    Background for the whole finite-basis problem; stated in the introduction.
  • domain assumption S7 is the unique (up to isomorphism) nonfinitely based three-element ai-semiring.
    Taken from the classification of Jackson–Ren–Zhao and Zhao et al.; used to motivate the choice of base algebra.
invented entities (2)
  • The concrete embedding φ: Mn(S) o Mn+1(S) that duplicates the last row and column independent evidence
    purpose: To produce the ascending chain of varieties V(Mn(S)) ≤ V(Mn+1(S))
    A new but elementary matrix construction; independent evidence is the explicit verification that it preserves multiplication.
  • The flat semirings S(wk) of linear words used to separate varieties inside [V(S7),V(M2(S7))] independent evidence
    purpose: To exhibit a countably infinite ascending chain of distinct varieties
    Standard construction already present in the flat-semiring literature; the novelty is their placement inside the matrix variety.

how reviews work

0 comments
Cite this review

Pith. "Pith review of The finite basis problem for matrix semirings $\mathbf{M}_n(S_7)$." pith.science (2026). https://pith.science/paper/O4PMUY4E

@misc{pith2026260709677,
  author       = {Pith},
  title        = {Pith review of: The finite basis problem for matrix semirings $\mathbfM_n(S_7)$},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/O4PMUY4E}},
  note         = {Machine review of arXiv:2607.09677}
}
abstract

We first prove an embedding theorem for matrix semirings $\mathbf{M}_n(S)$ over an additively idempotent semiring $S$: for all $n \geq 2$, $\mathbf{M}_n(S)$ embeds into $\mathbf{M}_{n+1}(S)$. This yields an ascending chain of varieties $\mathsf{V}(\mathbf{M}_2(S)) \leq \mathsf{V}(\mathbf{M}_3(S)) \leq \cdots$, which is strictly ascending when $S$ is the two-element distributive lattice. We then show that every variety in the interval $[\mathsf{V}(S_c(abc)), \mathsf{V}(\mathbf{M}_n(S_7))]$ is nonfinitely based (i.e., has no finite basis for its identities), where $S_c(abc)$ is an eight-element flat semiring and $S_7$ is the unique nonfinitely based three-element additively idempotent semiring. Consequently, $\mathbf{M}_n(S_7)$ is nonfinitely based, yielding an ascending chain $\mathsf{V}(\mathbf{M}_2(S_7)) \leq \mathsf{V}(\mathbf{M}_3(S_7)) \leq \cdots$; moreover, every variety in $[\mathsf{V}(S_7), \mathsf{V}(\mathbf{M}_n(S_7))]$ is also nonfinitely based, and this interval contains at least countably infinitely many distinct varieties. Although we do not know whether $\mathsf{V}(\mathbf{M}_n(S_7)) = \mathsf{V}(\mathbf{M}_{n+1}(S_7))$ holds, we show that the multiplicative reduct of $\mathbf{M}_n(S_7)$ without the constant matrix $[1]_n$ is $5$-nilpotent, which strongly suggests that the equality may indeed hold for all $n \geq 2$.

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

36 extracted references · 1 canonical work pages

  1. [1]

    Aceto, L., ´Esik, Z., Ing´ olfsd´ ottir, A.: The max-plus algebra of the natural numbers has no finite equational basis. Theoret. Comput. Sci.293(1), 169–188 (2003)

    2003

  2. [2]

    Birkhoff, G.: On the structure of abstract algebras. Proc. Camb. Philos. Soc.31, 433–454 (1935)

    1935

  3. [3]

    Springer, New York (1981)

    Burris, S., Sankappanavar, H.P.: A Course in Universal Algebra. Springer, New York (1981)

    1981

  4. [4]

    Springer Monogr

    Butkoviˇ c, P.: Max-linear systems: theory and algorithms. Springer Monogr. Math. Springer- Verlag London, Ltd., London (2010)

    2010

  5. [5]

    De Schutter, B., De Moor, B.: On the sequence of consecutive powers of a matrix in a Boolean algebra. SIAM J. Matrix Anal. Appl.21(1), 328–354 (1999)

    1999

  6. [6]

    Dolinka, I., Gusev, S.V., Volkov, M.V.: The finite basis problem for the endomorphism semir- ings of finite semilattices. Bull. Belg. Math. Soc. Simon Stevin32(5), 657–674 (2025)

    2025

  7. [7]

    Dolinka, I.: A nonfinitely based finite semiring. Int. J. Algebra Comput.17(8), 1537–1551 (2007)

    2007

  8. [8]

    Algebra Universalis60(1), 19–35 (2009)

    Dolinka, I.: A class of inherently nonfinitely based semirings. Algebra Universalis60(1), 19–35 (2009)

    2009

Show all 36 references
  1. [9]

    Preprint arXiv:2507.03709v1 (2025)

    Edwards, J., Mitchell, J.D., Ragavan, P.: Counting finite semirings. Preprint arXiv:2507.03709v1 (2025)

    2025 arXiv

  2. [10]

    Preprint arXiv:2501.19049 (2025)

    Gao, Z., Jackson, M., Ren, M.M., et al.: The finite basis problem for additively idempotent semirings that relate toS 7. Preprint arXiv:2501.19049 (2025)

    2025 arXiv

  3. [11]

    Manuscript in preparation

    Gao, Z.D., Jackson, M., Ren, M.M., Zhao, X.Z.: A continuum in the lattice of semiring varieties: the interval [V(S),V(S 0)]. Manuscript in preparation. 16 JUN JIAO AND MIAOMIAO REN

  4. [12]

    Kluwer Academic Publishers, Dordrecht-Boston-London (2001)

    G lazek, K.: A Guide to the Literature on Semirings and their Applications in Mathematics and Information Science. Kluwer Academic Publishers, Dordrecht-Boston-London (2001)

    2001

  5. [13]

    Longman Scientific and Technical, Harlow (1992)

    Golan, J.S.: The Theory of Semirings with Applications in Mathematics and Theoretical Computer Science. Longman Scientific and Technical, Harlow (1992)

    1992

  6. [14]

    Gusev, S.V., Volkov, M.V.: Semiring and involution identities of power groups. J. Aust. Math. Soc.115, 354–374 (2023)

    2023

  7. [15]

    Semigroup Forum 106, 403–420 (2023)

    Gusev, S.V., Volkov, M.V.: Semiring identities of finite inverse semigroups. Semigroup Forum 106, 403–420 (2023)

    2023

  8. [16]

    Gusev, S.V., Volkov, M.V.: The finite basis problem for endomorphism semirings of finite chains. Int. J. Algebra Comput., https://doi.org/10.1142/S0218196726400084 (2026)

    2026 doi

  9. [17]

    In preparation

    Gusev, S.V., Volkov, M.V.: The finite basis problem for semirings of triangular Boolean matrices. In preparation

  10. [18]

    Algebra Univers.79, 30 (2018)

    Ham, L., Jackson, M.: Axiomatisability and hardness for universal Horn classes of hyper- graphs. Algebra Univers.79, 30 (2018)

    2018

  11. [19]

    Linear Algebra Appl.387, 143– 165 (2004)

    Han, S.C., Li, H.X.: Indices and periods of incline matrices. Linear Algebra Appl.387, 143– 165 (2004)

    2004

  12. [20]

    Jackson, M.: Flat algebras and the translation of universal Horn logic to equational logic. J. Symbolic Logic73(1), 90–128 (2008)

    2008

  13. [21]

    Jackson, M., Ren, M.M., Zhao, X.Z.: Nonfinitely based ai-semirings with finitely based semi- group reducts. J. Algebra611, 211–245 (2022)

    2022

  14. [22]

    Semigroup Forum, accepted

    Jiao, J., Ren, M.M.: The finite basis problem for matrix semirings over a two-element addi- tively idempotent semiring. Semigroup Forum, accepted. Preprint arXiv:2602.06972 (2026)

    2026

  15. [23]

    Semigroup Forum71(1), 27–48 (2005)

    Kuˇ ril, M., Pol´ ak, L.: On varieties of semilattice-ordered semigroups. Semigroup Forum71(1), 27–48 (2005)

    2005

  16. [24]

    Maclagan, D., Sturmfels, B.: Introduction to Tropical Geometry. Grad. Stud. Math., vol. 161. American Mathematical Society, Providence, RI (2015)

    2015

  17. [25]

    Ren, M.M., Jackson, M., Zhao, X.Z., Lei, D.L.: Flat extensions of groups and limit varieties of additively idempotent semirings. J. Algebra623, 64–85 (2023)

    2023

  18. [26]

    Semigroup Forum110(2), 422–457 (2025)

    Ren, M.M., Liu, J.Y., Zeng, L.L., Chen, M.L.: The finite basis problem for additively idem- potent semirings of order four, I. Semigroup Forum110(2), 422–457 (2025)

    2025

  19. [27]

    Semigroup Forum112(2), 541–573 (2026)

    Ren, M.M., Liu, Z.X., Yue, M.Y., Chen, Y.Z.: The finite basis problem for additively idem- potent semirings of order four, III. Semigroup Forum112(2), 541–573 (2026)

    2026

  20. [28]

    In preparation

    Ren, M.M., Yue, M.Y., Yuan, M.Y., Lyu, S.M., Yang, C.Y., Yu, T.: The finite basis problem for additively idempotent semirings of order four, IV. In preparation

  21. [29]

    Tongji Daxue Xuebao Ziran Kexue Ban24(1), 50–55 (1996) (In chinese) MR1412569

    Shao, J.Y., Guo, J.M.: The Euler-Fermat formula for semigroups of Boolean matrices. Tongji Daxue Xuebao Ziran Kexue Ban24(1), 50–55 (1996) (In chinese) MR1412569

    1996

  22. [30]

    Semigroup Forum91(1), 171–184 (2015)

    Shao, Y., Ren, M.M.: On the varieties generated by ai-semirings of order two. Semigroup Forum91(1), 171–184 (2015)

    2015

  23. [31]

    Preprint arXiv:2412.16113 (2024)

    Volkov, M.V.: Identities of triangular Boolean matrices. Preprint arXiv:2412.16113 (2024)

    2024

  24. [32]

    Algebra Universalis86(4), 33 (2025)

    Yue, M.Y., Ren, M.M., Zeng, L.L., Shao, Y.: The finite basis problem for additively idempo- tent semirings of order four, II. Algebra Universalis86(4), 33 (2025)

    2025

  25. [33]

    Preprint arXiv:2603.00015 (2026)

    Yue, M.Y., Ren, M.M., Gao, Z.D.: Two nonfinitely based additively idempotent semirings of order four. Preprint arXiv:2603.00015 (2026)

    2026

  26. [34]

    Preprint arXiv:2605.15493 (2026)

    Yue, M.Y., Ren, M.M.: A nonfinitely based additively idempotent semiring of order four. Preprint arXiv:2605.15493 (2026)

    2026 arXiv

  27. [35]

    Semigroup Forum108, 479–487 (2024)

    Wu, Y.N., Ren, M.M., Zhao, X.Z.: The additively idempotent semiringS 0 7 is nonfinitely based. Semigroup Forum108, 479–487 (2024)

    2024

  28. [36]

    Ural Math

    Zhao, X.Z., Ren, M.M., Crvenkovi´ c, S., Shao, Y., ¯Dapi´ c, P.: The variety generated by an ai-semiring of order three. Ural Math. J.6(2), 117–132 (2020) School of Mathematics, Northwest University, Xi’an, 710127, Shaanxi, P.R. China Email address:jjunjiao@163.com School of M...

    2020

Pith tools

Reviewed July 14, 2026 · model on record in the stance chip above.