pith. sign in

arxiv: 2505.00424 · v2 · submitted 2025-05-01 · 🧮 math.LO

Monotone infinitary operations on ordinals (extended version)

Paolo Lipparini This is my paper

Pith reviewed 2026-05-22 17:49 UTC · model grok-4.3

classification 🧮 math.LO
keywords ordinal arithmeticinfinitary operationsHessenberg natural summixed sumwell-founded ordermonotonicitysurreal numberscombinatorial games
0
0 comments X

The pith

An ω-ary operation on ordinals equals both the rank of sequences in a well-founded order and the largest bounded mixed sum.

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

The paper defines an ω-ary operation on the class of ordinals that is strictly monotone in many significant cases, even though no fully strictly monotone infinitary operation exists by an elementary argument. The operation receives dual order-theoretic characterizations: it equals the rank of sequences under a suitable well-founded ordering, and it equals the largest order-preserving disjoint union of copies of the summands subject to a boundedness restriction. This construction extends the finitary Hessenberg natural sum, which is the smallest strictly monotone operation on each finite argument, and its game-theoretic recasting suggests a possible extension to surreal numbers. A reader would care because the operation supplies a canonical, order-respecting way to combine infinitely many ordinals while preserving monotonicity in the relevant cases.

Core claim

We define and study an ω-ary operation on the class of the ordinals, which is strictly monotone in many significant cases. By an elementary argument there is no fully strictly monotone infinitary operation on ordinals. We provide order-theoretical characterizations of our operation, both as the rank of sequences in an appropriate well-founded order, and as a mixed sum of the ordinals in the sequence. The latter means that such an infinitary sum is the largest realization as an order-preserving disjoint union of copies of the summands, under some boundedness restriction. The former characterization can be recast in terms of combinatorial games.

What carries the argument

The ω-ary operation on ordinals, realized simultaneously as the rank of sequences in a well-founded order and as the largest bounded mixed sum.

Load-bearing premise

The boundedness restriction on the order-preserving disjoint union is chosen so that the mixed-sum realization coincides with the rank in the well-founded order on sequences.

What would settle it

A concrete sequence of ordinals for which the rank computed in the well-founded order on sequences differs from the value of the largest order-preserving disjoint union under the stated boundedness restriction would show the two characterizations fail to agree.

read the original abstract

We define and study an $ \omega $-ary operation on the class of the ordinals, which is strictly monotone in many significant cases (by an elementary argument, there is no fully strictly monotone infinitary operation on ordinals). We compare the operation with the finitary Hessenberg natural sum, which is the smallest finitary strictly monotone operation on each argument. We also compare it with other infinitary generalizations of Hessenberg sum. We provide order-theoretical characterizations of our operation, both as the rank of sequences in an appropriate well-founded order, and as a mixed (or shuffled) sum of the ordinals in the sequence. The latter means that such an infinitary sum is the largest realization as an order-preserving disjoint union of copies of the summands, under some boundedness restriction. The former characterization can be recast in terms of combinatorial games, leading to the problem whether the operation can be extended to the class of Conway surreal numbers.

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

2 major / 2 minor

Summary. The paper defines an ω-ary operation on ordinals that is strictly monotone in many significant cases and proves by an elementary argument that no fully strictly monotone infinitary operation exists on the ordinals. It compares the operation to the finitary Hessenberg natural sum (the smallest strictly monotone finitary operation) and to other infinitary generalizations. Two order-theoretic characterizations are provided: the operation equals the rank of an ω-sequence in a suitable well-founded order on sequences of ordinals, and it equals a mixed (shuffled) sum realized as the largest order-preserving disjoint union of copies of the summands subject to a boundedness restriction. The rank characterization is recast in terms of combinatorial games, and the paper raises the question of extending the operation to Conway surreal numbers.

Significance. If the characterizations are independently justified and the maximality claim holds without circularity, the work supplies a canonical infinitary monotone operation extending the Hessenberg sum, with clear order-theoretic and game-theoretic content. The negative result on fully strict monotonicity is elementary and useful, while the dual characterizations (rank and mixed sum) and the open question about surreals indicate potential for further development in ordinal arithmetic and combinatorial game theory.

major comments (2)
  1. [mixed-sum characterization] The central claim that the operation realizes the largest order-preserving disjoint union under a boundedness restriction (abstract and the mixed-sum section) requires an independent argument that the chosen bound is the weakest (or strongest) condition compatible with order-preservation and maximality. If the bound is introduced precisely so that the mixed-sum realization coincides with the rank function defined earlier, the maximality statement risks being an artifact of the modeling choice rather than an intrinsic property; a concrete test or comparison with alternative bounds should be supplied.
  2. [rank characterization] The well-founded order on ω-sequences whose rank yields the operation (rank characterization section) should be stated explicitly with its definition of the order relation and the proof that the rank map is strictly monotone in the claimed cases; without this, it is difficult to verify that the two characterizations agree for the stated reasons.
minor comments (2)
  1. Notation for the ω-ary operation and the mixed sum should be introduced once and used consistently; the current presentation occasionally shifts between descriptive phrases and symbols without a central definition.
  2. The comparison with other infinitary generalizations of the Hessenberg sum would benefit from a short table or explicit list of which monotonicity properties each satisfies.

