Pith. sign in

REVIEW 5 major objections 5 minor 11 references

Bioperational Multisets in Various Semi-rings

T0 review · 5 major / 5 minor · reviewed 2026-08-14 · deepseek-v4-flash

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

Pith's one-line read The paper proves that in five arithmetical domains—whole numbers, integers, Gaussian integers, Eisenstein integers, and Z[√2]—every element with a non-trivial factorization can be padded into a minimal multiset whose sum equals its…

desk verdict A fun, mostly sound constructive paper on sum-product multisets, held back by a zero-quantifier bug in the main theorem and a few small gaps. read the letter →

arxiv 1908.03235 v1 pith:CG5IBGP7 submitted 2019-08-08 math.RA math.NT

Onno M. Cain This is my paper · ORCID
classification math.RAmath.NT MSC 16Y6011R04
keywords bioperationalmultisetequalsumandproductsemiringsGaussianintegersEisensteinlunararithmeticquadraticintegerringsconstructiveenumeration
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

A bioperational multiset is a list of numbers whose sum equals their product; {1,2,3} is the classic example, since 1+2+3=1·2·3=6. The paper asks which values can appear as that common sum and product, and answers the question constructively in whole numbers and six further domains: integers, general fields, lunar integers, Gaussian integers, Eisenstein integers, and Z[√2]. Its main theorem, Theorem 10.1, bundles five of those domains and says that every element that factors into non-units admits a non-trivial minimal bioperational multiset. The proof mechanism is padding: start with a factorization of the target, then append ones or small product-fixing blocks such as {−1,−1,1} to force the sum to match the product. Over fields the paper gives an exhaustive classification: every non-trivial bioperational multiset is obtained by adjoining the single element σ(S)/(π(S)−1), with only trivial repeated-element exceptions.

What carries the argument

The central object is the bioperational multiset itself, together with the operation of bioperating a multiset by appending elements that fix the product while shifting the sum. Three ingredients carry the argument: Lemma 3.3, that a product of reals at least 2 is at least their sum, which turns into the padding construction with additional 1s; Lemma 5.1, the field appendage formula a_{n+1} = σ(S)/(π(S)−1), which makes the field case exhaustive; and a small inventory of product-fixing blocks in the other rings, including T1 = {1}, T0 = {1,1,−1,−1}, T−1 = {1,−1,−1}, T±2i = {±i, ±i, −1, 1}, T±ω, and T±2√2 = {±1±√2, ∓1±√2}. Parity homomorphisms modulo 2, defined by the imaginary part or the coefficient of √2, match the parity of the sum and product coefficients before and after bioperating.

What would settle it

Work out a specific lunar multiplication from the definition cited in the paper, for example 17·7 or 99·99, and count the digits of the result. If any pair of lunar integers gives a product whose digit length is not the sum of the digit lengths minus one, then Lemma 6.1 and Theorem 6.2 lose their premise and the lunar enumeration would need a different proof; if the identity holds on all tested pairs, the lunar theorem keeps its support.

Watch

Extended reading notes

Core claim

On the paper's own terms, the central discovery is Theorem 10.1: if R is one of N, Z, Z[i], Z[ω], or Z[√2], then for every µ ∈ R that factors into non-units there exists a non-trivial minimal bioperational multiset over R with sum-product µ. The constructions are explicit. For N, any composite m = a1···ak yields a witness by appending π(S)−σ(S) copies of 1 to the factor multiset. For Z and the three quadratic rings, the same idea is adapted using appendages that leave the product unchanged while shifting the sum by ±1, ±2i, ±ω, or ±2√2, with parity homomorphisms modulo 2 deciding which appendage is needed. For fields, Theorem 5.2 is a full classification: a non-trivial multiset is bioperational exactly when it arises from Lemma 5.1 by adjoining σ/(π−1), and every exception is a trivial collection of n equal elements satisfying n = $a^{{n−1}}$. In lunar integers the paper claims the opposite extreme—every minimal bioperational multiset is trivial—based on digit-length identities for lunar arithmetic.

Load-bearing premise

