On the Expression of Composite Natural Numbers as Tensorial Products of Prime Natural Powers Vectors


This study describes how one can construct sets of composite natural numbers as tensorial products of the vectors created with the natural powers of prime numbers.

Share and Cite:

Nath, D. and Carbó-Dorca, R. (2023) On the Expression of Composite Natural Numbers as Tensorial Products of Prime Natural Powers Vectors. Journal of Applied Mathematics and Physics, 11, 1728-1736. doi: 10.4236/jamp.2023.116112.

1. Introduction

In a recent paper [1] , one of us described a mathematical framework where natural numbers were attached to a geometrical structure. One has based this procedure on simple ideas associated with normed vector spaces defined over natural numbers.

In this previous study, composite natural numbers resulted from geometrical norms attached to vectors, whose structure was associated with the natural powers of prime numbers. Prime number’s natural powers acted as scalars providing homotheties of the canonical basis set.

Such simple mathematical construction permits the connection between an infinite-dimensional vector space with his associate canonical basis set and a finite-dimensional vector space, the so-called inner space, where the canonical coordinates correspond to the prime number’s natural powers.

Here, a similar but completely different idea starts from the prime natural power sets, which one might easily consider as infinite-dimensional vectors associated with every prime number.

Such an infinite set of infinite-dimensional vectors can be the subject of appropriate tensorial products, yielding an infinite set of infinite-dimensional arbitrary rank tensors. The elements of such tensors correspond to subsets of the set of composite natural numbers.

One can reach the practical computational side of such a possible construction by considering finite-dimensional prime power vectors, whose tensorial products produce finite-dimensional tensors of arbitrary rank, containing as elements partial sets of the composite natural numbers.

To describe this prospect, the present paper will start with the basic notation and the description of prime number power vectors, which one will first use to construct an example made by composite natural number tensors of rank two. Then, one will describe the general structure of arbitrary rank tensors for completeness. Finally, one will present a practical finite-dimensional, computationally adapted algorithm.

2. Basic Notation and Prime Number Powers Vectors

Although this trivial section is easy to grasp, it becomes essential when considering the infinite-dimensional structure of the vectors needed to build the tensors associated with composite numbers. It describes the notation used here from now on.

2.1. Ordered Prime Number Set

Let us note in the following way the ordered set of prime numbers, P , as a subset of the natural number set :

P .

That is, one can think of the ordered prime number set as the sequence:

P = { 2 , 3 , 5 , 7 , 11 , , p I , } ,

where: p I denotes the I-th prime number. Then this means that one can also write:

p 1 = 2 ; p 2 = 3 ; p 3 = 5 ;

Of course, the cardinalities of both primes ad whole natural numbers sets are related in general by:

C a r d ( P ) C a r d ( ) .

2.2. Vectors of Prime Number Natural Powers

Next, let us adopt Dirac’s bra-ket notation for row-column natural number vectors and define the infinite-dimensional row vector of the sequence of natural powers attached with the I-th prime number as:

p I | = ( p I 1 ; p I 2 ; p I 3 ; ; p I N ; ) .

Then, according to these preliminary considerations, the transpose of p I | is an infinite-dimensional column vector:

p I | T = | p I .

Thus, one can suppose the dual vector pair attached to each prime number: p I P : { p I | ; | p I } .

One can consider any vector p I | and its dual as tensors of rank one.

At the same time, because of the tuple structure, by the symbol p I | one can understand, if necessary, both a vector and a set of prime powers.

One can highlight the character of the set of prime numbers’ natural powers vectors defining an infinite-dimensional vector space, defined in turn over the natural number set, where these vectors belong:

p I P : p I | V ( ) .

From this point of view, one can construct every prime power vector p I | through the canonical basis set defined as:

I : e I | = { e I J = δ I J | J } e I | V ( ) .

Then, one can rewrite the vectors p I | in terms of the infinite collection of canonical basis vectors as follows:

p I P : p I | = J ( p I ) J e J | .

As one can consider the prime power vectors constructed with ordered non-zero elements, they are perfect vectors in a sense provided by the reference [2] .

2.3. The Role of the Natural Numbers Set with Zero Added

