Bose–Einstein statistics

Template:Statistics (stat. mech.) In statistical mechanics, Bose-Einstein statistics (or more colloquially B-E statistics) determines the statistical distribution of identical indistinguishable bosons over the energy states in thermal equilibrium.

Concept

Bosons, unlike fermions, are not subject to the Pauli exclusion principle: an unlimited number of particles may occupy the same state at the same time. This explains why, at low temperatures, bosons can behave very differently from fermions; all the particles will tend to congregate together at the same lowest-energy state, forming what is known as a Bose–Einstein condensate.

B-E statistics was introduced for photons in 1920 by Bose and generalized to atoms by Einstein in 1924.

The expected number of particles in an energy state i  for B-E statistics is:

<math>

n_i = \frac {g_i} {e^{(\varepsilon_i-\mu)/kT} - 1} </math>

with <math>\varepsilon_i > \mu</math> and where:

n_i  is the number of particles in state i

g_i  is the degeneracy of state i

ε_i  is the energy of the i-th state

μ is the chemical potential

k is Boltzmann's constant

T is absolute temperature

This reduces to M-B statistics for energies ( ε_i − μ ) >> kT.

History

In the early 1920s Satyendra Nath Bose, a professor of University of Dhaka was intrigued by Einstein's theory of light waves being made of particles called photons. Bose was interested in deriving Planck's radiation formula, which Planck obtained largely by guessing. In 1900 Max Planck had derived his formula by manipulating the math to fit the empirical evidence. Using the particle picture of Einstein, Bose was able to derive the radiation formula by systematically developing a statistics of massless particles without the constraint of particle number conservation. Bose derived Planck's Law of Radiation by proposing different states for the photon. Instead of statistical independence of particles, Bose put particles into cells and described statistical independence of cells of phase space. Such systems allow two polarization states, and exhibit totally symmetric wavefunctions.

He developed a statistical law governing the behaviour pattern of photons quite successfully. However, he was not able to publish his work; no journals in Europe would accept his paper, being unable to understand it. Bose sent his paper to Einstein, who saw the significance of it and used his influence to get it published.

A derivation of the Bose–Einstein distribution

Suppose we have a number of energy levels, labeled by index <math>\displaystyle i</math>, each level having energy <math>\displaystyle \varepsilon_i</math> and containing a total of <math>\displaystyle n_i</math> particles. Suppose each level contains <math>\displaystyle g_i</math> distinct sublevels, all of which have the same energy, and which are distinguishable. For example, two particles may have different momenta, in which case they are distinguishable from each other, yet they can still have the same energy. The value of <math>\displaystyle g_i</math> associated with level <math>\displaystyle i</math> is called the "degeneracy" of that energy level. Any number of bosons can occupy the same sublevel.

Let <math>\displaystyle w(n,g)</math> be the number of ways of distributing <math>\displaystyle n</math> particles among the <math>\displaystyle g</math> sublevels of an energy level. There is only one way of distributing <math>\displaystyle n</math> particles with one sublevel, therefore <math>\displaystyle w(n,1)=1</math>. It is easy to see that there are <math>\displaystyle (n+1)</math> ways of distributing <math>\displaystyle n</math> particles in two sublevels which we will write as:

<math>

w(n,2)=\frac{(n+1)!}{n!1!}. </math>

With a little thought (See Notes below) it can be seen that the number of ways of distributing <math>\displaystyle n</math> particles in three sublevels is

<math>w(n,3) = w(n,2) + w(n-1,2) + \cdots + w(1,2) + w(0,2)

</math> so that

<math>

w(n,3)=\sum_{k=0}^n w(n-k,2) = \sum_{k=0}^n\frac{(n-k+1)!}{(n-k)!1!}=\frac{(n+2)!}{n!2!} </math>

where we have used the following theorem involving binomial coefficients:

<math>

\sum_{k=0}^n\frac{(k+a)!}{k!a!}=\frac{(n+a+1)!}{n!(a+1)!}. </math>

Continuing this process, we can see that <math>\displaystyle w(n,g)</math> is just a binomial coefficient (See Notes below)

<math>

w(n,g)=\frac{(n+g-1)!}{n!(g-1)!}. </math>

The number of ways that a set of occupation numbers <math>\displaystyle n_i</math> can be realized is the product of the ways that each individual energy level can be populated:

<math>

W = \prod_i w(n_i,g_i) = \prod_i \frac{(n_i+g_i-1)!}{n_i!(g_i-1)!} \approx\prod_i \frac{(n_i+g_i)!}{n_i!(g_i)!} </math>

