Hostname: page-component-586b7cd67f-rdxmf Total loading time: 0 Render date: 2024-11-23T21:25:52.499Z Has data issue: false hasContentIssue false

Some representations of real numbers using integer sequences

Published online by Cambridge University Press:  14 October 2022

Loïc Mazo*
Affiliation:
ICube, Université de Strasbourg, CNRS, Strasbourg, France
Marie-Andrée Da Col-Jacob
Affiliation:
ICube, Université de Strasbourg, CNRS, Strasbourg, France
Laurent Fuchs
Affiliation:
XLIMM, Université de Poitiers, CNRS, Poitiers, France
Nicolas Magaud
Affiliation:
ICube, Université de Strasbourg, CNRS, Strasbourg, France
Gaëlle Skapin
Affiliation:
XLIMM, Université de Poitiers, CNRS, Poitiers, France
*
*Corresponding author. Email: [email protected]

Abstract

The paper describes three models of the real field based on subsets of the integer sequences. The three models are compared to the Harthong–Reeb line. Two of the new models, contrary to the Harthong–Reeb line, provide accurate integer “views” on real numbers at a sequence of growing scales $B^n$ ( $B\ge2$ ).

Type
Paper
Copyright
© The Author(s), 2022. Published by Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Boldo, S., Lelay, C. and Melquiond, G. (2016). Formalization of real analysis: a survey of proof assistants and libraries. Mathematical Structures in Computer Science 26 (7) 11961233.CrossRefGoogle Scholar
Chollet, A. (2010). Non Classical Formalisms for the Computing Treatment of the Topology and the Discrete Geometry. PhD thesis, Université de La Rochelle.Google Scholar
Chollet, A., Wallet, G., Fuchs, L., Andres, E. and Largeteau-Skapin, G. (2012). Foundational aspects of multiscale digitization. Theoretical Computer Science 466 219.CrossRefGoogle Scholar
Chollet, A., Wallet, G., Fuchs, L., Largeteau-Skapin, G. and Andres, E. (2009). Insight in discrete geometry and computational content of a discrete model of the continuum. Pattern Recognition 42 (10) 22202228.CrossRefGoogle Scholar
Ciaffaglione, A. (2003). Certified Reasoning on Real Numbers and Objects in Co-Inductive Type Theory. Theses, Institut National Polytechnique de Lorraine.Google Scholar
Ciaffaglione, A. and Di Gianantonio, P. (2006). A certified, corecursive implementation of exact real numbers. Theoretical Computer Science 351 (1) 3951.CrossRefGoogle Scholar
Da Col, M.-A. and Tellier, P. (2009). Quasi-linear transformations and discrete tilings. Theoretical Computer Science 410 21262134.CrossRefGoogle Scholar
Diener, F. and Reeb, G. (1989). Analyse Non Standard. Paris (France): <LQ_NY0CBJ>Hermann.Hermann.>Google Scholar
Harthong, J. (1989). Une théorie du continu. In: Les mathématiques non standard, 307–329.Google Scholar
Laugwitz, D. (1983). $\Omega$-calculus as a generalization of field extension: an alternative approach to nonstandard analysis. In: Nonstandard Analysis - Recent developments, LNM, Springer, 120–133.Google Scholar
Magaud, N., Chollet, A. and Fuchs, L. (2015). Formalizing a discrete model of the continuum in Coq from a discrete geometry perspective. Annals of Mathematics and Artificial Intelligence 74 (3–4) 309332.CrossRefGoogle Scholar
Mazo, L. (2019). Multi-scale arithmetization of linear transformations. Journal of Mathematical Imaging and Vision 61 (4) 432442.CrossRefGoogle Scholar
Ménissier-Morain, V. (1995). Arithmétique exacte: conception, algorithmique et performances d’une implémentation informatique en précision arbitraire. PhD thesis, Université Paris 7.Google Scholar
Ménissier-Morain, V. (2005). Arbitrary precision real arithmetic: design and algorithms. Journal of Logical and Algebraic Methods in Programming 64 (1) 1339.CrossRefGoogle Scholar
Schmieden, C. and Laugwitz, D. (1958). Eine erweiterung der infinitesimalrechnung. Mathematische Zeitschrift 69 139.CrossRefGoogle Scholar