The lunar-integers portion of the enumeration stands on the digit-length identity D(ab)=D(a)+D(b)−1 (together with D(a+b)=max(D(a),D(b))); if that is not the multiplication rule of the target semi-ring, the claim that all minimal lunar bioperational multisets are trivial does not follow.

Editorial extensions

If this is right

  • For every composite positive integer m, a witness multiset can be written down directly from any factorization: pad the factors with copies of 1 until the sum reaches the product.
  • In Z and in Z[i], Z[ω], and Z[√2], the theorem reaches negative and complex targets as well, as long as the target has a factorization into non-units.
  • In any field, there are no hidden bioperational multisets: the family is parametrized by a single-appending formula, with trivial repeated-element exceptions.
  • The lunar-integers section, if its digit-length premise is accepted, asserts that no genuinely minimal bioperational multiset exists in lunar arithmetic; all non-trivial examples are trimmed versions of trivial ones.
  • The paper's open problems extend the same question to quaternions, where multiplication order matters, and to quadratic integer rings beyond Z[√2].

Reading between the lines

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

  • The real leverage of the paper is the padding strategy itself: any integral domain with a supply of product-fixing appendages and a usable parity invariant should admit the same theorem, making the quadratic-ring proofs templates for other Z[√d].
  • Because Theorem 10.1 is constructive, one can generate witnesses algorithmically from factorizations; counting the number of minimal witnesses for each target is a natural next question not addressed in the paper.
  • The lunar-integers claim is the only part of the abstract's enumeration that depends on a digit-length rule rather than on ordinary ring arithmetic; if that rule is altered or challenged, the lunar classification would need to be re-proved directly from the multiplication table.
  • The field classification suggests a broader dichotomy: bioperational multisets are abundant wherever product-fixing appendages exist and scarce elsewhere; identifying rings where the theorem fails would sharpen the boundary.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

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

Referee Report

5 major / 5 minor

Summary. The paper defines a bioperational multiset as a finite multiset whose sum equals its product, and claims to enumerate all possible sum-products over N, Z, fields, lunar (dismal) integers, Gaussian integers, Eisenstein integers, and Z[√2]. The main constructive results are Theorem 3.4 for composite integers in N, Theorem 4.1 for Z, Lemma 5.1/Theorem 5.2 characterizing fields, Theorem 6.2 for lunar integers, and Theorems 7.3, 8.1, 9.3 for the three quadratic rings, bundled as Theorem 10.1. The paper also includes parity lemmas for Z[i] and Z[√2], and lists open problems.

Significance. If the nonzero cases are isolated, the paper provides explicit, checkable constructions for bioperational multisets over several rings and a clean field characterization. The parity lemmas for Z[i] and Z[√2] are elegant and are verified by hand. The paper is honest about computational evidence and does not rely on circular reasoning or fitting. However, the central bundled theorem is false as stated because it includes the zero sum-product, and several proofs have repairable but real gaps. The lunar section's digit-length premise is actually correct under standard dismal arithmetic, contrary to one circulated objection; the real lunar concern is a missing digitwise argument in Theorem 6.2. Overall the manuscript is a solid draft whose central claims are defensible after a nonzero restriction and proof repairs.

