A grossone (symbol ) is a numeral intended to allow for the performance of numerical computations with infinities and infinitesimals.[1][2][3] In the grossone framework, is introduced as a natural number which is assigned the properties which would be possessed by a last element of the set of natural numbers,[4] such as would be seen with, for example, the quantity being approached with a limit increasing to infinity by finite degrees: it will always be finite, but seen as a completed whole the value it yields is .[5] occupies a quasi-infinite, quasi-finite space.[6]

has been compared to i,[7] which serves as a symbol for a square root of negative one: though no real number is the square root of a negative number, for some calculations it is useful to introduce an imaginary number where one can perform arithmetic on a number with such a property.

While similar to strictly infinite numbers, is assigned a different value from both Cantor's aleph number 0 and the ordinal number ω, and it also differs from the general symbol for infinity ∞ by being more specifically defined.[8]

The grossone has been studied in mathematical logic, numerical analysis, optimization, cellular automata, probability, and philosophy of mathematics, though is criticized by some mathematicians for being either insufficiently defined or trivial.[9][10][11]

Background

edit

Originally developed by the mathematician Yaroslav D. Sergeyev, Sergeyev presented the grossone approach in the book Arithmetic of Infinity and in subsequent papers on numerical computation with infinite and infinitesimal quantities.[12][2] A central principle of the approach is that "the part is less than the whole", applied not only to finite sets and finite quantities but also to infinite sets and processes.[8] This contrasts with standard Cantorian set theory, in which the set of natural numbers and the set of even natural numbers have the same size, namely 0, because they can be placed in bijection. In the grossone framework, by contrast, the natural numbers are assigned elements: as functions with the properties of a natural number, the even natural numbers and odd natural numbers are each assigned ①/2 elements.[8][11]

Definition and notation

edit

Grossone is denoted by the circled numeral . Sergeyev introduces it through the Infinite Unit Axiom, usually summarized in three parts:[8][11]

  • Infinity: every finite natural number n is less than grossone, i.e. n < ①.
  • Identity: ① satisfies identities such as 0·① = 0, ① − ① = 0, ①/① = 1, 0 = 1, 1 = 1, and 0 = 0.
  • Divisibility: for every finite positive integer n, the arithmetic progressions Nk,n = {k, k + n, k + 2n, …}, where 1 ≤ kn, are treated as n equal parts of , each containing ①/n elements.

In this framework, ① is treated as larger than every finite natural number and is often represented as the final element of the sequence of natural numbers:

1, 2, 3, …, ① − 2, ① − 1, ①.

This differs from the usual treatment of in standard set theory, where the natural numbers have no greatest element.

Interpretations

edit

Infinite-unit interpretation

edit

In Sergeyev's original presentation, grossone is introduced as an infinite unit of measure, namely the number of elements of the set of natural numbers. Sergeyev states that is not Cantor's cardinal number 0 and not the ordinal number ω, but is instead a new numeral with both cardinal and ordinal features analogous to those of finite natural numbers.[3]

In this interpretation, the natural numbers can be written in the form

ℕ = {1, 2, 3, …, ①}

where is treated as the largest element of in the grossone numeral system.[3] Sergeyev also distinguishes from an extended set of natural numbers containing expressions such as ① + 1, 2, and higher grossone-based numerals.[3] Thus, in Sergeyev's system, ① is not an absolute largest number in all grossone arithmetic, but the grossone-number of elements of the ordinary natural numbers as represented in that system.

Generic finite interpretation

edit

Louis Kauffman proposed a different interpretation of grossone notation in terms of the generic finite. In this interpretation, ① is not treated as a completed infinite natural number, but as a symbolic endpoint of an arbitrary finite initial segment.[13] Kauffman writes that

N = {1, 2, 3, …, ① − 2, ① − 1, ①}

is not an infinite set, but a symbolic structure representing a generic finite set.[13]