where the approximation assumes that <math>g_i \gg 1</math>. Following the same procedure used in deriving the Maxwell–Boltzmann statistics, we wish to find the set of <math>\displaystyle n_i</math> for which <math>\displaystyle W</math> is maximised, subject to the constraint that there be a fixed number of particles, and a fixed energy. The maxima of <math>\displaystyle W</math> and <math>\displaystyle \ln(W)</math> occur at the value of <math>\displaystyle N_i</math> and, since it is easier to accomplish mathematically, we will maximise the latter function instead. We constrain our solution using Lagrange multipliers forming the function:

<math>

f(n_i)=\ln(W)+\alpha(N-\sum n_i)+\beta(E-\sum n_i \varepsilon_i) </math>

Using the <math>g_i \gg 1</math> approximation and using Stirling's approximation for the factorials <math>\left(\ln(x!)\approx x\ln(x)-x\right)</math> gives

<math>f(n_i)=\sum_i (n_i + g_i) \ln(n_i + g_i) - n_i \ln(n_i) - g_i \ln (g_i) +\alpha\left(N-\sum n_i\right)+\beta\left(E-\sum n_i \varepsilon_i\right).

</math>

Taking the derivative with respect to <math>\displaystyle n_i</math>, and setting the result to zero and solving for <math>\displaystyle n_i</math>, yields the Bose–Einstein population numbers:

<math>

n_i = \frac{g_i}{e^{\alpha+\beta \varepsilon_i}-1}. </math>

It can be shown thermodynamically that <math>\displaystyle \beta = \frac{1}{kT}</math>, where <math>\displaystyle k</math> is Boltzmann's constant and <math>\displaystyle T</math> is the temperature.

It can also be shown that <math>\displaystyle \alpha = - \frac{\mu}{kT}</math>, where <math>\displaystyle \mu</math> is the chemical potential, so that finally:

<math>

n_i = \frac{g_i}{e^{(\varepsilon_i-\mu)/kT}-1}. </math>

Note that the above formula is sometimes written:

<math>

n_i = \frac{g_i}{e^{\varepsilon_i/kT}/z-1}, </math>

where <math>\displaystyle z=\exp(\mu/kT)</math> is the absolute activity.

Notes

The purpose of these notes is to clarify some aspects of the derivation of the Bose-Einstein (B-E) distribution for beginners. The enumeration of cases (or ways) in the B-E distribution can be recast as follows. Consider a game of dice throwing in which there are <math>\displaystyle n</math> dice, with each dice taking values in the set <math>\displaystyle \left\{ 1, \cdots, g \right\}</math>, for <math>g \ge 1</math>. The constraints of the game is that the value of a dice <math>\displaystyle i</math>, denoted by <math>\displaystyle n_i</math>, has to be greater or equal to the value of dice <math>\displaystyle (i-1)</math>, denoted by <math>\displaystyle m_{i-1}</math>, in the previous throw, i.e., <math>m_i \ge m_{i-1}</math>. Thus a valid sequence of dice throws can be described by an <math>\displaystyle n</math>-tuple <math>\displaystyle \left( m_1 , m_2 , \cdots , m_n \right)</math>, such that <math>m_i \ge m_{i-1}</math>. Let <math>\displaystyle S(n,g)</math> denote the set of these valid <math>\displaystyle n</math>-tuples:

<math> S(n,g) = \Big\{ \left( m_1 , m_2 , \cdots , m_n \right) \Big| \Big. m_i \ge m_{i-1} , m_i \in \left\{ 1 \cdots, g \right\} , \forall i = 1, \cdots , n \Big\} </math>

(1)

Then the quantity <math>\displaystyle w(n,g)</math> (defined above as the number of ways to distribute <math>\displaystyle n</math> particles among the <math>\displaystyle g</math> sublevels of an energy level) is the cardinality of <math>\displaystyle S(n,g)</math>, i.e., the number of elements (or valid <math>\displaystyle n</math>-tuples) in <math>\displaystyle S(n,g)</math>. Thus the problem of finding and expression for <math>\displaystyle w(n,g)</math> becomes the problem of counting the elements in <math>\displaystyle S(n,g)</math>.

Example n = 4, g = 3:

