1. Introduction
Modeling and computing with real numbers is a fundamental task in computer science. It remains a challenging issue and usually requires a trade-off between accuracy and efficiency. Floating-point numbers are widely used to model real numbers, but they fail to form a field and though they are scattered in a wide interval, there is only finitely many of them. Proof assistants need more faithful models. The approaches used are either abstract, simply relying on some axiom systems (PVS, Coq standard library), or concrete, actually implementing the real numbers as a concrete datatype together with some operations. In the latter case, real numbers can be derived from Cauchy sequences (HOL Light, Isabelle, C-CoRN Coq library, NASA PVS Library), Dedekind cuts (Mizar, HOL4, ProofPower-HOL), and Non-Standard Analysis (ACL2(r), Isabelle non-standard library). The reader can find more information on these models in the survey (Boldo et al. Reference Boldo, Lelay and Melquiond2016). The main objective of our research on real number models is not to propose a new model but rather to have a model that makes it possible to switch from the discrete calculus to the continuous one, especially when dramatic changes occur. For instance, Euclidean rigid motions and their digital versions have distinct topological and set theoretical properties like homology preservation and bijectivity which are ensured in the former case and not in the latter case. Among the different kinds of models cited above, those that allow to examine how the convergence from a discrete representation to a continuous one unfolds are those using sequences (of rationals or integers) to obtain real numbers. Indeed, with convergent sequences, one could get snapshots of the convergence process by choosing some indices in the sequences. Nevertheless, to be usable, the convergence speed of the sequences has to be known. This is the case with the HOL Light model. But this model only ensures that for any sequence, there exists a parameter that controls the convergence speed. In other words, the speed depends on the real. Thus, the model will be hardly tractable in situations appealing to many reals which is generally the case. Another solution would be to use the standard positional notation. It comes down to have a Cauchy sequence with the advantage that the convergence speed is known and common to all reals. But the positional notation badly behaves with operations. Let us borrow an example from Ciaffaglione (Reference Ciaffaglione2003): deciding what is the first digit of the product
$3\times0.333\dotsc$ is not possible, even if you postpone the decision until reading n digits in the right term. If you choose 9, you are wrong if you are computing
$3\times(1/3)$ but if you choose 1 you are wrong in all the other cases. To work around this issue, one of the easiest solutions is to allow negative digits in the positional notation.This is the choice made in Ciaffaglione and Di Gianantonio (Reference Ciaffaglione and Di Gianantonio2006) with a signed-digit positional model with base 2 (the model is implemented in Coq).
The real number models presented in this paper originate in a discrete model of the continuum proposed and developed by Chollet et al. (Reference Chollet, Wallet, Fuchs, Largeteau-Skapin and Andres2009, Reference Chollet, Wallet, Fuchs, Andres and Largeteau-Skapin2012) – see also Chollet’s PhD thesis, Chollet (Reference Chollet2010). The model of the continuum, studied by Chollet, is called the Harthong–Reeb line. It is based on the one hand on the works of Harthong (Reference Harthong1989) and Reeb (Diener and Reeb Reference Diener and Reeb1989) in nonstandard analysis and on the other hand on the works of Schmieden and Laugwitz (Reference Schmieden and Laugwitz1958), Laugwitz (Reference Laugwitz1983) in constructive mathematics. The Harthong–Reeb line is equipped with an algebraic structure in correspondence with the ordered commutative field structure of the real numbers and implemented in the Coq system (Magaud et al. Reference Magaud, Chollet and Fuchs2015). Thanks to this model, Chollet et al. (Reference Chollet, Wallet, Fuchs, Andres and Largeteau-Skapin2012) are able to build a multiscale arithmetic representation of the plane curve
$y=x(t)$ solution of the Cauchy problem
$x'=F(t,x), x(t_0)=x_0$. A few years later, Mazo (Reference Mazo2019) proposed a multiscale representation of the affine transformations whose snapshots are the arithmetic quasi-affine transforms developed by M.A. Da-Col, see for instance Da Col and Tellier (Reference Da Col and Tellier2009). Nevertheless, these multiscale representations come up against the same pitfall: the scale in Chollet’s model is not correlated with the accuracy. Therefore, only qualitative, asymptotic results can be stated. It is impossible to give any quantitative guaranty at a given scale.
In order to connect a real number with each of its representations at the different scales in the Harthong–Reeb line, mixing the model with the sequences of rationals provided by a positional numeration system is a natural solution. Rather than the model developed by Ciaffaglione which only comes with base 2 and a few functions, we choose to incorporate inside the Harthong–Reeb line the representations of real numbers defined by Ménissier-Morain (Reference Ménissier-Morain2005) – see also her PhD thesis, Ménissier-Morain (Reference Ménissier-Morain1995). Incorporating such efficient representations in the Harthong–Reeb line allows to bridge the gap between the abstract formal description of the Harthong–Reeb line and an actual efficient and usable concrete implementation. Given a scale
$n\in\mathbb{Z}$ (also called order), such a representation
$x_n\in\mathbb{Z}$ is linked to the represented real number x by the following inequality:
where
$B\ge 2$ is the base of the representations. Though the presentation is very different, it can be seen that such representations could be expressed with a positional encoding. This step is not done in this paper and will be accomplished in a future work. In the work of V. Menissier-Morain, besides the fact that there is a tight link between the real numbers and their representations, we also find a set of operations, algebraic and transcendental functions to deal with such representations. Hence, this paper is devoted to compare, and in a certain way to merge, Chollet’s model of the continuum with the representations of V. Menissier-Morain together with their algebraic operations.
The paper is organized as follows.
– In Section 2, we recall the definitions of the Harthong–Reeb line and the representations of V. Menissier-Morain – let us called them tight representations in the sequel – with their operations.
– We propose in Section 3.1 a characterization of sequences that are tight representations of some real. The characterization does not appeal to real numbers (contrary to Equation (1) which is used by V. Menissier-Morain). We also define the loose representations that are obtained by replacing the strict inequality in Equation (1) by a (nonstrict) inequality. In addition to the two previous sets of integer sequences and to Chollet’s sequences, regular sequences are considered. Regular sequences, introduced in Chollet et al. (Reference Chollet, Wallet, Fuchs, Andres and Largeteau-Skapin2012), are integer sequences derived from rational Cauchy sequences.
– Section 3.2 is devoted to the quotient spaces defined from the sets of integer sequences using the same equivalence relation that permits to build the Harthong–Reeb line. Each quotient space comes with an ordered ring, or field, structure.
– Eventually, Section 3.3 establishes the isomorphisms between the quotient spaces (except the Harthong–Reeb line) and the ordered field of the real numbers.
2. Background
2.1 The Harthong–Reeb line
Basically, in the Harthong–Reeb line model, a real number x is a sequence of integers, each term of the sequence providing a view on x at a growing scale as we go through the sequence.
The construction of the Harthong–Reeb line is rather intuitive. For short, real numbers are modeled by sequences of rationals which in turn are converted to integers thanks to a given sequence of increasing scales.
In the sequel, given an equivalence relation
$\sim$ on a set X, we denote by
$\left[a\right]$ the equivalence class of
$a\in X$ and by
$\dot{c}$ any representative of the class
$c\in X/\sim$ (all the operations defined below are well-defined, that is, they do not depend on the choice of the representatives).
First, we present the classes of rational sequences and their operations. Using the Landau notations, we consider the subsets
$\text{O}(1)$ and
$\text{o}(1)$ of the rational sequences and we denote by
${\mathbb Q}_{\lim}$ the quotient space
$\text{O}(1) / \text{o}(1)$ of the bounded sequences of rationals up to the sequences converging toward 0. For any
$(\pi,\rho)\in{\mathbb Q}_{\lim}$, we set:
\begin{align*}\pi+\rho&\overset{\mathrm{def}}{=}\left[\dot{\pi}+\dot{\rho}\right],\\\pi\times\rho&\overset{\mathrm{def}}{=}\left[\dot{\pi}\times \dot{\rho}\right],\end{align*}
where, on the right-hand side of the equalities,
$+$ and
$\times$ are the term-wise operations on the rational sequences. In a general way, throughout this article, the operations and relations on integer sequences denoted as an operation or a relation on integers are performed term-wise. The restriction of
${\mathbb Q}_{\lim}$ to the classes of the Cauchy sequences is noted
${\mathbb Q}_{\text{Cau}}$. It is well known that the limit operator provides an isomorphism from
$({\mathbb Q}_{\text{Cau}},+,\times)$ to
$(\mathbb R,+,\times)$.
Next, we have to transform rationals in integers. Let
${{\omega}}={{\left\langle {{{\omega}}_n}\right\rangle}}$ be an increasing sequence of positive integers
${{\omega}}_n$,
$n\in\mathbb{N}$. Such a sequence is called an infinitely large number. We consider the subsets
$\text{O}({{\omega}})$ and
$\text{o}({{\omega}})$ of
$\mathbb{Z}^\mathbb{N}$ (Landau notations) and we define the Harthong–Reeb line,
$\mathcal{H\;\!\!R}_\omega$, as the quotient space
$\text{O}({{\omega}}) / \text{o}({{\omega}})$. We denote by
$=_{{\omega}}$ the corresponding equivalence relation. The Harthong–Reeb line is equipped with the following operations.
where
$\div$ denotes the (term-wise) integer division:
$a\div b=\left\lfloor{a/b}\right\rfloor$.
The set
$\mathcal{H\;\!\!R}_\omega$ is also equipped with a partial order relation,
$\le_{{\omega}}$:
The relation
$\le_{{\omega}}$ is well defined (the choice of the representatives does not matter). The tuple
$(\mathcal{H\;\!\!R}_\omega,+,\times_{{\omega}},\le_{{\omega}})$ is an ordered commutative ring (Chollet et al., Reference Chollet, Wallet, Fuchs, Largeteau-Skapin and Andres2009, Reference Chollet, Wallet, Fuchs, Andres and Largeteau-Skapin2012; Magaud et al., Reference Magaud, Chollet and Fuchs2015).
It was proved in Chollet et al., (Reference Chollet, Wallet, Fuchs, Largeteau-Skapin and Andres2009, Reference Chollet, Wallet, Fuchs, Andres and Largeteau-Skapin2012) that
$\mathcal{H\;\!\!R}_\omega$ and
${\mathbb Q}_{\lim}$ are isomorphic via the map
$\phi_{{\omega}}$ and its converse
$\psi_{{\omega}}$ (both maps are well defined):
We end this section about the Harthong–Reeb line by an example. Let
${{\omega}}$ be the sequence
$\langle 10^{n}\rangle$. To obtain the image of
$\sqrt 3$ in
$\mathcal{H\;\!\!R}_\omega$, we need a sequence of rationals converging toward
$\sqrt 3$. So, using the Babylonian algorithm, we set
$b(0)=3$ and
$b(n+1)=(b(n)+3/b(n))/2$ for any
$n\in\mathbb{N}$. Then, the projection of b on
${\mathbb Q}_{\lim}$ represents the real
$\sqrt 3$ in
${\mathbb Q}_{\lim}$. Finally, the morphism
$\psi_{{\omega}}$ yields the Harthong–Reeb number which represents
$\sqrt 3$ in
$\mathcal{H\;\!\!R}_\omega$. It is the class (for the relation
$=_{{\omega}}$) of the sequence
$\langle \left\lfloor{10^{n}b(n)}\right\rfloor\rangle$, that is, the sequence
$3, 20, 175, 1732, 17320, 173205, \cdots$ up to sequences dominated by
$10^n$ asymptotically.
Since one of the goals of this article is to compare the Harthong–Reeb line with sequences, defined in Sections 2.2 and 3, that are indexed by
$\mathbb{Z}$, from now on we assume that the sequences in
$\mathcal{H\;\!\!R}_\omega$ are defined on
$\mathbb{Z}$. Actually, the values of the sequences for the negative indexes are not meaningful since equality between Harthong–Reeb numbers is asymptotically evaluated (toward positive infinity).
The Harthong–Reeb line is so unconstrained that it is spoiled with undesirable numbers that have no inverse and are neither zero nor positive nor negative (Appendix D gives some topological insight about this problem). Furthermore, because of the lack of constraint and contrary to a positional numeration system, the view
$x_n$ of a real number x at a given scale n provided by the model does not necessarily give an accurate approximation of x. Only the whole integer sequence
$(x_n)$ can give such an information. Indeed, since the model can be described using Landau notations, it only relies on convergence properties. For all these reasons, It is necessary to constrain the Harthong–Reeb model. This will be done in Section 3 by adopting the bound property and the algorithms presented in the following subsection.
2.2 Representations of real numbers
In this section, we describe the work of Ménissier-Morain (Reference Ménissier-Morain2005) about arbitrary precision approximations of real numbers.
Let
$B\in\mathbb{N}$,
$B\geq 2$. Notice that we assume that B is set for the rest of this article.
Let
$x\in\mathbb R$. A sequence
${{\left\langle {x_n}\right\rangle}}_{n\in\mathbb{Z}}$ of integers is a tight representation Footnote 1
of x if, for any n, the bound property of x by
$x_n$ for order n is satisfied:
In other words,
${{\left\langle {x_n}\right\rangle}}$ is a tight representation of x if, for any n,
$x_n =\left\lfloor{x B^n}\right\rfloor$ or
$x_n =\left\lceil{x B^n}\right\rceil$. In particular,
$\lim x_n/B^n = x$;if
${{\left\langle {x_n}\right\rangle}}$ is a tight representation of x, then, for any
$n < -\log_B\!(\lvert x\rvert)$, either
$x_n=0$ or
$x_n=\varepsilon$ where
$\varepsilon = 1$ if x is positive and
$\varepsilon = -1$ if x is negative;the tight representations of a given integer coincide for the positive indices;
the rational q admits for tight representation the sequence
${{\left\langle {q_n}\right\rangle}}_{n\in\mathbb{N}}$ where
\[q_n=\left\lfloor{ B^n q}\right\rfloor;\]
given
$x,y\in\mathbb R$ with tight representations
${{\left\langle {x_n}\right\rangle}}$ and
${{\left\langle {y_n}\right\rangle}}$, the real
$x+y$ admits for tight representation the sequence
${{\left\langle {z_n}\right\rangle}}_{n\in\mathbb{N}}$ where
The binary operator over integer sequences
\begin{equation*} z_n=\left\lfloor{\frac{x_{n+w}+y_{n+w}}{B^w}}\right\rceil\quad\text{ with } w=\begin{cases} 1 &\text{ if } B\geq 4,\\2&\text{ if } B=2\text{ or } 3.\end{cases} \end{equation*}
is denoted by
\[(\,{{\left\langle {x_n}\right\rangle}},{{\left\langle {y_n}\right\rangle}})\mapsto{{\left\langle {z_n=\left\lfloor{{(x_{n+w}+y_{n+w})}/{B^w}}\right\rceil}\right\rangle}}\]
$+_B$.
The computation of the product tight representation needs the definition of the most significant digit (msd):
For any tight representation
\begin{equation*} \mathrm{msd}\,(\,{{\left\langle {x_n}\right\rangle}}_{n\in\mathbb{Z}}\,)= \min\{n\in\mathbb{Z}\,,\,\lvert{x_n}\rvert >1\}. \end{equation*}
${{\left\langle {x_n}\right\rangle}}$ of a nonzero number,
$\mathrm{msd}\,(\,{{\left\langle {x_n}\right\rangle}}\,)$ is finite, whereas
$\mathrm{msd}\,(\,{{\left\langle {0}\right\rangle}}\,)=+\infty$. Given two tight representations
${{\left\langle {x_n}\right\rangle}}$ and
${{\left\langle {x_n'}\right\rangle}}$ of x,
$\mathrm{msd}\,(\,{{\left\langle {x_n}\right\rangle}}\,)$ and
$\mathrm{msd}\,\left({{\left\langle {x_n'}\right\rangle}}\right)$ may differ from one unit.Footnote 2
Moreover, for any
$n\geq \mathrm{msd}\,(\,{{\left\langle {x_n}\right\rangle}}\,)$, one has
(6)
\begin{equation} B^{n-\mathrm{msd}\,({{\left\langle {x_n}\right\rangle}})} \leq \left|x_{n}\right| \leq 2 B^{n-\mathrm{msd}\,({{\left\langle {x_n}\right\rangle}})+1}. \end{equation}
Actually, the computation of the product of two tight representations only needs the following bounded version of the function msd:
\begin{equation} \mathrm{msd}^*\,({{\left\langle {x_n}\right\rangle}},n)\overset{\mathrm{def}}{=} \begin{cases} \mathrm{msd}\,({{\left\langle {x_n}\right\rangle}})&\quad\text{if $|x_0|>1$},\\ \inf\!(\,\mathrm{msd}\,({{\left\langle {x_n}\right\rangle}}), \sup(0, n))&\quad\text{otherwise}. \end{cases} \end{equation}
Observe that the condition
$|x_0|>1$ is equivalent to
$\mathrm{msd}\,(x)\le 0$, in which case
${{\left\langle {x_n}\right\rangle}}$ is the tight representation of a nonzero number and
$\mathrm{msd}\,(x)$ is finite. If
$|x_0|\le 1$, that is,
$\mathrm{msd}\,(\,{{\left\langle {x_n}\right\rangle}}\,)>0$, and if
$n>0$, the computation of
$\mathrm{msd}^*(x,n)$ is done by an incremental search starting from 1 with at most n steps. That way, contrary to the function msd, the value of
$\mathrm{msd}^*\!({{\left\langle {0}\right\rangle}}, n)$ is finite, equal to 0 if
$n\leq 0$ and equal to n otherwise.
Given
$x,y\in\mathbb R$ with tight representations
${{\left\langle {x_n}\right\rangle}}$ and
${{\left\langle {y_n}\right\rangle}}$, the real
$x\times y$ admits for tight representation the sequence
${{\left\langle {z_n}\right\rangle}}_{n\in\mathbb{N}}$ whereFootnote 3
\begin{equation*} \begin{split} z_n&=\mathrm{sign}\!(x_{p_x})\times\mathrm{sign}\!(y_{p_y})\times\left\lfloor{\frac{1+\lvert x_{p_x} y_{p_y}\rvert}{B^{p_x+p_y-n}}}\right\rceil\\[3mm] &\text{with}\ p_x=\max\!\left(n-\mathrm{msd}^*\!\left({{\left\langle {y_n}\right\rangle}}, \frac{n-w}2+v\right)+v,\ \left\lfloor{\frac{n+w}2}\right\rfloor\right)\\ &\text{and}\ p_y=\max\!\left(n-\mathrm{msd}^*\!\left({{\left\langle {x_n}\right\rangle}}, \frac{n-w}2+v\right)+v,\ \left\lfloor{\frac{n+w}2}\right\rfloor\right)\\ &\text{and}\ (v,w) = \begin{cases} (3,2)&\text{ if } B\geq 4,\\ (3,3)&\text{ if } B=3,\\ (4,3)&\text{ if } B=2. \end{cases} \end{split} \end{equation*}
The binary operator over integer sequences
is denoted by
$\cdot_B$.
Given
$x\in\mathbb R$, the reader will find in Ménissier-Morain (Reference Ménissier-Morain1995), algorithms to compute tight representations of
$1/x$,
$\sqrt[k]{x}$,
$\exp\!(x)$,
$\log_{b}\!(x)$,
$\arctan\!(x)$,
$\sin\!(x)$,
$\cos\!(x)$, etc.To get a tight representation of the quotient of two reals, one can combine a product and an inverse operation. Nevertheless, it can be useful to compute the division directly. In Appendix E, we give the formula yielding the quotient of two numbers from their respective tight representations.
Taking the same example as in Section 2.1 and according to Ménissier-Morain (Reference Ménissier-Morain1995), a tight representation of
$\sqrt 3$ for
$B=10$ is given by the sequence
$\langle{\underline{\sqrt{\phantom\cdot}}(x_{2n})}\rangle$ where
${{\left\langle {x_n}\right\rangle}}=\langle3, 30, 300,\cdots\rangle$ is a tight representation of 3 and
$\underline{\sqrt{\phantom\cdot}}(x)=\left\lfloor{\sqrt x}\right\rfloor$ is returned by the algorithm
$\{\verb!int ! z =x$;
$\verb!int ! y =z+1$;
$\verb!while ! (z<y)$
$\{y=z;\; z=(y+x\div y)\div 2;\}$
$\verb!return ! y;\}$. The obtained tight representation is the sequence 1, 17, 173, 17320, 173205,
$\cdots$.
3. From Integer Sequences to Real Numbers
3.1 Four sets of integer sequences
In this section, we define a subset of the integer sequences
${{\left\langle {B}\right\rangle}}$ that corresponds to the tight representations of the real numbers as defined in Ménissier-Morain (Reference Ménissier-Morain2005) (see Section 2.2) but without using any real number. We will also introduce another subset
$\widetilde{{{\left\langle { B}\right\rangle}}}$, slightly bigger than the first one, that has the advantage to have a simpler characterization. In the following, we set
and we will compare these two sets
${{\left\langle {B}\right\rangle}}$ and
$\widetilde{{{\left\langle { B}\right\rangle}}}$ with
$\text{O}({{\omega}})$, which is used to define
$\mathcal{H\;\!\!R}_\omega$ (see Section 2.1), and with the Cauchy sequences of
$\text{O}({{\omega}})$.
3.1.1 The set
${{\left\langle {B}\right\rangle}}$ of tight representations of real numbers
The goal of V. Ménissier-Morain in her thesis and in Ménissier-Morain (Reference Ménissier-Morain2005) was to define accurate integer sequences from real numbers together with arithmetic operations on these sequences. Thus, the construction goes from reals to integer sequences. In this article, we want to do the converse: from integer sequences to reals. More precisely, our goal is to prove that the so called tight representations of real numbers provide a construction of the real field (as Cauchy sequences or Dedekind cuts do, for instance). The consequence is that we have to find a new definition of these tight representations. Indeed, in Ménissier-Morain (Reference Ménissier-Morain2005), the definition of the tight representations of real numbers relies on the bound property (5), which involves the real represented by the integer sequence. So, the bound property cannot be used in the construction of the real field. The following theorem provides a formula that makes it possible to define the tight representations of real numbers in a construction of the real field, that is, without any real variable in the formula.
Theorem 1. An integer sequence
${{\left\langle {x_n}\right\rangle}}$ is a tight representation of a real number if and only if
Furthermore, the real x of which such a sequence
${{\left\langle {x_n}\right\rangle}}$ is the tight representation is unique, the rational sequence
${{\left\langle {x_n/B^n}\right\rangle}}$ is convergent and
$x=\lim {{\left\langle {x_n/B^n}\right\rangle}}$.
We prove the above theorem in two steps. The first part (the only if part) corresponds to Lemma 2, whereas the second part (the if part) corresponds to Lemma 4.
Lemma 2. If the sequence
${{\left\langle {x_n}\right\rangle}}$ is a tight representation of a real number, then
${{\left\langle {x_n}\right\rangle}}$
satisfies Equation (9).
Proof Let
$n\in\mathbb{Z}$. From the bound property (5), we get for any
$k\in\mathbb{Z}$:
where
$\varepsilon_n$ and
$\varepsilon_{n+k}$ lie in
$(-1,1)$.
Then, multiplying Equation (10) by
$B^k$ and subtracting Equation (11), we obtain:
Taking i such that
$B^i > 1/(1-\left|\varepsilon_n\right|)$ (thus
$i\ge 1$), we derive that
Assuming now
$k\in\mathbb{N}$, we observe that both sides of Equation (12) are integers. We derive that, for any
$k\in\mathbb{N}$,
In order to establish the if part of Theorem 1, i.e. that Equation (9) implies the bound property (5) for some real x, we need to characterize such a real starting from the integer sequence
${{\left\langle {x_n}\right\rangle}}$. This is done by exhibiting a Cauchy sequence.
Proposition 3. Let
${{\left\langle {x_n}\right\rangle}}$ be an integer sequence satisfying Equation (9). Then, the sequence
${{\left\langle {x_n/B^n}\right\rangle}}$ is a Cauchy sequence.
Proof. Let
$m\in\mathbb{Z}$. Let us prove that, for a sufficiently large integer n and any
$k\in\mathbb{N}$,
$\lvert \tfrac{x_n}{B^n}-\frac{x_{n+k}}{B^{n+k}}\rvert\le \tfrac1{B^m}$:
\begin{equation*}\begin{split}\left| \frac{x_n}{B^n}-\frac{x_{n+k}}{B^{n+k}}\right|& \le \frac1{B^{n+k}} \ \left| B^k x_n-x_{n+k}\right| \\&\le \frac1{B^{n+k}}\times \frac{(B^i-1)(B^k +1)}{B^i}\quad\text{thanks to (9)}\\& \le \frac1{B^{n+k}}\times B^{k+1} \\& \le \frac1{B^{n-1}}.\end{split}\end{equation*}
Thus, it is sufficient to choose
$ n\geq m+1$.
We can now complete the proof of Theorem 1.
Lemma 4. Let
${{\left\langle {x_n}\right\rangle}}$ be an integer sequence satisfying Equation (9). Then,
${{\left\langle {x_n}\right\rangle}}$ satisfies the bound property (5) for the real x that is the limit of the Cauchy sequence
${{\left\langle {x_n/B^n}\right\rangle}}$.
Proof. Let x be the limit of the Cauchy sequence
${{\left\langle {x_n/B^n}\right\rangle}}$ and
$m\in\mathbb{Z}$. Let
$i\in\mathbb{Z}$ such that, for any
$k\in\mathbb{N}$,
$B^i\left|B^k x_m - x_{m+k}\right|\le (B^i-1)(B^k+1)$. Let
$k_i\in\mathbb{N}$ such that, for any
$k\ge k_i$,
$\lvert x-\tfrac{x_{m+k}}{B^{m+k}}\rvert \le \tfrac 1{2B^{m+i}}$. Then, for any
$k\ge k_i$,
\begin{equation*}\begin{split}\lvert B^m x - {x_m}\rvert& \le B^m\left| x - \frac{x_{m+k}}{B^{m+k}}\right| + \frac{1}{B^{k}} \left| x_{m+k} - {x_m}{B^k}\right| \\& \le \frac{1}{2B^{i}} + \frac{(B^i-1)(B^k+1)}{B^{k+i}}\quad\text{from (9)}\\& \le 1-\frac1{2B^i}+\frac1{B^k}(1-\frac{1}{B^{i}}).\end{split}\end{equation*}
Since the integer k can be chosen arbitrarily large, the bound property holds:
Thanks to Theorem 1, and because any real number has a tight representation (for instance, the sequence
${{\left\langle {\left\lfloor{x B^n}\right\rfloor}\right\rangle}}$), we can define a subset of the integer sequences that represent real numbers without using any real variable.
Definition 5 (Tight adic sequence). A tight B-adic sequence is an integer sequence
${{\left\langle {x_n}\right\rangle}}$ such that:
The set of all tight B-adic sequences is denoted by
${{\left\langle {B}\right\rangle}}$. The real number represented by a tight B-adic sequence
${{\left\langle {x_n}\right\rangle}}$ is denoted
$\lim_B\!\big({{\left\langle {x_n}\right\rangle}}\big)$, or more simply,
$\lim_B{{\left\langle {x_n}\right\rangle}}$.
Remark 6 If we strengthen Equation (9) by putting “
$\forall k\in\mathbb{Z}$” instead of “
$\forall k\in\mathbb{N}$”, Lemma 2 is no more valid while Lemma 4 remains true. That way, we have the possibility of defining a subset of tight B-adic sequences that are zero below some threshold unlike the tight representations defined in
Ménissier-Morain (Reference Ménissier-Morain2005) for which we can just assert that they lie in the set
$\{0,1\}$ or in the set
$\{-1,0\}$.
Indeed, since
and
the assumption
$\forall k\in\mathbb{Z},\ B^i\left| B^k x_n - x_{n+k}\right| \le (B^i-1)(B^k+1)$ implies
$x_{n}=0$ when n is near
$-\infty$.
The next section presents a set of integer sequences whose definition is simpler than the definition of tight B-adic sequences and that are almost tight representations of real numbers.
3.1.2 The set
$\widetilde{{{\left\langle { B}\right\rangle}}}$ of loose representations of real numbers
The goal of this section is to examine what happens if we replace the strict inequalities in the bound property by large inequalities.
In doing so, we will see that we save the variable i in the intrinsic definition of a representation, going from 3 variables to 2 variables, thus obtaining a simpler statement:
\begin{align*}\forall\, n\in\mathbb{Z}, \exists\,i\in\mathbb{Z},\forall\, k\in\mathbb{N},\ B^i\left| B^k x_n - x_{n+k}\right| & \le (B^i-1)(B^k+1)\\ &\quad\quad\quad\quad\quad {\text{(Definition 5 [Tight}\, \textit{B}{\text{-adic sequence])}}},\end{align*}
versus
This simplification makes definitions and proofs much easier to carry out, at the very small cost of losing at most 1 unit beyond some index in the integer sequence, only for sequences converging toward reals with finite B-adic expansion (Proposition 8). For instance, the sequence
${{\left\langle {\dotsc, x_0=3, x_1=7, x_2=\underline{20}, x_3=\underline{60}, x_4=\underline{180}, \cdots}\right\rangle}}$ is a 3-adic sequence representing the rational
$x=\,^{20}\!/_9$, and the underlined terms are common to all tight representations of x, whereas
${{\left\langle {\dotsc, x_0=3, x_1=7, {x_2=21}, {x_3=61}, {x_4=181}, \cdots}\right\rangle}}$ is a loose 3-adic sequence representing the rational x.
So, let us begin by naming this relaxed bound property.
Definition 7 (Loose representation). An integer sequence
${{\left\langle {x_n}\right\rangle}}_{n\in\mathbb{Z}}$ satisfies the weak bound property for the real x if, for any
$n\in\mathbb{Z}$,
Such an integer sequence is called a loose representation of the real number x.
Next, for a given real x, we compare the set of its loose representations to the set of its tight representations. It is plain that any tight representation is a loose representation. We will see that the converse is almost true.
Proposition 8. Let x be a real number and
${{\left\langle {x_n}\right\rangle}}$ be a loose representation of x. Then,
(1) if x has not a finite B-adic expansion,
${{\left\langle {x_n}\right\rangle}}$ is a tight representation of x.-
(2) if x has a finite B-adic expansion, that is,
$x= p/B^m$ for some
$p,m\in\mathbb{Z}$, then there exists a tight representation
${{\left\langle {y_n}\right\rangle}}$ of x such that
$x_n=y_n$ for any
$n<m$ and
$\left|x_n-y_n\right|=\left|x_n-xB^n\right|\le 1$ for any
$n\ge m$.
Proof. Since
${{\left\langle {x_n}\right\rangle}}$ is a loose representation of x, we have
(1) If x has not a finite B-adic expansion, whatever the value of n, the left-hand side of (14) is not an integer. Then, Equation (14) is equivalent to
$\left|x_n-xB^n\right| < 1$, that is, to the bound property (5) for x with order n.-
(2) Assume that
$x=p/B^m$ for some
$p, m\in\mathbb{Z}$. Then, for any
$n<m$ the left-hand side of (14) is not an integer and we conclude as above that
$x_n$ satisfies the bound property for x at order n. In this case, we set
$y_n=x_n$. Let n be an integer greater than or equal to m. Then
$xB^n$ is an integer. So, setting
$y_n=xB^n$, we get
$\left|x_n-y_n\right|\le 1$. The sequence
${{\left\langle {y_n}\right\rangle}}$ clearly satisfies the bound property for any
$n\in\mathbb{Z}$. Hence, the result holds.
Proposition 8 means that there is no difference between tight representations and loose representations for irrational numbers as
$\pi$ or
$\sqrt2$. Alike, both types of representations are also the same for the rational
$x=\,^{20}\!/_{9}$ and the base
$B=2$ for instance. If
$B=3$, on the one hand, the terms of both the tight and loose 3-adic sequences representing x obey to equivalent rules until the index
$n=2$. But, on the other hand, the terms beyond the index 2 are unique for tight representations of x (written in base 3, these terms are
$\overline{202}, \overline{2020}, \overline{20200}, \dotsc$), whereas the subsequence
${{\left\langle {x_k}\right\rangle}}_{k\ge 2}={{\left\langle { \overline {201}, \overline{2021}, \overline{20201}, \dotsc}\right\rangle}}$ can be found in a loose representation of
$^{20}\!/_{9}$.
We continue the study of the loose representations of reals by giving an “internal” definition of theses sequences, that is, a definition without reals.
Theorem 9. An integer sequence
${{\left\langle {x_n}\right\rangle}}$ is the loose representation of a real number if and only if
Furthermore, the real x of which such a sequence
${{\left\langle {x_n}\right\rangle}}$ is the representation is unique, the rational sequence
${{\left\langle {x_n/B^n}\right\rangle}}$ is convergent and
$x=\lim {{\left\langle {x_n/B^n}\right\rangle}}$.
The proof of Theorem 9 is similar to the proof of Theorem 1. Therefore, to avoid a tedious repetition, we put it in Appendix A.
Alike we have defined the tight B-adic sequences as the integer sequences that are tight representations of real numbers, we can now define the loose B-adic sequences.
Definition 10 (Loose adic sequence). A loose B-adic sequence is an integer sequence
${{\left\langle {x_n}\right\rangle}}$ such that
The set of all loose B-adic sequences is denoted by
$\widetilde{{{\left\langle { B}\right\rangle}}}$. The real number represented by a loose B-adic sequence
${{\left\langle {x_n}\right\rangle}}$ is denoted
$\lim_B\!\big(\,{{\left\langle {x_n}\right\rangle}}\!\big)$, or more simply,
$\lim_B\!{{\left\langle {x_n}\right\rangle}}$.
Note that, contrary to tight B-adic sequences (see Remark 6), replacing
$\forall k\in\mathbb{N}$ by
$\forall k\in\mathbb{Z}$ in the above definition has no effect.
Since it is plain that tight representations are loose representations, it follows that tight B-adic sequences are loose B-adic sequences. Nevertheless, it is interesting to have a proof of this inclusion relation that does not use real numbers:
\begin{align*}&{{\left\langle {x_n}\right\rangle}} \text{ is a tight $B$-adic sequence}&\\& \quad \quad \quad \quad \implies \forall n\in\mathbb{Z},\exists i\in\mathbb{Z},\forall k\in\mathbb{N},\ B^i\left| B^k x_n - x_{n+k}\right| \le (B^i-1)(B^k+1) \\& \quad \quad \quad \quad \implies \forall n\in\mathbb{Z},\exists i\in\mathbb{Z},\forall k\in\mathbb{N},\ B^i\left| B^k x_n - x_{n+k}\right| \le B^i(B^k+1) \\& \quad \quad \quad \quad \implies \forall n\in\mathbb{Z},\exists i\in\mathbb{Z},\forall k\in\mathbb{N},\ \left| B^k x_n - x_{n+k}\right| \le (B^k+1) \\& \quad \quad \quad \quad \implies \forall n\in\mathbb{Z},\forall k\in\mathbb{N},\ \left| B^k x_n - x_{n+k}\right| \le (B^k+1) \\& \quad \quad \quad \quad \implies {{\left\langle {x_n}\right\rangle}} {\text{is a loose}\, \textit{B}\,{\text{-adic sequence}}}.\end{align*}
In the following section, we compare the (tight, loose) B-adic sequences with the integer sequences used to define the set
$\mathcal{H\;\!\!R}_\omega$.
3.1.3 Relations between the sets of integer sequences used to represent real numbers
In Section 2.1, we saw that the Harthong–Reeb line is defined as a quotient of the set
$\text{O}({{\omega}})$ where
${{\omega}}$ is an “infinitely large number”. Taking
${{\omega}}={{\left\langle {B^n}\right\rangle}}$,
$\text{O}({{\omega}})$ can be specified as the set of the integer sequences
${{\left\langle {x_n}\right\rangle}}_{n\in\mathbb{Z}}$ such that:
We also consider a subset of
$\text{O}({{\omega}})$, introduced in Chollet et al. (Reference Chollet, Wallet, Fuchs, Andres and Largeteau-Skapin2012): the regular sequences. An integer sequence
${{\left\langle {x_n}\right\rangle}}$ is regular if the rational sequence
${{\left\langle {x_n/{{\omega}}_n}\right\rangle}}$ is a Cauchy sequence. In the thesis, the goal of this definition is to emphasize that the Harthong–Reeb line contains many non-regular elements which explain why the Harthong–Reeb line does not satisfies all the Heyting–Bridges axioms of the constructive real line. For consistency reasons, we will use the following definition.
Definition 11 (Regular sequence). An integer sequence
${{\left\langle {x_n}\right\rangle}}$ is regular if
The equivalence of this definition with the definition given in Chollet (Reference Chollet2010) is given in Appendix B. In particular, it is worth observing that Equation (17) is equivalent to (see Appendix B):
Let
${{\left\langle {x_n}\right\rangle}}$ be a regular sequence and let
$x=\lim{{\left\langle {x_n/B^n}\right\rangle}}$. We say that the sequence
${{\left\langle {x_n}\right\rangle}}$ is a free representation of x and we write
$x=\lim_B{{\left\langle {x_n}\right\rangle}}$. The subset of
$\text{O}({{\omega}})$ formed by the regular sequences is denoted by
$\text{O}^{\text{reg}}({{\omega}})$.
These two subsets
$\text{O}({{\omega}})$ and
$\text{O}^{\text{reg}}({{\omega}})$ of the integer sequences are related to the (tight, loose) B-adic sequences by the following inclusion relations.
Proposition 12. For any integer
$B\ge 2$,
Proof. We show the inclusions from left to right.
We saw in Section 3.1.2 that
${{\left\langle {B}\right\rangle}}\subset\widetilde{{{\left\langle { B}\right\rangle}}}$.Let
${{\left\langle {x_n}\right\rangle}}$ be a loose B-adic sequence. We have
We have to prove Equation (17). So, let
\[\forall n\in\mathbb{Z}, \forall k\in\mathbb{N},\ \left|B^k x_n-x_{n+k}\right|\le B^k+1.\]
$i\in\mathbb{Z}$. Noting that
$B^k+1\le B^{k+1}$ for any
$k\ge 0$ (since
$B\ge 2$), we derive that
Then, multiplying both side of the inequality by
\[\forall n\in\mathbb{Z}, \forall k\in\mathbb{N},\ \left|B^k x_n-x_{n+k}\right|\le B^{k+1}.\]
$B^i$ and putting
$n=i+1$,
Thus,
\[\exists n=i+1\in\mathbb{Z}, \forall k\in\mathbb{N},\ B^i\left|B^k x_n-x_{n+k}\right|\le B^{n+k}.\]
${{\left\langle {x_n}\right\rangle}}\in\text{O}^{\text{reg}}({{\omega}})$.
Let
${{\left\langle {x_n}\right\rangle}}\in\text{O}^{\text{reg}}({{\omega}})$:
In particular, taking
\[\forall i\in\mathbb{Z}, \exists n\in\mathbb{Z}, \forall k\in\mathbb{N},\ B^i\left|B^k x_n - x_{n+k}\right|\le B^{n+k}.\]
$i=0$,
We derive that
\[\exists n\in\mathbb{Z}, \forall k\in\mathbb{N},\ \left|B^k x_n-x_{n+k}\right|\le B^{n+k}.\]
We can now choose an integer j such that
\[\exists n\in\mathbb{Z}, \forall k\in\mathbb{N},\ \left|x_{n+k}\right|\le B^{n+k}\left(1+B^{-n}\lvert x_n\rvert \right).\]
$B^j\ge 1+B^{-n}\lvert x_n\rvert$:
Thereby, according to Equation (16),
\[\exists n\in\mathbb{Z}, \exists j=\left\lceil{\log_B\!\left(1+B^{-n}\lvert x_n\rvert \right)}\right\rceil\in\mathbb{Z}, \forall k\in\mathbb{N},\ \left|x_{n+k}\right|\le B^{n+k+j}.\]
${{\left\langle {x_n}\right\rangle}}\in\text{O}({{\omega}})$.
Now that we have compared the four subsets of the integer sequences, the next step is to look at the four quotient spaces.
3.2 Quotient spaces
We saw in Section 2.1, that the Harthong–Reeb line
$\mathcal{H\;\!\!R}_\omega$ is the quotient space
$\text{O}({{\omega}})/\text{o}({{\omega}})$ (recall that we write
$=_{{{\omega}}}$ for the corresponding equivalence relation). Alike, we define the quotient spaces
$\mathcal{H\;\!\!R}_{{{\omega}}}^{\text{reg}}=\text{O}^{\text{reg}}({{\omega}})/ \text{o}({{\omega}})$,
${\mathcal {B}_{{{\omega}}}}={{\left\langle {B}\right\rangle}}/\text{o}({{\omega}})$ and
${\widetilde{\mathcal {B}_{{{\omega}}}}}=\widetilde{{{\left\langle { B}\right\rangle}}}/\text{o}({{\omega}})$. In this section, we aim at propagating the algebraic structure of
$\mathcal{H\;\!\!R}_\omega$ to the three other quotient spaces. But before that, we have to rewrite the definition of the equivalence relation
$=_{{{\omega}}}$ in a form compatible with B-adic numbers:
Alike, we rewrite the order relation
$\le_{{\omega}}$ (by abuse of notation, we confuse the order on the sequences and the order on the classes).
3.2.1 Canonical maps between the quotient spaces
The inclusion relations of Proposition 12 result in inclusion relations between the classes of the equivalence relation
$=_{{{\omega}}}$ and the classes of its restrictions to the subsets
${{\left\langle {B}\right\rangle}}$,
$\widetilde{{{\left\langle { B}\right\rangle}}}$ and
$\text{O}^{\text{reg}}({{\omega}})$. Indeed, for any two sets
$A\subset B$, any equivalence relation
$E\subset B\times B$ and any
$x\in A$,
$\{y\in A\mid (x,y)\in E\}\subset\{y\in B\mid (x,y)\in E\}$, that is the class of
$x\in A$ for the restriction of E to A is included in the class of x for E. These inclusions between equivalence classes result in turn in three canonical maps between the quotient spaces:
Definition 13 (Inclusions). The inclusions between the classes of the relation
$=_{{{\omega}}}$ in the spaces
${\mathcal {B}_{{{\omega}}}}$,
${\widetilde{\mathcal {B}_{{{\omega}}}}}$,
$\mathcal{H\;\!\!R}_{{{\omega}}}^{\text{reg}}({{\left\langle {B^n}\right\rangle}})$, and
$\mathcal{H\;\!\!R}_\omega$ are denoted
${{\mathrm{inc_1}}}$,
${{\mathrm{inc_2}}}$, and
${{\mathrm{inc_3}}}$, respectively:
\begin{align*}{\mathcal {B}_{{{\omega}}}} & \xrightarrow{{{\mathrm{inc_1}}}} && {\widetilde{\mathcal {B}_{{{\omega}}}}} && \xrightarrow{{{\mathrm{inc_2}}}} && \mathcal{H\;\!\!R}_{{{\omega}}}^{\text{reg}} && \xrightarrow{{{\mathrm{inc_3}}}} && \mathcal{H\;\!\!R}_\omega\\ x & \longmapsto && y = \left[\dot{x}\right] && \longmapsto && z = \left[\dot{y}\right] && \longmapsto && t = \left[\dot{z}\right]\end{align*}
where, given a class a in the source space,
$\left[\dot{a}\right]$ denotes the unique class, in the destination space, including a (formally, the denotation stands for the class – in the destination space – of a representative – in the source space – of a)
Actually, the map
${{\mathrm{inc_3}}}$ is simply the identity function.
Proposition 14. For any
$x,y\in\text{O}({{\omega}})$,
$(x=_{{\omega}} y \wedge x\in\text{O}^{\text{reg}}({{\omega}})) \implies y\in\text{O}^{\text{reg}}({{\omega}})$. In other words, putting
$z=[x]$, for any class
$z\in\mathcal{H\;\!\!R}_{{{\omega}}}^{\text{reg}}$,
${{\mathrm{inc_3}}}\!(z)=z$.
Proof. Let
$x={{\left\langle {x_n}\right\rangle}}$,
$y={{\left\langle {y_n}\right\rangle}}$ be two sequences in
$\text{O}({{\omega}})$ such that
$x=_{{\omega}} y$ and x is regular.
Let
$i\in\mathbb{Z}$. Since x is regular, by Formula (18), there exists
$n_0\in\mathbb{Z}$, such that for
$n\ge n_0$ and any
$k\in\mathbb{N}$,
Moreover, since
$x=_{{\omega}} y$ and thanks to Formula (19), there exists
$n\ge n_0\in\mathbb{Z}$ such that, for any
$k\in\mathbb{N}$,
Then, adding Equations (21), (22), and
$B^k\times$ Equation (23), we get
Since
$B^2>3$, we are done: y is regular.
The following proposition expresses the fact that a class of
$=_{{{\omega}}}$ in a given set obviously contains at most one class of the restriction of
$=_{{{\omega}}}$ to a subset.
Proposition 15. The three maps
${{\mathrm{inc_1}}}$,
${{\mathrm{inc_2}}}$ and
${{\mathrm{inc_3}}}$ are one-to-one.
We end the comparison between the four quotient spaces by showing that any class of regular sequences contains a loose B-adic sequence and any class of loose B-adic sequences contains a tight B-adic sequence. Conversely, there exist elements in the Harthong–Reeb line that do not contain any regular sequence.
Proposition 16. The two maps
${{\mathrm{inc_1}}}$,
${{\mathrm{inc_2}}}$ are onto. The map
${{\mathrm{inc_3}}}$ is not onto.
Proof. Using reals, the proof is easy: given a regular sequence a, let
$x=\lim_B a$. The real x has a tight representation
${{\left\langle {x_n}\right\rangle}}$ (which is also a loose representation). Then, a is equivalent to
${{\left\langle {x_n}\right\rangle}}$ since
$\lim_B a=\lim_B{{\left\langle {x_n}\right\rangle}}$. So,
${{\mathrm{inc_2}}}$ is onto. Alike,
${{\mathrm{inc_1}}}$ is onto. Conversely, the integer sequence
${{\left\langle {(-B)^n}\right\rangle}}$ belongs to
$\text{O}(B^n)$. But it has no limit. Thus, it is not equivalent to a regular sequence. Nevertheless, writing a proof without using reals is much longer. For instance, in order to prove that
${{\mathrm{inc_2}}}$ is onto, we have to exhibit a process to build a loose B-adic sequence from a regular one, both sequences being equivalent, but without appealing to the limits.
${{\mathrm{inc_1}}}$ is onto.
Let
$a={{\left\langle {a_n}\right\rangle}}$ be a loose B-adic sequence. Put
$b_n=\left\lfloor{\frac{a_n+2}{B^2}}\right\rceil$ if
$B=2$ and
$b_n=\left\lfloor{\frac{a_n+1}{B}}\right\rceil$ otherwise.
Let
$n\in\mathbb{Z}$ and
$k\in\mathbb{N}$. Then, assuming
$B=2$,
\begin{equation*}\begin{split}B^2\left|B^k b_n - b_{n+k}\right|&\le B^2\left|B^{k}\left\lfloor{\frac{a_{n+2}}{B^2}}\right\rceil- \left\lfloor{\frac{a_{n+k+2}}{B^2}}\right\rceil\right| \\&\le \left|B^{k}a_{n+2}- {a_{n+k+2}}\right| + \frac{B^2}2\left(B^k+1\right) \\&\le \left(1+\frac{B^2}2\right)\left(B^k+1\right)\quad\text{for $a\in\widetilde{{{\left\langle { B}\right\rangle}}}$} \\&\le \left({B^2}-1\right)\left(B^k+1\right).\end{split}\end{equation*}
Thus,
$b={{\left\langle {b_n}\right\rangle}}$ is a tight B-adic sequence. The proof in the case
$B\ge 3$ is similar.
Let us now verify that the sequences a and b are equivalent. We only treat the case
$B=2$, the other case being similar.
So, let
$i\in\mathbb{Z}$,
$n\in\mathbb{Z}$.
\begin{align*}B^i\left|a_{n}-b_{n}\right|&\le B^i\left|a_n-\frac{a_{n+2}}{B^2}\right|+\frac{1}{2}B^i\\&\le B^{i-2}\left|B^2a_n-{a_{n+2}}\right|+\frac{1}{2}B^i\\&\le B^{i-2}\left(B^2+1\right)+\frac{1}{2}B^i\quad\text{for $a\in\widetilde{{{\left\langle { B}\right\rangle}}}$}\\&\le B^i\left(\frac32+\frac1{B^2}\right)\\&\le 2B^i.\end{align*}
Thus, for any
$n\ge i+1$,
$B^i\left|a_{n}-b_{n}\right|\le B^{n}$, that is,
$a=_{{{\left\langle {B^n}\right\rangle}}}b$. Eventually,
$b\in{{\mathrm{inc_1}}}^{-1}(a)$ which proves that
${{\mathrm{inc_1}}}$ is onto.
The map
${{\mathrm{inc_2}}}$ is onto.
The idea is to build a loose B-adic sequence from a regular one by pruning the latter sequence in order to satisfy Equation (15). Since the proof is rather long, it is given in Appendix C.
${{\mathrm{inc_3}}}$ is not onto.
The proof is given in Appendix D. Actually, we prove a stronger result. We define a natural topology over
$\text{O}({{\omega}})$, and we show that the set of regular sequences is not a dense subset of the space
$\text{O}({{\omega}})$ for this topology
whereas nonregular sequences form a dense subset of
$\text{O}({{\omega}})$.
3.2.2 Field structures
We saw in Section 2.2 that
$\mathcal{H\;\!\!R}_\omega$ is equipped with an ordered commutative ring structure,
$(\mathcal{H\;\!\!R}_\omega,+,\times_{{\omega}},\le_{{\omega}})$. This section aims at propagating this structure to the subsets
${\mathcal {B}_{{{\omega}}}}$,
${\widetilde{\mathcal {B}_{{{\omega}}}}}$, and
$\mathcal{H\;\!\!R}_{{{\omega}}}^{\text{reg}}({{\omega}})$.
Since
${{\mathrm{inc_3}}}$ is not onto, we need to verify that
$\mathcal{H\;\!\!R}_{{{\omega}}}^{\text{reg}}({{\omega}})$ is stable for the operators
$+$ and
$\times_{{{\omega}}}$.
Lemma 17. The subset
${{\mathrm{inc_3}}}\!(\mathcal{H\;\!\!R}_{{{\omega}}}^{\text{reg}})$ of
$\mathcal{H\;\!\!R}_\omega$ is stable for the operators
$+$ and
$\times_{{\omega}}$.
Addition
Let
$a={{\left\langle {a_n}\right\rangle}}$ and
$b={{\left\langle {b_n}\right\rangle}}$ be two regular sequences. Since the addition in
$\mathcal{H\;\!\!R}_\omega$ is derived from the term-wise addition, it is sufficient to prove that the sequence
${{\left\langle {a_n+b_n}\right\rangle}}$ is regular, that is, for any
$i\in\mathbb{Z}$,
$\left|B^k (a_n + b_n) - (a_{n+k} + b_{n+k})\right|$ is less than
$B^{n+k}/B^i$ for sufficiently large n and any
$k\in\mathbb{N}$.
Let
$i\in\mathbb{Z}$. Because a and b are regular,
$\left|B^k a_n - a_{n+k} \right|$ and
$\left|B^k b_n - b_{n+k}\right|$ are less than
$B^{n+k}/B^{i+1}$ for sufficiently large n and for any
$k\in\mathbb{N}$.
Then, for
$B\ge 2$,
Multiplication
Recall that the product
$\times_{{\omega}}$ in
$\mathcal{H\;\!\!R}_\omega$ is defined by
$[u]\times_{{\omega}}[v]=[(u\times v)\div {{\omega}}]$ where
$[\cdot]$ stands for the equivalence class and
$\times$,
$\div$ are the term-wise multiplication and integer division, respectively.
Let
$a={{\left\langle {a_n}\right\rangle}}$ and
$b={{\left\langle {b_n}\right\rangle}}$ be two regular sequences. By abuse of notation, we write
$a \times_{{\omega}} b$ for the sequence
${{\left\langle {(a_n b_n)\div {{\omega}}}\right\rangle}}$ (with
${{\omega}}=B^n$). In order to prove that
${{\mathrm{inc_3}}}\!(\mathcal{H\;\!\!R}_{{{\omega}}}^{\text{reg}})$ is stable for
$\times_{{\omega}}$, it is sufficient to prove that
$a\times_{{\omega}} b$ is regular.
So, let
$i\in\mathbb{Z}$. We shall prove that
for sufficiently large n and any
$k\in\mathbb{N}$.
First, we split
$\left|B^k (a_n\times_{{\omega}} b_n) - (a_{n+k}\times_{{\omega}} b_{n+k})\right|$ in three terms.
\begin{equation*}\begin{split}& \left|B^k (a_n\times_{{\omega}} b_n) - (a_{n+k}\times_{{\omega}} b_{n+k})\right|\\ &= \left|B^k \left((a_n b_n)\div B^n\right) - (a_{n+k} b_{n+k})\div B^{n+k}\right|\\&=\left|B^k \left(\frac{a_n b_n}{B^n}+\varepsilon_1\right)-\frac{a_{n+k} b_{n+k}}{B^{n+k}}+\varepsilon_2\right|\ \text{where $\varepsilon_1, \varepsilon_2\in(-1,1)$}\\&\le\left|\frac{b_n}{B^n}\left(B^{k}a_n-a_{n+k}\right)+\frac{a_{n+k}}{B^{n+k}}\left(B^{k}b_n-b_{n+k}\right)\right| +2B^{k} \\&\le M_b \left|B^ka_n-a_{n+k}\right|+M_a \left|B^kb_n-b_{n+k}\right| +2B^{k} ,\end{split}\end{equation*}
where
$M_a=\sup_m\frac{a_m}{B^m}$ and
$M_b=\sup_m\frac{b_m}{B^m}$.
Since the sequences a and b are regular, and thus in
$\text{O}(B^n)$,
$M_a<\infty$, and
$M_b<\infty$. Hence, there exists
$i_0\in\mathbb{N}$ such that
$B^{i_0}>3\max\!(M_a, M_b)$. Furthermore, by Formula (18), for any i and for sufficiently large n,
Taking
$n\ge \log_B6+i$, we also have
$6B^{k+i}\le B^{n+k}$. Therefore, the three terms
$M_b \left|B^ka_n-a_{n+k}\right|$,
$M_a \left|B^kb_n-b_{n+k}\right|$ and
$2B^k$ are less than, or equal to
$B^{n+k}/{3B^i}$ which proves the result.
We can now extend the operators
$+$,
$\times_{{\omega}}$ and the binary relation
$\le_{{\omega}}$ to the sets
$\mathcal{H\;\!\!R}_{{{\omega}}}^{\text{reg}}$,
$\widetilde{{{\left\langle { B}\right\rangle}}}$ and
${{\left\langle {B}\right\rangle}}$ (denoting by
${{\mathrm{inc_1}}}^{-1}$, resp.
${{\mathrm{inc_2}}}^{-1}$, the inverse function of
${{\mathrm{inc_1}}}$, resp.
${{\mathrm{inc_2}}}$, and by
${{\mathrm{inc_3}}}^{-1}$ the partial inverse function of
${{\mathrm{inc_3}}}$ defined on the set
${{\mathrm{inc_3}}}\!(\mathcal{H\;\!\!R}_{{{\omega}}}^{\text{reg}})$).
Definition 18 (Operations).
(1)
$\forall x,y\in\mathcal{H\;\!\!R}_{{{\omega}}}^{\text{reg}}$
\begin{align*}x+y & \ \overset{\mathrm{def}}{=} \ {{\mathrm{inc_3}}}^{-1}\!( {{\mathrm{inc_3}}}\!(x)+{{\mathrm{inc_3}}}\!(y))\\x\times_{{\omega}} y & \ \overset{\mathrm{def}}{=} \ {{\mathrm{inc_3}}}^{-1}\!( {{\mathrm{inc_3}}}\!(x)\times_{{\omega}}{{\mathrm{inc_3}}}\!(y))\\x\le_{{\omega}} y & \overset{\mathrm{def}}{\leftrightarrow} {{\mathrm{inc_3}}}\!(x)\le_{{\omega}}{{\mathrm{inc_3}}}\!(y).\end{align*}
-
(2)
$\forall x,y\in{\widetilde{\mathcal {B}_{{{\omega}}}}}$,
\begin{align*}x+y & \ \overset{\mathrm{def}}{=} \ {{\mathrm{inc_2}}}^{-1}\!( {{\mathrm{inc_2}}}\!(x)+{{\mathrm{inc_2}}}\!(y))\\x\times_{{\omega}} y & \ \overset{\mathrm{def}}{=} \ {{\mathrm{inc_2}}}^{-1}\!( {{\mathrm{inc_2}}}\!(x)\times_{{\omega}}{{\mathrm{inc_2}}}\!(y))\\x\le_{{\omega}} y & \overset{\mathrm{def}}{\leftrightarrow} {{\mathrm{inc_2}}}\!(x)\le_{{\omega}}{{\mathrm{inc_2}}}\!(y).\end{align*}
-
(3)
$\forall x,y\in{\mathcal {B}_{{{\omega}}}}$,
\begin{align*}x+y & \ \overset{\mathrm{def}}{=} \ {{\mathrm{inc_1}}}^{-1}\!( {{\mathrm{inc_1}}}\!(x)+{{\mathrm{inc_1}}}\!(y))\\x\times_{{\omega}} y & \ \overset{\mathrm{def}}{=} \ {{\mathrm{inc_1}}}^{-1}\!( {{\mathrm{inc_1}}}\!(x)\times_{{\omega}}{{\mathrm{inc_1}}}\!(y))\\x\le_{{\omega}} y & \overset{\mathrm{def}}{\leftrightarrow} {{\mathrm{inc_1}}}\!(x)\le_{{\omega}}{{\mathrm{inc_1}}}\!(y).\end{align*}
By Definition 18, we directly have the following properties.
The map
${{\mathrm{inc_1}}}\colon ({\mathcal {B}_{{{\omega}}}},+,\times_{{\omega}},\le_{{\omega}})\to ({\widetilde{\mathcal {B}_{{{\omega}}}}},+,\times_{{\omega}},\le_{{\omega}})$ is an isomorphism.The map
${{\mathrm{inc_2}}}\colon ({\widetilde{\mathcal {B}_{{{\omega}}}}},+,\times_{{\omega}},\le_{{\omega}})\to (\mathcal{H\;\!\!R}_{{{\omega}}}^{\text{reg}},+,\times_{{\omega}},\le_{{\omega}})$ is an isomorphism.The map
${{\mathrm{inc_3}}}\colon (\mathcal{H\;\!\!R}_{{{\omega}}}^{\text{reg}},+,\times_{{\omega}},\le_{{\omega}})\to (\mathcal{H\;\!\!R}_\omega,+,\times_{{\omega}},\le_{{\omega}})$ is a one-to-one morphism.
The three morphisms
${{\mathrm{inc_3}}}$,
${{\mathrm{inc_2}}}$, and
${{\mathrm{inc_1}}}$ transfer the properties of
$\mathcal{H\;\!\!R}_\omega$ to the other structures. Actually,
${\mathcal {B}_{{{\omega}}}}$,
${\widetilde{\mathcal {B}_{{{\omega}}}}}$, and
$\mathcal{H\;\!\!R}_{{{\omega}}}^{\text{reg}}$ have a richer structure than
$\mathcal{H\;\!\!R}_\omega$: their order relation is total and they are fields, not only rings.
Proposition 20. The order
$\le_{{\omega}}$ is total in
${\mathcal {B}_{{{\omega}}}}$,
${\widetilde{\mathcal {B}_{{{\omega}}}}}$ and
$\mathcal{H\;\!\!R}_{{{\omega}}}^{\text{reg}}$.
Proof. Since
${{\mathrm{inc_1}}}$ and
${{\mathrm{inc_2}}}$ are bijective, it suffices to prove the result for the set
$\mathcal{H\;\!\!R}_{{{\omega}}}^{\text{reg}}$. Moreover, because
$\mathcal{H\;\!\!R}_\omega$ is an ordered ring, the order
$\le_{{\omega}}$ is a total order of the subset
$\mathcal{H\;\!\!R}_{{{\omega}}}^{\text{reg}}$ if and only if any nonzero element in
$\mathcal{H\;\!\!R}_{{{\omega}}}^{\text{reg}}$ is positive or negative. So, let us consider a regular sequence
$x={{\left\langle {x_n}\right\rangle}}$ that is not equivalent to the null sequence. From the definition of
$=_{{{\left\langle {B^n}\right\rangle}}}$ (Equation (19)), we derive that there exists
$i\in\mathbb{Z}$ and a sequence of indices
${{\left\langle {u_n}\right\rangle}}$ such that, for any
$n\in\mathbb{Z}$,
A consequence of the existence of such a pair
$(i,{{\left\langle {u_n}\right\rangle}})$ is that for large enough index n, the sign of
$x_n$ is not null and constant. Indeed, from Equation (25), we get
$x_{u_n}\neq 0$ for any n and from Formula (18), we derive that for large enough n,
$B^i\left|B^kx_{u_n}-x_{u_n+k}\right|\le B^{u_n+k}$ for any
$k\ge 0$. If, for some
$k\ge 1$,
$x_{u_n+k}$ has not the same sign as
$x_{u_n}$, then it comes that
$B^i\left|B^kx_{u_n}\right|\le B^{u_n+k}$, that is
$B^i\left|x_{u_n}\right|\le B^{u_n}$ which contradicts Equation (25). Since there exists
$n_0\in\mathbb{Z}$ such that
$\forall n\ge n_0,\ x_n\ge 0$ or
$\forall n\ge n_0,\ x_n\le 0$, we easily get from the definition of
$\le_{{\omega}}$, Equation (4), that either
$\left[x\right]\ge0$ or
$\left[x\right]\le 0$ and, because
$\left[x\right] \neq 0$,
$\left[x\right]>0$ or
$\left[x\right] < 0$.
Proposition 21.
${\mathcal {B}_{{{\omega}}}}$,
${\widetilde{\mathcal {B}_{{{\omega}}}}}$ and
$\mathcal{H\;\!\!R}_{{{\omega}}}^{\text{reg}}$ are ordered commutative fields.
Proof. The proof is split in three parts.
First, we prove that the tuple
$({{\mathrm{inc_3}}}\!(\mathcal{H\;\!\!R}_{{{\omega}}}^{\text{reg}}),+,\times_{{\omega}}, \le_{{\omega}})$ is a subring of
$\mathcal{H\;\!\!R}_\omega$. We already have proved that
${{\mathrm{inc_3}}}\!(\mathcal{H\;\!\!R}_{{{\omega}}}^{\text{reg}})$ is stable for the operators
$+$ and
$\times_{{\omega}}$. It remains to prove that the opposite of an element in
${{\mathrm{inc_3}}}\!(\mathcal{H\;\!\!R}_{{{\omega}}}^{\text{reg}})$ is still in
${{\mathrm{inc_3}}}\!(\mathcal{H\;\!\!R}_{{{\omega}}}^{\text{reg}})$. Since, obviously,
$[\!{{\left\langle {-x_n}\right\rangle}}\!]$ is the opposite class of
$[\!{{\left\langle {x_n}\right\rangle}}\!]$ in
$\mathcal{H\;\!\!R}_\omega$, it suffices to prove that for any regular sequence
$x={{\left\langle {x_n}\right\rangle}}$, the sequence
${{\left\langle {-x_n}\right\rangle}}$ is regular. The proof is straightforward.Second, we show that
${{\mathrm{inc_3}}}\!(\mathcal{H\;\!\!R}_{{{\omega}}}^{\text{reg}})$ is a field. At this aim, we define a map
$\mathrm{inv}\colon {{\mathrm{inc_3}}}\!(\mathcal{H\;\!\!R}_{{{\omega}}}^{\text{reg}})\setminus\left[{{\left\langle {0}\right\rangle}}\right]\to{{\mathrm{inc_3}}}\!(\mathcal{H\;\!\!R}_{{{\omega}}}^{\text{reg}})$ by putting
where the representative
\[\mathrm{inv}\!( \left[{{\left\langle {x_n}\right\rangle}}\right] )=\left[{{\left\langle {\left\lfloor{\frac{B^{2n}}{x_n}}\right\rceil}\right\rangle}}\right],\]
${{\left\langle {x_n}\right\rangle}}$ is chosen such as
$x_n\neq 0$ for any
$n\in\mathbb{Z}$ (this can be achieved for instance by replacing the zero terms by ones).
Let
$x\in{{\mathrm{inc_3}}}\!(\mathcal{H\;\!\!R}_{{{\omega}}}^{\text{reg}})\setminus\left[{{\left\langle {0}\right\rangle}}\right]$. Let us prove that inv is well-defined, that is,
$\mathrm{inv}(x)\in{{\mathrm{inc_3}}}\!(\mathcal{H\;\!\!R}_{{{\omega}}}^{\text{reg}})$ and
$\mathrm{inv}(x)$ does not depend on the choice of the representative of x.
Let
${{\left\langle {x_n}\right\rangle}}\in x$. We claim that
(26)Indeed, by hypothesis,
\begin{equation} \exists i_0\in\mathbb{Z}, \exists n_0\in\mathbb{Z}, \forall n\ge n_0, \ \left|x_n\right|\ge B^{n-i_0}. \end{equation}
${{\left\langle {0}\right\rangle}}\notin x$. Then, the negation of Equation (19) yields an integer
$i_1$ such that for any
$n\in\mathbb{Z}$, there exists
$k_n\in\mathbb{N}$ such that
(27)Moreover, thanks to the regularity of
\begin{equation} B^{i_1}\left|x_{n+k_n}\right|>B^{n+k_n}. \end{equation}
${{\left\langle {x_n}\right\rangle}}$ and Equation (18), there exists
$n_0\in\mathbb{Z}$ such that, for any
$n\ge n_0$,
Then, splitting the absolute value,
\[B^{i_1+1}\left|B^{k_n} x_n-x_{n+k_n}\right|\le B^{n+k_n}.\]
Using Equation (27),
\[B^{i_1+1}\left(\left|x_{n+k_n}\right|-B^{k_n}\left|x_n\right|\right)\le B^{n+k_n}.\]
We derive that
\[B B^{n+k_n}-B^{i_1+1+k_n}\left|x_n\right|\le B^{n+k_n}.\]
Since
\[B^{n-i_1}\frac{B-1}{B}
< \left|x_n\right|.\]
$B\ge2$, we have
$(B-1)/B\ge 1/B$. Hence, choosing
$i_0=i_1+1$, the claim is established.
Let
${{\left\langle {x_n}\right\rangle}}\in x$ with
$x_n\neq 0$ for any
$n\in\mathbb{Z}$. We now prove that the sequence
${{\left\langle {B^{2n}/x_n}\right\rangle}}$ is regular. The integers
$i_0$ and
$n_0$ are those defined in the previous item. Let
$i\in\mathbb{Z}$ and
$n\ge n_0$. We have
Since x is regular, for sufficiently large n and any
\begin{equation*} \begin{split} B^i\left|B^k\frac{B^{2n}}{x_{n}}-\frac{B^{2(n+k)}}{x_{n+k}}\right| &= B^{i+2n+k}\frac{\left|x_{n+k}-B^kx_{n}\right|}{{\left|x_{n}\right|}{\left|x_{n+k}\right|}} \\ &\le B^{i+2n+k}\frac{\left|B^k x_{n}-x_{n+k}\right|}{B^{n-i_0}B^{n+k-i_0}}\\ &\le B^{i+2q_0}\left|B^k x_{n}-x_{n+k}\right|. \end{split} \end{equation*}
$k\in\mathbb{N}$, we have
$B^{i+2q_0}\left|B^k x_{n}-x_{n+k}\right|\le B^{k+n}$, so we are done: the sequence
${{\left\langle {B^{2n}/x_n}\right\rangle}}$ is regular.
We prove that the function inv is independent of the choice of the representative. Let
${{\left\langle {x_n}\right\rangle}}$ and
${{\left\langle {y_n}\right\rangle}}$ be two representatives of x with
$x_n\neq 0$ and
$y_n\neq 0$ for any
$n\in\mathbb{Z}$. Let
$i_0^x$,
$i_0^y$,
$n_0^x$, and
$n_0^y$ be integers provided by Equation (26) for the sequences
${{\left\langle {x_n}\right\rangle}}$ and
${{\left\langle {y_n}\right\rangle}}$.
Let
$i\in\mathbb{Z}$ and
$n\ge\max\!(n_0^x, n_0^y)$. We have
\begin{equation*} \begin{split} B^i\left|\frac{B^{2(n+k)}}{x_{n+k}}-\frac{B^{2(n+k)}}{y_{n+k}}\right| &= B^{i+2(n+k)}\frac{\left|x_{n+k}-y_{n+k}\right|}{\left|x_{n+k}y_{n+k}\right|} \\ &\le B^{i+i_0^x+i_0^y}\left|x_{n+k}-y_{n+k}\right|. \end{split} \end{equation*}
Because
${{\left\langle {x_n}\right\rangle}}=_{{\omega}}{{\left\langle {y_n}\right\rangle}}$,
$B^{i+i_0^x+i_0^y}\left|x_{n+k}-y_{n+k}\right|\le B^{n+k}$ for sufficiently large n and any
$k\in\mathbb{N}$, which proves that
${{\left\langle {B^{2n}/x_n}\right\rangle}}$ and
${{\left\langle {B^{2n}/y_n}\right\rangle}}$ are equivalent:
$\mathrm{inv}(x)$ is independent of the choice of the representative for x.
It remains to prove that
$\mathrm{inv}(x)$ is actually the inverse of x, that is,
$x\times_{{\omega}}\mathrm{inv}\!(x)=\left[{{\omega}}\right]$.
Given
${{\left\langle {x_n}\right\rangle}}\in x$, we compute a representative of
$x\times_{{\omega}} \mathrm{inv}(x)$ and show that this representative is equivalent to the unity element of the ring
$\text{O}({{\omega}})$ which is the sequence
${{\omega}}={{\left\langle {B^n}\right\rangle}}$ itself:
\begin{align*}\left\lfloor{\frac{{x_n} \times \left\lfloor{\frac{B^{2n}}{x_n}}\right\rceil}{B^n}}\right\rfloor &= \varepsilon_1+\frac{x_n}{B^n}\varepsilon_2+B^n \\ &\quad\text{where $\varepsilon_1\in( -\!1,0]$ and $\varepsilon_2\in\Big( -\!\frac{1}{2},\frac{1}{2}\Big]$}\\ & = \varepsilon+B^n\quad\text{where $|\varepsilon|\le 1+{\text{sup}_n}{\frac{\left|x_n\right|}{B^n}}$}. \end{align*}
The latter inequality clearly establishes that
$x\times_{{\omega}}\mathrm{inv}\!(x)=\left[{{\omega}}\right]$.
Finally, thanks to the isomorphisms
${{\mathrm{inc_3}}}$ (whose codomain is restricted to
${{\mathrm{inc_3}}}\!(\mathcal{H\;\!\!R}_{{{\omega}}}^{\text{reg}})$),
${{\mathrm{inc_2}}}$, and
${{\mathrm{inc_1}}}$, we derive that
$\mathcal{H\;\!\!R}_{{{\omega}}}^{\text{reg}}$,
${\mathcal {B}_{{{\omega}}}}$, and
${\widetilde{\mathcal {B}_{{{\omega}}}}}$ are also ordered commutative fields.
The following proposition shows that the operations
$+_B$ and
$\cdot_B$ defined in Ménissier-Morain (Reference Ménissier-Morain2005) (see Section 2.2) directly perform the operations of the fields
$({\mathcal {B}_{{{\omega}}}},+,\times_{{\omega}})$ and
$({\widetilde{\mathcal {B}_{{{\omega}}}}}, +, \times_{{\omega}})$, avoiding the cost of the computation of the function
${{\mathrm{inc_2}}}^{-1}$ (see the proof of Proposition 16).
Proposition 22. Let
$x, y\in{\mathcal {B}_{{{\omega}}}}$, or
$x, y\in{\widetilde{\mathcal {B}_{{{\omega}}}}}$.
Then,
We split the proof of Proposition 22 by stating Lemma 23 (addition of integer sequences) and Lemma 24 (multiplication of integer sequences).
The last part of the proof is devoted to formally switching to quotient spaces.
Lemma 23. Let x and y be two regular sequences. Then,
Proof. Let
$x={{\left\langle {x_n}\right\rangle}}$ and
$y={{\left\langle {y_n}\right\rangle}}$ be two integer sequences. Put
$z = x +_B y$ and
$z' = x + y$. In order to prove the proposition, we have to show that
So, let
$i\in\mathbb{Z}$. By definition,
$z'_n=x_n+y_n$ and
$z_n = \left\lfloor{ ({x_{n+r} + y_{n+r}})/{B^r}}\right\rceil = ({x_{n+r} + y_{n+r}})/{B^r} + \varepsilon $ with
$r\in\{1,2\}$ (depending on the value of B) and
$|\varepsilon| \leq \frac{1}{2}$.
Thereby, we have
\begin{equation*}\begin{split}B^i&|z'_{n+k}-z_{n+k}| \\& =B^i\left| x_{n+k} + y_{n+k} - \frac{x_{n+k+r} + y_{n+k+r}}{B^r} - \varepsilon\right|\\& = B^i\left| \frac{B^r x_{n+k} - x_{n+k+r}}{B^r} + \frac{B^r y_{n+k} - y_{n+k+r}}{B^r}- \varepsilon \right|\\&\leq \frac{1}{2}B^i + B^{-r}\big(B^i\left| {B^r x_{n+k} - x_{n+k+r}}\right| + B^i\left|{B^r y_{n+k} - y_{n+k+r}}\right|\big).\end{split}\end{equation*}
The sequences x and y are regular. Thus, according to Equation (18), for sufficiently large n and for any
$k\in\mathbb{N}$, we have
$B^i\left|B^r x_{n+k} - x_{n+k+r}\right|\le B^r$ and
$B^i \left|B^r x_{n+k} - x_{n+k+r}\right|\le B^r$. Therefore, for sufficiently large
$n\in\mathbb{Z}$ and any
$k\in\mathbb{N}$,
As
$2 + \frac{1}{2} B^i\le B^{n+k}$ for large enough n, we are done.
Lemma 24. Let
$x={{\left\langle {x_n}\right\rangle}}$ and
$y={{\left\langle {y_n}\right\rangle}}$ be two loose B-adic sequences. Then,
Proof. Let
$x={{\left\langle {x_n}\right\rangle}}$ and
$y={{\left\langle {y_n}\right\rangle}}$ be two loose B-adic sequences. We set
$z = x \cdot_B y$ and
$z' = x \times_{{{\omega}}} y$ (where
${{\omega}}={{\left\langle {B^n}\right\rangle}}$). If either x or y is zero, the result is obvious (taking the sequence
${{\left\langle {0}\right\rangle}}_{n\in\mathbb{Z}}$ as a representative of zero). So, until the end of the proof, we assume that x and y are not zero. Then,
$\mathrm{msd} (x)$ and
$\mathrm{msd} (y)$ are finite.
From the definition of the product
$\cdot_B$ (Equation (8)), we derive that, for large enough n,
where
$|a|=1$,
$p_x=n+v-\mathrm{msd} (y)$,
$p_y=n+v-\mathrm{msd} (x)$,
$v \in\{3, 4, 5\}$ and
$|\varepsilon|\le\frac{1}{2}$.
It follows that
\begin{equation*} \begin{split} \left|z'_n - z_n\right| & = \left|\frac{x_n \ y_n}{B^n} - \varepsilon' - \frac{a+ x_{p_x} y_{p_y}}{B^{p_x+p_y-n}} - \varepsilon\right|\quad \text{where $|\varepsilon'|
< 1$}\\&\le\left|\frac{B^{p_x} x_n B^{p_y} y_n - B^n x_{p_x}B^ny_{p_y}}{B^{n+p_x+p_y}}\right|+2+B^{n-p_x-p_y} .\end{split}\end{equation*}
Provided we enforce
$n-p_x-p_y\le 0$, that is,
$n\ge \mathrm{msd} (x)+\mathrm{msd} (y)-2v$, we get
\begin{equation}\left|z'_n - z_n\right| \le \left|\frac{B^{p_x} x_n B^{p_y} y_n - B^n x_{p_x}B^ny_{p_y}}{B^{n+p_x+p_y}}\right|+3.\end{equation}
We rewrite the first term of the right-hand side of the previous inequality as follows:
Since x and y belong to
$\mathcal{H\;\!\!R}_\omega$, we have
$\frac{x_n}{B^n}\le\sup_p\frac{x_p}{B^p}<\infty$ and
$\frac{y_n}{B^n}\le\sup_p\frac{y_p}{B^p}<\infty$. Moreover, since x and y are regular and thanks to Equation (18), for any
$i_0\in\mathbb{Z}$ and for sufficiently large n,
\begin{equation} \frac{\left|B^{p_y}y_n-B^ny_{p_y}\right|}{B^{p_y}}\le \frac{B^{\min\!(p_y,n)}B^{\max\!(p_y,n)}}{B^{p_y}B^{i_0}}\le \frac{B^{\max\!(P_y,n)}}{B^{i_0}}\le \frac{B^{n}B^{c_x}}{B^{i_0}}, \end{equation}
where
$c_x$ is the constant
$\left|n-p_y\right|=\left|\mathrm{msd} (x)-v\right|$.
Alike, for any
$i_0\in\mathbb{Z}$ and for sufficiently large n,
where
$c_y$ is the constant
$\left|n-p_x\right|=\left|\mathrm{msd} (y)-v\right|$.
From Formulae (28), (29), (30), and (31), we derive that, for any
$i_0$, i and for some large enough n,
where M is a constant
$\left(M=c_x\sup_p\frac{x_p}{B^p}+c_y\sup_p\frac{y_p}{B^p}\right)$.
Finally, taking
$i_0$ such that
$MB^{i-i_0}<1$ and enforcing n to satisfy
$MB^{i-i_0}+3B^{i-n}\le 1$, we get
$B^i\left|z'_n - z_n\right| \le B^n$ for any
$i\in\mathbb{Z}$ and sufficiently large
$n\in\mathbb{Z}$. Thereby, we have proved that
${{\left\langle {z_n}\right\rangle}}=_{{\omega}} {{\left\langle {z'_n}\right\rangle}}$.
Proof of Proposition 22 We develop the case
$x, y\in{\widetilde{\mathcal {B}_{{{\omega}}}}}$ for the addition. The case
$x, y\in{\mathcal {B}_{{{\omega}}}}$ and the proof for the multiplication are similar.
So, let
$x, y\in{\widetilde{\mathcal {B}_{{{\omega}}}}}$. Then,
$\dot{x}$ and
$\dot{y}$ are regular sequences. Therefore, we derive from Lemma 23 that
$\dot{x}+_B \dot{y}\ =_{{\omega}}\ \dot{x} + \dot{y}$. We set
$\phi={{\mathrm{inc_3}}}\circ{{\mathrm{inc_2}}}$. Observe that, from Proposition 37, we get
$\dot{x}+_B \dot{y}\in\widetilde{{{\left\langle { B}\right\rangle}}}$. Hence,
$\phi\left(\left[\dot{x}+_B\dot{y}\right]\right)$ is well defined and belongs to
$\mathcal{H\;\!\!R}_\omega$. We have
\begin{equation*}\begin{split}\dot{x}+_B \dot{y}=_{{\omega}}\ \dot{x} + \dot{y}&\implies \dot{x}+_B \dot{y}\in\left[\dot{x}+\dot{y}\right] \text{ where } \left[\dot{x}+\dot{y}\right]\in\mathcal{H\;\!\!R}_\omega\\&\implies \dot{x}+_B \dot{y}\in\left[\dot{x}\right]+\left[\dot{y}\right] \text{ by Equation (2)}\\&\implies \dot{x}+_B \dot{y}\in \phi(x)+\phi(y)\text{ by Definition 13}\\&\implies \dot{x}+_B \dot{y}\in \phi(x+y)\text{ by Proposition 19}\\&\implies \phi\left(\left[\dot{x}+_B \dot{y}\right]\right) = \phi(x+y) \text{ where } \left[\dot{x}+_B\dot{y}\right]\in{\widetilde{\mathcal {B}_{{{\omega}}}}}\\&\implies \left[\dot{x}+_B\dot{y}\right] =x+y\text{ by Proposition 15},\end{split}\end{equation*}
which is the stated result.
3.3 Back to real numbers
Until now, we have extended the structure of the Harthong–Reeb line to the (free, loose, tight) representations of real numbers. To end this study, it remains to verify that the obtained fields are isomorphic to the real numbers field.
First, let us show that the equivalence relation
$=_{{{\omega}}}$ inherited from the construction of
$\mathcal{H\;\!\!R}_\omega$ actually corresponds to the identification of representations of the same real number.
3.3.1 A natural equivalence relation for (free, loose, tight) representations
On the one hand, the Harthong–Reeb line
$\mathcal{H\;\!\!R}_\omega$ was defined in Chollet et al. (Reference Chollet, Wallet, Fuchs, Andres and Largeteau-Skapin2012) as the quotient set
$\text{O}({{\omega}})/\text{o}({{\omega}})$. On the other hand, it is natural to identify (free, loose, tight) representations of reals numbers that represents the same real number. Actually, these two equivalence relations are identical for the free representationsFootnote 4
and thus for the other kinds of representation.
Proposition 25. Let
${{\left\langle {x_n}\right\rangle}}$,
${{\left\langle {y_n}\right\rangle}}$ be two free representations of some real numbers x and y. Then
${{\left\langle {x_n}\right\rangle}}=_{{{\omega}}}{{\left\langle {y_n}\right\rangle}}$ if and only if
$x=y$.
Proof. Let
${{\left\langle {x_n}\right\rangle}},{{\left\langle {y_n}\right\rangle}}\in\text{O}^{\text{reg}}({{\omega}})$. Put
$x=\lim\!{{\left\langle {x_n/B^n}\right\rangle}}$ and
$y=\lim\!{{\left\langle {y_n/B^n}\right\rangle}}$ (recall that by definition of
$\text{O}^{\text{reg}}({{\omega}})$,
${{\left\langle {x_n/B^n}\right\rangle}}$ and
${{\left\langle {y_n/B^n}\right\rangle}}$ are Cauchy sequences).
The proof is straightforward:
\begin{align*}{{\left\langle {x_n}\right\rangle}}=_{{\omega}} {{\left\langle {y_n}\right\rangle}}&\Longleftrightarrow\forall i\in\mathbb{Z}, \exists n_0\in\mathbb{Z}, n\ge n_0\implies B^i\left|x_n-y_n\right|\le B^n\\&\Longleftrightarrow\forall i\in\mathbb{Z}, \exists n_0\in\mathbb{Z}, n\ge n_0\implies \left|\frac{x_n}{B^n}-\frac{y_n}{B^n}\right|\le \frac1{B^i}\\&\Longleftrightarrow \lim\!{{\left\langle {\frac{x_n}{B^n}}\right\rangle}}=\lim\!{{\left\langle {\frac{y_n}{B^n}}\right\rangle}}\\&\Longleftrightarrow x=y.\end{align*}
As a consequence of Proposition 25, we can define a new map,
$\lim_B$, from the field
$\mathcal{H\;\!\!R}_{{{\omega}}}^{\text{reg}}$, resp.
${\widetilde{\mathcal {B}_{{{\omega}}}}}$,
${\mathcal {B}_{{{\omega}}}}$, to the field of real numbers:
\begin{align*}\lim{\!}_B\colon\qquad &\mathcal{H\;\!\!R}_{{{\omega}}}^{\text{reg}}\ (\text{resp. } {\widetilde{\mathcal {B}_{{{\omega}}}}}, {\mathcal {B}_{{{\omega}}}})&\longrightarrow\qquad &\mathbb R\\&\qquad x=\left[{{\left\langle {x_n}\right\rangle}}\right] &\longmapsto\qquad &\lim\!{{\left\langle {\frac{x_n}{B^n}}\right\rangle}}\end{align*}
In the next section, we show that the functions
$\lim_B$ are isomorphisms.
3.3.2 Isomorphisms between the real number field and the representation fields
Our last result asserts that the addition, the multiplication, and the order relation of the three fields
$\mathcal{H\;\!\!R}_{{{\omega}}}^{\text{reg}}$,
${\widetilde{\mathcal {B}_{{{\omega}}}}}$,
${\mathcal {B}_{{{\omega}}}}$ correspond, via the map
$\lim_B$ to the addition, the multiplication, and the order of the real field
$\mathbb R$. Since we have already shown that
$(\mathcal{H\;\!\!R}_{{{\omega}}}^{\text{reg}},+,\times_{{\omega}},\le_{{\omega}})$,
$({\widetilde{\mathcal {B}_{{{\omega}}}}},+,\times_{{\omega}},\le_{{\omega}})$, and
$({\mathcal {B}_{{{\omega}}}},+,\times_{{\omega}},\le_{{\omega}})$ are isomorphic, we just now examine the map
$\lim_B\colon{\mathcal {B}_{{{\omega}}}}\to\mathbb R$.
Theorem 26. The function
$\lim_B\colon({\mathcal {B}_{{{\omega}}}},+,\times_{{\omega}},\le_{{\omega}})\to(\mathbb R,+,\times,\le)$ is a order-preserving isomorphism.
$\lim_B$ is onto: for any
$x\in\mathbb R$,
$\left\lfloor{xB^n}\right\rfloor$ is a preimage of x.
$\lim_B$ is one-to-one. This is just the if part of Proposition 25.
$\lim_B$ is a morphism. We have seen in Proposition 22, that the operations
$+$ and
$\times_{{\omega}}$ of the field
${\mathcal {B}_{{{\omega}}}}$ are identical to the operations
$+_B$ and
$\cdot_B$ described in Ménissier-Morain (Reference Ménissier-Morain2005). Hence, the results obtained in Ménissier-Morain (Reference Ménissier-Morain2005) and recalled in Section 2.2 show that, for any classes x, y in
${\mathcal {B}_{{{\omega}}}}$, we have
$\lim_B\!(x+y)=\lim_B\!(x)+\lim_B(y)$ and
$\lim_B\!(x\times_{{\omega}} y)=\lim_B\!(x)\times\lim_B\!(y)$.
$\lim_B$ is increasing. Let
$x,y\in{\mathcal {B}_{{{\omega}}}}$. Let
${{\left\langle {x_n}\right\rangle}}\in x$ and
${{\left\langle {y_n}\right\rangle}}\in y$. Then,
\begin{equation*}\begin{split}x\le_{{\omega}} y&\implies \forall i\in\mathbb{Z},\exists n\in\mathbb{Z}, \forall k\in\mathbb{N},\ B^i\left(x_{n+k}-y_{n+k}\right)\le B^{n+k}\\ &\implies \forall i\in\mathbb{Z},\exists n\in\mathbb{Z}, \forall k\in\mathbb{N},\ \frac{x_{n+k}}{B^{n+k}}-\frac{y_{n+k}}{B^{n+k}}\le \frac1{B^i}\\ &\implies \forall i\in\mathbb{Z},\ \lim{\!}_B(x)-\lim{\!}_B(y)\le\frac1{B^i}\\ &\implies \lim{\!}_B(x)-\lim{\!}_B(y)\le 0\\ &\implies \lim{\!}_B(x)\le \lim{\!}_B(y). \end{split}\end{equation*}
4. Conclusion
In this article, we built an isomorphism between the B-adic sequences and the real field. This new isomorphism is in line with a rather long series of efforts in nonstandard and constructive mathematics to represent real numbers with sequences of integers. The advantage of the representations proposed in this article over a model like the Harthong–Reeb line is that, at each scale provided by the choice of the base B, the term of the B-adic sequence is almost the best one in terms of precision.
In the near future, we wish to make the link between our model and the one developed by Ciaffaglione (Reference Ciaffaglione2003) for the base 2 and founded on the positional numeral system.
Moreover, now that the theoretical foundations are laid properly, we plan to extend the already-existing Coq formalization of the Harthong–Reeb line, to integrate B-adic sequences as a new implementation for elements of the Harthong–Reeb line and to formally check that all properties of the Harthong–Reeb line are verified by this implementation. In parallel, we want to take advantage of the determinism and the accuracy of the B-adic sequences over the too much unconstrained elements of the Harthong–Reeb line to resume the study of the digitalization of the affine transforms, especially rigid motions. One of the goals of such a study will be to understand how the periodic structures highlighted by the works on quasi-affine transforms evolve when the resolution under which the Euclidean world is seen in the digital space grows.
Appendix A. Proof of Theorem 9
Theorem 9 binds the integer sequences
${{\left\langle {x_n}\right\rangle}}$ satisfying the weak bound property (13) for some real x with a predicate on integer sequences, Equation (15). It makes it possible to construct the field
$\mathbb R$ from loose B-adic sequences. The proof of Theorem 9 is similar to the proof of Theorem 1.
Lemma 27. Let
$(x_n)$ be the loose representation of a real number. Then,
Proof. Assuming
$(x_n)$ is a loose representation of a real number x, the weak bound property (13) is satisfied. Hence, for any
$n\in\mathbb{Z}$ and any
$k\in\mathbb{Z}$,
and
These two equations lead to
which can be rewritten as
Proposition 28. Let
$(x_n)$ be an integer sequence satisfying Equation (15). Then, the sequence
$(x_n/B^n)$ is a Cauchy sequence.
Proof. Let
$m\in\mathbb{N}$. Let us prove that, for sufficiently large n and any
$k\ge 0$,
$\lvert \tfrac{x_n}{B^n}-\frac{x_{n+k}}{B^{n+k}}\rvert\le \tfrac1{B^m}$.
\begin{equation*}\begin{split}\left\vert \frac{x_n}{B^n}-\frac{x_{n+k}}{B^{n+k}}\right\vert& \le \frac1{B^{n+k}} \ \left\vert B^k x_n-x_{n+k}\right\vert \\&\le \frac1{B^{n+k}}\times (B^k +1)\quad\text{thanks to (15)}\\& \le \frac1{B^{n+k}}\times B^{k+1} \\& \le \frac1{B^{n-1}}.\end{split}\end{equation*}
Thus, it is sufficient to choose
$ n\geq m+1$.
Lemma 29. Let
$(x_n)$ be an integer sequence satisfying Equation (15). Then,
$(x_n)$ satisfies the weak bound property
where x is the limit of the Cauchy sequence
${{\left\langle {x_n/B^n}\right\rangle}}$.
Proof. Let x be the limit of the Cauchy sequence
${{\left\langle {x_n/B^n}\right\rangle}}$ and
$m\in\mathbb{Z}$. For any positive real a, there exists an integer
$k_a\geq 1$ such that, for any
$k\ge k_a$,
$\lvert x-\tfrac{x_{m+k}}{B^{m+k}}\rvert \le \tfrac a{B^m}$. Then,
\begin{align}\lvert x - \frac{x_m}{B^m}\rvert& \le \left| x - \frac{x_{m+k}}{B^{m+k}}\right| + \frac{1}{B^{m+k}} \left| x_{m+k} - {x_m}{B^k}\right| \nonumber\\& \le \frac{a}{B^m} + \frac{B^k+1}{B^{m+k}}\quad\text{from (15)}\nonumber\\& \le \frac{1+a+\tfrac{1}{B^k}}{B^m}.\end{align}
Since Inequality (A1) is satisfied for any
$a>0$ and any
$k\ge k_a$, we derive that
Appendix B. Equivalence of the Definitions of Regular Sequences
We compare the definition of a regular sequence given in Chollet (Reference Chollet2010) with the definition given in this article (Definition 11). First, let us recall Chollet’s definition of regular sequences:
We give below a stronger formulation of our definition of regular sequences.
Lemma 30. An integer sequence
${{\left\langle {x_n}\right\rangle}}$ is regular (in the sense of Definition 11) if and only if
Proof . The “if” part is obvious (taking
$n=n_0$ in Equation (B2)). Conversely, let
$i\in\mathbb{Z}$. From Equation (17), we get an integer
$n_0$ such that for any
$k\in\mathbb{Z}$,
Thus, for any
$n\ge n_0$ and any
$k\ge 0$, we have
\begin{align*}B^{i+1}\left|B^{n-n_0} x_{n_0} - x_{n}\right|&\le B^{n}\\%\\
B^{i+1}\left|B^{n+k-n_0} x_{n_0} - x_{n+k}\right|&\le B^{n+k}.\end{align*}
By combining the two equations above in order to eliminate
$x_{n_0}$, we get
Since we assume
$B\ge 2$, the result holds.
We can now establish the equivalence of both definitions of regular sequences.
Proposition 31. Let B be an integer greater than or equal to 2. Then, the following statements are equivalent:
(1)
$\displaystyle\forall p\in\mathbb{N}\setminus\{0\}, \exists n_0\in\mathbb{N}, \forall \ell\ge n_0, \forall m\ge n_0,\; \left| \frac{x_\ell}{B^\ell} - \frac {x_m}{B^m}\right|\le\frac1p$.(2)
$\displaystyle\forall i\in\mathbb{Z}, \exists n_0\in\mathbb{Z}, \forall n\ge n_0, \forall k\in\mathbb{N},\; B^i\left| B^k x_n - x_{n+k}\right|\le B^{n+k}$.
$(1)\implies(2)$
Let
$i\in\mathbb{Z}$. Taking
$p=B^i$,
$\ell=n$, and
$m=n+k$, we directly obtain the second statement from the first one.
$(2)\implies(1)$
Let
$p\ge 1$ and take i such that
$B^i\ge p$. From (2), there exists
$n_0\in\mathbb{Z}$ such that for any
$n\ge n_0$ and any
$k\ge 0$,
In particular, taking
$n=\min\!(\ell,m)$ and
$k=|\ell-m|$, we get the first statement.
Appendix C. Building a Loose B-Adic Sequence from a Regular Sequence
Let
$x={{\left\langle {x_n}\right\rangle}}$ be a regular sequence. Making the change
$i\gets i+1$ and dividing by
$B^n$ in Formula (18), we get
Observing that for any integers i, j, m, n,
we derive from Equation (C1) that for any
$i\in\mathbb{Z}$, there exists
$n_0\in\mathbb{Z}$ such that for any
$m\ge n\ge n_0$ and any
$j\in\mathbb{Z}$,
Consequently,
Finally, since
$B\ge 2$ and the left-hand side of the previous inequality is an integer, we get
Then, for any
$i\in\mathbb{Z}$, we define
$\gamma(i)$ as the smallest integer
$n\ge i$ such that
This mapping
$\gamma$ is monotonically increasing. Indeed, let
$i< k$. Let us show that Formula (C2) is satisfied putting
$n=\gamma(k)$, which, by definition of
$\gamma$, implies that
$\gamma(k)\ge\gamma(i)$.
We start by splitting the inequality of Formula (C2) in two parts:
Observe that the second part of the right-hand side of the previous inequality is upper bounded by
$B^{j-k}$ by definition of
$\gamma$. We now look at the first part of the expression putting
$\frac {x_{\gamma(k)}}{B^{\gamma(k)-i}} = \left\lfloor{ \frac {x_{\gamma(k)}}{B^{\gamma(k)-i}}}\right\rceil + \varepsilon_1$ and
$\frac {x_{\gamma(k)}}{B^{\gamma(k)-k}} = \left\lfloor{ \frac {x_{\gamma(k)}}{B^{\gamma(k)-k}}}\right\rceil + \varepsilon_2$ where
$\left|\varepsilon_1\right|, \left|\varepsilon_2\right|\le \frac{1}{2}$. Then,
Now, we have to examine two cases.
(1) If
$B>2$ or
$k-i>1$, using Equation (C4) and the definition of
$\gamma(k)$, we derive from Equation (C3) that
Because at this point, we assume
\begin{equation*}\begin{split} \left|B^{j-i} \left\lfloor{ \frac {x_{\gamma(k)}}{B^{\gamma(k)-i}} }\right\rceil - \left\lfloor{ \frac {x_{m}}{B^{m-j} }}\right\rceil\right|& \le B^{j-k}\left(\frac{1}{2}B^{k-i}+\frac{1}{2}\right)+B^{j-k}\\& \le \left(\frac{1}{2}\frac3{B^{k-i}}+\frac{1}{2}\right)B^{j-i}. \end{split}\end{equation*}
$B>2$ or
$k-i>1$, we get
$\frac3{B^{k-i}}\le 1$. Hence,
$\left|B^{j-i} \left\lfloor{ \frac {x_{\gamma(k)}}{B^{\gamma(k)-i}} }\right\rceil - \left\lfloor{ \frac {x_{m}}{B^{m-j} }}\right\rceil\right| \le B^{j-i}$ and we are done.
(2) If
$B=2$ and
$k=i+1$, Equation (C4) can be rewritten as
Since the left-hand side of the above equation is an integer, we derive that
\begin{equation*}\left|B^{k-i} \left\lfloor{ \frac {x_{\gamma(k)}}{B^{\gamma(k)-i}} }\right\rceil- \left\lfloor{ \frac {x_{\gamma(k)}}{B^{\gamma(k)-k}} }\right\rceil\right|\le\frac32.\end{equation*}
Then, from Equation (C3), we get
\begin{equation*}\left|B^{k-i} \left\lfloor{ \frac {x_{\gamma(k)}}{B^{\gamma(k)-i}} }\right\rceil- \left\lfloor{ \frac {x_{\gamma(k)}}{B^{\gamma(k)-k}} }\right\rceil\right|\le1.\end{equation*}
for
\begin{equation*}\begin{split} \left|B^{j-i} \left\lfloor{ \frac {x_{\gamma(k)}}{B^{\gamma(k)-i}} }\right\rceil - \left\lfloor{ \frac {x_{m}}{B^{m-j} }}\right\rceil\right|& \le B^{j-k}\times 1+B^{j-k}\\& \le 2B^{j-k}\\ &\le B^{j-i}, \end{split}\end{equation*}
$B=2$ and
$j-i=j-k+1$.
So, we have proved that
$\gamma$ is increasing. Eventually, we define the sequence
$y={{\left\langle {y_i}\right\rangle}}_{i\in\mathbb{Z}}$ by
for any
$i\in\mathbb{Z}$.
From the definition of
$\gamma$ and because it is increasing, we derive that
Hence, the sequence
${{\left\langle {y_i}\right\rangle}}_{i\in\mathbb{Z}}$ is a loose B-adic sequence. It remains to prove that
${{\left\langle {y_i}\right\rangle}}$ is equivalent to
${{\left\langle {x_i}\right\rangle}}$, that is,
We have
\begin{equation}\begin{split}B^i\left|x_{m}-y_m\right|&\le B^i\left|x_{m}-\frac{x_{\gamma(m)}}{B^{\gamma(m)-m}}\right|+\frac{1}{2}B^i\\&\le B^{m-\gamma(m)}\times B^i\left|B^{\gamma(m)-m}x_{m}-{x_{\gamma(m)}}\right|+\frac{1}{2}B^i.\end{split}\end{equation}
Since the sequence x is regular, for large enough m,
Thus, Equation (C6) can be rewritten as
which is equivalent to
because the left-hand side of the inequality is a multiple of
$B^i$. We conclude that the sequences x and y are equivalent. In other words, we obtain
${{\mathrm{inc_2}}}\!(y)=x$ which establishes that
${{\mathrm{inc_2}}}$ is onto.
Appendix D. The Harthong–Reeb Line is Fat
We define a topology over the sequences bounded by
${{\omega}}={{\left\langle {B^n}\right\rangle}}_{n\in\mathbb{Z}}$ up to a constant factor and we show that
(1) there exists a sequence in
$\text{O}({{\omega}})$ that is far (for this topology) from any regular sequence. In other words, the regular sequences are not dense in
$\text{O}({{\omega}})$;(2) any regular sequence is close to nonregular sequences. In other words, nonregular sequences are dense in
$\text{O}({{\omega}})$.
Let
$a={{\left\langle {a_n}\right\rangle}}\in\text{O}({{\omega}})$ and
$i\in\mathbb{Z}$. We set
Then, a sequence
$b={{\left\langle {b_n}\right\rangle}}$ is equivalent to a sequence
$a={{\left\langle {a_n}\right\rangle}}$, that is,
$b=_{{{\omega}}}a$, if and only if
$b\in\mathcal B(a, i)$ for any
$i\in\mathbb{Z}$. We consider the topology
$\mathcal T$ over
$\text{O}({{\omega}})$ generated by the set of all the balls
$\mathcal B(a,i)$.
In
$\text{O}({{\omega}})$, we choose a prototypical undesirable sequence,
$\textrm{o}={{\left\langle {( -\!B)^n}\right\rangle}}$, and we show that there is no regular sequence in its neighborhood.
Lemma 32. The ball
$\mathcal B(\textrm{o}, 1)$ does not contain any regular sequence.
Proof . By contradiction, we consider a regular sequence
$b={{\left\langle {b_n}\right\rangle}}$ in the ball
$\mathcal B(\textrm{o}, 1)$.
On the one hand, since b is regular, there exists an integer
$n_1$ such that for any
$n\ge n_1$ (taking
$i=1$ and
$k=1$ in Equation (18)),
On the other hand, since
$b\in\mathcal B(\textrm{o}, 1)$, there exists
$n_2\ge n_1$ such that for any
$n\ge n_2$,
and also,
Then, adding Equations (D1), (D2), multiplied by B, and (D3), we get
That is,
$B \le 3/2$ which contradicts the assumption on B.
Let us now prove that non regular sequences are dense in
$\text{O}({{\omega}})$.
Lemma 33. Let
$a={{\left\langle {a_n}\right\rangle}}$ be a regular sequence and r be a positive integer. Then, the ball
$\mathcal B(a,r)$ contains a nonregular sequence.
Proof. We will prove that
$b=a+\frac{1}{2}B^{-r}\textrm{o}$ belongs to
$\mathcal B(a,r)$ and is nonregular.
(1) The sequence b belongs to
$\mathcal B(a,r)$. Indeed,
\begin{equation*}B^r\left|a_n-b_n\right|= B^r\left|a_n - \left(a_n+\frac{1}{2}B^{-r}(-B)^n\right)\right|=\frac{1}{2}B^n<B^{n}.\end{equation*}
(2) In order to prove that b is nonregular, we show the negation of Equation (18), that is,
Let
\[ \exists i\in\mathbb{Z},\:\forall n_0\in\mathbb{Z},\:\exists n\ge n_0,\:\exists k\in\mathbb{N},\:B^i\left|B^k b_n - b_{n+k}\right|> B^{n+k}.\]
$i=\left\lceil{\log_B2}\right\rceil+r$ and
$n_0\in\mathbb{Z}$. Since a is regular, we can use Equation (18) to get an integer
$n\ge n_0$ such that
$B^i\left|Ba_n-a_{n+1}\right|\le B^{n+1}$. Then, we have
We are done (using
\begin{align*}B^i\left|B b_n - b_{n+1}\right|&\ge B^i\left| B \left(a_n+\frac{1}{2}B^{-r}(-B)^n\right) - \left(a_{n+1} + \frac{1}{2}B^{-r}(-B)^{n+1}\right)\right| \\& \ge B^i\times B^{-r}B^{n+1}- B^i\times\left|B a_n-a_{n+1}\right|\\&\ge 2B^{n+1} -B^{n+1} \; {\text{by definition of} \,\textit{i}\, {\text{and}}\, \textit{n}} \\&> B^{n+1}.\end{align*}
$k=1$ in the negation of Equation (18)).
Appendix E. Division
Theorem 34. Let
$x\in\mathbb R$,
$y\in\mathbb R\setminus\{0\}$ with tight representations
${{\left\langle {x_n}\right\rangle}}$ and
${{\left\langle {y_n}\right\rangle}}$. Define
${{\left\langle {z_n}\right\rangle}}$ by
\begin{equation}\begin{split}z_n =&\begin{cases}\mathrm{sign}\!(x_{p_x})\times\mathrm{sign}\!(y_{p_y}) \text{ if }n \leq \mathrm{msd} ( {{\left\langle {x_n}\right\rangle}} ) - \mathrm{msd} \left({{\left\langle {y_n}\right\rangle}}\right) - 1\\\mathrm{sign}\!(x_{p_x})\times\mathrm{sign}\!(y_{p_y})\times\left\lfloor{\frac{\lvert x_{p_x} \rvert +1}{\lvert y_{p_y} \rvert -1}B^{p_y - p_x -n}}\right\rfloor \text{ otherwise,}\end{cases} \\& \text{where }\\& p_x= \mathrm{msd} ( {{\left\langle {x_n}\right\rangle}} ) +\Big(n + \mathrm{msd} \left({{\left\langle {y_n}\right\rangle}}\right)-\mathrm{msd} ( {{\left\langle {x_n}\right\rangle}} )\Big) \text{ and,}\\& p_y= \mathrm{msd} \left({{\left\langle {y_n}\right\rangle}}\right) +\Big(n+\mathrm{msd} \left({{\left\langle {y_n}\right\rangle}}\right) - \mathrm{msd} ( {{\left\langle {x_n}\right\rangle}} )\Big)+k,\\ &\text{with } k = \begin{cases} 2 &\text{ if } B > 2\\ 3 &\text{ if } B = 2. \end{cases} \end{split}\end{equation}
Then
${{\left\langle {z_n}\right\rangle}}$ is well defined and satisfies the bound property for
${x}/{y}$ :
Proof. When
$x=0$, the definition of
${{\left\langle {z_n}\right\rangle}}$ gives
$z_n=0$ for any
$n\in\mathbb{Z}$. Thus, the result holds in this case. We now assume
$x\neq 0$ and we set
$m_x=\mathrm{msd} ( {{\left\langle {x_n}\right\rangle}} )$,
$m_y=\mathrm{msd} \left({{\left\langle {y_n}\right\rangle}}\right)$.
The bound property of
$|x|$, resp.
$|y|$, for order
$m_x -1$, resp.
$m_y$, and the definitions of
$m_x$,
$m_y$ give
So, we have
We derive that, for any
$n\le m_x-m_y-1$, the integer
$\mathrm{sign}\!(x)\times\mathrm{sign}\!(y)$ satisfies the bound property for
${x}/{y}$ at order n:
If
$n \ge m_x - m_y$, then
$p_x\ge m_x$ and
$p_y\ge m_y+1$. Thus, according to Equation (6),
\begin{equation}\begin{split}1\le B^{p_x - m_x} &\leq \lvert x_{p_x} \rvert < 2 B^{1+p_x - m_x} \text{, and}\\2\le B^{p_y - m_y} &\leq \lvert y_{p_y} \rvert
< 2 B^{1+p_y - m_y}.\end{split}\end{equation}
So,
Hence,
Moreover, from Equation (E2), we derive that
$\lvert y_{p_y} \rvert - 1 \neq 0$. Then,
using the bound property of x, resp. y, of order
$p_x$, resp.
$p_y$, we obtain:
Let us put
$\alpha = \frac{\lvert x_{p_x}\rvert - 1}{\lvert y_{p_y}\rvert + 1} B^{p_y - p_x+n}$ and
$\beta = \frac{\lvert x_{p_x} \rvert +1}{\lvert y_{p_y} \rvert - 1} B^{p_y-p_x+n}$. Then, Equation (E3) can be rewritten as
Besides, we have
\begin{equation*}\begin{split}0 < \beta - \alpha &= 2 \frac{\lvert x_{p_x} \rvert + \lvert y_{p_y}\rvert }{\lvert y_{p_y} \rvert ^2 - 1} B^{p_y - p_x + n} \\& < 2 \frac{\lvert x_{p_x}\rvert + \lvert y_{p_y}\rvert}{\lvert y_{p_y}\rvert^2 - \lvert x_{p_x}\rvert^2} B^{p_y - p_x + n} \\& \leq 2 \frac{1}{\lvert y_{p_y} \rvert - \lvert x_{p_x}\rvert} B^{p_y - p_x + n} \\&
< \frac{2 B^{p_y - p_x + n}}{ B^{p_y- m_y} - 2 B^{1+p_x - m_x}}\\& \le \frac{2}{ B^{k}-2B}.\end{split}\end{equation*}
Hence, in both cases,
$B=2$ and
$k=3$ or
$B>2$ and
$k=2$, we get
$0 < \beta - \alpha < 1$. It follows that
$\lfloor \beta \rfloor$ verifies the bound property
for
$|x|/|y|$, and
$\mathrm{sign}\!(x_{p_x})\times\mathrm{sign}\!(y_{p_y})\times\left\lfloor{\beta}\right\rfloor$ verifies the bound property for
${x}/{y}$.
Appendix F. Binary Operations on Loose B-Adic Sequences
The goal of this section of the appendix is to study whether the relaxation of the bound property into a weak bound property has consequences on some propositions proved in Ménissier-Morain (Reference Ménissier-Morain1995) or in Ménissier-Morain (Reference Ménissier-Morain2005) which are of prime importance for our work. For each proposition, we use a red font when a modification was done compared to the initial version in Ménissier-Morain (Reference Ménissier-Morain1995) or in Ménissier-Morain (Reference Ménissier-Morain2005).
First, let us recall the definitions of the bound property and of the weak bound property.
Definition 35 (Bound property) Let
$x\in\mathbb R$. A sequence
${{\left\langle {x_n}\right\rangle}}$ of integers is a tight representation of x if, for any n, the bound property of x by
$x_n$ for order n is satisfied:
Definition 36 (Weak bound property) Let
$x\in\mathbb R$. A sequence
${{\left\langle {x_n}\right\rangle}}$ of integers is a loose representation of x if, for any n, the weak bound property of x by
$x_n$ for order n is satisfied:
A sequence
${{\left\langle {x_n}\right\rangle}}$ of integers is a loose representation of
$x\in\mathbb R$ without being a tight representation of x only if, for some
$n\in\mathbb{Z}$,
$x_n=B^nx\pm1$, which implies that
$B^nx$ is an integer. Taking this scenario into account requires to check each algorithm and property in the work of Ménissier-Morain. First of all, we check the addition algorithm. The result is that no change is needed.
Proposition 37 (addition). Let
${{\left\langle {x_n}\right\rangle}}$ and
${{\left\langle {y_n}\right\rangle}}$ be loose representations of
$x,y\in\mathbb R$. Then, the real
$x+y$ admits for loose representation the sequence
${{\left\langle {z_n}\right\rangle}}_{n\in\mathbb{N}}$ where
\begin{equation*} z_n=\left\lfloor{\frac{x_{n+w}+y_{n+w}}{B^w}}\right\rceil\quad\text{ with } w=\begin{cases} 1 &\text{ if } B\geq 4,\\2&\text{ if } B=2\text{ or } 3.\end{cases} \end{equation*}
Proof. We show that the sequence
${{\left\langle {z_n}\right\rangle}}$ satisfies the weak bound property for any n.
By definition of
$\left\lfloor{.}\right\rceil$, we have
Thanks to the weak bound property satisfied by
${{\left\langle {x_n}\right\rangle}}$ and
${{\left\langle {y_n}\right\rangle}}$, we derive
Equivalently,
Since
$B^w \ge 4$, we get
We conclude that
${{\left\langle {z_n}\right\rangle}}$ satisfies the weak bound property.
Before dealing with multiplication, we need to extend the definition of the most significant digit to loose representations. Unfortunately, doing so, we break some properties of the msd function described by Ménissier-Morain (Reference Ménissier-Morain1995), Property 7.Footnote 5
Indeed, it is no more true that
$\left| \mathrm{msd} ( {{\left\langle {x_n}\right\rangle}} )+\left\lfloor{\log_B|x|}\right\rfloor \right|\leq 1$, and it is no more true that for any
$n\geq \mathrm{msd} ( {{\left\langle {x_n}\right\rangle}} )$,
$|x_n|/B^{n-\mathrm{msd}{{\left\langle {x_n}\right\rangle}}}\in[1,2B]$ as shown by the following counterexamples.
Let
$B=2$ and
$x=1/2$. Then,
$B^nx=B^{n-1}$. So, putting
$x_n=\left\lceil{B^{n-1}-1}\right\rceil$ if
$n\le 2$ and
$x_n=B^{n-1}+1$, otherwise, we obtain a loose representation of x. In this case,
$\mathrm{msd}{{\left\langle {x_n}\right\rangle}}=3$, whereas
$\log_B(x)=-1$. Hence,
$\mathrm{msd}{{\left\langle {x_n}\right\rangle}}+\log_B(x)>1$. Moreover,
$x_3=5$. Hence, for
$n=\mathrm{msd}{{\left\langle {x_n}\right\rangle}}=3$,
$|x_n|/B^{n-\mathrm{msd}{{\left\langle {x_n}\right\rangle}}}>2B$. Now, we can change the sequence
${{\left\langle {x_n}\right\rangle}}$ by setting
$x_n=\left\lfloor{B^{n-1}}\right\rfloor+1$ if
$n\le 1$ and
$x_n=B^{n-1}-1$ otherwise. We still have a loose representation of x where
$\mathrm{msd}{{\left\langle {x_n}\right\rangle}}=1$ and
$|x_n|/B^{n-\mathrm{msd}{{\left\langle {x_n}\right\rangle}}}<1$ for any
$n>\mathrm{msd}{{\left\langle {x_n}\right\rangle}}$.
In view of these counterexamples, we have to adapt the results of Ménissier-Morain to encompass the loose representations of real numbers.
Proposition 38. Ménissier-Morain (Reference Ménissier-Morain1995), Property 7, Ménissier-Morain (Reference Ménissier-Morain2005), Property 15 Let
$x\in\mathbb R\setminus\{0\}$ and
${{\left\langle {x_n}\right\rangle}}$ be a loose representation of x. Then,
(1)
$\mathrm{msd} ( {{\left\langle {x_n}\right\rangle}} )$ exists;(2)
$\mathrm{msd} ( {{\left\langle {x_n}\right\rangle}} )=-\left\lfloor{\log_B|x|}\right\rfloor+\varepsilon$ where
$\varepsilon\in\{0,1{\color{red},2}\}$;-
(3) for any
$n\ge\mathrm{msd} ( {{\left\langle {x_n}\right\rangle}} )$,
where
Proof. Let
$x\in\mathbb R\setminus\{0\}$ and
$m=\left\lfloor{\log_B|x|}\right\rfloor$. Let
${{\left\langle {x_n}\right\rangle}}$ be a loose representation of x.
By definition of
$\left\lfloor{.}\right\rfloor$,
Besides,
$x_{-m+k}$ satisfies the weak bound property for order
$-m+k$ of x:
Thus, we also have
Observe that in the previous equation, an equality can occur only if
$B^{-m+k} x$ is an integer.
From Equations (F2) and (F3), we derive that
and
\begin{equation}\begin{cases}B^k\le \left|x_{-m+k}\right| +1\quad\text{if $|x|=B^{m}$ and $k\ge0$}\\B^k
< \left|x_{-m+k}\right| +1\quad\text{otherwise}.\end{cases}\end{equation}
In particular, for any
$k<0$,
$\left|x_{-m+k}\right| < B^{k+1}+1\le 2$. That is,
$\left|x_{-m+k}\right|\in\{0,1\}$. Therefore,
$\mathrm{msd}\ge -m$ (to lighten the notation, we write msd instead of
$\mathrm{msd} ( {{\left\langle {x_n}\right\rangle}} )$).
On the other hand, if
$k\ge 0$, Equations (F4) and (F5) concern integers. Thus, they can be rewritten as
and
where
$\zeta_1=1$ if
$|x|=B^m\wedge |x_{-m+k}|=|x|B^{-m+k}-1$ and
$\zeta_1=0$ otherwise.
Then, because
$B^k-1\ge 2$ for any
$B\ge 2$ and
$k\ge 2$, one has
$\mathrm{msd}\le -m+2$, that is,
$\mathrm{msd}=-m+\varepsilon$ where
$\varepsilon\in\{0,1,2\}$.
By definition of the most significant digit, we have
$\left|x_{\mathrm{msd}-1}\right| \le 1$. Thus, the right part of Equation (F3), taking
$-m+k=\mathrm{msd}-1$, gives
$|x|\le 2B\times B^{-\mathrm{msd}}$. Then, the left part of Equation (F3), where
$-m+k=n\ge\mathrm{msd}$, yields
\[\begin{cases}\left|x_{n}\right| \le 1 + 2B \times B^{n-\mathrm{msd}}\text{ if $|x|=2B\times B^{-\mathrm{msd}}$},\\\left|x_{n}\right|
< 1 + 2B \times B^{n-\mathrm{msd}}\text{ otherwise}.\end{cases}\]
Since the last equation only involves integers, it is equivalent to
where
$\zeta_2=1$ if
$|x|=2B^{1-msd}\wedge |x_n|=B^{n}+1$ and
$\zeta_2=0$ otherwise.
Moreover, for any
$n\ge \mathrm{msd}$, Equation (F6) can be rewritten as
Thereby, for
$\mathrm{msd}+m\ge 0$,
We saw that the extension of the most significant digit to loose representations slightly change its properties. Surprisingly, these changes do not propagate to the multiplication algorithm
Ménissier-Morain (Reference Ménissier-Morain1995), Algorithm 4 and Theorem 14, Ménissier-Morain (Reference Ménissier-Morain2005), Algorithm 4 and Theorem 16.
Proposition 39 (multiplication). Let
${{\left\langle {x_n}\right\rangle}}$ and
${{\left\langle {y_n}\right\rangle}}$ be the loose representations of
$x,y\in\mathbb R\setminus\{0\}$. Then, the real
$x\times y$ admits for loose representation the sequence
${{\left\langle {z_n}\right\rangle}}_{n\in\mathbb{N}}$ where
\begin{equation*} \begin{split} z_n&=\mathrm{sign}\!(x_{p_x})\times\mathrm{sign}\!(y_{p_y})\times\left\lfloor{\frac{1+\lvert x_{p_x} y_{p_y}\rvert}{B^{p_x+p_y-n}}}\right\rceil\\[3mm] &\text{with}\ p_x=\max\!\left(n-\mathrm{msd} \left({{\left\langle {y_n}\right\rangle}}\right)+v,\ \left\lfloor{\frac{n+w}2}\right\rfloor\right)\\ &\text{and}\ p_y=\max\left(n-\mathrm{msd} ( {{\left\langle {x_n}\right\rangle}} )+v,\ \left\lfloor{\frac{n+w}2}\right\rfloor\right)\\ &\text{and}\ (v,w) = \begin{cases} (3,2)&\text{ if } B\geq 4,\\ (3,3)&\text{ if } B=3,\\ (4,3)&\text{ if } B=2. \end{cases} \end{split} \end{equation*}
Proof. Since, given a sequence
${{\left\langle {z_n}\right\rangle}}$ that is a loose representation of the real z, the sequences
${{\left\langle {|z_n|}\right\rangle}}$ and
${{\left\langle {-|z_n|}\right\rangle}}$ are loose representations of
$|z|$ and
$-|z|$, we can assume without loss of generality that
$x>0$ and
$y>0$.
Firstly, observe that
and, if
$p_x\ge \mathrm{msd} \left({{\left\langle {x_n}\right\rangle}}\right)$ or
$p_y\ge \mathrm{msd} \left({{\left\langle {y_n}\right\rangle}}\right)$,
Indeed, by definition of
$p_x$ and
$p_y$,
$p_x+p_y-n\ge 2\times \left\lfloor{(n+w)/2}\right\rfloor-n\ge w-1$;if, for instance,
$p_x\ge \mathrm{msd} ( {{\left\langle {x_n}\right\rangle}} )$, then
$p_x+p_y-n\ge\mathrm{msd} ( {{\left\langle {x_n}\right\rangle}} )+p_y-n\ge v$.
We separate the rest of the proof in two cases, depending on the value of
$\zeta_2$ in Equation (F1).
(1) Let us assume that
$x_n<xB^n+1$ and
$y_n<yB^n+1$. Then,
$\zeta_2=0$ in Equation (F1) for both terms
$x_n$ and
$y_n$. In this case, we follow the proof in Ménissier-Morain (Reference Ménissier-Morain2005).
From the weak bound property for x and y at respective orders
$p_x$ and
$p_y$, we derive that
Notice that in the case where x, resp. y, is the B-adic number
$B^{-p_x}$, resp.
$B^{-p_y}$, it is possible to have
$x_{p_x}=0$, resp.
$y_{p_y}=0$. Nevertheless, the reader can check that the above left inequality remains true.
The previous inequalities can be equivalently stated as follows:
or
Therefore, from the definition of
$\left\lfloor{.}\right\rceil$, we get
It remains to show that
We distinguish three sub-cases
a. If
$p_x<\mathrm{msd} ( {{\left\langle {x_n}\right\rangle}} )$ and
$p_y<\mathrm{msd} \left({{\left\langle {y_n}\right\rangle}}\right)$, then, by definition of the most significant digit (Equation (F7)) and by definition of w,
\begin{equation*}\frac{x_{p_x}+y_{p_y}}{B^{p_x+p_y-n}}\le \frac2{B^{w-1}}\le \frac{1}{2}.\end{equation*}
b. If, for instance,
$p_x\ge\mathrm{msd} ( {{\left\langle {x_n}\right\rangle}} )$ and
$p_y<\mathrm{msd} \left({{\left\langle {y_n}\right\rangle}}\right)$, then, according to Equation (F1)
(taking into account the hypothesis
$\zeta_2=0$)
and according to the definition of the most significant digit,
Hence, by definition of
$p_y$ and by Equation (F8),
The last inequality comes from the definition of v.
c. If both
$p_x\ge\mathrm{msd} ( {{\left\langle {x_n}\right\rangle}} )$ and
$p_y\ge\mathrm{msd} \left({{\left\langle {y_n}\right\rangle}}\right)$,
Thus, by definition of
\begin{equation*}\frac{x_{p_x}+y_{p_y}}{B^{p_x+p_y-n}}\le\frac{2B\times B^{n-\mathrm{msd} ( {{\left\langle {x_n}\right\rangle}} )}}{B^{p_y}} + \frac{2B\times B^{n-\mathrm{msd}\left( {{\left\langle {y_n}\right\rangle}}\!\right)}}{B^{p_x}}.\end{equation*}
$p_x$,
$p_y$ and Equation (F8),
\begin{equation*}\frac{x_{p_x}+y_{p_y}}{B^{p_x+p_y-n}}\le\frac{4B}{B^{v}}\le \frac{1}{2}.\end{equation*}
We have shown that, in the three subcases, Equation (F9) is satisfied so we are done for the first case.
(3) We now assume that
$x_n\ge xB^n+1$ or
$y_n\ge yB^n+1$: for instance,
$x_n\ge xB^n+1$ (the other case is perfectly similar). Then the weak bound property for y at order
$p_y$ gives
which can be rewritten as
\begin{equation*}\frac{x_{p_x}-1}{B^{p_x}}\times\frac{y_{p_y}-1}{B^{p_y}}\le x\times y\le \frac{x_{p_x}-1}{B^{p_x}}\times\frac{y_{p_y}+1}{B^{p_y}},\end{equation*}
(F10)We observe that, in Equation (F10), the difference between both bounds is less than or equal to 1/2:
\begin{equation}-\frac{(x_{p_x}+y_{p_y})}{B^{p_x+p_y-n}}\le B^n x\times y -\frac{1+x_{p_x}y_{p_y}}{B^{p_x+p_y-n}}\le\frac{x_{p_x}-y_{p_y}-2}{B^{p_x+p_y-n}}.\end{equation}
Thereby,
\begin{equation*}\frac{2x_{p_x}-2}{B^{p_x+p_y-n}}\le \frac{4B^{p_x-\mathrm{msd} ( {{\left\langle {x_n}\right\rangle}} )+1}}{B^{p_x+p_y-n}}\le 4B^{1-v}\le 1/2 .\end{equation*}
where
\begin{equation*}A\le B^n x\times y - \left\lfloor{\frac{1+x_{p_x}y_{p_y}}{B^{p_x+p_y-n}}}\right\rceil\le B,\end{equation*}
$B-A\le 1$. We derive that
which establishes the result in the second case.
\begin{equation*}\left| B^n x\times y - \left\lfloor{\frac{1+x_{p_x}y_{p_y}}{B^{p_x+p_y-n}}}\right\rceil\right|\le1.\end{equation*}

