Generator

Where fourteen comes from

Where fourteen comes from
Where fourteen comes from. 25 centred cells asked the same question: does the lattice still have the symmetry of the system it was built in? The bar is the order of the lattice's automorphism group against 48, the largest any lattice has. 3 lose symmetry outright, 8 describe a lattice already on the list, and 14 are kept, which is where the fourteen comes from — 3 lost, 8 duplicates, 14 lattices out of 25 candidates.

25 centred cells asked the same question: does the lattice still have the symmetry of the system it was built in? The bar is the order of the lattice's automorphism group against 48, the largest any lattice has. 3 lose symmetry outright, 8 describe a lattice already on the list, and 14 are kept, which is where the fourteen comes from — 3 lost, 8 duplicates, 14 lattices out of 25 candidates.

5 essays call bravais-count. The drawing above is what it returns with no arguments at all; every call below passes it something, because a placement that passes nothing draws whichever member of the family the generator happens to default to rather than the one its essay argues about. Every one of this site's 393 essays names its parameters at the call site, which the standard pass of 2026-08-09 established and param-floor holds.

Where it is called

Changing this generator changes every one of these figures.

The fourteen Bravais lattices. All fourteen lattices: triclinic P, with 2 symmetries; monoclinic P, with 4 symmetries; monoclinic C, with 4 symmetries; orthorhombic P, with 8 symmetries; orthorhombic C, with 8 symmetries; orthorhombic I, with 8 symmetries; orthorhombic F, with 8 symmetries; tetragonal P, with 16 symmetries; tetragonal I, with 16 symmetries; rhombohedral P, with 12 symmetries; hexagonal P, with 24 symmetries; cubic P, with 48 symmetries; cubic I, with 48 symmetries; cubic F, with 48 symmetries. The corner points are the conventional cell; the points in the second colour are the centring translations, drawn at every position inside the cell rather than one per face. The cell shapes are the picture's, chosen so no two systems look alike; only the angles a system is defined by mean anything. Lattices

Twenty-five cells, and fourteen lattices

The usual picture of the fourteen Bravais lattices is a plate of fourteen boxes, which is the answer with the argument removed. The argument is one question asked of twenty-five candidates, and the question has a computable answer.

Six integers that do not depend on the description. The same monoclinic lattice written in 4 different bases, each obtained from the last by an integer matrix of determinant one, and each reduced by Niggli's algorithm. Every one of them gives the same six integers — the squared lengths and twice the dot products of the reduced basis. That is what makes the reduced form a fingerprint of the lattice: two cells with no number in common are the same lattice exactly when their reduced forms agree, and the comparison has no tolerance in it. Lattices

The cell that settles the argument

Two determinations of one compound can report cells that share no number and describe the same lattice. Reduction is the procedure that decides — six integers that depend on the lattice and not on anybody's choice of axes, and that agree exactly when the lattices do.

Thirty-two classes, from fourteen Gram matrices. The five hundred and ten subgroups sorted by how many operations of each kind they contain — a determinant and a trace decide which of the ten kinds a matrix is. Thirty-two answers come out, and they are the thirty-two crystal classes: matched against the construction elsewhere in this collection by signature rather than by name, since nothing here names a point group. What symmetry decides

Thirty-two from fourteen matrices

Write the fourteen Bravais lattices as Gram matrices, ask each one which integer matrices preserve it, and take every subgroup of every answer: five hundred and ten of them. Sort those by how many operations of each kind they contain — which a determinant and a trace decide — and thirty-two answers come out. They are the crystal classes, from a construction in which no point group is ever named.

Twenty-two halvings the fourteen lattices permit. Every lattice has exactly seven subgroups of index two, whatever its shape. The third column is how many of the seven the lattice's own group carries onto themselves, and the fourth is how many of those survive as distinct types once a change of basis within the type is allowed to identify them. The running total ends at twenty-two, which with the fourteen grey lattices is the thirty-six magnetic Bravais lattices — and the row that ends at zero is the face-centred cubic lattice. Lattices

The halving a lattice will not permit

Admit time reversal and a lattice splits into points that leave the moments alone and points that reverse them. The second set is a coset of a subgroup of index two, and every lattice has exactly seven of those, whatever its shape. What differs is how many of the seven the lattice's own symmetry survives — and the face-centred cubic lattice survives none of them.

Seventy-three arithmetic classes, from fourteen groups. Every subgroup of every lattice's own group, split by whether the subgroup's own Bravais group is that lattice's. The ones that are not belong to a lower lattice and are counted there, which is what stops the same class being counted twice. The running total ends at seventy-three, and no conjugacy in GL(3, ℤ) was ever decided. What symmetry decides

Seventy-three, without a search

The unit a space group is built from is a point group together with the lattice it acts on, and there are seventy-three of them. Getting there looks like it needs conjugacy in GL(3,ℤ), which is a search this collection tried and abandoned. It does not: every finite group of integer matrices carries a canonical larger group that says which lattice it belongs to, and once that is computed the search has nothing left to do.

The whole library · All essays