Order without repetition

The arrangements a crystal keeps at absolute zero

Ice has a residual entropy, and the number a calorimeter measures is the logarithm of a count of arrangements. Pauling's one-line estimate of that count is out by two and a half per cent; the exact count in two dimensions is available, falls towards its limit from above, and the whole disorder is invisible to a diffraction experiment, which sees only the average.

Assumes How many arrangements one rule allows and The symmetry of an average.

A structure determination reports one arrangement of atoms per cell. Ice cannot be reported that way, and the reason is not a failure of the experiment.

Each oxygen in ordinary ice has four hydrogen bonds. Exactly two of the four protons sit close to it — those are the covalent bonds of the water molecule it belongs to — and every bond carries exactly one proton, close to one end or the other. That is all. Nothing in it says which two, and the number of arrangements consistent with it is enormous.

And the number is measurable, which is what makes it a fact about ice rather than about arithmetic. Boltzmann’s entropy is the logarithm of a count of arrangements; a calorimeter measures entropy; so a count made on paper can be compared with a thermometer.

Six of sixteen. The six ways four bonds at one site can carry two protons close and two far — two arrows in and two out. Of the sixteen assignments of four arrows, these are the ones obeying the rule, and the count of six is what the model is named after. Everything counted in this essay follows from applying that rule at every site at once, which is much stronger than applying it at one.
Fig. 1 The rule, in full. Four bonds at a site, each with an arrow saying which end its proton sits at, and exactly two pointing in. Of the sixteen ways of assigning four arrows, six obey it — which is what the model is named after and is counted here rather than quoted.

Pauling’s line

Linus Pauling wrote the estimate down in 1935 and it takes three sentences.

Ignore the rule. Each of the 2N bonds has two positions for its proton, so there are 2²ᴺ = 4ᴺ arrangements. Now put the rule back one site at a time: of the sixteen ways the four bonds at an oxygen can be occupied, six obey it, so each site survives with probability 6/16. Treat the sites as independent and

W4N×(6/16)N=(3/2)N.W \approx 4^N \times (6/16)^N = (3/2)^N.

An entropy of R ln(3/2) = 3.37 joules per kelvin per mole. The measured residual entropy of ice, from Giauque and Stout’s calorimetry in 1936, is about 3.4. A count of arrangements agreeing with a thermometer to one per cent, from a calculation that fits in a paragraph.

The agreement hides an assumption doing a great deal of work, and it is exactly the assumption the exact count is able to test: the sites are not independent, since a bond is shared and each site constrains its neighbours.

The same rule where it can be counted exactly

In two dimensions the rule has a lattice of its own. Square ice puts an arrow on every edge of a square lattice and requires two in and two out at every vertex — the same combinatorial statement with four bonds per site — and on a torus the configurations can be counted exactly.

The count is done twice, by methods sharing nothing.

Brute force. Every edge of the torus is given an arrow and the rule is checked at every vertex. That is two to the power of twice the number of sites, so it stops at three by three, which is 262,144 assignments and 148 legal ones.

A transfer matrix. The state carried from one row to the next is the direction of each vertical edge crossing it, so there are 2^L states; the matrix entry is the number of ways to fill one row consistently with the arrows above and below; and the count on the torus is the trace of the L-th power, because the torus closes.

They agree at every size where both can run, and the second reaches a seven by seven torus: 4,484,823,396 configurations, exactly, on forty-nine sites.

Arrangements per site, falling towards the exact value. The number of configurations of an L × L torus obeying the ice rule, taken to the power of one over the number of sites. The largest computed here is 4,484,823,396 configurations on a 7 × 7 torus. The values fall towards Lieb's exact 1.54 from above, and every one of them is above Pauling's estimate of 1.5 — which undercounts, because it treats the vertices as independent and they are not.
Fig. 2 The count per site at each size, against the two reference numbers. Pauling’s estimate is 1.5 and the exact value for the infinite square lattice is (4/3)3/2=1.5396(4/3)^{3/2} = 1.5396, which is Lieb’s. The finite tori come down towards it from above and every one of them is above both — so no finite calculation here reaches either number, and the row of values matters more than any one of them.

What the exact answer says about the estimate

Two things, and the second is the one worth carrying away.

The independence assumption undercounts. Correlations between neighbouring vertices leave more arrangements than the estimate allows, not fewer, and the exact answer is 2.6 per cent above it. That is the direction that is not obvious: constraints usually cost, and here the accounting of them was double-counting.

