1. Introduction
Following Akiyama–Petho [
1, AkiyamaPetho], the pair
is a canonical number system (CNS) if every
,
, admits a unique finite expansion
with
and
.
Polynomial/base specialization. Let be monic with , put , and let be the class of x in R. With the digit set (a transversal of ), We say (or equivalently ) is a CNS if every has a unique finite expansion
If
P is irreducible and
is a root, this is the same as unique finite
-expansions in
; in this case
is called a
CNS base.
Example 1 (A concrete CNS expansion).
Take (here and ). Then
In R I have the relation . Consider . Define digits by
Then α has the (CNS-style) digit expansion
Indeed, using in R,
Equivalently, if (a root of ), this reads with .
Canonical number systems (CNS) were developed in the polynomial setting by S. Akiyama and A. Pethő [
2], and later studied over more general coefficient domains (for instance Euclidean domains) by A. Pethő and P. Varga [
3]. In these works, a CNS is a positional representation in a quotient ring such as
, where every element admits a finite expansion in powers of a single base (the class of
x) using digits from a fixed finite set.
Related ideas also appear in the study of number systems arising from the Chinese Remainder Theorem, notably in work of van de Woestijne [
4], where representations are constructed by decomposing rings into simpler components and recombining them through compatible digit systems. Moreover, earlier work of Kovács and Pethő [
5,
6] demonstrates that finite digit representations can exist in a variety of algebraic settings beyond the classical polynomial quotient framework, especially in integral domains and orders of algebraic number fields.
Motivated by these developments, in this paper we extend the classical one–base notion of CNS to an n–dimensional representation framework. Rather than fixing a single base, we allow several commuting shift maps to generate place values. Our primary interest is the representation scope of this extension: identifying broad classes of rings and modules for which such n–dimensional systems provide digit expansions for every element, and clarifying the conditions under which these expansions exist and are unique.
2. Preliminary
In the classical (one–base) setting, choosing an integer base automatically provides the structural properties needed for a positional representation: the map on is injective, powers yield distinct place values, and there is only one shift so no ordering issues arise. In an n–dimensional (multi–base) setting, however, “place values” are generated by a family of -endomorphisms , and these properties are no longer automatic. Therefore we redefine what it means to be a base by imposing:
Definition 1 (Base family). Let L be a -module and let . We call the ordered family a base on L if it satisfies:
-
1.
Injective.
Each is injective.
-
2.
Commuting.
The endomorphisms commute pairwise:
-
3.
-
Independent (no base is generated by the others).
For each and each integer , the power cannot be written as a composition of powers of the remaining maps. Equivalently, there do not exist exponents () such that
(Under the commuting assumption, the product is well-defined independent of order.)
Example 2 (Classical base 10 on
).
Let and define the (single) base map
Then T is injective. The associated place values are . For instance,
Example 3.
(A multi-base family on : 10, , ) Let and define three -endomorphisms by multiplication:
Then each is injective (since is an integral domain), and they commute:
because multiplication by commutes in the commutative ring .
Moreover, the family is independent in the sense that distinct exponent triples produce distinct place maps. Writing
we have
and if then , hence .
Finally, a polynomial can be expanded by writing each integer coefficient in base 10.
For example,
can be written as a finite sum of places with digits in :
where only finitely many are nonzero.
Example 4 (A finite ring:
and the identity map).
Let (viewed as an abelian group). Take the base map
Then T is injective and for all k. Every element already has the trivial “expansion” (one digit). Remark:
is not a free -module, so this example is meant only to illustrate the idea of a base map (identity) in a finite setting.
Example 5 (A non-commutative ring:
with base
).
Let , viewed as a free -module of rank 4
with basis . Define the base endomorphism
Then T is injective and is finite.
A natural digit set is
which is a complete set of representatives of (entrywise reduction mod 2). Hence every has a unique decomposition
and iterating yields a finite T-expansion
For instance, for
one possible expansion is
with all digits in D.
Example 6.
(A one–base CNS on ) Let (as a –module). Define the (single) base endomorphism
Fix the base frame
Then for each ,
Let the digit alphabets be
and set the digit set
We redefine the digit set in the multi-base setting because, unlike the classical one–base case (where digits are representatives of ), several base maps contribute to the “higher-place” part, so digits must represent the quotient by the combined image in order to retain a unique remainder (coset) decomposition.
Definition 2 (Digit set for a base family).
Let L be a -module and let be a base family. Set
A digit set
(for ) is a finite
subset such that and D is a complete set of representatives of the quotient . Equivalently, every admits a unique
coset decomposition
i.e. the natural projection restricts to a bijection . In particular, for each there exist such that
Remark 1. The remainder digit d is unique by construction. The tuple need not be unique unless additional hypotheses are imposed (e.g. is a direct sum). When , this reduces to the usual condition that D is a transversal of .
Example 7 (Digit sets in common settings).
-
1.
-
Integers (one base).
Let and . Then and
so every has a unique decomposition with , .
-
2.
-
Polynomials (a base family).
Let and define
Modulo only the constant term remains, and modulo the constant term is taken modulo 10, hence
Thus one may again take the digit set
and every admits a unique decomposition with and .
-
3.
-
Matrices (noncommutative ring, one base).
Let and . Then and
(as additive groups). A convenient digit set is
which is finite, contains 0
, and represents each coset uniquely. Equivalently, every has a unique decomposition
-
4.
-
(two-component module, one base).
Let and define the base endomorphism
(as additive groups). A convenient digit set is
which is finite, contains 0, and represents each coset uniquely. Equivalently, every has a unique decomposition
Definition 3 (
n-dimensional CNS (multi-base extension of [
2])).
Let L be a -module and let be a base family
on L, i.e. are injective
, pairwise commuting
, and independent
in the sense that
Set
and assume the quotient is finite.
A digit set
for is a finite set with such that D is a complete set of representatives of ; equivalently, for every there exists a unique
with
The pair is called an n-dimensional number system
if every admits a finite expansion of the form
where is a finite set.
Fixing once and for all a monomial order ≺ on , we call an n-dimensional canonical number system (CNS) if the above expansion is unique for every when written in normal form (i.e. F consists exactly of those α with , and F has a ≺-maximum).
Example 8 (More detailed concrete expansions).
-
1.
-
(base 10).
With and ,
so .
-
2.
-
(bases ).
Let , , , and . Consider
Writing each integer coefficient in base 10
gives
Equivalently,
where the nonzero digits are precisely
-
3.
-
(base ).
With and , the matrix
admits the digit expansion
[A concrete element and its expansion] Consider the element
Hence the digit sequence is
With and as in Example 6, we compute
-
4.
-
(two-component module, one base).
Let and define the base endomorphism
A convenient digit set is
which is finite, contains 0, and represents each coset uniquely. Equivalently, every has a unique decomposition
one digit expansion (in the sense of a finite T–expansion) is
with all digits .
Digit folding and a reduced-frame CNS. Lemma 1 shows that when a CNS is built from an expanded block frame , one can fold each block of M digits into a single polynomial digit in (with u acting as U on L). Since , this yields an equivalent CNS expansion using the smaller frame , reducing the coordinate dimension from to m at the cost of enlarging the digit alphabet. We refer to the resulting system as the folded (dimension-reduced) CNS.
Lemma 1 (Digit folding operation for an
n–dimensional CNS).
Let E be a (not necessarily commutative) ring, L a left E–module, and let satisfy . Fix a finite base frame and an integer . Form the expanded frame
For and write
Let be finite digit alphabets and set
Assume is a CNS in the sense that every has a unique finite expansion
Define the folded digit alphabets as formal truncated polynomials
Let act on L by evaluation at U:
(This is well-defined because is E–linear.)
Then every admits a finite folded expansion with base frame :
If the original expansion with is unique and T is injective, then the folded expansion with is also unique.
Example 9.
( folded to one digit alphabet of size 20) Let
(viewed as a –module). Define the single base endomorphism
Fix the base frame of length 2
Then for each ,
(Expanded 2–coordinate digits).
Let the two coordinate digit alphabets be
and set . Thus each expanded digit is a pair
Every element has a finite expansion
obtained by the usual base–10
expansion of a and the coefficient expansion of f in .(Digit folding into one alphabet). Define a folding map
where
Let be its inverse, i.e.
(So Δ
is just a relabeling of the product digit set ; this is exactly the “digit folding” idea: compress two coordinates into one larger alphabet.)
Define the folded digit set
Given a folded digit , write .
Then every admits a finite expansion using only one digit alphabet Δ:
Equivalently, in coordinates,
Concrete computation.
Let
Choose expanded digits by
Fold them into :
Then
where the only digits used are .
then forces all , and forces all in , hence all are the zero digit. Therefore the folded expansion is unique.
Definition 4 (Digit–folding reduction; folding–irreducible CNS).
Fix a class of digit–folding moves as in Lemma 1. A digit–folding reduction
of an n–dimensional CNS is a finite sequence
where each arrow is obtained by applying Lemma 1 with some commuting endomorphism U and some integer , so that the frame size strictly decreases at each step.
We call an n–dimensional CNS folding–irreducible (or fully folded) if no nontrivial digit–folding move applies to it, i.e. there do not exist commuting with the base shift(s) and an integer for which Lemma 1 yields a further compression of the base frame.
A fully folded form of a given CNS is any folding–irreducible CNS obtained from it by a digit–folding reduction.
Remark 2. Every digit–folding reduction terminates: each application of Lemma 1 replaces an –frame by an m–frame with , hence strictly decreases the (positive integer) frame size. Therefore no infinite sequence of digit–folding reductions exists.
Remark 3. A fully folded form need not be unique in general: different choices of folding directions (choices of U and the associated finite tower structure) or different orders of folding may lead to non-isomorphic folding–irreducible presentations. If a canonical normal form is desired, one may fix a deterministic folding strategy (e.g. greedy in M, then lexicographic in the chosen towers).
3. The Question and Some Clues
Remark 4 (Representation scope and guiding questions). A central motivation for introducing an n–dimensional number system (and its canonical variant) is to understand its representation scope. Informally, this asks: for which modules (or rings) does the proposed positional mechanism actually represent every element by a finite digit expansion, and when is such an expansion unique? To make this precise, we adopt the following terminology.
Definition 5 (Representation scope). Fix and a class of –modules. For , let be a base family on L and let be a finite digit set (a transversal of , where ). Write .
In words, iff every element of L admits a finite digit expansion in the places with digits from D.
Remark. For notational convenience, we may adjoin to a base family so the “0th place” is treated uniformly with shifted places. This does not change the digit theory: digits are still taken from a finite transversal of (we do not quotient by ).
Definition 6.
(n–dimensional CNS (identity–adjoined form)) Let L be a –module and let be an n–dimensional CNS on L in the sense of Definition [
n–dimensional CNS]
. Define the identity–adjoined
base family
We call ann–dimensional CNS
if it satisfies the same expansion and uniqueness requirements as , with the understanding that the digit set is still chosen as a transversal of
Remark 5. The notation CNS is convenient when the digits are taken in a coefficient field, e.g. . In typical base families that include a prime p (so coefficients are reduced modulo p), one may view the digit alphabet as itself (identified with ) and regard these coefficient digits as acting at the 0th place via .
Definition 7.
( (identity–closed representation scope)) Let denote the representation scope of n–dimensional number systems on (as defined previously). For each with , write
We define the identity–closed representation scope
by
Thus contains both the original n–dimensional number systems and their identity–adjoined presentations (CNS).
Proposition 1 (Direct products of
n–dimensional number systems).
Let be –modules. Suppose
are n–dimensional number systems, where
and , are digit sets (transversals of the corresponding quotients). Define
i.e. , and set
Then is an n–dimensional number system.
Moreover, if and are n–dimensional CNS (with respect to the same fixed monomial order on ), then is an n–dimensional CNS.
Finally, if one (or both) of the factors is presented in the identity–adjoined form CNS, then the product can be presented as CNS on L by adjoining ; forgetting recovers an ordinary CNS presentation.
Proof.
Step 1: is a base family. Each
is injective because
and
are injective. For commutativity, for all
and
,
since the
commute pairwise and the
commute pairwise.
For independence, suppose
where
. Applying to
gives
hence
, so
by independence of
. Thus
is independent.
Step 2: digit quotient and digit set. Let
Then
Hence
so if
and
represent cosets uniquely in
and
, then
represents cosets uniquely in
.
Step 3: existence of expansions. Take
. Since
is an
n–dimensional number system, there exist digits
such that
Similarly, there exist digits
such that
Therefore
with
, proving that
is an
n–dimensional number system.
Step 4: uniqueness (CNS case). Assume both factors are
n–dimensional CNS (unique normal form with respect to the same monomial order). If
then comparing coordinates gives equality of the corresponding expansions in
and in
. By uniqueness in each factor,
for all
, hence the product expansion is unique, so
is a CNS.
Step 5: the CNS presentation. If one wishes to work in the identity–adjoined notation, adjoin to to obtain . This does not change the digit theory because digits are still taken modulo (one does not quotient by ). Thus the product admits a CNS presentation; forgetting recovers the ordinary CNS presentation. □
Remark 6.
(Examples in and a guiding hypothesis) Let be the class of –modules (or rings viewed as –modules). By the constructions above, the following standard objects admit n–dimensional number–system presentations (and hence lie in the identity–closed scope ):
together with finite direct sums of such systems (by the direct–product closure proposition). In particular, combinations such as
can be represented by choosing compatible base maps on each component and taking the product digit set; adjoining yields the corresponding CNS notation.
and hence a standard presentation
Moreover, the basic building blocks , , and their typical quotients naturally support digit–expansion structures in our framework. It is therefore reasonable to expect that such a finite–generators presentation should place R inside the identity–closed representation scope . This leads to the following hypothesis.
Assumption 1 (Guiding hypothesis).
If a ring R admits a presentation as a finitely generated –algebra,
for some surjection , then R admits an n–dimensional number–system presentation (possibly in the identity–adjoined form), i.e.
Emphasize that is not restricted to commutative settings: for instance, noncommutative rings such as (with base given by left multiplication by and a finite digit set modulo ) also admit CNS presentations, and hence lie in .
We also note that does not automatically contain every ring one might consider: for example, noncommutative free algebras such as and fields like fall outside the present scope under our standing digit–set/quotient requirements.
Proposition 2. ( lies outside ) For every , the field does not admit an n–dimensional number–system presentation of the type used in this paper (hence ).
Proof. Let
be any
–endomorphism (additive group homomorphism). Set
. Then for every integer
m we have
. Moreover, for
,
and hence for every
,
Thus every
–endomorphism of
is multiplication by a rational number.
In particular, if
is injective, then
with
, so
T is surjective and
. Therefore, for any base family
of injective endomorphisms on
, we have
Consequently the only possible digit transversal is
, so any digit expansion evaluates to 0 and cannot represent
. Hence
is not representable in the sense of
. □
Proposition 3 (The free algebra
is not covered by the commuting multiplication–base model).
Let be the (noncommutative) free –algebra on two generators. Consider the natural “generator–multiplication” choice of base maps
Then cannot be a base family in the sense of Definition [Base family]
(hence R is not in the portion of arising from finitely many commuting multiplication–base maps).
Proof. A base family is required to be finite and
pairwise commuting. However, for every
,
Since
R is the free algebra, the words
and
are distinct, hence
in
R, and therefore
. Thus the two independent “shift directions” coming from the two generators cannot simultaneously appear in a commuting base family. Consequently, the standard finite–base approach (using only finitely many independent generator multiplications) does not apply to
. □
References
- Shigeki Akiyama; Attila Pethő. On canonical number systems. Theoretical Computer Science 2002, vol. 270(no. 1–2), 921–933. [Google Scholar] [CrossRef]
- Shigeki Akiyama; Attila Pethő. On a canonical number systems. Theoretical Computer Science 2002, 270, 921–933. [Google Scholar] [CrossRef]
- Attila Pethő; Péter Varga. Canonical number systems over imaginary quadratic Euclidean domains. Colloquium Mathematicum 2017, 146(no. 2), 165–186. [Google Scholar] [CrossRef]
- Christiaan E. van de Woestijne. Number systems and the Chinese Remainder Theorem. Osaka Journal of Mathematics 2004, vol. 41(no. 2), 327–351. [Google Scholar]
- Béla Kovács; Attila Pethő. Number systems in integral domains, especially in orders of algebraic number fields. Acta Sci. Math. (Szeged) 1991, 55(no. 3–4), 287–299. [Google Scholar]
- Béla Kovács; Attila Pethő. On a representation of algebraic integers. Studia Sci. Math. Hungar. 1992, 27(no. 1–2), 169–172. [Google Scholar]
|
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content. |
© 2025 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).