Math Detours · Grade 10 · Connections · 11

Why the air does not gather in one corner

All the air in a room could rush into one corner, but it never does. With 10 coins, all heads comes up 1 time in 1024. With 100 coins, a billion tries a second since the universe began would almost certainly not be enough.

Name ____________________Date ____________

Tonight's idea

No law of physics stops every air molecule in your room from wandering into the left half at once. So why are you not gasping?

Try a small model. Each molecule is in the left half or the right half, like a coin showing heads or tails, each equally likely, whatever the others do. (An idealisation: real molecules collide. And a corner is smaller than a half, so it is rarer still.) With 10 coins there are \(2^{10} = 1024\) equally likely arrangements. Exactly 1 is all heads. But 252 have 5 heads. Nothing pushes the coins towards an even split. There are just more ways to be there.

In a big random system, what you see is what can happen in the most ways.

The Ehrenfest urn shows a system getting there. Put tokens numbered 0 to 9 in box A and leave box B empty. Each turn, pick a random digit 0 to 9 and move that token to the other box. The rule treats both boxes alike, yet box A drains towards 5 tokens and then hovers there.

Watch one: counting the ways for 10 coins

1 0 10 1 45 2 120 3 210 4 252 5 210 6 120 7 45 8 10 9 1 10 number of heads
Ways for 10 coins to show each number of heads: \(1 + 10 + 45 + \dots + 1 = 1024\).

How many of the 1024 arrangements have exactly 2 heads? Choose which coins are the heads: 10 choices for one, 9 for the other, and each pair has been counted twice, so \(\frac{10 \times 9}{2} = 45\). For 5 heads, choose 5 coins in order, \(10 \times 9 \times 8 \times 7 \times 6 = 30{,}240\) ways, then divide by the \(5 \times 4 \times 3 \times 2 \times 1 = 120\) orders in which the same five could be picked: \(30{,}240 \div 120 = 252\).

The figure shows every count. Swapping heads and tails turns \(k\) heads into \(10 - k\), so the chart is symmetric, and the bars add to 1024. The chance of exactly 5 heads is \(\frac{252}{1024} \approx 0.246\), and of all heads \(\frac{1}{1024}\). Even the most likely count comes up less than a quarter of the time. It is the whole middle of the chart that dominates, not one bar.

Your turn

  1. Use the chart for 10 fair coins. (a) What is the chance of 4, 5 or 6 heads? (b) What is the chance of a lopsided result: 0, 1, 9 or 10 heads?
  2. Run the urn. Tokens 0 to 9 all start in box A. Here are 20 digits from a computer's random number generator: 6, 3, 5, 4, 5, 9, 1, 7, 7, 9, 1, 7, 1, 6, 4, 2, 9, 5, 8, 1. For each digit, move that token to the other box, and write down how many tokens are in box A after each turn. Which tokens end in box A? Did the count ever get back to 10?
  3. The urn has 8 tokens in box A and 2 in box B. (a) What is the chance that the next turn takes a token out of A? Puts one into A? (b) With \(k\) tokens in A, what is the chance that the count goes down? (c) For which \(k\) are up and down equally likely? Does the count stay still there?
  4. For 100 coins a computer adds up the counts: 40 to 60 heads covers about 0.965 of all \(2^{100}\) arrangements. (a) What is the chance of landing outside 40 to 60? (b) Compare with your answer to 1(a), which is the same band (40% to 60% heads) for 10 coins. What do you expect for 1000 coins and 400 to 600 heads? (c) Use \(2^{10} = 1024 \approx 10^3\) to estimate \(2^{100}\) as a power of 10. What is the chance that 100 coins all land heads?

Stretch: how long until it all comes back?

A known fact about the 10-token urn (a case of Kac's lemma), on trust tonight: over a very long run, the fraction of turns with \(k\) tokens in box A is \(\frac{\text{ways}}{1024}\), read off the chart, and the average number of turns between one visit to \(k\) and the next is \(\frac{1024}{\text{ways}}\). (a) Starting with all 10 in A, how many turns on average until all 10 are in A again? How many between visits to 5? (b) With 100 tokens the same rule gives \(2^{100}\) turns to refill A. At a billion turns a second, about how many seconds is that? The universe is about \(4 \times 10^{17}\) seconds old. (c) Every single move can be undone by the very next move. So why does the urn look as if it only runs one way?

Answers

  1. (a) \(210 + 252 + 210 = 672\) ways, so \(\frac{672}{1024} = \frac{21}{32} \approx 0.66\). (b) \(1 + 10 + 10 + 1 = 22\) ways, so \(\frac{22}{1024} \approx 0.021\), about 1 time in 47. Near-even results are about 30 times as likely as these lopsided ones, with no force pulling towards the middle.
  2. The count in box A after each turn: 9, 8, 7, 6, 7, 6, 5, 4, 5, 6, 7, 6, 5, 6, 7, 6, 5, 4, 3, 4. (A digit that repeats, like the second 5, sends its token back.) Tokens 0, 1, 4 and 6 end in A. The count fell quickly from 10, then wandered between 3 and 7 and never came close to 10 again. Another list of digits gives a different path, but nearly always the same story.
  3. (a) Each token is equally likely to be picked and 8 of the 10 are in A, so out of A has chance \(\frac{8}{10}\) and into A has chance \(\frac{2}{10}\). (b) \(\frac{k}{10}\): the fuller box is the more likely one to lose a token. Nothing aims at 5. (c) \(k = 5\), where both chances are \(\frac{5}{10}\). The count does not stay still: every turn moves one token, so from 5 it goes to 4 or 6, and from there it is more likely to step back towards 5 than away.
  4. (a) \(1 - 0.965 = 0.035\), about 1 time in 28. (b) The same band holds about 0.66 for 10 coins and 0.965 for 100, so it tightens as the number grows. For 1000 coins the chance of landing outside 400 to 600 is about 2 in 10 billion: the band holds essentially everything. (c) \(2^{100} = (2^{10})^{10} \approx (10^3)^{10} = 10^{30}\) (more exactly \(1.27 \times 10^{30}\)), so the chance is about 1 in \(10^{30}\). A real room holds far more than 100 molecules, more like \(10^{27}\).

Stretch. (a) All in A is 1 way, so \(\frac{1024}{1} = 1024\) turns on average. Level 5 has 252 ways: \(\frac{1024}{252} \approx 4.1\) turns. The urn is back at 5 almost at once and back at 10 very rarely, because it spends only \(\frac{1}{1024}\) of its turns there. (b) About \(10^{30} \div 10^9 = 10^{21}\) seconds, a few thousand times the age of the universe, and that is for only 100 molecules. "Never" is not quite true; "not in any time that matters" is. (c) Each move is reversible, but from a lopsided state far more of the possible moves lead towards the middle than away (8 against 2 in exercise 3). The one-way look comes from counting, not from the rule. Spreading and mixing look one-way for the same reason.

← PreviousNext: The average of 350 degrees and 10 degrees →