<math>

  S(4,3) =
  \left\{ 
     \underbrace{(1111), (1112), (1113)}_{(a)},
     \underbrace{(1122), (1123), (1133)}_{(b)},
     \underbrace{(1222), (1223), (1233), (1333)}_{(c)},
  \right.

</math>

<math>

  \left.
     \underbrace{(2222), (2223), (2233), (2333), (3333)}_{(d)}
  \right\}

</math>

<math>\displaystyle w(4,3) = 15</math> (there are <math>\displaystyle 15</math> elements in <math>\displaystyle S(4,3)</math>)

Subset <math>\displaystyle (a)</math> is obtained by fixing all indices <math>\displaystyle m_i</math> to <math>\displaystyle 1</math>, except for the last index, <math>\displaystyle m_n</math>, which is incremented from <math>\displaystyle 1</math> to <math>\displaystyle g=3</math>. Subset <math>\displaystyle (b)</math> is obtained by fixing <math>\displaystyle m_1 = m_2 = 1</math>, and increment <math>\displaystyle m_3</math> from <math>\displaystyle 2</math> to <math>\displaystyle g=3</math>; due to the constraint <math>

  \displaystyle 
  m_i \ge m_{i-1}

</math> on the indices in <math>\displaystyle S(n,g)</math>, the index <math>\displaystyle m_4</math> must automatically take values in <math>\displaystyle \left\{ 2, 3 \right\}</math>. The construction of subsets <math>\displaystyle (c)</math> and <math>\displaystyle (d)</math> follows in the same manner.

Each element of <math>\displaystyle S(4,3)</math> can be thought of as a multiset of cardinality <math>\displaystyle n=4</math>; the elements of such multiset are taken from the set <math>\displaystyle \left\{ 1, 2, 3 \right\}</math> of cardinality <math>\displaystyle g=3</math>, and the number of such multisets is the multiset coefficient

<math>

  \displaystyle 
  \left\langle 
     \begin{matrix} 

3 \\ 4

     \end{matrix}
  \right\rangle 
  = {3 + 4 - 1 \choose 3-1}
  = {3 + 4 - 1 \choose 4}
  =
  \frac
  {6!}
  {4! 2!}
  = 15

</math>

More generally, each element of <math>\displaystyle S(n,g)</math> is a multiset of cardinality <math>\displaystyle n</math> (number of dice) with elements taken from the set <math>\displaystyle \left\{ 1, \cdots, g \right\}</math> of cardinality <math>\displaystyle g</math> (number of possible values of each dice), and the number of such multisets, i.e., <math>\displaystyle w(n,g)</math> is the multiset coefficient

<math> \displaystyle w(n,g) = \left\langle \begin{matrix} g \\ n \end{matrix} \right\rangle = {g + n - 1 \choose g-1} = {g + n - 1 \choose n} = \frac{(g + n - 1)!} {n! (g-1)!} </math>

(2)

which is exactly the same as the formula for <math>\displaystyle w(n,g)</math>, as derived above with the aid of a theorem involving binomial coefficients, namely

<math> \sum_{k=0}^n\frac{(k+a)!}{k!a!}=\frac{(n+a+1)!}{n!(a+1)!}. </math>

(3)

To understand the decomposition

<math> \displaystyle w(n,g) = \sum_{k=0}^{n} w(n-k, g-1) = w(n, g-1) + w(n-1, g-1) + \cdots + w(1, g-1) + w(0, g-1) </math>

(4)

or for example, <math>\displaystyle n=4</math> and <math>\displaystyle g=3</math>

<math>

  \displaystyle 
  w(4,3)
  =
  w(4,2)
  +
  w(3,2)
  +
  w(2,2)
  +
  w(1,2)
  +
  w(0,2)

</math>

To this end, let's rearrange the elements of <math>\displaystyle S(4,3)</math> as follows

<math>

  S(4,3) =
  \left\{ 
     \underbrace{

(1111), (1112), (1122), (1222), (2222)

     }_{(\alpha)},
     \underbrace{

(111{\color{Red}\underset{=}{3}}), (112{\color{Red}\underset{=}{3}}), (122{\color{Red}\underset{=}{3}}), (222{\color{Red}\underset{=}{3}})

     }_{(\beta)},
  \right.

</math>

<math>

  \left.
     \underbrace{

(11{\color{Red}\underset{==}{33}}), (12{\color{Red}\underset{==}{33}}), (22{\color{Red}\underset{==}{33}})

     }_{(\gamma)},
     \underbrace{

(1{\color{Red}\underset{===}{333}}), (2{\color{Red}\underset{===}{333}})

     }_{(\delta)}
     \underbrace{

({\color{Red}\underset{====}{3333}})

     }_{(\omega)}
  \right\}

