5

Introduction

One way to define the $n$-adic integers is to start from the ring of modular integers $\mathbb{Z}/n\mathbb{Z}$, the quotient of $\mathbb{Z}$ by the ideal $n\mathbb{Z}$. There is an obvious sequence of ring homomorphisms

$$\cdots \to \mathbb{Z}/n^r\mathbb{Z} \cdots \to \mathbb{Z}/n^3\mathbb{Z} \to \mathbb{Z}/n^2\mathbb{Z} \to \mathbb{Z}/n\mathbb{Z}$$

given by expressing the integer modulo $n^r$ in base $n$ notation and taking the last $r-1$ digits (i.e. reducing modulo $n^{r-1}$).

The $n$-adic integers $\mathbb{Z}_n$ can be defined as the inverse limit of this sequence. The standard intuitive picture is that of "integers" with infinitely many digits to the left in base $n$.

Similarly, we can define what I will call the $(a,b)$-adic natural numbers starting from a semiring of the form $\mathbb{N}/(a\mathbb{N}+b)$, the quotient of the nonnegative integers $\mathbb{N}$ by the congruence $a\mathbb{N}+b$ (where we identify two numbers whenever they are both greater or equal to $b$ and differ by a multiple of $a$). There is again a sequence of semiring homomorphisms

$$\cdots \to \mathbb{N}/(a^3\,\mathbb{N}+b(a^2+a+1)) \to \mathbb{N}/(a^2\,\mathbb{N}+b(a+1)) \to \mathbb{N}/(a\mathbb{N}+b)$$