Also, it is interesting to notice that one could write the prime natural powers vectors as a homothecy of the powers of the natural numbers set with zero added: 0 = { 0 } , where the homothetic factor could be the corresponding I-th prime number p I . That is, one can write the following alternative form:

p I | = p I p I 0 | = p I ( 1 ; p I ; p I 2 ; ; p I N 1 ; ) ,

where one emphasizes the character of the I-th prime number as a homothetic parameter.

2.4. An Apparent Paradox about Cardinalities of Natural Numbers and Powers of Prime Numbers

One can now be aware that each natural bra vector of prime powers p I | , considered the set of natural powers of the I-th prime number, bears the same cardinality as the natural number set .

The set of prime numbers, even infinite, as a subset of the natural numbers, apparently seems to bear a cardinality less than the natural set ; see, for example, references [3] [4] [5] [6] . However, prime set infinity precludes the existence of an infinite set of prime natural powers vectors, constructed as one has commented in section 2.2.

One can write these considerations and practically admit one can suppose the bra vectors as set representations of the natural powers of each unique prime number.

Then, the elements of the union of all of the prime power vectors, which can be symbolized by P , is just a subset of the natural numbers:

P = I p I | P ,

yielding the inclusion as the composite numbers made by two or more prime power products are not contained in the prime powers’ union set P .

In the same way that one can assume the cardinality of the prime set is less than the one attached to the whole natural number set, as discussed before in section 2.1, it seems that one can also write in general:

C a r d ( P ) C a r d ( ) .

However, there a paradox might develop. Because it seems evident that while:

p I P : C a r d ( p I | ) = C a r d ( ) ,

One might perhaps compare the cardinality of the union of prime powers with the prime and natural number cardinalities as:

C a r d ( P ) = C a r d ( P ) × C a r d ( ) C a r d ( ) .

One can solve the paradox by realizing that the cardinality of the prime numbers set is the same as the natural number one and that the product of two equal cardinalities yields the factor cardinality.

Such unequal cardinality relationships, though, might be valid in the discrete dimension description in section 5. below, where one discusses the creation of prime vector powers and tensors. Then, infinite cardinality algebra should transform into a standard natural number algebra of the chosen natural vector space dimensions; for example, see reference [5] [6] .

2.5. Linear Independence of Prime Natural Powers Vectors

One can represent the set of the prime natural powers’ vectors like:

P = { p I | | I ; p I P } ,

and the associated dual set of column vectors, which one can construct so that no vector possesses a shared element with the rest. Thus, in the same way as the canonical vector set, the set P is linearly independent, that is, a set of natural numbers:

A = { a I | I } | a a | V ( ) ,

used as unknown values in the following equation implies that the vector a | is null:

I a I p I | = 0 | a | = 0 | .

Suppose one accepts the usual vector operations in the natural vector space. In that case, one must also consider that the natural set necessarily includes zero as the null natural element, consistent with the discussion in the above section 2.3.

To show the linear independence of the vector set P , it is only necessary to use the reduction to absurd, a customary procedure in these cases, and realize that one cannot describe a power vector of a prime number by a linear combination of the power vectors of different prime numbers.

2.6. Definition of the Natural Powers of Prime Numbers Functions

Connected with this linear independency property of the elements of the set P , one can also define a set of natural discrete functions using a simple algorithm:

I , N p I P : p I ( N ) = p I N .

That is, for example, one can see that if: I = 4 N = 6 : p 4 = 7 p 4 ( 6 ) 7 6 .

Then the set of natural power functions, which one can collect in the set:

P = { p I ( N ) | I , N ; p I P } ,

Corresponds to a set of linearly independent functions.

2.7. Prime Natural Powers as Unique Elements

As a consequence of these previous definitions and properties, one can admit as an impossible occurrence that a sum of powers of different prime numbers yields a power of a prime number. That is:

N > 1 p I P : I p I N P .

Such a property implies that, when considering the nature of the elements of the sums involved in Fermat’s theorem of any dimension, they cannot be in any case all of them prime numbers; see, for example, reference [7] , to peruse the definition and extension of the theorem.

For instance, when considering the Pythagorean triples, only the ones that one can call true Fermat triples comprise two or one prime components, resulting in the triples without primes being homothetic from a true Fermat triple.

3. Composite Natural Number Tensors of Rank Two

