The Additive Arithmetic of Linear Orders
Listen
Radio episode about this paper
Transcript
Introduction to the show: ident: Mathematics. The day in mathematics: new theorems, new proofs, and what they open.
Ada: We're looking at the paper: "The Additive Arithmetic of Linear Orders".
Paper summary: Ada: So we're looking at this paper called "The Additive Arithmetic of Linear Orders," and what they're doing is building out how you can add linear orders together, which they call the ordered sum, under this operation LO plus.
Emmy: It sounds like they are trying to find a solid arithmetic structure for all these linear orders when you combine them in this way.
Kolya: So what's the main goal here then? What are they trying to prove about these sums that we don't already know?
Ada: Well, the core idea is using a Euclidean algorithm, but they're tailoring it for pairs of linear orders that almost additively commute. They’re aiming to get a system that works across the whole class of linear orders.
Emmy: They claim this approach links up with a two-piece generalized interval exchange transformation on the unit interval, which gives them a way to visualize or construct these sums.
Kolya: That sounds structural. So what's one of the big results they are presenting that might matter to someone who just wants to know what this does?
Ada: They generalize and unify proofs for some really classical theorems in LO plus, specifically Lindenbaum’s division theorem and Aronszajn’s representation theorem for additively commuting pairs of linear orders.
Emmy: That's significant because it brings those older results into a single framework, showing they all follow from this new arithmetic structure.
Kolya: And they also tackled something Tarski posed back in one thousand nine hundred fifty-six right <ref:2608.20309#pg1>? That problem about whether if you have some combinations like nA plus mB being equivalent to kB plus lA, it forces A plus B to be equivalent to B plus A.
Ada: Exactly. They prove that this is true in general for any pair of linear orders A and B and any natural numbers n, m, k, l greater than or equal to one.
Emmy: That’s a big win because Tarski and Chang only showed it for certain specific choices of those numbers back then.
Kolya: So what's the characterization they found for when two linear orders A and B actually add commutatively? What is that condition?
Ada: They characterize it by saying A plus B is equivalent to B plus A if and only if the order omegaA embeds initially in omegaB and the order omega starA embeds finally in omega starB, or vice versa.
Emmy: That gives us a concrete way to check for commutativity using those initial and final parts of the orders.
Paper summary: Kolya: And how does this help us understand what these commutative semigroups look like? The paper mentions something about characterization of commutative semigroups representable in LO plus.
Ada: They show that any such semigroup is actually a subsemigroup of naturally totally ordered semigroups in the sense of Clifford.
Emmy: So, even if you start with a structure that looks like it only has commutative sums, it's hiding inside a larger, more predictable order structure.
Kolya: That suggests there’s always some underlying total order dictating the behavior here. So where does this arithmetic development actually come from? What's the mechanism they are using?
Ada: They develop this arithmetic using a Euclidean algorithm specifically for pairs of linear orders that have this one-sided weak commutativity relation.
Emmy: This algorithm is designed to generalize the classical Euclidean algorithm on natural numbers, making it work for these more complex linear orders.
Kolya: And what about the results they got from that? They mention new proofs for Lindenbaum’s division theorem and solving open problems from ordinal algebras concerning additively commuting pairs.
Ada: Right, they use this algorithm to prove Lindenbaum’s division theorem by doing a division process that works just like you would over natural numbers or real numbers.
Emmy: And because the algorithm doesn't terminate in all cases, it leads to a non-terminating division system where terms are pairwise additively commuting.
Kolya: So if we look at the structure they create—these symbolic representations and dynamical representations—how do those help us understand the actual orders?
Ada: They establish structural representations for orders from this non-terminating division system. These are two types: one is a symbolic representation derived from lex ordered sequence spaces, and the other is a dynamical representation based on group actions on the unit interval.
Emmy: That connects the abstract arithmetic to concrete geometric or dynamic systems, which I find really compelling when thinking about how these orders behave in action.
Kolya: So for someone just listening who doesn't deal with sequence spaces or group actions, what does this all boil down to in practical terms?
Ada: It boils down to establishing fundamental arithmetic facts about discrete sums in LO plus and providing conditions on pairs A and B that either imply or are implied by A plus B being equivalent to B plus A.
Paper summary: Emmy: The key condition they emphasize is Theorem seven point one, which states that if the order of B plus A is less than or equal to the initial part of A plus B, and also less than or equal to some finite part f in A plus B, then A plus B will be equivalent to B plus A.
Kolya: That sounds like a very specific condition. What does that condition tell you about when you can expect commutativity?
Ada: It's a precise way to guarantee it based on the relationship between the orders and their sums.
Emmy: They also showed they could prove Lindenbaum’s Division Theorem using this Euclidean algorithm in a symmetric setup that witnessed A plus B being equivalent to B plus A.
Kolya: So, if I had to summarize what this paper is about for a listener who just wants the big picture, what's the main contribution?
Ada: The main contribution is systematically developing the arithmetic of linear orders under ordered sum, LO plus, by creating a new Euclidean algorithm that lets them prove old theorems and solve problems Tarski posed.
Emmy: It gives us a robust system for dealing with the sums of these orders.
Kolya: And what about where this leaves things open? What are the limitations they mentioned?
Ada: They do mention that their approach relies on working with pairs of linear orders that satisfy a one-sided weak commutativity relation.
Emmy: That means the algorithm is specifically built for that kind of structure, so it might not be directly applicable to every arbitrary pair of linear orders without some extra setup.
Kolya: And what about how this connects to what we know from other areas? Is there anything they suggest for future work?
Ada: They establish these structural representations, and those are the tools they use to generalize Aronszajn’s representation theorem for commuting pairs.
Emmy: The next step seems to be exploring how these specific dynamical systems arising from the algorithm can be used more broadly across different types of algebraic structures.
Kolya: So, to wrap up—this paper is essentially building a new arithmetic toolkit for linear orders using a tailored Euclidean algorithm, proving deep structural results about their sums and commutativity, and showing how these ideas connect to classical problems like Tarski's division theorem.
Ada: That’s the core idea of "The Additive Arithmetic of Linear Orders."
Emmy: It shows that even with just addition on linear orders, there is a rich underlying arithmetic structure to explore.
Conclusion: Ada: So, we've seen how they built this whole arithmetic structure for linear orders using that tailored Euclidean algorithm and what those new structural representations mean for understanding these sums and their commutativity.
Emmy: Yeah, it's about taking something that feels like just basic addition on these orders and showing there’s a deep underlying geometry or algebraic reason why things behave the way they do, especially around how they commute.
Kolya: From my side, what this really boils down to is having a concrete test—that theorem about the initial part embedding into the final part—so we have a way to predict when two orders will actually be equivalent under their sum operation.
Ada: Exactly. The paper introduces these concepts, and it’s not just abstract math; it’s giving us tools to analyze how these mathematical objects interact structurally, which is what I care about most as a number theorist.
Emmy: And the authors are really tackling some of those big classical problems in order theory by showing how this new arithmetic framework unifies them all, proving things they couldn't before with this algorithm.
Kolya: It suggests that the behavior of these additive structures isn't random; it follows a very specific pattern dictated by these initial and final segments we talked about.
Ada: So, to wrap up, "The Additive Arithmetic of Linear Orders" is essentially giving us a new language and a set of rules for adding linear orders together that lets us predict commutativity with much more precision than we could before.
Emmy: And it opens the door to seeing these semigroups in a totally different light, showing they fit neatly inside larger, more predictable structures.
Kolya: It’s a solid piece of work because it takes these complex order relations and gives them an arithmetic engine you can actually use to solve problems about them.
Ada: And that leads us right into looking at how this specific non-terminating division system they create translates into those symbolic and dynamical representations we discussed earlier.
math.LO
Submitted: 2026-08-20
Updated: 2026-11-18
Comments: 111 pages
License: http://creativecommons.org/licenses/by-nc-nd/4.0/
Importance score: 92/100
The gist: The paper systematically develops the arithmetic of linear orders under the ordered sum operation (LO, +)…
Key concepts
- Ordered Sum Operation (LO, +)
- This is the arithmetic structure being studied, where two linear orders A and B can be combined using an operation called '+'. The paper focuses on how this sum behaves and how it relates to commutativity between the orders.
- Euclidean Algorithm for Pairs
- A specific algorithm used to analyze pairs of linear orders that exhibit a one-sided weak commutativity. This algorithm is key to proving fundamental results about the arithmetic of these sums, leading to new proofs for theorems like Lindenbaum's division theorem.
- Additively Commuting Pairs
- Two linear orders A and B are additively commuting if their sum is independent of the order in which they are combined, meaning A + B is equivalent to B + A. The paper characterizes these pairs based on embeddings of specific order structures ($\omega_A$ and $\omega^*_A$).
- Interval Exchange Transformation
- This concept from dynamical systems is used as a fundamental framework for developing the arithmetic. It provides a structural representation for linear orders, allowing researchers to characterize commutative semigroups representable in this ordered sum context.
Terminology
Summary
The paper systematically develops the arithmetic of linear orders under the ordered sum operation (LO, +), utilizing a Euclidean algorithm tailored for pairs of linear orders that exhibit almost additive commutativity. p. 0 We present a systematic development of the arithmetic of the class
of linear orders under the ordered sum (LO, +) and prove a number of new
results. Our approach is based on a Euclidean algorithm for pairs of linear
orders that almost additively commute. This algorithm
is a generalization of the classical Euclidean algorithm on N. Combinatorially, it
is equivalent to the dynamical system arising from a two-piece generalized interval
exchange transformation on the unit interval
[0, 1) = AB 7→ BAX = [0, 1),
in which the maps between the corresponding copies of the intervals A and B
are required to preserve the orientation of these intervals but not necessarily their
lengths, and whose images leave a gap on one side of [0, 1).Where the paper says it
Where the paper says it
Key results established include:
i. Generalizations and unified proofs for classical theorems in (LO, +), such as Lindenbaum’s division theorem and Aronszajn's representation theorem for additively commuting pairs of linear orders.
ii. A solution to a Tarski problem: proving that for any pair of linear orders A, B and natural numbers n, m, k, l at least 1, if nA + mB about= kB + lA, then A + B about= B + A. p. 0 We generalize and give unified proofs of the main classical theorems for
(LO, +), including Lindenbaum’s division theorem for (LO, +) and a
representation theorem for additively commuting pairs of linear orders
due to Aronszajn. We solve the following problem, posed by Tarski in 1956: is it true that
for every pair of linear orders A, B and quadruple of natural numbers
n, m, k, l ≥ 1, if nA + mB ∼= kB + lA then A + B ∼= B + A?Where the paper says it
iii. A characterization of additively commuting pairs: A + B about= B + A if and only if omega A embeds initially in omega B and omega* A embeds finally in omega* B, or vice versa. p. 0 We show the answer is yes in general. We prove the following characterization of the additively commuting
pairs in LO: A + B ∼= B + A if and only if ωA embeds initially in
ωB and ω
∗A embeds finally in ω
∗B, or vice versa.Where the paper says it
iv. Characterization of commutative semigroups (S, plus) representable in (LO, +), showing they are all subsemigroups of naturally totally ordered semigroups in the sense of Clifford. p. 0 We show this can be
viewed as a correctly revised version of a refuted conjecture of Tarski. We characterize the commutative semigroups (S, ⊕) that can be represented in (LO, +) and show in particular they are all subsemigroups of
naturally totally ordered semigroups in the sense of Clifford.Where the paper says it
The arithmetic is developed via a Euclidean algorithm for pairs satisfying a one-sided weak commutativity relation. p. 2 This paper is the result of our research in this direction. In it we will develop
the arithmetic of (LO, +) on the basis of a Euclidean algorithm for pairs of linear
orders A, B that satisfy a one-sided weak commutativity relation. We will show that the algorithm yields a new proof of Lindenbaum’s division
theorem that directly generalizes a proof of the theorem for (N, +) obtained by
applying its classical version. We also use it to solve two open problems from Ordinal Algebras, one stated explicitly and one implicitly posed, concerning additively
commuting pairs of linear orders; see the discussion in Sections 1. In the second half of the paper, we use the systems of isomorphisms arising
from runs of the Euclidean algorithm to prove representation theorems for the
linear orders appearing in the course of such a run. In the last section, we use
these representations to characterize the commutative semigroups (S, ⊕) that can
be represented as semigroups of linear order types under the ordered sum.Where the paper says it
Where the paper says it
Where the paper says it
Fundamental arithmetic facts regarding discrete sums in (LO, +) are provided, along with conditions on pairs A, B in LO that imply or are implied by A + B about= B + A. p. 6 Such embeddings arise in applications of our Euclidean algorithm for
(LO, +). In Section 4, we establish a number of arithmetic facts concerning sums of linear orders that we will use in our later results.Where the paper says it
If B + A init A + B and B + A f in A + B, then A + B about= B + A.
Lindenbaum’s Division Theorem is proven using the Euclidean algorithm, involving division over an equation similar to working over (N, +) or (R, +). The non-terminating nature of the algorithm leads to a non-terminating division system where terms are pairwise additively commuting. p. 2 We will show that the algorithm yields a new proof of Lindenbaum’s division
theorem that directly generalizes a proof of the theorem for (N, +) obtained by
applying its classical version. We also use it to solve two open problems from Ordinal Algebras, one stated explicitly and one implicitly posed, concerning additively
commuting pairs of linear orders; see the discussion in Sections 1.Where the paper says it
Structural representations for orders A k from a given non-terminating division system D are established in two types: symbolic representations X(I[u]) derived from lex-ordered sequence spaces, and dynamical representations R(K[x]) derived from group actions on the unit interval. p. 2 This algorithm
is a generalization of the classical Euclidean algorithm on N. Combinatorially, it
is equivalent to the dynamical system arising from a two-piece generalized interval
exchange transformation on the unit interval
[0, 1) = AB 7→ BAX = [0, 1),
in which the maps between the corresponding copies of the intervals A and B
are required to preserve the orientation of these intervals but not necessarily their
lengths, and whose images leave a gap on one side of [0, 1). Among our results:
i. We generalize and give unified proofs of the main classical theorems for
(LO, +), including Lindenbaum’s division theorem for (LO, +) and a
representation theorem for additively commuting pairs of linear orders
due to Aronszajn.Where the paper says it
Where the paper says it
The paper provides basic arithmetic facts about discrete sums in (LO, +) and establishes several arithmetic conditions on pairs A, B in LO that either imply or are implied by A + B about= B + A. p. 2 In a
forthcoming companion paper [4], we will show that as a consequence several of the
arithmetic results established in this paper for (LO, +) hold in an arbitrary ordinal
algebra. Tarski’s Commuting Sums Problem. We
were originally motivated to better understand the theorem, and to see its proof
as a proof by division in a sense that clearly generalizes division in the natural
numbers. This paper is the result of our research in this direction.Where the paper says it
Where the paper says it
If B + A init A + B and B + A f in A + B then A + B about= B + A.
The paper also provides a proof of Lindenbaum’s Division Theorem using the Euclidean algorithm, which proceeds by dividing over an equation just as though working over (N, +) or (R, +). The final section shows that if the algorithm does not terminate at any stage, it yields a non-terminating division system, and in this case, terms in the resulting system are shown to be pairwise additively commuting. p. 2 We will show that the algorithm yields a new proof of Lindenbaum’s division
theorem that directly generalizes a proof of the theorem for (N, +) obtained by
applying its classical version. We also use it to solve two open problems from Ordinal Algebras, one stated explicitly and one implicitly posed, concerning additively
commuting pairs of linear orders; see the discussion in Sections 1.Where the paper says it
The paper also provides a proof of Lindenbaum’s Division Theorem 1. p. 5 Commutative semigroups of order types. The first part of the paper
centers around the Euclidean algorithm defined in Section 5, and culminates in
the solution to Tarski’s Generalized Sum Problem in Section 7 and a proof of
Lindenbaum’s Division Theorem in Section 8. Readers familiar with
interval exchanges or orientation-preserving maps on the circle will recognize the
mechanics of such transformations in many of our proofs. We will show that the algorithm yields a new proof of Lindenbaum’s division
theorem that directly generalizes a proof of the theorem for (N, +) obtained by
applying its classical version. We will show that the algorithm yields a new proof of Lindenbaum’s division
theorem that directly generalizes a proof of the theorem for (N, +) obtained by
applying its classical version. We also use it to solve two open problems from Ordinal Algebras, one stated explicitly and one implicitly posed, concerning additively
commuting pairs of linear orders; see the discussion in Sections 1.Where the paper says it
Where the paper says it
Where the paper says it
Green — the paper says it, and the page is printed. Red — no passage carries it, so treat that sentence as unverified. The same check runs on your own text: check a summary against its source, $5.
Improvements for AI systems
-
Improved AI can solve Tarski's Generalized Sum Problem for linear orders by using data accrued from a run of the Euclidean algorithm for A and B, as described in Section 7.
-
Improved AI can prove Lindenbaum’s Division Theorem 1.2 by developing an algorithm based on a Euclidean algorithm for pairs of linear orders that almost additively commute, generalizing the classical Euclidean algorithm on N.
-
Improved AI can characterize commutative semigroups that are subsemigroups of naturally totally ordered semigroups in the sense of Clifford by using representation theorems derived from runs of the Euclidean algorithm.
-
Improved AI can solve Tarski’s Commuting Pairs Conjecture 1.5 for linear orders by using a revised version 1.6, which provides an arithmetic characterization expressible in the language of ordinal algebras, instead of relying on results that cannot be formulated within that framework.
-
Improved AI can compute the condensation classes delta(x) of an order X via countable nested intersections of copies of division terms Ak, especially when D is non-splitting and using D-branchings.
-
Improved AI can establish new commutativity laws for (LO, +) by proving Theorem 7.1:
If B + A less than or equal to initial A + B and B + A less than or equal to final A + B then A + B is isomorphic to B + A.
-
Improved AI can determine if a division system is splitting by analyzing the arithmetic information yielded by its runs of the Euclidean algorithm, based on Proposition 6.6 and 6.7, which states that for non-terminating systems, terms are either all splitting or all non-splitting.
Abstract
We present a systematic development of the arithmetic of the class of linear orders under the ordered sum (LO, +) and prove a number of new results. Our approach is based on a Euclidean algorithm for pairs of linear orders that almost additively commute. Among our results: (i.) We generalize and give unified proofs of the main classical theorems for (LO, +), including Lindenbaum's division theorem for (LO, +) and a representation theorem for additively commuting pairs of linear orders due to Aronszajn. (ii.) We solve the following problem, posed by Tarski in 1956: is it true that for every pair of linear orders A, B and quadruple of natural numbers n, m, k, l at least 1, if nA + mB kB + lA then A + B B + A ? Tarski and Chang showed the answer is yes for certain choices of the coefficients n, m, k, l. We show the answer is yes in general. (iii.) We prove the following characterization of the additively commuting pairs in LO: A + B B + A if and only if ωA embeds initially in ωB and ω* A embeds finally in ω* B, or vice versa. We show this can be viewed as a correctly revised version of a refuted conjecture of Tarski. (iv.) We characterize the commutative semigroups (S, plus) that can be represented in (LO, +) and show in particular they are all subsemigroups of naturally totally ordered semigroups in the sense of Clifford.
Sources
Related papers
- The consistency strength of the failure of amenable C-sequences
- Classification of bipartite observables III: simplicity, mixtures and quantum error correction
- Indiscernible Extraction in Theories with Bounded k-splitting
- Measuring the Complexity of Countable Presburger Models
- A non-trivially non-trivial automorphism at an inaccessible cardinal
- The Ordering Principle and Higher Dependent Choice