Simulated Author's Rebuttal

2 responses · 0 unresolved

Thank you for your thorough review and constructive comments on our manuscript. We appreciate the feedback on the characterizations and will revise to improve clarity and justification. We respond to each major comment below.

read point-by-point responses

  1. Referee: The central claim that the operation realizes the largest order-preserving disjoint union under a boundedness restriction (abstract and the mixed-sum section) requires an independent argument that the chosen bound is the weakest (or strongest) condition compatible with order-preservation and maximality. If the bound is introduced precisely so that the mixed-sum realization coincides with the rank function defined earlier, the maximality statement risks being an artifact of the modeling choice rather than an intrinsic property; a concrete test or comparison with alternative bounds should be supplied.

    Authors: We thank the referee for this observation. The boundedness restriction is derived from the order-preservation requirement itself: it is the weakest condition ensuring that the disjoint union respects the ordinal ordering of the summands without allowing later components to improperly precede earlier ones. In the revision we will add an independent justification by proving that any weaker bound permits order violations, while any stronger bound yields a strictly smaller operation. We will also supply a concrete comparison using sequences of small ordinals (e.g., finite and ω) to show that alternative bounds produce operations distinct from our rank function, confirming the maximality is intrinsic. revision: yes

  2. Referee: The well-founded order on ω-sequences whose rank yields the operation (rank characterization section) should be stated explicitly with its definition of the order relation and the proof that the rank map is strictly monotone in the claimed cases; without this, it is difficult to verify that the two characterizations agree for the stated reasons.

    Authors: We agree that the presentation would benefit from greater explicitness. In the revised manuscript we will state the well-founded order on ω-sequences in full: two sequences α and β satisfy α ≺ β precisely when, at the least index k where they differ, the preceding components are equal and α_k < β_k (with the relation lifted recursively through the ordinal structure). We will include a self-contained proof that the associated rank function is strictly monotone in each argument under the stated conditions (non-decreasing sequences). This expanded section will also demonstrate the agreement with the mixed-sum characterization directly from the definitions, avoiding any appearance of circularity. revision: yes

Circularity Check

0 steps flagged

No significant circularity; characterizations are independent

full rationale

The paper defines the ω-ary operation and supplies two independent order-theoretic characterizations: one via rank in a well-founded order on sequences, and one via mixed sum under an explicitly stated boundedness restriction on order-preserving disjoint unions. These are shown to coincide, with the restriction serving as a condition that makes the realizations match while preserving order. No equations reduce a claimed prediction or maximality result to a fitted parameter or self-referential definition by construction. No load-bearing self-citations or uniqueness theorems imported from prior author work are invoked in the abstract or described derivation. The construction is self-contained against the external benchmarks of ordinal arithmetic and well-founded relations.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 1 invented entities

The central claims rest on the new definition of the ω-ary operation and on standard set-theoretic background for ordinals and well-founded relations. No numerical free parameters appear. The operation itself is the sole invented entity and lacks independent evidence outside the paper.

axioms (1)
  • standard math Axioms of ZFC set theory sufficient to define ordinals, well-orderings, and well-founded relations
    Invoked throughout for the class of ordinals and the construction of the well-founded order on sequences.
invented entities (1)
  • ω-ary monotone operation on ordinals no independent evidence
    purpose: To provide a strictly monotone infinitary generalization of the Hessenberg natural sum
    Newly defined and studied in the paper; no independent falsifiable handle is supplied in the abstract.

pith-pipeline@v0.9.0 · 5687 in / 1503 out tokens · 53238 ms · 2026-05-22T17:49:01.452884+00:00 · methodology

discussion (0)

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

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

What do these tags mean?
matches
The paper's claim is directly supported by a theorem in the formal canon.
supports
The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends
The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses
The paper appears to rely on the theorem as machinery.
contradicts
The paper's claim conflicts with a theorem or certificate in the canon.
unclear
Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