</math>

Clearly, the subset <math>\displaystyle (\alpha)</math> of <math>\displaystyle S(4,3)</math> is the same as the set

<math>

  \displaystyle 
  S(4,2)
  =
  \left\{ 

(1111), (1112), (1122), (1222), (2222)

  \right\}

</math>

By deleting the index <math>\displaystyle m_4=3</math> (shown in red with double underline) in the subset <math>\displaystyle (\beta)</math> of <math>\displaystyle S(4,3)</math>, one obtain the set

<math>

  \displaystyle 
  S(3,2)
  =
  \left\{ 

(111), (112), (122), (222)

  \right\}

</math> In other words, there is a one-to-one correspondence between the subset <math>\displaystyle (\beta)</math> of <math>\displaystyle S(4,3)</math> and the set <math>\displaystyle S(3,2)</math>. We write

<math>

  \displaystyle 
  (\beta)
  \longleftrightarrow
  S(3,2)

</math>

Similarly, it is easy to see that

<math>

  \displaystyle 
  (\gamma)
  \longleftrightarrow
  S(2,2)
  =
  \left\{ 

(11), (12), (22)

  \right\}

</math>

<math>

  \displaystyle 
  (\delta)
  \longleftrightarrow
  S(1,2)
  =
  \left\{ 

(1), (2)

  \right\}

</math>

<math>

  \displaystyle 
  (\omega)
  \longleftrightarrow
  S(0,2)
  =
  \phi

</math> (empty set)

Thus we can write

<math>

  \displaystyle 
  S(4,3) 
  =
  \bigcup_{k=0}^{4}
  S(4-k,2)

</math>

or more generally,

<math> \displaystyle S(n,g) = \bigcup_{k=0}^{n} S(n-k,g-1) </math>

(5)

and since the sets

<math>

  \displaystyle 
  S(i,g-1) \ , \ {\rm for} \ i = 0, \cdots , n

</math> are non-intersecting, we thus have

<math> \displaystyle w(n,g) = \sum_{k=0}^{n} w(n-k,g-1) </math>

(6)

with the convention that

<math> \displaystyle w(0,g) = 1 \ , \forall g \ , {\rm and} \ w(n,0) = 1 \ , \forall n </math>

(7)

Continue the process, we arrive at the following formula

<math>

  \displaystyle 
  w(n,g) 
  =
  \sum_{k_1=0}^{n}
  \sum_{k_2=0}^{n-k_1}
  w(n - k_1 - k_2, g-2)
  =
  \sum_{k_1=0}^{n}
  \sum_{k_2=0}^{n-k_1}
  \cdots
  \sum_{k_g=0}^{n-\sum_{j=1}^{g-1} k_j}
  w(n - \sum_{i=1}^{g} k_i, 0)

</math> Using the convention (7)₂ above, we obtain the formula

<math> \displaystyle w(n,g) = \sum_{k_1=0}^{n} \sum_{k_2=0}^{n-k_1} \cdots \sum_{k_g=0}^{n-\sum_{j=1}^{g-1} k_j} 1 </math>

(8)

keeping in mind that for <math>\displaystyle q</math> and <math>\displaystyle p</math> being constants, we have

<math> \displaystyle \sum_{k=0}^{q} p = q p </math>

(9)

It can then be verified that (8) and (2) give the same result for <math>\displaystyle w(4,3)</math>, <math>\displaystyle w(3,3)</math>, <math>\displaystyle w(3,2)</math>, etc.

Information Retrieval

In recent years, Bose Einstein statistics have also been used as a method for term weighting in information retrieval. The method is one of a collection of DFR ("Divergence From Randomness") models, the basic notion being that Bose Einstein statistics may be a useful indicator in cases where a particular term and a particular document have a significant relationship that would not have occurred purely by chance. Source code for implementing this model is available from the Terrier project at the University of Glasgow.

References

Annett, James F., "Superconductivity, Superfluids and Condensates", Oxford University Press, 2004, New York.

Carter, Ashley H., "Classical and Statistical Thermodynamics", Prentice-Hall, Inc., 2001, New Jersey.

Griffiths, David J., "Introduction to Quantum Mechanics", 2nd ed. Pearson Education, Inc., 2005.

See also

• Maxwell-Boltzmann statistics
• Fermi-Dirac statistics
• Parastatistics
• Planck's law of black body radiation