A per-site growth read off a small box is an overestimate. Every finite torus in the ladder above sits above the limit, because a small torus has short loops in it that a large one does not, and the deficit falls slowly. Reporting the L = 3 value of 1.74 as an estimate of the limit would be out by thirteen per cent — worse than Pauling’s line, from a computation a thousand times larger.

Lieb’s exact value for two-dimensional square ice, (4/3)3/2(4/3)^{3/2}, came in 1967 from the Bethe ansatz, and it is one of the few models in this subject with a closed-form answer. Nothing in this collection derives it; it is quoted, and used as the destination the finite counts are measured against.

Arrangements per site, falling towards the exact value. The number of configurations of an L × L torus obeying the ice rule, taken to the power of one over the number of sites. The largest computed here is 143,224 configurations on a 5 × 5 torus. The values fall towards Lieb's exact 1.54 from above, and every one of them is above Pauling's estimate of 1.5 — which undercounts, because it treats the vertices as independent and they are not.
Fig. 3 The same ladder stopped at five, which is where the brute-force check can still be imagined. The exact counts are 4, 18, 148, 2970 and 143,224 — integers, computed two ways for the first three of them, and the sequence’s growth is what the whole essay is about.

Why the transfer matrix can be trusted

The two counting methods are worth comparing as methods, since only one of them survives past nine sites.

Brute force is transparent and hopeless: it visits every assignment of arrows and checks every vertex, so its cost is the number of assignments, and the number of assignments is exponential in twice the area. At L = 3 that is a quarter of a million; at L = 5 it would be a million million million.

The transfer matrix is opaque and cheap. Its cost is the number of states squared times the number of rows — exponential in the width rather than in the area — and the trace at the end is what closes the torus. Everything about the arrangement except the row currently being crossed is forgotten, which is legitimate precisely because the rule is local: what a row does next depends on the arrows crossing it and on nothing else.

The reason to run both is that the second is easy to get wrong in a way that produces a plausible number. An off-by-one in the wrap-around, a state indexed the wrong way up, or a boundary handled as a line rather than a circle each give a count that is too large or too small by a factor nobody would notice. Agreement with an enumeration that reads the rule directly is the only cheap check there is, and it is available exactly where the enumeration can still run.

80 tile sets, three answers. 80 sets of 12 tiles over 4 colours, each run through both searches: a periodic block up to 3 × 3, and a square up to 4 × 4 that cannot be tiled. 71 are decided and 9 are not. The third column is the subject: it is a statement about the bound and never about the tile sets, and no bound empties it.
Fig. 4 A neighbouring question for contrast: whether a set of local rules can be satisfied at all, over a sample of tile sets. Counting how many arrangements a rule permits presumes that it permits one, and the presumption is exactly what no procedure decides in general. The ice rule is comfortably on the decidable side — a legal arrangement is easy to write down — and the counting question is then the interesting one.

What a diffraction experiment sees

Here is where the disorder meets the rest of this collection, and the answer is uncomfortable.

A crystal with this many arrangements still diffracts to sharp spots. Sharpness comes from the lattice, and the lattice is untouched — the oxygens are on it, perfectly, in every arrangement. What the experiment measures is an average over some 10²⁰ cells, and the average of all the arrangements is half a proton at each of the two positions on every bond.

That average is a perfectly good periodic structure. It has a symmetry, and the symmetry is higher than any arrangement’s.

18 arrangements, one average. One legal arrangement of protons on the bonds of a 2 × 2 torus, taken from the enumeration rather than drawn, and beside it the average over every arrangement — half a proton at each of the two positions on every bond. Both point sets were handed to the detector this site uses everywhere: the arrangement has 16 operations and the average has 32, an index of 2. A diffraction experiment measures the second, and no amount of precision recovers the first.
Fig. 5 One legal arrangement of protons on the bonds of a small torus, taken from the enumeration rather than drawn, and beside it the average over every arrangement. Both point sets were handed to the detector this collection uses everywhere: the arrangement has sixteen operations and the average has thirty-two. The measurement sees the second and no amount of precision recovers the first.

A half-occupied site is a statement about a population, and it is worth being clear that it is not a statement about a proton. No proton is in two places, none is halfway along its bond, and nothing about any individual cell is fractional. What is fractional is the fraction of the crystal’s cells in which that position is taken, and the experiment measures a fraction of cells because the beam illuminates all of them at once. A structure report is a census, and a census of a disordered population returns a number no member of it has.