26 extracted references · 26 canonical work pages

  1. [1]

    Abraham, R

    U. Abraham, R. Bonnet,Hausdorff’s theorem for posets that satisfy the finite antichain prop- erty, Fund. Math.159, 51–69 (1999)

    work page 1999

  2. [2]

    H. J. Altman,Intermediate arithmetic operations on ordinal numbers, MLQ Math. Log. Q., 63, 228–242 (2017)

    work page 2017

  3. [3]

    Bachmann,Transfinite Zahlen, Zweite, neubearbeitete Auflage, Ergebnisse der Mathematik und ihrer Grenzgebiete, Band 1, Springer-Verlag, Berlin-New York, 1967

    H. Bachmann,Transfinite Zahlen, Zweite, neubearbeitete Auflage, Ergebnisse der Mathematik und ihrer Grenzgebiete, Band 1, Springer-Verlag, Berlin-New York, 1967

    work page 1967

  4. [4]

    Berarducci, M

    A. Berarducci, M. Mamino,Asymptotic analysis of Skolem’s exponential functions, J. Symb. Log.87, 758–782 (2022)

    work page 2022

  5. [5]

    P. W. Carruth,Arithmetic of ordinals with applications to the theory of ordered Abelian groups, Bull. Amer. Math. Soc.48, 262-271 (1942)

    work page 1942

  6. [6]

    V. A. Chatyrko,Ordinal products of topological spaces, Fund. Math.144, 95–117 (1994)

    work page 1994

  7. [7]

    J. H. Conway,On numbers and games, London Mathematical Society Monographs No. 6., Academic Press, 1976 (Second Edition, 2001)

    work page 1976

  8. [8]

    Dushnik,Upper and lower bounds of order-types, Michigan Math

    B. Dushnik,Upper and lower bounds of order-types, Michigan Math. J.2, 27–31 (1954)

    work page 1954

  9. [9]

    Gonshor,Number theory for the ordinals with a new definition for multiplication, Notre Dame J

    H. Gonshor,Number theory for the ordinals with a new definition for multiplication, Notre Dame J. Form. Log.21, 708–710 (1980)

    work page 1980

  10. [10]

    Gonshor, H.,An introduction to the theory of surreal numbers, London Mathematical Society Lecture Note Series110, Cambridge University Press, Cambridge (1986)

    work page 1986

  11. [11]

    Halbeisen, P

    L. Halbeisen, P. P. P´ erez-Velasco,On Carruth’s axioms for natural sums and products, Eur. J. Math.9, Paper No. 97, 14 (2023)

    work page 2023

  12. [12]

    Hessenberg,Grundbegriffe der Mengenlehre, G¨ ottingen: Vandenhoeck & Ruprecht (1906)

    G. Hessenberg,Grundbegriffe der Mengenlehre, G¨ ottingen: Vandenhoeck & Ruprecht (1906)

    work page 1906

  13. [13]

    Jacobsthal,Zur Arithmetik der transfiniten Zahlen, Math

    E. Jacobsthal,Zur Arithmetik der transfiniten Zahlen, Math. Ann.67, 130–144 (1909)

    work page 1909

  14. [14]

    Jech,Set theory

    T. Jech,Set theory. The third millennium edition, revised and expanded, Springer Mono- graphs in Mathematics. Springer-Verlag, Berlin (2003)

    work page 2003

  15. [15]

    D. H. J. de Jongh, R. Parikh. Well-partial orderings and hierarchies. Nederl. Akad. Wetensch. Proc. Ser. A 80=Indag. Math. 39(3), 195–207 (1977)

    work page 1977

  16. [16]

    Lipparini,An infinite natural sum, MLQ Math

    P. Lipparini,An infinite natural sum, MLQ Math. Log. Quart.62, 249–257 (2016)

    work page 2016

  17. [17]

    Lipparini,Some transfinite natural sums, MLQ Math

    P. Lipparini,Some transfinite natural sums, MLQ Math. Log. Q.64, 514–528 (2018)

    work page 2018

  18. [18]

    Lipparini,An infinite natural product, Ann

    P. Lipparini,An infinite natural product, Ann. Math. Silesianae32(1), 247–262 (2018)

    work page 2018

  19. [19]

    Lipparini,Review of[2], Math

    P. Lipparini,Review of[2], Math. Rev. MR3724379 (2018)

    work page 2018

  20. [20]

    Lipparini,Series of combinatorial games, arXiv:2406.02453v2, 1–19 (2024)

    P. Lipparini,Series of combinatorial games, arXiv:2406.02453v2, 1–19 (2024)

    work page arXiv 2024

  21. [21]

    Neumer, ¨Uber Mischsummen von Ordnungszahlen, Arch

    W. Neumer, ¨Uber Mischsummen von Ordnungszahlen, Arch. Math.5, 244–248 (1954)

    work page 1954

  22. [22]

    A. N. Siegel,Combinatorial game theory, Graduate Studies in Mathematics146, American Mathematical Society, Providence, RI (2013)

    work page 2013

  23. [23]

    Sierpinski,Cardinal and ordinal numbers

    W. Sierpinski,Cardinal and ordinal numbers. Second revised edition, Monografie Matematy- czne, Vol. 34, Panstowe Wydawnictwo Naukowe, Warsaw (1965)

    work page 1965

  24. [24]

    G. H. Toulmin,Shuffling ordinals and transfinite dimension, Proc. London Math. Soc.4, 177–195 (1954)

    work page 1954

  25. [25]

    V¨ a¨ an¨ anen, T

    J. V¨ a¨ an¨ anen, T. Wang,An Ehrenfeucht-Fra¨ ıss´ e game forLω1ω, MLQ Math. Log. Q.59, 357–370 (2013)

    work page 2013

  26. [26]

    not numbers

    N. J. H. Wontner,Views from a peak: Generalisations and Descriptive Set Theory, ILLC Dissertation Series DS-2023-NN, Institute for Logic, Language and Computation, Amsterdam (2023). 7.Appendix I. A game-theoretical rewording We now provide a characterization of#S in terms of combinatorial game theory. We refer to [22, Chapter VIII] for basic notions, thou...

    work page arXiv 2023