One can manipulate the vectors constructed with elements of natural powers of prime numbers subject to the usual vector space operations; for example, see references [2] [8] .

The absence of a field structure on the natural number set , a semiring, limits everything. Even under this restriction, one can consider tensor operations available on these natural vectors as another useful geometrical tool.

One can envisage the construction of all the composite natural numbers bearing two prime natural powers as the rank two tensorial product, yielding an infinite-dimensional array structure.

The result can be written, as usual, by the equivalent notations:

| p I p J | | p I | p J = C I J .

Thus, one can take the elements of the above rank two tensor as those of an alternative infinite-dimensional square symmetric matrix, whose elements one can express as:

{ p I ; p J } P : C I J = { p I A p J B | ( A , B ) } .

According to the possible homothecy point of view of the vectors p I | , as described at the end of section 2.2 above, one can also consider the following expression of the rank two tensors:

C I J = ( p I p J ) | p I 0 p J 0 | ( p I p J ) | p I 0 | p J 0 .

One can note now the fact that the prime number pairs entering the construction of the rank two tensors of composite natural numbers can be chosen being:

I < J p I < p J .

The reverse relationship between prime numbers does not provide new information about calculating the elements of the related tensors, as these tensor elements are the same.

4. The General Composite Natural Number Tensors of Arbitrary Rank

From the rank two tensorial constructs, as presented in the section above, one can write tensors of any arbitrary superior rank whose elements are composite numbers bearing at least N distinct prime number natural powers.

Yet, they possess the characteristics of an infinite-dimensional tensorial product that one might generally write as:

C ( I K | K = 1 , N ) N = K = 1 N | p I K = { K = 1 N p I K A K | ( A K | K = 1 , N ) } .

In the same way as in the rank two tensors, one can write an equivalent expression of the arbitrary rank tensor above like:

C ( I K | K = 1 , N ) N = ( K = 1 N p I K ) K = 1 N | p I K 0 .

As in the previous rank two tensors, one can suppose that the arbitrary rank tensors are made using an ordered set of prime numbers, like:

p I 1 < p I 2 < p I 3 < < p I K < < p I N .

Other possible ordering choices will generate tensors with reordered equivalent composite natural number elements. Unless one needs the corresponding tensor elements reorganization associated with a permutation of the involved prime numbers, one can consider the prime numbers involved in constructing the tensor ordered as in the prime number set. As discussed earlier, such a possibility appears to be in close connection with the structure of vector spaces [2] .

5. The Practical Expression of the Composite Natural Number Tensors

Of course, from the practical point of view, one can transform the infinite-dimensional tensors of section 3 into a collection of finite-dimensional ones. One needs to consider the prime vector powers up to some natural number N and rewrite the involved power vector as a N-dimensional one, like:

p I N | = ( p I 1 ; p I 2 ; p I 3 ; ; p I N ) ,

Which one can also express as a homothecy:

p I N | = p I ( 1 ; p I 1 ; p I 2 ; ; p I N 1 ) = p I p I N 1 | .

5.1. Finite-Dimensional Rank Two Tensors

Therefore, one can construct the tensors of rank two by designing an algorithm like:

( M , N ) : C I J M N = | p I M p J N | = | p I M | p J N = { p I A p J B | A = 1 , M ; B = 1 , N } ,

or instead, like:

( M , N ) : C I J M N = ( p I p J ) | p I M 1 | p J N 1

Then alternatively, one can consider the corresponding tensors as ( M × N ) -dimensional matrices.

For example, one can write one of the simplest of these tensors as the ( 2 × 2 ) matrix:

C 12 22 = ( 2 × 3 2 × 3 2 2 2 × 3 2 2 × 3 2 ) = ( 6 18 12 36 ) ( 2 × 3 ) ( 1 3 2 2 × 3 ) .

Choosing the corresponding prime numbers in reverse order will generate the corresponding tensor connected with an attached transpose matrix.

5.2. Finite-Dimensional Arbitrary Rank Tensors of Composite Numbers

One can transform the infinite-dimensional tensors of section 4, into finite-dimensional tensors associated with the composite numbers holding N prime powers. One can build these finite-dimensional tensors even using different finite dimensions for each vector. For instance, according to the set: { N K | K = 1 , N } .