given by expressing the numbers in a certain modified base $a$ notation with $b$ extra digits (for $b=1$ it is called bijective numeration, but I'm not aware of any standard name for it when $b>1$) and truncating. For example, one can express the elements of $\mathbb{N}/(16\mathbb{N}+10)$ with two-digit representatives in base $4$ with $2$ extra digits:

$$0,1,2,3,4,5,12,13,14,15,22,23,24,25,32,33,34,35,42,43,44,45,52,53,54,55$$

and the homomorphism to $\mathbb{N}/(4\mathbb{N}+2)$ is given by taking the units digit.

The semiring of $(a,b)$-adic naturals $\mathbb{N}_{a,b}$ can be then defined analogously as the inverse limit of this sequence. As before, one can think of them as "naturals" with infinitely many digits expressed in this generalized base $a$ notation. Note that the special case $\mathbb{N}_{a,0}$ is isomorphic to $\mathbb{Z}_a$.


Motivation

My motivation to do this is that the exponentiation function $(m,n)\mapsto m^n : \mathbb{N}^2 \to \mathbb{N}$ (where we take $0^0=1$) descends to the quotient $\mathbb{N}/(a\mathbb{N}+b)$ whenever $\lambda(a)\mid a$ and $\nu(a)\le b$, where $\lambda$ is the Carmichael function and $\nu(a)$ denotes the highest exponent appearing in the prime factorization of $a$. This follows from this property and the fact that $k^b>b$ for any $b$ and $k>1$.

Since these two conditions imply that $\lambda(a^r)\mid a^r$ and $\nu(a^r)\le b(a^{r-1}+\cdots+a+1)$ for any $r$, exponentiation is well-defined for the entire sequence (in a compatible way, though I won't prove that here), and hence is well-defined when we take the limit. This way we get semirings $\mathbb{N}_{a,b}$ admitting an everywhere defined exponentiation function $(m,n)\mapsto m^n : \mathbb{N}_{a,b}^2 \to \mathbb{N}_{a,b}$, which together with the nonnegative reals $\mathbb{R}^+$ are the only exponentiation-preserving "completions" of $\mathbb{N}$ that I know of.


Question

I would like to know the basic structure of $\mathbb{N}_{a,b}$. It is known that the $n$-adic integers $\mathbb{Z}_n$ can be decomposed as a direct product of irreducible $\mathbb{Z}_p$ factors, one for each prime $p$ appearing in the prime factorization of $n$.

Is there an analogous factorization of $\mathbb{N}_{a,b}$ with $b>0$ in terms of some special irreducible $\mathbb{N}_{x,y}$? If not, can these semirings be expressed in terms of other more familiar objects?

I am especially interested in factorizations that preserve the exponential structure whenever it's there, but I would be also satisfied with a general statement for any $a, b$.

Noa Even
  • 2,875
pregunton
  • 6,358
  • 3
    Do you know if there is a CRT like theorem for these rigs in each component of the limit? The reason you get the isomorphism $\mathbb{Z}n \cong \prod{p|n} \mathbb{Z}p$ is because at each stage of the limit you have the isomorphism $\mathbb{Z}/n^r\mathbb{Z} \cong \prod{p|n} \mathbb{Z}/p^r\mathbb{Z}$ by the CRT; trying to mimic or hope for results on $\mathbb{N}_{a,b}$ that mimic the radical nature of $\mathbb{Z}_n$ would likely follow from something like it or reduce to statements on $(a,b)$ where you can do this in a relevant way. – Geoff Aug 06 '19 at 14:36
  • 2
    @Geoff Thanks for your comment! I thought about it, and it looks like a direct analogue of CRT in this setting gives no new factorizations. Since all of the finite rigs are generated from $0$ by repeated addition of $1$, if a product of two such rigs (say $\mathbb{N}/(a\mathbb{N}+b) \times \mathbb{N}/(a'\mathbb{N}+b')$) is to be of this form it should also be additively generated by $(1,1)$. But we can't get one of $(1,0)$ or $(0,1)$ this way unless $b=b'=0$ and $\mathrm{gcd}(a,a')=1$. That would imply all of the $\mathbb{N}_{a,b}$ with $b>0$ are irreducible w.r.t. direct product, right? – pregunton Aug 07 '19 at 07:39
  • 1
    Me and @Wojowu collaborated on discord recently to determine the full profinite completion (https://ncatlab.org/nlab/show/profinite+completion+of+a+group but semiring in this case), which ends up being $\mathbb{N} \bigsqcup \mathbb{\hat{Z}}$ with any operations between elements from distinct components being converted into profinite integers. I haven't thought about your question in particular yet, but I figured I'd mention this.

    Coming here from your link here on my related question: https://mathoverflow.net/questions/483243/1-adics-a-thing?noredirect=1#comment1259266_483243

    – Keith Dec 02 '24 at 12:28
  • 1
    @Keith Thanks for your interest! Since posting the question I also briefly studied the full profinite completion (if I remember correctly, a natural decimal notation for it would be the bijective-base version of factoradic, which starts like $1, 11, 21,$ $111, 121, 211,$ $221, 311, 321,$ $1111,$ etc.) and proved that it's also compatible with exponentiation. It's interesting that it admits such a neat description, I wonder if exponentiation can also be expressed in a simple way. – pregunton Dec 02 '24 at 12:58
  • @pregunton what is the procedure to project a bijective-base factoradic representation down to an arbitrary finite quotient of $\mathbb{N}$? – Keith Dec 02 '24 at 15:28
  • 1
    @Keith The idea is that $\mathbb{N}/(a\mathbb{N}+b)$ is a quotient of $\mathbb{N}/(c\mathbb{N}+d)$ iff $a|c$ and $b\le d$. Since the succesive truncations of "bijectorial" notation are of the form $\mathbb{N}/(k!\mathbb{N}+(k-1)!+(k-2)!+...+1)$, for any $a, b$ we can always find $k$ sufficiently high to satisfy both conditions $a|(k!)$ and $b\le (k-1)!+...+1$. – pregunton Dec 02 '24 at 16:25

1 Answers1

3

As Keith has mentioned in the comments, by chance we have recently been thinking about the version of this where rather than fixing $a$, you let it be arbitrary as well. The description in this case is entirely analogous, so let me present it.

Let $N(m,k)$ be the quotient of $\mathbb N$ by the congruence generated by $m\sim m+k$, that is, $\mathbb N/(k\mathbb N+m)$. It consists of the initial segment $0,\dots,m-1$ followed by a length $k$ loop $m,\dots,m+k-1$. Let me call elements of the initial segment "small" elements of $N(m,k)$, and the remaining elements "large".

For $b>0$, $\mathbb N_{a,b}$ is the inverse limit of $N(m,k)$ for $k$ ranging over powers of $a$ and $m$ arbitrary (it's not hard to see that your restriction to $k=b(a^l+\dots+1)$ doesn't change anything, in particular it is independent of $b$). Elements of the inverse limits are given by tuples of $x_{m,k}\in N(m,k)$ which are compatible under maps corresponding to coarsening the quotients. There are two possibilities:

  1. Suppose some $x_{m,k}\in N(m,k)$ is small, given by some element $n\in\mathbb N$. Then for any other $N(m',l)$ which maps onto $N(m,k)$, we must have $x_{m',l}=n$ too - this is because in the quotient of $\mathbb N$ defining $N(m,k)$, no other element is identified with $n$, so there can't be any other such element in a finer quotient either. So these elements correspond precisely to elements of $\mathbb N$.

  2. All $x_{m,k}\in N(m,k)$ are large. If we consider the elements $x_{0,k}\in N(0,k)=\mathbb Z/k$, those define an element of $\mathbb Z_a$. And further, any such element uniquely extends to the whole inverse system, since there is a unique large element in $N(m,k)$ which maps to $x_{0,k}$ in $N(0,k)$. So those elements correspond to elements of $\mathbb Z_a$.

Thus we see that as a set, $\mathbb N_{a,b}$ is in a natural bijection to $\mathbb N\sqcup\mathbb Z_a$. We can describe its monoid structure quite explicitly - both $\mathbb N$ and $\mathbb Z_a$ are subsemigroups (but the latter is not a submonoid! the identity is different), and the sum of $n\in\mathbb N$ and $x\in\mathbb Z_a$ corresponds to the usual sum $n+x$ viewed in $\mathbb Z_a$.

Being an inverse limit of finite sets, this structure also has a natural topology, which we can describe as follows: $\mathbb Z_a$ is a closed subset, and it is enough to characterize convergent sequences of elements $\mathbb N$. And this is fairly easy - if a sequence in $\mathbb N$ is not eventually constant, then it is convergent iff it is convergent in $\mathbb Z_a$ and its limit is what we expect.

Wojowu
  • 27,526
  • Thanks Woj, you caught something I didn't, in particular that observation at the start of your 3rd paragraph. I do wonder (along with OP, I assume) if this extends to an exponential operation. We do have to mind the Carmichael function, and I am not experienced enough in number theory to know how often we have $\lambda(a)\mid a$, but I believe $a = 2$ works, in which case we should have some sort of total exponential function. My unproven hunch is that it is the obvious one on $\mathbb{N}$ and $\mathbb{Z}_2$ with the same type-casting-esque operation. – Keith Dec 02 '24 at 20:27
  • Thank you! That's a very satisfying description, and on hindsight it makes sense that it's independent of $b$. I don't think much more can be said about the structure of these things, so I'll accept your answer. – pregunton Dec 02 '24 at 20:30
  • 1
    @Keith Regarding exponentiation, by chance I just found this paper where a construction is outlined starting in page 29. I see how to extend Definition 19 to a full operation on $\mathbb{N}\sqcup \mathbb{\hat{Z}}$, by letting $\clubsuit+n$ denote the inclusion $\mathbb{\hat{Z}} \to \mathbb{N}\sqcup \mathbb{\hat{Z}}$ in the second argument (I don't know how to produce the actual symbol used in the paper). It looks like the construction can also be adapted to $\mathbb N\sqcup\mathbb Z_a$. – pregunton Dec 02 '24 at 20:30
  • @pregunton Ah, are the "factoradic integers" the profinite completion of the naturals? If so, that's really helpful for my question back on MO. – Keith Dec 02 '24 at 20:42
  • 1
    @Keith No, the factoradic integers are the same as the profinite integers (more precisely, a profinite integer has a possibly infinite decimal representation in factoradic (ordinary, non-bijective). As I understand, what the paper I linked does is construct an exponentiation-like operation $\mathbb{\hat{Z}} \times (\clubsuit+\mathbb{\hat{Z}}) \to \mathbb{\hat{Z}}$, where $x \mapsto \clubsuit + x$ is a formal transformation that doesn't respect multiplication, e.g. $\clubsuit + 1$ is not the additive identity of ${\hat{Z}}$, and the notation only really makes sense inside an exponent. – pregunton Dec 02 '24 at 21:03
  • 1
    @Keith However, given the isomorphism you and Wojowu found, that strange operation can be understood as a part of a full, true exponentiation operation in $\mathbb{N}\sqcup \mathbb{\hat{Z}}$. As Wojowu said, the inclusion of $\mathbb{\hat{Z}}$ into $\mathbb{N}\sqcup \mathbb{\hat{Z}}$ is not a monoid inclusion, so it's not surprising that $\clubsuit+\mathbb{\hat{Z}}$ does not respect multiplication. – pregunton Dec 02 '24 at 21:04
  • 1
    @pregunton Ah, that makes sense! I read the paper and saw they jointly defined exponential for non-clubs and clubs, and just assumed they were both part of the number system. This is surprisingly beautiful for a number system that on the face of it looks ugly. – Keith Dec 02 '24 at 21:06
  • 1
    @pregunton, re, I believe that the symbol is an $\infty$ superimposed on a $0$. With mathtools, you can produce this symbol with \mathclap0\mathclap\infty, but it has zero width. With calc, you can further do \hbox{\widthof{$\infty$}/2}\mathclap0\mathclap\infty\hbox{\widthof{$\infty$}/2}, although that's (1) horrible and (2) needs something like \mathpalette anyway unless it's always used inline. – LSpice Dec 02 '24 at 23:07
  • @pregunton, re, further to my earlier comment, and at the risk of too much TeX in this thread, @‍egreg over at TeXSE gave a typically excellent answer to how to construct this symbol (but MathJax doesn't seem to know the necessary primitives to use it here). – LSpice Dec 03 '24 at 13:34