On Kauffman's reading, ① is not itself a particular natural number, but it can be treated as a generic natural number in finite formulas. For any finite realization of ①, the symbol ① represents the highest element of that realization; in this sense it may be regarded as larger than any particular integer named in advance.[13] Kauffman describes this as a relaxation of Sergeyev's original approach, since the generic-finite reading does not require ① to have all the divisibility properties postulated in Sergeyev's theory, such as being divisible by every finite positive integer.[13]

Kauffman formulates a transfer principle for this interpretation: a statement P(①) involving ① is taken as true when there is a natural number N such that P(n) is true for all finite natural numbers n > N.[13] This permits grossone notation to be used as a way of writing finite formulas with an indefinitely large symbolic endpoint, without interpreting the underlying object as a Cantorian completed infinite set.

The generic finite interpretation is therefore distinct both from ordinary Cantorian set theory and from Sergeyev's original infinite-unit interpretation. It treats grossone notation as a formal device for reasoning about arbitrary finite structures and their limiting behavior, rather than as a commitment to completed infinite sets.[13]

Relation to other theories of infinity

edit

Grossone is distinct from the standard cardinal 0 and ordinal ω used in set theory. Sergeyev argues that these symbols belong to different mathematical languages and should not be conflated with ①.[8]

The relationship between grossone and non-standard analysis has been controversial. Gutman and Kutateladze argued that Sergeyev's informal grossone theory admits a formalization inside classical non-standard analysis, modeling grossone by ν!, where ν is an infinitely large non-standard natural number.[10] Sergeyev rejected this interpretation and argued that the grossone methodology is independent of non-standard analysis.[14]

Gabriele Lolli gave an axiomatic treatment of grossone in 2015, using a second-order language and predicative second-order logic. Lolli's formalization was not finitely axiomatizable and was shown to be a conservative extension of Peano arithmetic.[9] Franco Montagna, Giulia Simi, and Andrea Sorbi studied related formal systems inspired by grossone, including bounded universes of finite and infinite natural numbers.[15]

Applications

edit

Grossone-based methods have been proposed for a variety of areas in applied mathematics and computation. Sergeyev's 2017 survey discussed proposed applications to infinite sets, divergent series, probability, fractals, numerical differentiation, ordinary differential equations, and optimization.[8]

In mathematical programming and operations research, Sonia De Cosmis and Renato De Leone proposed uses of grossone in anti-cycling procedures for the simplex method and in exact differentiable penalty functions for nonlinear programming.[16] Louis D'Alotto applied the Infinite Unit Axiom and grossone to the classification of one-dimensional cellular automata.[17]

In optimization, Marco Cococcioni, Massimo Pappalardo, and Sergeyev proposed a grossone-based method for lexicographic multi-objective linear programming.[18] Later work by Cococcioni and collaborators proposed a cutting-plane method for lexicographic multi-objective integer linear programming using the grossone methodology.[19] Cristian S. Calude and Monica Dumitrescu used a grossone-inspired formalism to study infinitesimal probabilities on infinite sets of positive integers.[20]

Potential infinity and limits

edit

Grossone has been discussed in relation to the traditional distinction between potential infinity and actual infinity, especially in connection with the use of limits. Sergeyev contrasts the ①-based methodology with the ordinary limit-based treatment of infinity: in his account, the d'Alembert–Cauchy concept of limit replaced actual infinite and infinitesimal quantities by potential ones, while grossone notation is intended to allow expressions to be evaluated at specified infinite or infinitesimal points.[8]

Kauffman's generic-finite interpretation gives a different connection with non-completed infinity. Kauffman begins from the stance that there are no completed infinite sets and interprets ① as a symbolic endpoint of an arbitrary finite initial segment, rather than as a Cantorian completed infinite set.[13] On this reading, a formula containing ① can be understood as a finite formula with an unspecified large upper bound. Kauffman states that expressions involving ① can be read as generic finite formulas and, in suitable cases, as indicating the behavior of a corresponding limit or infinite sum.[13]

