About the Entropy of a Natural Number and a Type of the Entropy of an Ideal

In this article, we find some properties of certain types of entropies of a natural number. We are studying a way of measuring the “disorder” of the divisors of a natural number. We compare two of the entropies H and H¯ defined for a natural number. An useful property of the Shannon entropy is the additivity, HS(pq)=HS(p)+HS(q), where pq denotes tensor product, so we focus on its study in the case of numbers and ideals. We mention that only one of the two entropy functions discussed in this paper satisfies additivity, whereas the other does not. In addition, regarding the entropy H of a natural number, we generalize this notion for ideals, and we find some of its properties.


Introduction and Preliminaries
In information theory, the entropy is defined as a measure of uncertainty. The most used of the entropies is Shannon entropy (H S ), which is given for a probability distribution p = {p 1 , . . . , p r }; thus, An useful property of the Shannon entropy is the additivity, H S (pq) = H S (p) + H S (q), where p = {p 1 , . . . , p r }, q = {q 1 , . . . , q r } and pq = {p 1 q 1 , . . . , p 1 q r , . . . , p r q 1 , . . . , p r q r }.
In [1], Sayyari gave an extension of Jensen's discrete inequality considering the class of uniformly convex functions getting lower and upper bounds for Jensen's inequality. He applied this results in information theory and obtained new and strong bounds for Shannon's entropy of a probability distribution. Recently, in [2], De Gregorio, Sánchez and Toral defined the block entropy (based on Shannon entropy), which can determine the memory for systems modeled as Markov chains of arbitrary finite order.
We have found several ways to define the entropy of a natural number. Jeong et al., in [3], defined the additive entropy of a natural number in terms of the additive partition function. If d is the divisor of a natural number n, then we will write d|n. If σ(n) is the sum of natural divisors of n, then it is easy to see that ∑ d|n d σ(n) = 1. Thus, the ratio d σ(n) can be seen as a probability. As a result we, have a discrete probability distribution associated with a natural number. In [4], we found the following definition for the entropy of a natural number: where log is the natural logarithm. Unfortunately, we did not find this interesting definition of the entropy of a natural number in a book or paper, but on a website. This entropy has the following interesting property: when m, n ∈ N * and gcd(m, n) = 1. If p is a prime number and α ∈ N * , then we have Taking the limit as α → ∞, we obtain We remark that, if p is a prime number, q > 1, such that 1 p + 1 q = 1, then In the paper [5], Minculete and Pozna introduced the notion of entropy of a natural number in another way-namely, if n ∈ N, n ≥ 2, by applying the fundamental theorem of arithmetic, n is written uniquely n = p α 1 1 p α 2 2 . . . p α r r , where r ∈ N * , p 1 , p 2 , . . . , p r are distinct prime positive integers and α 1 , α 2 , . . . , α r ∈ N * . Let Ω(n) = α 1 + α 2 + . . . + α r and p(α i ) = α i Ω(n) , (∀) i = 1, r. The entropy of n is defined by Here, by convention, H(1) = 0. Minculete and Pozna (in [5]) gave an equivalent form for the entropy of n, namely: For example, if n = 6 = 2 · 3, we have: Another example: if n = 24 = 2 3 · 3, we have: Minculete and Pozna proved (in [5]) the following: where ω(n) is the number of distinct prime factors of n. (ii) If n = p 1 · p 2 · . . . · p r , then H(n) = log ω(n); (iii) If n = (p 1 · p 2 · . . . · p r ) k , then H(n) = log ω(n).
It is easy to see that H(n α ) = H(n), with α ≥ 1. The relevance of this entropy is given by the possibility of extension to ideals. The extension of some properties of the natural numbers to ideals was recently given in [6]. Some of the studied results can be transferred to other types of generalized entropies that can be defined later [7]. Entropy is generally used in mathematical physics applications, but it can constitute a new element of analysis in theoretical fields [8]. Recently, in [9], Niepostyn and Daszczuk used entropy as a measure of consistency in software architecture. Therefore, the area of studying different types of entropies in various fields is expanding.
Our motivation of this article was to study some properties of certain types of entropies of a natural number. We compare two of the entropies defined for a natural number. Additionally, regarding the entropy H of a natural number, introduced in [5], we generalize this notion for ideals, and we find some of its properties. We mention that the entropy of the ideal is generalized from the second notion of the entropy of integers.

A Comparison between the Entropies H and H
In this section, we propose to compare the entropies H and H, looking to similarities and differences between them.
. Next, we use the following limit of functions: Remark 2. Related to the entropy H, we have when gcd(n, p) = 1, with p being a prime number and n, α ∈ N * . It is easy to see that lim p→∞ lim α→∞ H(p α ) = 0 = H(p α ).