So the reported structure is a structure no cell has, and the fractional occupancies in it are not a fitting compromise but the correct answer to the question the experiment asks. This is the symmetry of an average in its purest form: there, several orientations of a molecule average to something more symmetric than any of them; here, an unlistable number of arrangements do.

The practical consequence is that the disorder has to be found somewhere other than in the Bragg peaks. It shows in diffuse scattering — intensity between the spots, which is where all the information about correlations goes — and the shape of that diffuse intensity — which is where what a measurement cannot separate is decided — is what distinguishes a structure obeying the ice rule from one whose protons are simply random.

p2 in one cell, p4 on average. On the left, a molecule in one orientation at a site whose symmetry is larger than its own: the arrangement has 2 operations and the detector says p2. On the right, the average over the 2 orientations the site offers, which is what a diffraction experiment measures because different cells choose differently and nothing prefers one choice. The average has 4 operations — it is p4 — and every atom in it is present in half of the cells. Both groups are detected from the point sets rather than assumed, and the difference between them is the reason a refined structure can have symmetry no molecule in the crystal has.
Fig. 6 The same arithmetic in the collection’s usual setting: an arrangement with symmetry H sitting at a site whose symmetry is S, and the superposition of all the orientations, which has S. The index between the two groups is the number of orientations being averaged. Ice is this picture with an index no small number describes.

What the count is not

Three limits, and the first is a boundary this collection keeps deliberately.

No thermodynamics is done here. Entropy appears only as the logarithm of a count of arrangements, with every arrangement weighted equally. No temperature is introduced, no free energy is written down, and nothing is derived about the transition ice does or does not make at low temperature. The calorimetric number is quoted as a measurement made by others.

Equal weighting is a choice. It is the right one for a rule — the rule prefers nothing — and it is not right for a material at a temperature, where arrangements differ slightly in energy and the differences are what the low-temperature behaviour of real ice is about.

And two dimensions is not three. Square ice is the ice rule on a lattice with four bonds per site and it is not ice. Pauling’s estimate has the same form in both, which is why it is a useful comparison; Lieb’s exact value is two-dimensional and has no three-dimensional counterpart in closed form. The best estimates for real ice come from series expansions and simulation, and they sit about 1.4 per cent above Pauling’s number — smaller than the two-dimensional correction, in the direction the two-dimensional calculation predicts.

Arrangements per site, and the limit they approach. The number of dimer arrangements of each rectangle, taken to the power of one over the number of sites — the growth per site, which is the quantity a count this large is really about. The line is the limit for the infinite square lattice, e^{G/π} = 1.34, where G is Catalan's constant. The largest region computed here reaches 1.29 and is short by 0.05: a limit is not something a finite computation arrives at, and the line is drawn as a destination rather than as a result.
Fig. 7 The dimer count’s own approach to its limit, for comparison: the same shape of problem with a different local rule, approaching its growth constant from below rather than from above. Which side a finite count approaches from is a property of the boundary conditions rather than of the rule, and it is a reason to compute several sizes rather than one.

The entropy per site, and what it means for a mole

The number 1.5 is small and the consequences are not, which is worth doing arithmetic on once.

A mole of ice has 6 × 10²³ oxygens, so the number of arrangements is (3/2) raised to that power — a number with about a hundred thousand million million million digits. Its logarithm times Boltzmann’s constant is 3.4 joules per kelvin per mole, which is a perfectly ordinary laboratory quantity, and that is the whole of why an unimaginable count is measurable: the logarithm is the observable, and the logarithm of an unimaginable number is small.

The same arithmetic says how much better a rule would have to be to matter. A rule permitting 1.0001 arrangements per site — which sounds like almost no freedom at all — still allows more arrangements of a mole than there are atoms in the observable universe, and it would show up in a calorimeter as 0.0008 joules per kelvin per mole, far below anything measurable. Between a rule that decides the structure and a rule a calorimeter can catch being undecided, there is an enormous range where a structure determination is reporting one arrangement out of many and nothing whatever says so.