A related use appears in work on infinite series. Zhigljavsky proposed axioms for using grossone in summation, including a "transition to a limit" principle under which, if a sequence tends to zero as n tends to infinity, the ①-indexed term is infinitesimal. He describes these axioms as making the substitution of by ① sensible when translating classical summation problems into grossone notation.[5]

These interpretations should not be conflated. In Sergeyev's original methodology, ① is treated as an actual infinite unit of measure. In Kauffman's generic-finite interpretation, by contrast, ① is a symbolic device for reasoning about arbitrary finite structures and their limiting behavior without assuming completed infinite sets.[13]

Criticism

edit

The notion of the grossone has been the subject of both formal study and of criticism. Lolli described Sergeyev's approach as involving elements of realism, formalism, and finitism, while also identifying points requiring clarification or further development.[21] Paul Ernest characterized grossone as a contemporary controversy concerning infinity in mathematical practice, noting both the extent of Sergeyev's publication record and the strength of the criticism directed at the theory.[11]

Gutman and Kutateladze argued that grossone could be formalized inside non-standard analysis and criticized Sergeyev's presentation as unnecessary or imprecise.[10] Gutman, Katz, Kudryk, and Kutateladze later compared grossone with Levi-Civita fields and hyperreal frameworks and argued that any consistent subsystem of Sergeyev's system would be subsumed by existing non-standard methods.[22] Sergeyev responded to such claims in a 2019 article defending the independence of the grossone methodology from non-standard analysis.[14]

Ernest concluded in 2023 that the value of the grossone approach remained unsettled and that no decisive problem had yet been solved by it that could not be solved by existing methods.[11]

See also

edit

References

