pith. sign in

arxiv: 1907.03216 · v2 · pith:FMEQT3XZnew · submitted 2019-07-07 · 🧮 math.RA

Is supernilpotence super nilpotence?

Pith reviewed 2026-05-25 01:40 UTC · model grok-4.3

classification 🧮 math.RA
keywords supernilpotencesuper nilpotencefinite algebrasnilpotenceuniversal algebraequivalence
0
0 comments X

The pith

Supernilpotence coincides with super nilpotence for finite algebras.

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

The paper asks if two notions of nilpotence in algebra theory are actually identical. It proves they are the same when the algebra is finite. A reader would care because this removes any practical difference between the notions for all finite structures that arise in applications. If the claim holds, then theorems or classifications using either term apply equally in the finite setting without further checks.

Core claim

We show that the answer to the question in the title is: Yes, for finite algebras.

What carries the argument

The equivalence between supernilpotence and super nilpotence, shown to hold exactly when the algebra is finite.

If this is right

  • Any result proved using supernilpotence applies directly to super nilpotence for finite algebras.
  • The potential distinction between the two notions is confined to infinite algebras.
  • Studies of nilpotent finite algebras can treat the two terms as interchangeable.
  • Classification or structural results for finite nilpotent algebras simplify by merging the two concepts.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • Any counterexample separating the notions must be an infinite algebra.
  • Theorems in papers that use only one of the terms can now be recognized as covering the other term in all finite cases.
  • The result raises the question of whether similar unifications hold for other variants of nilpotence under a finiteness restriction.

Load-bearing premise

The algebras under consideration are finite.

What would settle it

A single finite algebra that satisfies one definition but fails the other would disprove the claim.

read the original abstract

We show that the answer to the question in the title is: ``Yes, for finite algebras.''

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

0 major / 1 minor

Summary. The manuscript poses the question of whether supernilpotence coincides with super nilpotence and answers affirmatively for finite algebras, stating explicitly that the equivalence holds precisely when the algebra is finite and constructing the argument around finiteness-dependent properties such as termination of congruence chains.

Significance. If the result holds, the equivalence clarifies the relationship between these two nilpotence notions in the finite case, which is the setting of primary interest for many computational and classification questions in universal algebra. The explicit restriction to finite algebras and the use of finiteness-specific tools (e.g., guaranteed existence of witnessing terms) are strengths that keep the claim within a well-defined scope.

minor comments (1)
  1. The abstract is extremely terse; a one-sentence indication of the main technical device used in the finite-case proof would improve readability without lengthening the paper substantially.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for the positive report and the recommendation to accept the manuscript.

Circularity Check

0 steps flagged

No circularity; finite-case equivalence proven via finiteness-specific properties

full rationale

The paper's central result is an equivalence (supernilpotence iff super nilpotence) that holds precisely for finite algebras. The abstract and skeptic summary state the restriction explicitly and tie the proof to termination of congruence chains and existence of witnessing terms that are guaranteed only when the algebra is finite. No equations, self-citations, fitted parameters, or ansatzes are quoted that reduce the claim to its own inputs by construction. The derivation is therefore self-contained against external benchmarks and receives the default non-finding.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

Abstract only; no definitions, lemmas, or background results are supplied, so no free parameters, axioms, or invented entities can be identified.

pith-pipeline@v0.9.0 · 5521 in / 911 out tokens · 21710 ms · 2026-05-25T01:40:03.505929+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

18 extracted references · 18 canonical work pages · 2 internal anchors

  1. [1]

    Algebra Universalis 63 (2010), no

    Aichinger, Erhard; Mudrinski, Nebojˇ sa, Some applications of higher commu- tators in Mal’cev algebras. Algebra Universalis 63 (2010), no. 4, 367–403

  2. [2]

    H., Contributions to the theory of loops

    Bruck, R. H., Contributions to the theory of loops. Trans. Amer. Math. Soc. 60, (1946). 245–354

  3. [3]

    Contributions to general algebra, 13 (Velk´ e Karlovice, 1999/Dresden, 2000), 41 –54, Heyn, Kla- genfurt, 2001

    Bulatov, Andrei, On the number of finite Mal’tsev algebras. Contributions to general algebra, 13 (Velk´ e Karlovice, 1999/Dresden, 2000), 41 –54, Heyn, Kla- genfurt, 2001

  4. [4]

    Capelli, Alfredo, Sopra la composizione dei gruppi di sostituzioni. Mem. R. Accad. Lincei 19 (1884), 262–272

  5. [5]

    http://www.uacalc.org

    Freese, Ralph; Kiss, Emil W.; Valeriote, Matthew, Universal Algeb ra Calcula- tor. http://www.uacalc.org

  6. [6]

    London Mathematical Society Lecture Note Series, 125

    Freese, Ralph; McKenzie, Ralph, Commutator theory for congruence modular varieties. London Mathematical Society Lecture Note Series, 125. Cambridge University Press, Cambridge, 1987

  7. [7]

    Contempo- rary Mathematics, 76

    Hobby, David; McKenzie, Ralph, The structure of finite algebras. Contempo- rary Mathematics, 76. American Mathematical Society, Providenc e, RI, 1988

  8. [8]

    Internat

    Kearnes, Keith A., An order-theoretic property of the commutator. Internat. J. Algebra Comput. 3 (1993), no. 4, 491–533

  9. [9]

    Algebra Universalis 37 (1997), no

    Kearnes, Keith A., A Hamiltonian property for nilpotent algebras. Algebra Universalis 37 (1997), no. 4, 403–421

  10. [10]

    Discrete Math

    Kearnes, Keith A.; Kiss, Emil W., Finite algebras of finite complexity. Discrete Math. 207 (1999), no. 1-3, 89–135

  11. [11]

    Al- gebra Universalis 42 (1999), no

    Kearnes, Keith A., Congruence modular varieties with small free spectra. Al- gebra Universalis 42 (1999), no. 3, 165–181

  12. [12]

    Supernilpotence Need Not Imply Nilpotence

    Moore, Matthew; Moorhead, Andrew, Supernilpotence need not imply nilpo- tence. arXiv:1808.04858v2 [math.RA]

  13. [13]

    Moorhead, Andrew, Higher commutator theory for congruence modular vari- eties. J. Algebra 513 (2018), 133–158

  14. [14]

    unpublished manuscript (June 2019)

    Moorhead, Andrew, Supernilpotent Taylor algebras are nilpotent. unpublished manuscript (June 2019)

  15. [15]

    Peirce, Benjamin, Linear Associative Algebra. Amer. J. Math. 4 (1881), no. 1–4, 97–229

  16. [16]

    On the Descending Central Series of Higher Commutators for Simple Algebras

    Weinell, Steven, On the descending central series of higher commutators for simple algebras. arXiv:1812.05151v1 [math.RA]

  17. [17]

    Algebra Universalis 80 (2019), no

    Wires, Alexander, On supernilpotent algebras. Algebra Universalis 80 (2019), no. 1, Art. 1, 37 pp

  18. [18]

    Wright, C. R. B., On the multiplication group of a loop. Illinois J. Math. 13 1969 660–673. E-mail address : kearnes@colorado.edu Department of Mathematics, University of Colorado, Boulde r, CO 80309-0395, USA E-mail address : szendrei@colorado.edu Department of Mathematics, University of Colorado, Boulde r, CO 80309-0395, USA