TL;DR
This paper introduces two novel abstract prearithmetic systems, AM and BM, designed to address phenomena where standard arithmetic breaks down, such as the "paradox of the heap." These systems offer a consistent way to handle situations where adding a small quantity doesn't change the overall state, and they can also resolve series convergence issues in certain contexts.
What Problem Does This Paper Address?
The authors tackle a fundamental limitation of conventional Diophantine arithmetic: its inability to accurately model certain real-world phenomena. Examples include the paradox of the heap (where adding one grain of sand to a heap doesn't change its status as a heap) and scenarios involving the combination of substances where volumes don't add linearly (like mixing alcohol and water). These inconsistencies arise because standard arithmetic assumes strict adherence to axioms that don't always hold true in practical, often "vague," situations. While some attempts to address this have led to "inconsistent arithmetics" (where axioms are simultaneously true and false), this paper proposes a different path: consistent "non-Diophantine arithmetics."
Methods
The core of the paper lies in defining and exploring two classes of abstract prearithmetics: {AM}M>1 and {BM}M>0.
- Abstract Prearithmetic Definition: They start by defining an abstract prearithmetic as a tuple (A, +, ×, ≤), where A is a set, and +, ×, and ≤ are operations and a relation, respectively. This provides a general framework.
- {AM}M>1 Class: For any real M > 1, AM is defined as the set [0, M] with modified addition (a ⊕ b = min(M, a + b)) and multiplication (a ⊗ b = min(M, a × b)). This effectively caps any sum or product at M. They prove AM is a complete totally ordered semiring and is "weakly projective" with respect to the standard nonnegative real numbers (R+).
- {BM}M>0 Class: For any real M > 0, BM is defined as the interval [0, M] with addition and multiplication defined via a projective mapping (using an arctan function) to and from the extended real numbers (R). This class is shown to be projective with respect to R.
- Projectivity: A key concept is "projectivity" (and "weak projectivity"), which describes how one prearithmetic can be mapped onto another using projector and coprojector functions. This allows for transferring properties and analyses between systems.
Datasets
Not discussed in the paper.
Key Insights and Ideas
- Consistent Handling of Vagueness: The AM and BM classes provide a mathematically consistent framework for dealing with "vague" concepts like "heap" or situations where quantities don't strictly add up. This avoids the logical contradictions of inconsistent arithmetics.
- Resolving the Paradox of the Heap: By defining operations like
a ⊕ b = min(M, a + b)in AM, adding a single grain to a heap of size M results inmin(M, M + 1) = M, thus preserving the "heap" status. Similarly, in BM, M + a = M for any a in BM, directly addressing this paradox. - Series Convergence: The paper demonstrates that projections of series from standard arithmetic (R+ or R) onto these new prearithmetics can converge, even if the original series might not. This is a powerful tool for analysis.
- Generalization of Arithmetic: These non-Diophantine arithmetics can be seen as generalizations of standard arithmetic, where the identity functions for projection recover the usual behavior.
Key Results
- Every element of the {AM}M>1 and {BM}M>0 classes is a complete totally ordered semiring.
- {AM}M>1 is weakly projective with respect to R+ (nonnegative real numbers).
- {BM}M>0 is projective with respect to R (extended real numbers).
- The weak projection of any series of elements from R+ converges in AM (for M > 1).
- The projection of any non-indeterminate series of elements from R converges in BM (for M > 0).
- Both classes provide a means to overcome versions of the paradox of the heap.
Limitations and Future Work
- Scope of Application: While the paper demonstrates the utility of these arithmetics for specific paradoxes and phenomena, their broader applicability across various scientific and technical domains remains an area for exploration.
- Third Class: The paper mentions a third class of abstract prearithmetics in [13] but does not detail it here, suggesting further research in this direction.
- Computational Aspects: The paper focuses on the theoretical properties. Investigating efficient computational implementations and algorithms for these non-Diophantine arithmetics would be a valuable next step.
- Further Paradoxes: Exploring how these systems can address other paradoxes or counter-intuitive situations in mathematics and science is a natural extension.
Summary updated