edit
  1. Sergeyev, Yaroslav D. (2014). "Examples of the Usage of Infinities and Infinitesimals in Numerical Computations". Advances in Artificial Life and Evolutionary Computation. Communications in Computer and Information Science. Vol. 445. pp. 190–200. doi:10.1007/978-3-319-12745-3_15. ISBN 978-3-319-12744-6.
  2. 1 2 Sergeyev, Yaroslav D. (2008). "A New Applied Approach for Executing Computations with Infinite and Infinitesimal Quantities". Informatica. 19 (4): 567–596. doi:10.15388/Informatica.2008.231.
  3. 1 2 3 4 Sergeyev, Yaroslav D. (2009). "Numerical computations and mathematical modelling with infinite and infinitesimal numbers". Journal of Applied Mathematics and Computing. 29 (1–2): 177–195. doi:10.1007/s12190-008-0123-7.
  4. Montagna, Franco; Simi, Giulia; Sorbi, Andrea (2015). "Taking the Pirahã seriously". Communications in Nonlinear Science and Numerical Simulation. 21 (1–3): 52–69. Bibcode:2015CNSNS..21...52M. doi:10.1016/j.cnsns.2014.06.052.
  5. 1 2 Zhigljavsky, Anatoly (2012). "Computing sums of conditionally convergent and divergent series using the concept of grossone". Applied Mathematics and Computation. 218 (16): 8064–8076. doi:10.1016/j.amc.2011.12.034.
  6. INSTICC (2012-10-25). The Infinity Computer and Numerical Computations with Infinite and Infinitesimal(...)" Dr. Yaroslav D. Sergeyev (IJCCI 2012). Retrieved 2026-05-02 via Vimeo.
  7. Rizza, Davide; Iannone, Paola; Thoma, Athina (July 2018). "Investigating secondary school students' epistemologies through a class activity concerning infinity". Proceedings of the 42nd Conference of the International Group for the Psychology of Mathematics Education. Vol. 3. pp. 131–138. hdl:2134/34064.
  8. 1 2 3 4 5 6 7 Sergeyev, Yaroslav D. (2017). "Numerical infinities and infinitesimals: Methodology, applications, and repercussions on two Hilbert problems". EMS Surveys in Mathematical Sciences. 4 (2): 219–320. doi:10.4171/EMSS/4-2-3. (This paper currently has an expression of concern, see doi:10.4171/EMSS/4-2-3. If this is an intentional citation to a such a paper, please replace {{expression of concern|...}} with {{expression of concern|...|intentional=yes}}.)
  9. 1 2 Lolli, Gabriele (2015). "Metamathematical investigations on the theory of Grossone". Applied Mathematics and Computation. 255: 3–14. doi:10.1016/j.amc.2014.03.140.
  10. 1 2 3 Gutman, A. E.; Kutateladze, S. S. (2008). "On the theory of grossone". Siberian Mathematical Journal. 49 (5): 835–841. arXiv:0808.1164. Bibcode:2008SibMJ..49..835G. doi:10.1007/s11202-008-0082-0.
  11. 1 2 3 4 5 Ernest, Paul (2023). "Rejection, Disagreement, Controversy and Acceptance in Mathematical Practice: Episodes in the Social Construction of Infinity". Global Philosophy. 33 15. doi:10.1007/s10516-023-09652-8.
  12. Sergeyev, Yaroslav D. (2013). Arithmetic of Infinity (2nd ed.). Cosenza: Edizioni Orizzonti Meridionali. ASIN B00G7RB1FS.
  13. 1 2 3 4 5 6 7 8 9 Kauffman, Louis H. (2015). "Infinite computations and the generic finite". Applied Mathematics and Computation. 255: 25–35. arXiv:1401.7545. doi:10.1016/j.amc.2014.06.054.
  14. 1 2 Sergeyev, Yaroslav D. (2019). "Independence of the Grossone-Based Infinity Methodology from Non-standard Analysis and Comments upon Logical Fallacies in Some Texts Asserting the Opposite". Foundations of Science. 24 (1): 153–170. arXiv:1802.01408. doi:10.1007/s10699-018-9566-y.
  15. Montagna, Franco; Simi, Giulia; Sorbi, Andrea (2015). "Taking the Pirahã seriously". Communications in Nonlinear Science and Numerical Simulation. 21 (1–3): 52–69. Bibcode:2015CNSNS..21...52M. doi:10.1016/j.cnsns.2014.06.052.
  16. De Cosmis, Sonia; De Leone, Renato (2012). "The use of grossone in Mathematical Programming and Operations Research". Applied Mathematics and Computation. 218 (16): 8029–8038. arXiv:1107.5681. doi:10.1016/j.amc.2011.07.042.
  17. D'Alotto, Louis (2015). "A classification of one-dimensional cellular automata using infinite computations". Applied Mathematics and Computation. 255: 15–24. doi:10.1016/j.amc.2014.06.087.
  18. Cococcioni, Marco; Pappalardo, Massimo; Sergeyev, Yaroslav D. (2018). "Lexicographic multi-objective linear programming using grossone methodology: Theory and algorithm". Applied Mathematics and Computation. 318: 298–311. doi:10.1016/j.amc.2017.05.058. hdl:11568/877746.
  19. Cococcioni, Marco; Cudazzo, Alessandro; Fiaschi, Lorenzo; Pappalardo, Massimo; Sergeyev, Yaroslav D. (2024). "A new cutting plane method for lexicographic multi-objective integer linear programming". Communications in Nonlinear Science and Numerical Simulation. 129 107674. Bibcode:2024CNSNS.12907674C. doi:10.1016/j.cnsns.2023.107674. hdl:11568/1217533.
  20. Calude, Cristian S.; Dumitrescu, Monica (2020). "Infinitesimal Probabilities Based on Grossone". SN Computer Science. 1 36. doi:10.1007/s42979-019-0042-8.
  21. Lolli, Gabriele (2025). "Infinite numbers, infinity computing the philosophy of grossone". Soft Computing. 29 (8): 4287–4299. doi:10.1007/s00500-025-10573-4.
  22. Gutman, Alexander E.; Katz, Mikhail G.; Kudryk, Taras S.; Kutateladze, Semen S. (2017). "The Mathematical Intelligencer Flunks the Olympics". Foundations of Science. 22 (3): 539–555. arXiv:1606.00160. doi:10.1007/s10699-016-9485-8.