major comments (5)
  1. [Theorem 10.1; Theorems 7.3, 8.1, 9.3] As stated, Theorem 10.1 is false for µ=0. In any integral domain, a multiset with sum-product 0 must contain 0, and then its total sum is 0, so the singleton {0} is a proper submultiset with the same sum and product; hence no nontrivial minimal bioperational multiset has sum-product 0. Since 0 factors into non-units (for example, 0=0·2 in Z), the quantified claim includes µ=0. The minimality argument in Theorem 7.3, that ai=µ forces the remaining factors to be units, fails for µ=0 because product of the remaining factors need not be 1. The same issue affects Theorems 8.1 and 9.3. The fix is to restrict the theorem and the preceding statements to nonzero µ, i.e. to non-vanishing sum-products, and to adjust the abstract accordingly.
  2. [Lemma 3.3] The induction step in Lemma 3.3 is not justified as written. From an+1 > π(S)^k one cannot infer an+1−1 ≥ π(S)^k for real numbers, and the two displayed inequalities need not hold simultaneously; for example, if π(S)=2 and an+1=2.1, then an+1−1=1.1 < 2 and an+1 < 2^{k+1} fails for k=1. Since Lemma 3.3 is the load-bearing step in Theorem 3.4 and Corollary 3.4.1, a correct proof of the lemma is needed. The lemma itself is true and can be proved by a direct induction using the induction hypothesis π(S)≥σ(S) and the fact that all elements are at least 2.
  3. [Theorem 5.2] The proof of Theorem 5.2 divides by a1 after deriving that all ai are equal, but it never rules out a1=0. If some ai=0, then π(S'_i)=π(S)/ai is undefined and the preceding inference π(S'_i)=1 does not apply. This is patchable: if a non-producible multiset had a zero element, then removing it would leave a multiset with product 0, contradicting the assumption that no proper submultiset can be used in Lemma 5.1; nevertheless the proof as printed has a gap. The field characterization may be true, but the division-by-zero step must be addressed.
  4. [Theorem 6.2] The final step of Theorem 6.2, that F(a1)=a2=...=an implies S'={a1} has the same sum-product as S, does not follow from the displayed equality of maxima and minima alone. One must use the full bioperational equality digitwise to show that every digit of a1 is at most d=F(a1); otherwise, for example, 62⊗2=22 while 62+2=62 in dismal arithmetic. The theorem may still be true, but the proof needs this added digitwise argument before the minimality conclusion is valid.
  5. [Theorem 3.2] Theorem 3.2 is stated with proof 'From computation', but no computation, algorithm, or verifiable certificate is supplied in the paper. Since the abstract advertises enumeration, a finite exhaustive check should be documented or referenced with enough specificity for the reader to reproduce it; as written, this is an unproved assertion.
minor comments (5)
  1. [Section 3, proof of Theorem 3.1] In the proof of Theorem 3.1 for n=4, the line '4a ≥ a+b+c = abc ≥ 8a' should read 'a+b+c+d = abcd'; the displayed equality is a typo, though the corrected inequality appears a few lines later.
  2. [Theorems 7.3 and 9.3] The word 'bioperationl' is misspelled; it should be 'bioperational' in both theorem statements.
  3. [Section 6] The paper says it will not explain lunar arithmetic, but all of Section 6 rests on the digit-length identities. A one-sentence definition of lunar addition and multiplication (digitwise max and digitwise min with shift-and-max addition) would make the section self-contained and let readers verify the identities independently.
  4. [Section 2] The definitions of 'trivial' and 'vanishes' are clear, but the term 'non-vanishing' is used in Theorems 3.1 and 3.2 without an explicit definition; adding 'non-vanishing means the sum-product is not zero' would remove ambiguity.
  5. [References] Reference [7] points to a GitHub repository and Repl.it; if these are intended to support Theorem 3.2, they should be cited inside the proof and archived or versioned so the computation is reproducible.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity: the paper's constructions are direct and its only self-citation is a non-load-bearing computational side note.

full rationale

The central claims are proved by explicit construction rather than by fitting or by definitional circularity. Theorem 3.4 constructs, for every composite m, a bioperational multiset over N by taking a factorization m = a1...ak and appending ones until the sum equals the product; no parameter is fitted to the target sum-product. Theorem 4.1 and the ring theorems (7.3, 8.1, 9.3) proceed by appending explicitly verified product-fixing appendages (T±1, T0, T±2i, T±ω, T±2√2) and shaving to minimality; the appendages are checked by direct multiplication. Lemma 5.1 solves the linear equation a_{n+1} = σ(S)/(π(S)-1), which is an algebraic derivation, not a restatement of the classification. Theorem 10.1 merely bundles these direct proofs. The only self-citation is reference [7], the author's own GitHub and Repl.it code, used in the one-line proof of Theorem 3.2 ('Proof. From computation.'); that length-5 enumeration is a side example and is not load-bearing for the paper's main enumeration result, which is supplied by the constructive Theorem 3.4. The lunar arithmetic digit identities are attributed to external sources (Dismal Arithmetic and Numberphile), not to the author, and no prediction is made from fitted values. Any concern about the printed quantifier in Theorem 10.1 admitting µ=0 would be a correctness or edge-case issue, not circularity, because it does not involve a result being defined in terms of its own conclusion.

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

