Skip to main content

Graduate Statistical Mechanics I · Ensembles, entropy, and the thermodynamic limit

Six distinguishable cells are partitioned into a left block of three and a right block…

Problem

Graduate Statistical Mechanics I practice problem

Six distinguishable cells are partitioned into a left block of three and a right block of three. Three indistinguishable particles of species AA and three of species BB occupy the cells with exactly one particle per cell. Let KK be the number of AA particles in the left block.

1. Count the microstates by the value of K∈{0,1,2,3}K\in\{0,1,2,3\} and
prove that the un-normalized counts are [1,9,9,1][1,9,9,1] on a total of 2020 equally likely placements, soP(K=k)=120(3k)(33−k),(P(K=0),P(K=1),P(K=2),P(K=3))=(120,920,920,120).\mathbb{P}(K=k) =\frac{1}{20}\binom{3}{k}\binom{3}{3-k}, \qquad \bigl(\mathbb{P}(K=0),\mathbb{P}(K=1),\mathbb{P}(K=2),\mathbb{P}(K=3)\bigr) =\Bigl(\tfrac1{20},\tfrac9{20},\tfrac9{20},\tfrac1{20}\Bigr).2. Compute the first two moments and proveE[K]=32,Var(K)=920.\mathbb{E}[K]=\frac32,\qquad \mathrm{Var}(K)=\frac9{20}.3. Perfect segregation means every AA occupies one block and every
BB the other (either orientation). Prove that this event has probability 1/101/10. Taking the mixed counting entropy S=kBln⁡20S=k_B\ln 20 relative to a single reference placement, proveΔSkB=ln⁡20.\frac{\Delta S}{k_B}=\ln 20.If the two species are identical, the 2020 colorings collapse to one occupancy, and the mixing increment is 00.

4. Audit both sentences: (i) “each of the four values of KK is
equally likely, or KK is binomial with parameters 33 and 1/21/2, so the variance is 3/43/4”; (ii) “identical species still contribute ΔS/kB=ln⁡20\Delta S/k_B=\ln 20, or this is an ensemble-equivalence / convex-entropy-intruder exercise.”

Do not replace the hypergeometric count by a supporting-line ensemble-equivalence argument, and do not treat AA and BB as thermodynamic phases.

Hint

Hint

The number of ways to put kk of the three AA's into the left block is (3k)(33−k)\binom{3}{k}\binom{3}{3-k}. Summing k=0k=0 to 33 recovers (63)=20\binom{6}{3}=20.

Check your work

Work the problem yourself first. Then open it in Training to check your answer and read the full worked solution.

Create a free account to check your answer and see the solution. Create a free account.

More Graduate Statistical Mechanics I practice problems