(Positive) Totally Ordered Noncommutative Monoids -- How Noncommutative Can They Be?
Eliahu Levy

TL;DR
This paper explores the structure of noncommutative, totally ordered monoids, examining how noncommutativity can be constrained and related to classical ordered algebraic systems like ordinals and Euclidean ratios.
Contribution
It introduces a framework for understanding noncommutative totally ordered monoids and investigates the limitations on noncommutativity imposed by order compatibility.
Findings
Noncommutative totally ordered monoids are limited in their noncommutativity.
Order compatibility leads to partial commutativity in such monoids.
Connections to ordinal addition and Euclidean ratios are established.
Abstract
Commutative totally ordered monoids abound, number systems for example. When the monoid is not assumed commutative, one may be hard pressed to find an example. One suggested by Professor Orr Shalit are the countable ordinals with addition. In this note we attempt an introductory investigation of totally (also partially) ordered monoids, not assumed commutative (still writing them additively), and taking them as positive, i.e.\ every element is greater than the unit element. That, in the usual commutative cases, allows the ordering to be defined via the algebraic structure, namely, as divisibility (in our additive sense): defined as . The noncommutative case offers several ways to generalize that. First we try to follow the divisibility definition (on the right or on the left). Then, alternatively, we insist on the ordering being compatible with the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputability, Logic, AI Algorithms · Mathematical and Theoretical Analysis · Advanced Topology and Set Theory