The paper introduces no fitted parameters and postulates no new entities. It relies on standard algebraic properties of integral domains and units, plus the cited lunar arithmetic identities, the latter of which are false for the multiplication rule.

assumptions (4)
  • domain assumption The arithmetic of lunar integers satisfies the dismal arithmetic rules cited from [10], including D(ab)=D(a)+D(b)-1 and D(a+b)=max{D(a),D(b)}.
    Section 6, Lemma 6.1 derives the at-most-one-multi-digit-element property from these identities. The multiplication identity is false in standard dismal arithmetic, so this assumption fails and the lunar proofs are invalid.
  • standard math Each of Z[i], Z[ω], and Z[√2] is an integral domain with the stated units, so a sub-multiset preserving the product must contain every non-unit factor.
    Used in Theorems 7.3, 8.1, and 9.3 to argue that a minimal sub-multiset cannot drop a non-unit and must therefore be non-trivial.
  • standard math Every element µ in the statement of Theorem 10.1 that factors into non-units has a factorization with at least two non-unit factors.
    The constructions in Theorems 4.1, 7.3, 8.1, and 9.3 start from such a factorization; for primes or units no such factorization exists and the theorem is silent.
  • standard math The residue maps φ in Lemmas 7.2 and 9.2 are well-defined and multiplicative on the residue classes checked by hand.
    The checks are explicit in the paper and are correct, giving the parity obstructions that the bioperation constructions require.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Bioperational Multisets in Various Semi-rings." pith.science (2026). https://pith.science/paper/CG5IBGP7

@misc{pith2026190803235,
  author       = {Pith},
  title        = {Pith review of: Bioperational Multisets in Various Semi-rings},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/CG5IBGP7}},
  note         = {Machine review of arXiv:1908.03235}
}
read the original abstract

One can find lists of whole numbers having equal sum and product. We call such a creature a bioperational multiset. No one seems to have seriously studied them in areas outside whole numbers such as the rationals, Gaussian integers, or semi-rings. We enumerate all possible sum-products for a bioperational multiset over whole numbers and six additional domains.

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

11 extracted references · 11 canonical work pages

  1. [1]

    https://www.youtube.com/watch?v=OcTMBrUutfk

    Matt Parker, What’s the story with log(1 + 2 + 3)? . https://www.youtube.com/watch?v=OcTMBrUutfk

    work page

  2. [2]

    Kurlandchik and A

    L. Kurlandchik and A. Nowicki, When the sum equals the product , The Mathematical Gazette, 84(499), 91-94. doi:10.2307/362148 8

    work page doi:10.2307/362148

  3. [3]

    Mark Bennet, https://math.stackexchange.com/questions/1176875

    work page arXiv

  4. [4]

    Michael Rozenberg, https://math.stackexchange.com/questions/2640531

    work page arXiv

  5. [5]

    mathlove, https://math.stackexchange.com/questions/929564

    work page

  6. [6]

    Robert Israel, https://math.stackexchange.com/questions/111040

    work page

  7. [7]

    On Github: https://github.com/onnomc/bioperational-multisets On Repl.it: https://repl.it/@onnomc/BioperationalMultisets

    work page

  8. [8]

    An Algorithm to Solve the Equal-Sum-Product Problem

    M.A. Nyblom, C.D. Evans, An Algorithm to Solve the Equal-Sum-Product Problem. https://arxiv.org/abs/1311.3874

    work page Pith review arXiv

Show all 11 references
  1. [9]

    The Online Encyclopedia of Integer Sequences, https://oeis.org/

  2. [10]

    David Applegate, Marc LeBrun, N. J. A. Sloane, Dismal Arithmetic , https://arxiv.org/abs/1107.1130

    arXiv

  3. [11]

    Niel Sloane, Primes on the Moon (Lunar Arithmetic) , Numberphile, [interview by Brady Haran], https://www.youtube.com/watch?v=cZkGeR9CWbk 13

Pith tools

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