ebook img

q-Stirling's formula in Tsallis statistics PDF

0.34 MB·
Save to my drive
Quick download
Download
Most books are stored in the elastic cloud where traffic is expensive. For this reason, we have a limit on daily download.

Preview q-Stirling's formula in Tsallis statistics

q-Stirling’s formula in Tsallis statistics Hiroki Suyari∗ 4 0 Department of Information and Image Sciences, 0 2 Faculty of Engineering, Chiba University, 263-8522, Japan n a (Dated: February 2, 2008) J 7 Abstract 2 ] We present the q-Stirling’s formula using the q-product determined by Tsallis entropy as nonex- h c tensive generalization of the usual Stirling’s formula. The numerical computations and the proof e m are also shown. Moreover, we derive and prove some inequalities and equalities concerning the - t a q-Stirling’s formula. Applying the q-Stirling’s formula, the mathematical foundations of Tsallis t s . statistics can be obtained as similarly as those of Boltzmann-Gibbs statistics. t a m - PACS numbers: 02.50.-r,02.60.-x d n Keywords: q-Stirling’s formula, q-product, Tsallis entropy o c [ 1 v 1 4 5 1 0 4 0 / t a m - d n o c : v i X r a ∗Electronic address: [email protected],[email protected] 1 I. INTRODUCTION Tsallis statistics derived from Tsallis entropy [1][2] provides many successful descriptions of the physical systems with power-law behavior, which cannot be systematically recovered in the usual Boltzmann-Gibbs statistical mechanics [3]. The appearance of such a new physics stimulates us to finding its corresponding new mathematical structure behind it [4]. On the way to the goal, we obtain the q-Stirling’s formula as nonextensive generalization of the usual Stirling’s formula. The q-Stirling’s formula is derived from the q-product determined by Tsallis entropy. The q-product is first introduced by Borges in [5] for satisfying the following equations: ln (x y) = ln x+ln y, (1) q q q q ⊗ exp (x) exp (y) = exp (x+y), (2) q q q q ⊗ where ln x and exp (x) are the q-logarithm function[3]: q q x1−q 1 ln x := − x > 0,q R+ (3) q 1 q ∈ − (cid:0) (cid:1) and its inverse function, the q-exponential function[3]: 1 [1+(1 q)x]1−q if 1+(1 q)x > 0, exp (x) := − − x R,q R+ . (4) q  ∈ ∈ 0 otherwise  (cid:0) (cid:1) The requirements (1) and (2) lead us to the definition of q between two positive numbers ⊗ 1 [x1−q +y1−q 1]1−q , if x > 0, y > 0, x1−q +y1−q 1 > 0 x y := − − , (5) q ⊗ 0, otherwise  which is called the q-product in [5]. The q-product recovers the usual product: lim(x y) = xy. (6) q q→1 ⊗ The fundamental properties of the q-product are almost the same as the usual product, q ⊗ but the distributive law does not hold in general. a(x y) = ax y a R+,x,y R+ (7) q q ⊗ 6 ⊗ ∈ ∈ (cid:0) (cid:1) In our previous paper [6], a Tsallis distribution is derived from applying the q-product to the likelihood function in maximum likelihood principle (MLP for short) instead of the usual 2 product. This first successful application of the q-product to the MLP is briefly reviewed as follows. Consider the same setting as Gauss’ law of error: we get n observed values: x ,x , ,x R (8) 1 2 n ··· ∈ as results of n measurements for some observation. Each observed value x (i = 1, ,n) is i ··· each value of identically distributed random variable X (i = 1, ,n), respectively. There i ··· exist a true value x satisfying the additive relation: x = x+e (i = 1, ,n), (9) i i ··· where each of e is an error in each observation of a true value x. Thus, for each X , i i there exists a random variable E such that X = x + E (i = 1, ,n). Every E has i i i i ··· the same probability density function f which is differentiable, because X , ,X are 1 n ··· identically distributed random variables. (i.e., E , ,E are also identically distributed 1 n ··· random variables.) Let L (θ) be a function of a variable θ, defined by q L (θ) = L (x ,x , ,x ;θ) := f (x θ) f (x θ) f (x θ). (10) q q 1 2 n 1 q 2 q q n ··· − ⊗ − ⊗ ···⊗ − If the function L (x ,x , ,x ;θ) of θ for any fixed x ,x , ,x takes the maximum at q 1 2 n 1 2 n ··· ··· x +x + +x θ = θ∗ := 1 2 ··· n, (11) n then the probability density function f must be a Tsallis distribution: exp ( β e2) q q f (e) = − (12) exp ( β e2)de q q − where β is a q-dependent positive constaRnt. This result recovers Gauss’ law of error when q q 1. See [6] for the proof. → In addition to the above successful application of the q-product, we show one more im- portant property of the q-product in section II. This property convinces us of the undoubted validity of the q-product in Tsallis statistics. Along the lines of the above successful applica- tion and the important properties of the q-product, we derive the q-Stirling’s formula with the proof and numerical computations in section III. 3 II. REPRESENTATION OF THE q-EXPONENTIAL FUNCTION BY MEANS OF THE q-PRODUCT The base of the natural logarithm e is well-known to be defined as n 1 exp(1) := lim 1+ . (13) n→∞ n (cid:18) (cid:19) Using this definition, the exponential function exp(x) is expressed by x n exp(x) = lim 1+ . (14) n→∞ n (cid:16) (cid:17) Replacing the power on the right side of (14) by the n times of the q-product n : ⊗q x⊗nq := x x, (15) q q ⊗ ···⊗ ntimes exp (x) is obtained. In other words, lim |1+ x{z⊗nq co}incides with exp (x). q n→∞ n q (cid:0) (cid:1) x ⊗n q exp (x) = lim 1+ (16) q n→∞ n (cid:16) (cid:17) exp (x) in (4) was originally introduced in [7] from Tsallis entropy and its maximization. q On the other hand, lim 1+ x ⊗nq is computed using the definition of the q-product only. n→∞ n Therefore, this coincidenc(cid:0)e is an(cid:1)evidence revealing the conclusive validity of the q-product in Tsallis statistics as similarly as the law of error in Tsallis statistics. Therefore, the q- Stirling’s formula using the q-product is naturally defined and computed in the following section. The proof of (16) is given in the appendix. III. q-STIRLING’S FORMULA A. q-factorial n! q The q-factorial n! for n N and q > 0 is defined by q ∈ n! := 1 n (17) q q q ⊗ ···⊗ where is the q-product (5). Using the definition (5), n! is explicitly expressed by q q ⊗ 1 n 1−q n! = k1−q (n 1) . (18) q − − " # k=1 X 4 This implies n k1−q n − ln (n! ) = k=1 . (19) q q P 1 q − In the present paper, we derive the approximation of ln (n! ) instead of that of n! . In fact, q q q when q > 1, there exists infinite numbers of n N such that n k1−q (n 1) < 0. For ∈ k=1 − − example, P n k1−q (n 1) < 0 when q = 1.2 and n 6. (20) − − ≥ k=1 X When n k1−q (n 1) < 0, n! takes complex numbers in general except q = 1 + k=1 − − q 21m (m ∈PN). On the other hand, when nk=1k1−q − (n−1) > 0 for a given n ∈ N and q > 0, we easily obtain n!q from lnq(n!q).PTherefore, the approximation of lnq(n!q) is called “q-Stirling’s formula” in the present paper. If an approximation of ln (n! ) is not needed, q q the above explicit form (19) should be directly used for its computation. However, in order to clarify the correspondence between the studies q = 1 and q = 1, the approximation of 6 ln (n! ) is useful. In fact, using the present q-Stirling’s formula, we obtain the surprising q q mathematical structure in Tsallis statistics [8]. We obtain the q-Stirling’s formula as follows: n+ 1 lnn+( n)+θ +(1 δ ) if q = 1, 2 − n,1 − 1 lnq(n!q) =  n(cid:0) − 21n(cid:1)−lnn− 12 +θn,2 −δ2 if q = 2,  n + 1 n1−q−1 + n +θ + 1 δ if q > 0 and q = 1,2, 2−q 2 1−q −2−q n,q 2−q − q 6  (cid:16) (cid:17) (cid:16) (cid:17) (cid:16) (cid:17) (21)    where 1 limθ = 0, 0 < θ < , e1−δ1 = √2π. (22) n,q n,1 n→∞ 12n It is easily verified that the q-Stirling’s formula coincides with the usual Stirling’s formula when q 1. → limln (n! ) = lnn! (23) q q q→1 Other properties of θ and δ such as explicit forms and approximations are still unclear. n,q q But numerical results of (21) exhibit good approximations of the true value (19), which is shown in the next subsection. 5 B. Numerical computation of the q-Stirling’s formula By the property limθ = 0 in (22), θ is set to be 0 for the computation. The n,q n,q n→∞ explicit form of δ is not clear yet, but δ does not depend on n. Thus, δ is set to be q q q δ = δ = 1 ln√2π 0.081 which is already known in the usual Stirling’s formula. Then q 1 − ≃ the q-Stirling’s formula for the numerical computations in this subsection is given by n+ 1 lnn+( n)+(1 0.081) if q = 1, 2 − − lnq(n!q) ≃ (cid:0)n− 21n(cid:1)−lnn− 21 −0.081 if q = 2,  n + 1 n1−q−1 + n + 1 0.081 if q > 0 and q = 1,2, 2−q 2 1−q −2−q 2−q − 6 (cid:16) (cid:17) (cid:16) (cid:17) (cid:16) (cid:17) (24)    According to the following numerical results, these assumptions on θ = 0 and δ = 0.081 n,q q are found to be justified when n . We compute the true value (19) and its approximate → ∞ value(24)forln (n! ). Moreover, therelativeerrorandtheabsoluteerrorarealsocomputed. q q true value approximate value relative error := | − |, (25) true value absolute error := true value approximate value . (26) | − | n ln (n! ) (18) approximate value (24) relative error absolute error q q 2 9.6230 10−1 8.8677 10−1 7.8480 10−2 7.5521 10−2 × × × × 5 9.2143 9.1455 7.4604 10−3 6.8742 10−2 × × 10 3.9708 101 3.9644 101 1.6117 10−3 6.3995 10−2 q = 0.1 × × × × (27) 15 9.0005 101 8.9943 101 6.8181 10−4 6.1366 10−2 × × × × 20 1.5933 102 1.5927 102 3.7384 10−4 5.9563 10−2 × × × × ↓ ↓ ↓ 0 0 ∞ 6 n ln (n! ) (18) approximate value (24) relative error absolute error q q 2 8.2843 10−1 7.7112 10−1 6.9180 10−2 5.7311 10−2 × × × × 5 6.7647 6.7289 5.2937 10−3 3.5810 10−2 × × 10 2.4937 101 2.4912 101 9.9893 10−4 2.4910 10−2 q = 0.5 × × × × (28) 15 5.0938 101 5.0918 101 3.9413 10−4 2.0076 10−2 × × × × 20 8.3332 101 8.3315 101 2.0633 10−4 1.7194 10−2 × × × × ↓ ↓ ↓ 0 0 ∞ n ln (n! ) (18) approximate value (24) relative error absolute error q q 2 6.9339 10−1 6.5208 10−1 5.9570 10−2 4.1305 10−2 × × × × 5 4.7906 4.7740 3.4666 10−3 1.6607 10−2 × × 10 1.5118 101 1.5110 101 5.4802 10−4 8.2851 10−3 q = 0.999 × × × × (29) 15 2.7930 101 2.7924 101 1.9711 10−4 5.5052 10−3 × × × × 20 4.2387 101 4.2383 101 9.7063 10−5 4.1142 10−3 × × × × ↓ ↓ ↓ 0 0 ∞ n ln(n!) approximate value (24) relative error absolute error 2 6.9315 10−1 6.5187 10−1 5.9553 10−2 4.1279 10−2 × × × × 5 4.7875 4.7709 3.4639 10−3 1.6583 10−2 × × 10 1.5104 101 1.5096 101 5.4746 10−4 8.2691 10−3 q = 1.0 × × × × (30) 15 2.7899 101 2.7894 101 1.9690 10−4 5.4933 10−3 × × × × 20 4.2336 101 4.2332 101 9.6960 10−5 4.1049 10−3 × × × × ↓ ↓ ↓ 0 0 ∞ 7 n ln (n! ) (18) approximate value (24) relative error absolute error q q 2 5.8579 10−1 5.5504 10−1 5.2489 10−2 3.0747 10−2 × × × × 5 3.5367 3.5275 2.5856 10−3 9.1442 10−3 × × 10 9.9580 9.9537 4.3609 10−4 4.3426 10−3 q = 1.5 × × (31) 15 1.7172 101 1.7169 101 1.8303 10−4 3.1431 10−3 × × × × 20 2.4809 101 2.4807 101 1.0643 10−4 2.6406 10−3 × × × × ↓ ↓ ↓ 0 0 ∞ n ln (n! ) (18) approximate value (24) relative error absolute error q q 2 5.0000 10−1 4.7585 10−1 4.8294 10−2 2.4147 10−2 × × × × 5 2.7167 2.7096 2.6152 10−3 7.1046 10−3 × × 10 7.0710 7.0664 6.5292 10−4 4.6168 10−3 q = 2.0 × × (32) 15 1.1682 101 1.1678 101 3.5564 10−4 4.1545 10−3 × × × × 20 1.6402 101 1.6398 101 2.4342 10−4 3.9926 10−3 × × × × ↓ ↓ ↓ 0 0 ∞ The numerical results (27) (32) and Fig.1 show that the relative error of the q-Stirling’s ∼ 00..0088 aa ulul 00..0077 mm rr oo sfsf 00..0066 ’’ gg nn rlirli 00..0055 StiSti -- qq e e 00..0044 hh f tf t oo 00..0033 r r oo rr rr e ee e 00..0022 vv atiati elel 00..0011 rr 00 55 1100 1155 2200 nn FIG. 1: relative error of the q Stirling formula with respect to n when q = 0.1,0.2, ,2.0 − ··· 8 formula (24) in any q > 0 goes to zero when n . Therefore, the q-Stirling’s formula → ∞ (21) can provide a good approximate value for each ln (n! ) in any q > 0. q q C. Derivation of the q-Stirling’s formula This subsection proves the q-Stirling’s formula (21) when q > 0 (q = 1). The case q = 1 6 of the q-Stirling’s formula (21) is the famous usual Stirling’s formula whose proof is found in many references such as [9], so that we prove the q-Stirling’s formula in case q > 0 (q = 1). 6 For simplicity, we assume q = 1 in the subsections C and D. 6 Note that, when q = 0, n! is directly and explicitly derived from (18) as follows: q n 1 1 n! = k (n 1) = n2 n+1. (33) q=0 − − 2 − 2 k=1 X Thus, the q-Stirling’s formula when q = 0 is not needed. When q < 0,ln x is a convex q function with respect to x, so thatδ defined by (37) below does not converge when n n,q → ∞ in general. Moreover, Tsallis entropy when q < 0 lacks the property of concavity which plays essential roles in the natural generalization of Boltzmann-Gibbs statistical mechanics. Therefore, we prove the q-Stirling’s formula (21) when q > 0. n Consider the definite integral ln xdx when q > 0 (q = 1). The curve in Fig.2 describes 1 q 6 a concave function with respect Rto x: x1−q 1 y = ln x = − . (34) q 1 q − For each natural number k 2,3, on the x-axis, there exist a rectangle with width ∈ { ···} 1 and height ln k (See Fig.2). Here, in order to avoid confusions, we call a rectangle at q k 2,3, on the x-axis by “k-rectangle”. The center of the bottom of each k-rectangle ∈ { ···} is at k 2,3, on the x-axis. For each k-rectangle, we define α and β for k N by k,q k,q ∈ { ···} ∈ α := the area of the portion surrounded by the curve, the top side of the k-rectangle k,q (x-axis when k = 1) and the left side of the (k +1)-rectangle, (35) β := the area of the portion surrounded by the curve, the left side k,q of the (k +1)-rectangle and the top side of the (k +1)-rectangle. (36) Then, we define the sum of areas of all gaps between the curve and the rectangles by δ n,q 9 yy αα ββ nn−−11,,qq nn−−11,,qq yy == llnn xx qq ββ 22,,qq αα 22,,qq ββ 11,,qq αα 11,,qq (cid:1)(cid:1)(cid:2)(cid:2)(cid:0)(cid:0) (cid:3)(cid:3) xx n FIG. 2: approximation of ln xdx 1 q R n−1 n−1 n−1 δ := α β = (α β ). (37) n,q k,q k,q k,q k,q − − k=1 k=1 k=1 X X X Using δ , the area of the portion surrounded by the x-axis, the straight line x = n and the n,q curve y = ln x is computed as q 1 ln 2+ln 3+ +ln (n 1)+ ln n+δ (38) q q q q n,q ··· − 2 n n x1−q 1 lnn+n 1 if q = 2 = ln xdx = − dx = − − . (39) q Z1 Z1 (cid:18) 1−q (cid:19)  2−1q ·n·lnqn− n2−−q1 if q 6= 2 Therefore, we obtain  ln (n! ) = ln (1 n) = ln 2+ln 3+ +ln n (40) q q q q q q q q ⊗ ···⊗ ··· 1 1 = ln 2+ln 3+ +ln (n 1)+ ln n+δ + ln n δ (41) q q q q n,q q n,q ··· − 2 2 − (cid:18) (cid:19) ( lnn+n 1)+ 1 1 1 δ if q = 2 = − − 2 − n − n,2 (42)  2−1q ·n·lnqn− n2−−q1(cid:0) + 21 l(cid:1)nqn−δn,q if q 6= 2 (cid:16) (cid:17) =  n− 21n −lnn− 21 −δn,2 if q = 2 . (43)  n + 1 ln n+ n + 1 δ if q = 2  2−q 2 q −2−q 2−q − n,q 6 (cid:16) (cid:17) (cid:16) (cid:17) (cid:16) (cid:17)  10

See more

The list of books you might like

Most books are stored in the elastic cloud where traffic is expensive. For this reason, we have a limit on daily download.