One layer, and the two ways to sit on it. A close-packed layer — large pale discs, each touching six others, which is as tight as one layer of equal spheres can be. Its hollows come in two sets, marked in the two smaller colours, and a second layer must take one set or the other; the two choices are mirror images and equally good. The third layer then faces the same choice again, and this time the two answers are genuinely different: over the first layer, or over the hollows the second did not use. That single decision, repeated, is the whole of close packing — and nothing in the geometry prefers either answer, because both give the same density and the same number of touching neighbours.
Fig. 8 The other classical case of a structure with a choice at every step: close packing, where each layer may sit in either of two positions on the one below. The count there is two to the number of layers rather than something to the number of sites, so it is exponentially smaller — which is why stacking disorder is visible as streaks in a diffraction pattern and proton disorder in ice is not.

Where else the same count turns up

The six-vertex model is one of the small number of exactly solvable objects in two dimensions, and it is not confined to water.

Spin ice. In pyrochlore magnets, whose magnetic symmetry is a group with time reversal in it, such as holmium titanate, the magnetic moments sit on a lattice of corner-sharing tetrahedra and obey a two-in-two-out rule of exactly the same form. Their residual entropy has been measured and comes out near Pauling’s value — a magnetic system reproducing a number computed for a hydrogen-bond network, because the combinatorics is the same and the physics is not.

Alternating sign matrices. As with the Aztec diamond’s power of two, the configurations of square ice with particular boundary conditions are in bijection with a class of matrices whose count is a product formula proved in the 1990s, which is the same kind of coincidence as the Aztec diamond’s power of two and turned out to be the same subject.

And ferroelectrics. Slater’s model of potassium dihydrogen phosphate is the six-vertex model with energies attached to the six vertices, which is where the model came from historically — the counting problem is the zero-energy case of an interacting one.

18 arrangements, one average. One legal arrangement of protons on the bonds of a 2 × 2 torus, taken from the enumeration rather than drawn, and beside it the average over every arrangement — half a proton at each of the two positions on every bond. Both point sets were handed to the detector this site uses everywhere: the arrangement has 8 operations and the average has 32, an index of 4. A diffraction experiment measures the second, and no amount of precision recovers the first.
Fig. 9 A different legal arrangement of the same small torus, and the same average. The two arrangements have no relation to one another; the average does not depend on which is chosen; and the eighteen arrangements of this torus are what an eighteen-fold ambiguity looks like when it is small enough to draw.

The rule as a covering, which is the previous rung

The ice rule and the dimer rule are the same shape of statement with a different number in it. A dimer covering says one of the bonds at each site is occupied; the ice rule says two of the four are. Both are conditions on a site’s neighbourhood and nothing else, both leave exponentially many arrangements, and both are counted by carrying a boundary from one row to the next.

What differs is the number the growth comes to, and the difference is instructive: 1.3385 per site for dimers on the square lattice, 1.5396 for square ice. The looser rule permits more, as it must — but the two are the same order of magnitude, and neither is anywhere near the 2 that free choice at every site would give. A local rule with any content at all costs most of the freedom and leaves an exponential amount of it, which is the shape of every disorder problem in this subject.

4 × 4: one of 36 arrangements. A 4 by 4 array of sites, each covered exactly once by an object occupying two neighbouring sites — a dimer. One arrangement is drawn, and it was built by making choices that leave the rest of the region still coverable, which is the enumeration run once rather than a picture drawn by hand. There are 36 arrangements in all, counted exactly.
Fig. 10 A dimer covering of a small region, from the neighbouring rung. One bond per site rather than two of four, and the same kind of count: exact, exponential, and computed by walking the region once with a boundary in hand. The two rules produce growth constants within fifteen per cent of one another and describe entirely different materials.

The two rules also differ in how many independent routes their counts have, and that is a fact about the mathematics rather than about the materials. The dimer count on a rectangle has three: an enumeration, Kasteleyn’s determinant, and the product of cosines that diagonalises it. The ice count on a torus has two — an enumeration and a transfer matrix — because no product formula of that kind exists for the six-vertex model on a torus, and Lieb’s closed form is a statement about the infinite lattice rather than a formula for a finite one. Where a third route exists it is worth having; where it does not, the two that remain have to be independent enough to be worth running both, which is why the brute-force check here reads the rule directly at every vertex rather than sharing any machinery with the matrix.

Who counted it

Bernal and Fowler wrote the rules down in 1933, from the geometry of the water molecule and the shape of the hydrogen bond. Pauling turned them into a count in 1935 and compared it with Giauque and Stout’s calorimetry, which had been published as an anomaly nobody could explain. Lieb solved the two-dimensional case exactly in 1967, and Nagle produced the accurate three-dimensional series estimates in 1966.

