Intuition The one core ideaWhen you can't track every particle, you instead count how many microscopic arrangements look the same from outside — and the arrangement with the most ways to happen is what you almost always measure. Everything below is just the vocabulary and the pictures you need before that sentence makes full sense.
This page assumes nothing . Every letter, every symbol, every piece of notation the parent note leans on is built here from the ground up, in an order where each idea rests on the one before it.
Before any physics, we need one fact about counting.
Intuition Choices multiplyIf you make one choice with a independent choice with b a × b a + b 2 × 2 = 4
Definition The multiplication (product) ruleIf a process is a sequence of independent stages with n 1 , n 2 , … product n 1 × n 2 × ⋯
Picture: a branching tree — each level multiplies the number of leaves.Why the topic needs it: the parent's Ω total = 2 N N 2 × 2 × ⋯
Intuition How many ways to line things up?Line up N N N − 1 N − 2 1
N ! = N × ( N − 1 ) × ( N − 2 ) × ⋯ × 2 × 1 N orderings (arrangements in a row) of N
Special case you must know: 0 ! = 1 one way to arrange nothing — do nothing).Picture: filling N Why the topic needs it: ( n N )
Worked example Small factorials1 ! = 1 , 2 ! = 2 , 3 ! = 6 , 4 ! = 24 4 ! = 4 × 3 ! = 4 × 6 = 24
This is the workhorse of the whole topic, so we build it slowly.
n pick a group of n N , where the order inside the group does not matter (a committee of 3 is the same committee no matter who you name first). Start from all N !
WHAT we do: take N ! WHY it overcounts: we only care which n n n ! N − n ( N − n )! same choice. So we divide those away:
( 2 4 ) ( 2 4 ) = 2 ! 2 ! 4 ! = 2 × 2 24 = 6 Every case is covered: ( 0 4 ) = 1 ( 1 4 ) = 4 ( 2 4 ) = 6 ( 3 4 ) = 4 ( 4 4 ) = 1
Common mistake Forgetting the order does NOT matterWhy it feels right: it looks like you should keep all N ! The fix: for a macrostate "how many are up", the labels among the ups are invisible — so divide by n ! ( N − n )!
Definition Sigma notation∑ n = 0 N f ( n ) = f ( 0 ) + f ( 1 ) + f ( 2 ) + ⋯ + f ( N ) Σ n = 0 starts ; the number on top (N stops ; f ( n )
Picture: a machine that walks n f ( n ) Why the topic needs it: the sanity check n = 0 ∑ N ( n N ) = 2 N
2 N 2 N 2 N doubles . That doubling-per-particle is why Ω N ∼ 1 0 23
Intuition Equal-weight countingIf every microstate is equally likely (the fundamental postulate ), then the chance of a macrostate is just its share of the total: how many microstates it owns, divided by all microstates.
Intuition Why the peak gets sharper with more particlesAs N P ( n ) keeps its centre at N /2 but its width grows only like N relative width, width/ ∼ N / N = 1/ N always found at its most-probable macrostate — the very meaning of equilibrium. (Details live in Binomial and Gaussian distributions .)
These are the "few numbers a lab instrument reads" — the ingredients of a macrostate .
Definition The bulk variables
N number of particles (a count; picture: how many molecules in the box).V volume (space the system occupies; picture: the size of the box in litres).E total energy (all kinetic + potential energy added up; picture: a fixed budget shared among particles).T temperature (how hot; picture: a thermometer reading — deeply, it is how entropy responds to added energy ).P pressure (force per area on the walls; picture: a gauge needle).Why the topic needs them: a macrostate is named by a small handful of these, e.g. Ω ( E , V , N )
For a classical system, one microstate is a single point listing every position q p ( q 1 , p 1 , … , q 3 N , p 3 N ) phase space — 6 N N
Picture: a dot drifting through an enormous multi-dimensional room; the room's regions are studied by Phase space and Liouville's theorem .Why the topic needs it: it makes "a complete microscopic specification" a precise geometric object you can measure the size of.
Binomial coefficient N choose n
Equilibrium is the most probable macrostate
Test yourself — cover the right side and answer out loud.
What does the multiplication rule say? Independent choices multiply: n 1 × n 2 × ⋯
What is N ! N × ( N − 1 ) × ⋯ × 1 N
What is 0 ! 1
Write ( n N ) n ! ( N − n )! N !
Why do we divide by n ! ( N − n )! To cancel orderings inside the chosen and unchosen groups, since order does not matter for a macrostate.
Compute ( 2 4 ) 6
What does ∑ n = 0 N f ( n ) Add f ( 0 ) + f ( 1 ) + ⋯ + f ( N )
Why is the total number of microstates 2 N Each of N
What is ∑ n = 0 N ( n N ) 2 N
How do you turn a count into a probability here? P ( n ) = Ω ( n ) / Ω total
Which symbols name a macrostate? A few bulk variables like E , V , N T , P , N
What is a phase-space point? One microstate: all positions and momenta ( q 1 , p 1 , … , q 3 N , p 3 N )
What is Ω The number of microstates consistent with a macrostate — the central object of the topic.