Proposition 3.
If gcd(n, p) = 1, with p being a prime number and n, α ∈ N * , then we have Proof. From the definition of H, we have It follows that By taking the limit when α → ∞, we deduce the relation of the statement.
We also see that if gcd(m, n) = 1, then As a result, we ask ourselves the question of what is the relationship between H(mn) and H(m) + H(n), where m, n ∈ N * , m, n ≥ 2.
If m = 22 and n = 105, then H(m) = log 2, H(n) = log 3 and H(mn) = log 5, so we have If m = 20 and n = 63, then H(m) = H(n) = log 3 − 2 3 log 2 and H(mn) = log 6 − 2 3 log 2, which means that Next, we study a general result of this type for the entropy H.
Proposition 4. We assume that m = p k q and n = p k t, where p, q, t are distinct prime numbers and k ∈ N * . Then, the inequality holds.
Proof. From the definition of H, we have H(m) = H(n) = log(k + 1) − k k+1 log k and H(mn) = log 2(k + 1) − k k+1 log 2k. Therefore, we obtain We consider the function f : [1, ∞) → R defined by x > 0 for every x ≥ 1, we deduce that the function f is increasing, so we have f (x) ≥ f (1) = log 2 > 0. Consequently, the inequality of the statement is true.

Proposition 5.
We assume that m = p k 1 p 2 and n = q k 1 q 2 , where p 1 , p 2 , q 1 , q 2 are distinct prime numbers and k ∈ N * . Then, we have the following inequality Equality holds for k = 1.
We study another result for which we have where m, n ∈ N * , m, n ≥ 2. Proof. Using the definition of H, we deduce the equality Since log a i , log b j ≥ log k for all i ∈ {1, . . . , r} and j ∈ {1, . . . , s}, we obtain that ∑ r i=1 a i log a i ≥ log k ∑ r i=1 a i = (log k)Ω(m) and ∑ s j=1 b j log b j ≥ log k ∑ s j=1 b j = (log k) Ω(n). Using equality (7) and above inequalities, we show that Consequently, the inequality of the statement is true.
Therefore, taking into account that H(m), H(n) ≥ log 2 and using inequality (9), we deduce the statement.
Next, our goal was to show that the entropy H is more suitable to extend it to ideals.

The Entropy of an Ideal
In this section, we introduce the notion of entropy of an ideal of a ring of algebraic integers, and we find interesting properties of it.
Let K be an algebraic number field of degree [K : Q] = n, where n ∈ N, n ≥ 2, and let O K be its ring of integers. Let Spec(O K ) be the set of the prime ideals of the ring O K . Let p be a prime positive integer. Since O K is a Dedekind ring, applying the fundamental theorem of Dedekind rings, the ideal pO K is written uniquely (except for the order of the factors) like this: where g ∈ N * , e 1 , e 2 , . . . , e g ∈ N * and P 1 , P 2 , . . . , P g ∈ Spec(O K ). The number e i (i = 1, g) is called the ramification index of p at the ideal P i . Generally, according to the fundamental theorem of Dedekind rings, any ideal I of the ring O K decomposes uniquely: 1 1 · P e 2 2 · . . . · P e g g , where r ∈ N * , e 1 , e 2 , . . . , e g ∈ N * and P 1 , P 2 , . . . , P g ∈ Spec(O K ).
We shall mostly work in this article with ideals of the form pO K , since for such ideals there are known ramification results in the ring O K , for many algebraic number fields K (when K is any quadratic field, or K is any cubic field, or K is any cyclotomic field, or K is any Kummer field, etc.) The following result is known (see [10][11][12]): Proposition 7. In the above notation, we have: where f i is the residual degree of p, meaning f i = [O K /P i : Z/pZ], i = 1, g.
Let J be the set of ideals of the ring O K . Let I∈J, I be written uniquely as in equality (10). It is easy to see that ∑ g i=1 e i Ω(I) = 1. Thus, the ratio e i Ω(I) can be seen as a probability; as a result, we have a discrete probability distribution associated with a ideal.
We generalize the notion of entropy of an ideal like this: Definition 1. Let I = (0) be an ideal of the ring O K , decomposed as above. We define the entropy of the ideal I as follows: where Ω(I) = e 1 + e 2 + . . . + e g .
Immediately, we obtain the following equivalent form, for the entropy of the ideal I: We now give some examples of calculating the entropy of an ideal.

Example 1.
Let ξ be a primitive root of order 5 of the unity and let K = Q(ξ) be the 5th cyclotomic field. The ring of algebraic integers of the field K is [10,13]). Let the ideal Example 2. Let the pure cubic field K = Q 3 √ 2 . Since 2 2 ≡ 1 (mod 9), the results show that the ring of algebraic integers of the field K is O K = Z 3 √ 2 (see [14]).

Remark 3.
Let K be an algebraic number field, and let O K be its ring of integers. Let p be a prime positive integer. If p is inert or totally ramified in the ring O K , then H(pO K ) = 0.
Proof. To calculate the entropy of ideal pO K , we consider two cases. Case 1: if p is inert in the ring O K , the results show that pO K is a prime ideal. Then Ω(pO K ) = 1 and H(pO K ) = 0. Case 2: if p is totally ramified in the ring O K , the results show that pO K = P n , where P ∈ Spec(O K ) and n = [K : Q]. This results immediately in Ω(pO K ) = n and H(pO K ) = log n − log n = 0.
Proposition 8. Let n be a positive integer, n ≥ 2, and let p be a positive prime integer. Let K be an algebraic number field of degree [K : Q] = n and let O K be its ring of integers. Then: where ω(pO K ) is the number of distinct prime factors of the ideal pO K . study some inequalities involving the entropy H of an exponential divisor of a positive integer and the entropy H of an exponential divisor of an ideal. Additionally, we shall try to study the entropy in the cases of more general ideals of the ring of algebraic integers O K of an algebraic number field K, than the ideals of the form pO K , with p being a prime integer.