The order is worth noticing. The measurement came first and was a puzzle; the count explained it; and the exact solution arrived thirty years later and moved the number by two and a half per cent. A one-line estimate that survives a thirty-year correction of that size is a good estimate, and knowing exactly how good it is takes the harder computation.

It is also a case where the estimate’s error and the experiment’s error were the same size, which made the agreement look better than it was. Pauling’s 3.37 against a calorimetric 3.4 is a match to one per cent, and the exact two-dimensional correction is two and a half per cent — larger than the apparent discrepancy. So the 1935 agreement was partly luck: had the calorimetry been ten times more precise, it would have shown the estimate to be low, and the correction would have been demanded three decades before the mathematics could supply it. That is a common shape and worth recognising rather than admiring. An agreement is evidence in proportion to how precisely both sides are known, and quoting a match without quoting the two uncertainties is a claim with the interesting part removed.

What a residual entropy is not a violation of

A count of arrangements surviving at absolute zero sounds like a contradiction of a law, and the resolution is worth stating because it says what the measured number is a measurement of.

The third law says that the entropy of a system in internal equilibrium tends to zero as the temperature does. Ice is not in internal equilibrium at low temperature: rearranging the protons means breaking and reforming hydrogen bonds, the rate at which that happens falls off exponentially as the crystal cools, and by a few tens of kelvin it has effectively stopped. The crystal is frozen into whichever arrangement it happened to have.

So the residual entropy is a measurement of a freezing, not of a ground state. What a calorimeter reports is the entropy the crystal failed to shed, and the count on this page is the count of arrangements it was choosing among when the choosing stopped.

There is a genuine ordered arrangement underneath. Ordinary ice has a low-temperature ordered phase in which the protons take one particular arrangement and the entropy really is zero, and it is reachable — the transformation is catalysed by a dopant that lets the protons move at temperatures where they otherwise could not. The ordered phase exists, the third law holds, and the residual entropy is the cost of not getting there.

That is a useful distinction to carry into every other disordered structure. A measured residual entropy says a system fell out of equilibrium and how many arrangements it fell among; it says nothing about whether an ordered arrangement exists, and finding one is a separate experiment.

Where the disorder does show

The essay says the disorder has to be found somewhere other than in the Bragg peaks, and the somewhere has a shape that is itself a consequence of the rule.

The scattering from a disordered crystal is the sharp part — the Bragg peaks of the average structure — plus a diffuse part carrying everything the average threw away. The diffuse part is the transform of the correlations: how the arrangement at one site is related to the arrangement at another.

For a rule of this kind the correlations have an unusually distinctive form. The ice rule is a conservation law — two in and two out at every site is a statement that something has no source anywhere — and a conserved quantity with no source has correlations that fall off as a power of distance rather than exponentially, with a shape borrowed from electrostatics.

In reciprocal space that produces sharp features at particular points where the diffuse intensity is not smooth: it approaches different values from different directions, giving a bow-tie or pinch shape that no ordinary short-range correlation produces. Those features are the direct signature of the rule, they have been measured in spin ice by neutron scattering, and they are what distinguishes an arrangement obeying a local constraint from one that is merely random.

So the count and the correlations are two different things the same rule produces, and only the second is visible in an experiment. A count says how much freedom the rule leaves; the diffuse pattern says what the rule is.

Where the ladder goes next

The count is the simplest measure of a disordered structure and the least informative. What it does not say is anything about correlations — which arrangements are near which, how the disorder is spatially organised, and what the diffuse scattering actually looks like. Those are the questions the next rungs of this anchor are for, and they are measurements rather than counts.

The other direction runs back through this collection’s own ground. What diffraction cannot tell apart is the general form of the difficulty here: an experiment measuring an average cannot distinguish arrangements that share one, and no improvement in the instrument changes that. Ice is the case where the number of arrangements sharing the average is not two or three but a number with 10²⁰ digits.

What this makes readable

Essays that name this one as a prerequisite.

Named alongside this one

Essays reaching for the same objects. Nobody chose these; they are what the concept index makes visible.

What links here

The 8 essays that link to this one and share the most of its objects, of 9 that link here.

The objects this essay names

Each one links to every other essay that touches it.

Configurational entropyCountingDisorderEntropyLocal rulesLong-range orderMeasurementResidual entropy