Crystallography & Symmetry
patterns derived from their groups
Concept

Defect — where it appears

A local departure from a structure's own repeating rule, which cannot be removed by any deformation of the surrounding material. What makes one a crystallographic object rather than a blemish is that a circuit round it fails to close by an amount the lattice quantises.

Named by 5 essays across 3 fields — each of them below, with the objects they name alongside it.

A circuit that closes on the wrong point: (1, 0). A square lattice with one extra half-column, drawn as a graph: the rows above the core have one more site than the rows below, and the core is the site at the end of the extra column. The path is 4 steps east, 4 north, 4 west and 4 south — the same number out as back — and it ends one lattice vector from where it started. Every one of the 12 circuits in the survey that goes round the core fails by that vector, and all 10 that miss it close exactly.

The circuit that does not close

A defect in a crystal is usually introduced as a picture — an extra half-row of atoms, a wedge taken out. What makes a defect a crystallographic object rather than a drawing is a closure failure: walk a closed circuit through the lattice and come back to the wrong point, by an amount the lattice itself decides.

applied · Defects The sphere fixes a count; the torus fixes only a difference. Euler's relation for a trivalent net gives Σ (6 − n) pₙ = 6χ, so the surface fixes one linear combination of the face counts and nothing else. On a sphere that combination is twelve, which with no face smaller than a pentagon forces exactly twelve pentagons. On a torus it is zero, which permits any number of pentagons provided as many heptagons pay for them — and permits none at all, which is the plain hexagonal net. On a surface of two holes it is minus twelve, so heptagons become compulsory instead.

As many heptagons as pentagons

A trivalent net on a sphere must have exactly twelve pentagons. The same three lines of arithmetic on a torus give zero — which does not forbid pentagons, it makes them pay: every pentagon has to be balanced by a heptagon, and the counts are otherwise free. One rotated bond in a wrapped honeycomb makes two of each and changes nothing else.

restriction · Curvature The kinds of line defect each breaking allows. The eleven proper crystal classes, each with the order of the binary group that covers it, the number of conjugacy classes of that group other than the identity — which is the number of kinds of line defect — and whether the group commutes. 6 of the eleven do not, and in those media two defect lines cannot pass through each other without leaving a third line behind.

The defect that needs two laps

Which defects a medium can have is not a fact about the medium. It is a fact about the space its order parameter lives in, and for a rotational symmetry broken down to a point group that space has a fundamental group twice the size of the point group. The kinds of line defect are its conjugacy classes — and in six of the eleven cases they do not commute, which means two defect lines cannot pass through each other.

applied · Defects Seven fields and the number that counts each one. The degree of each field, computed by triangulating the sphere drawn round the defect, mapping every vertex, and adding the signed areas of the image triangles. The total is 4π times the degree, and the integral column is that total divided by 4π before rounding. Each is read on three successively finer meshes and required to give the same integer on all three, because a mesh too coarse for its field does not produce a noisy answer — it produces a confident wrong one.

The point defect whose charge has no sign

A line defect is read on a loop; a point defect is read on a sphere, and the number that comes off the sphere is a degree. In a nematic that degree is an integer whose sign depends on a choice nobody can make — and the media where no such number exists at all are exactly the ones whose residual symmetry is a crystal class.

applied · Defects Every arrangement on a torus 4 across, sorted by defects. The transfer matrix that counts ice arrangements chooses, at each vertex, the one horizontal arrow the rule permits. Enumerating both choices instead and carrying a polynomial that records how many vertices end up with three arrows in or three out gives the number of arrangements at every defect count at once. The first column, drawn solid, is the ice count — 2970 arrangements with no defect at all, which is the number the earlier transfer matrix gives and is checked against it. The second column is empty: no arrangement has exactly one defective vertex, because a defect carries a charge and the charges on a closed surface must cancel. The columns together add to two raised to the number of edges, which is every assignment of arrows whatever.

What a defect costs the count

Each broken vertex relaxes the rule and so adds arrangements — the question left standing was whether each adds a fixed amount or the cloud around it costs some back. The exact count at every defect number at once answers both halves: almost all of the rise is the freedom to choose which vertices break, and with that removed the first defects subtract rather than add.

aperiodic · Entropy

Named alongside it

The objects these essays reach for when they reach for this one.

DisclinationHomotopyLocal symmetryOrder parameterBurgers vectorCensusClosureConjugacy classCoordination numberCountingCrystal netCrystallographic restriction

All concepts