Therefore, one can write a finite-dimensional tensor of arbitrary rank N as an array like:

C ( I K | K = 1 , N ) ( N K | K = 1 , N ) = K = 1 N | p I K N K = { K = 1 N p I K A K | ( A K | K = 1 , N K ) } .

Then, one can see every tensor element made with products of N prime powers. Therefore, one can also consider every tensor of this kind as an array containing a subset of natural composite numbers.

One can also write the alternative expression in the homothecy formalism as:

C ( I K | K = 1 , N ) ( N K | K = 1 , N ) = ( K = 1 N p I k ) K = 1 N | p I K N K 1 .

The same remark about ordering the involved prime numbers as before in the infinite-dimensional case applies here. The structure of the tensor will vary; however, the information about the contained composite natural number elements will be the same as in the ordered construction.

When the dimension of the involved prime number powers is uniformly the same for all the used primes, one can observe the magnitude of the generated composite natural numbers.

Suppose, then, that:

N 1 = N 2 = N 3 = = N N = M ,

thus, the number of composite number elements will be: N M .

So, the number of computable composite numbers quickly becomes astronomically large. Suppose one chooses ten prime numbers and assumes their discrete power vectors of dimension 11. One can obtain a vast number of composite natural numbers: M = 11 N = 10 N M = 10 11 . A quantity that roughly corresponds to the average number of stars in a galaxy the size of the Milky Way.

Combinatorics can produce an infinite set of sets of this kind; think about the freedom to choose among the known ones (see, for example, references [2] [7] [9] ) 106 different heaps of 10 prime numbers natural power vectors of dimension 11. Then the number of composite natural numbers in this set will be 1017 elements.

6. Conclusions

This study’s simple arguments show the straightforward construction of composite natural numbers as feasible, defined through tensor products of the vectors constructed with prime powers indefinite sequences.

Thus, using the fact that all composite numbers are expressible from products of powers of primes and from what one has discussed so far, natural numbers can be well-understood on the one hand from prime numbers and their natural power set vectors, and on the other with the tensorial products of these prime power vectors, containing the prospect to generate all the composite numbers.

Thus, from the point of view of the present study, composite numbers might appear as an infinite set of tensors, starting from the prime power vectors and the tensor product of two prime powers elements, driving to the tensor product of an arbitrary number of vectors.

Then, one can imagine the whole set of composite numbers as tensor elements made of an infinite (or quasi-infinite, if the computational or practical side is preferred) number of tensorial products of prime powers vectors.

Finally, one can think about the composite numbers in terms of infinite rank tensors made by infinite tensorial products of infinite-dimensional prime powers vectors.

Consequently, one can add another mathematical thought to understand natural numbers’ using geometrical connections.

Conflicts of Interest

The authors declare no conflicts of interest regarding the publication of this paper.


[1] Carbó-Dorca, R. (2023) On the Geometrical Structure of Natural Numbers. London Journal of Research in Science: Natural and Formal, 23, 15-38.
[2] Carbó-Dorca, R. (2018) Boolean Hypercubes and the Structure of Vector Spaces. Journal of Mathematical Sciences and Modelling, 1, 1-14.
[3] Granville, A. and Martin, G. (2006) Prime Number Races. American Mathematical Monthly, 113, 1-33.
[4] Derbyshire, J. (2004) Prime Obsession: Bernhard Riemann and the Greatest Unsolved Problem in Mathematics. Plume, New York.
[5] Pinter, C.C. (2014) A Book of Set Theory. Dover Publications Inc., Garden City.
[6] Gowers, T. (Ed.) (2008) The Princeton Companion to Mathematics. Princeton University Press, Princeton, NJ.
[7] Carbó-Dorca, R., Reyes, S. and Niño, A. (2021) Extension of Fermat’s Last Theorem in Minkowski Natural Spaces. Journal of Mathematical Chemistry, 59, 1851-1863.
[8] Hogben, L. (Ed.) (2007) Handbook of Linear Algebra. Chapman & Hall/CRC, Boca Raton, FL.
[9] Carbó-Dorca, R. (2022) Mersenne Numbers, Recursive Generation of Natural Numbers, and Counting the Number of Prime Numbers. Applied Mathematics, 13 538-543.

Copyright © 2024 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.