Mathematics, in the end, is a product of human thinking independent of experience — so how does it come to match the objects of the real world so fittingly? ——Albert Einstein, Geometry and Experience (Geometry and Experience, 1921)
A word from the author
While making this series I also finished reading this book. For me, the biggest difference between reading in the AI era and before is that the answers to most of the questions in a book can be found with AI; if our curiosity is strong enough, we can get more out of a book than before. For example, most of the mathematical and physical derivations in this series actually came out of my process of asking AI one question after another. AI does not read a whole book in our place; it helps us discover more of what we want to know from a book, so “what we want to know” is what matters.
🎬 The companion video for this episode is out (YouTube)
Prologue · A question bigger than Galois’s
In the summer of 1870, the Franco-Prussian War had just begun. A Norwegian was hiking alone across the French countryside, heading for Italy. When he reached Fontainebleau, he was arrested as a German spy — the mathematical manuscripts full of symbols in his rucksack were taken by the gendarmes for encrypted military telegrams. He was held in prison for about a month, until a French mathematician came with a letter from the Ministry of the Interior and got him out.
This man taken for a spy was called Sophus Lie. And the “codes” in his manuscripts were a branch of mathematics that afterwards quietly rewrote the whole of physics.

Figure 1 Sophus Lie (1842–1899) — the man who was taken for a spy. Public domain.
In EP2 and EP3, Galois (Évariste Galois) used groups to unlock discrete symmetry — the ways a finite number of roots can be arranged and permuted. But more of the symmetries in this world are continuous: turning a circle, turning a sphere, you can turn by any tiny amount, with no gaps in between. Lie asked a question bigger than Galois’s: does continuous symmetry also have the whole apparatus that Galois had?
This episode follows this question in four steps: first, Lie the man and the question he set out to chase (history); next, continuous symmetry’s own “periodic table” (mathematics); then how it built the periodic table of the elements of our universe (physics); and finally how to walk back from infinite continuous symmetry to the finite atoms of symmetry, and at the end to ask: have these atoms really all been found?
Contents
- §1 · The history line: the man who wanted to make a Galois theory for differential equations
- §2 · The mathematics line: the “periodic table” of continuous symmetry
- §3 · The physics line: where do those electron numbers in the periodic table actually come from
- §4 · Back to the question on the mathematics line: how do we get back to the “finite”?
- Epilogue · Have they all been found?
- Appendix 1 · Foundations of representation theory: complete reducibility, characters, Schur orthogonality
- Appendix 2 · The irreducible representations of : spherical harmonics and (odd dimensions)
- Appendix 3 · Deriving the electron’s spin ½ from the Dirac equation
- Appendix 4 · From spin ½ to fermions and Pauli exclusion
- Appendix 5 · Burnside’s theorem: the order of a non-abelian simple group contains at least 3 primes
- Sources
§1 · The history line: the man who wanted to make a Galois theory for differential equations
In 1842, Sophus Lie was born in Nordfjordeide on the west coast of Norway; his father was a Lutheran pastor. From childhood he was a fine athlete — especially good at gymnastics, and also a pioneer of early hiking in Norway: on ordinary days he thought nothing of walking thirty or forty kilometers, on good days he could walk seventy or eighty, and legend has it that once, to fetch a book he had left behind, he walked a round trip of more than a hundred kilometers.

Figure 2 Lie’s homeland, the west coast of Norway. J. C. Dahl, “Winter at the Sognefjord”, 1827. Public domain.
But his life did not start smoothly. When he graduated from university in 1865, he had shown neither exceptional talent for what he had studied nor any great liking for it, and for several years after graduating he did not know what to do. According to his authoritative biographer Stubhaug, in those years he at one point sank into a low close to suicide — at the beginning of 1866 he wrote to a good friend that he had meant to end his life, but had not had the strength to do it. The turning point came around 1867–68: he read the geometry of Plücker and Poncelet, and borrowed from Sylow the lecture notes on Galois theory from years before, and only then did he really set out on the road of mathematics.

Figure 3 Évariste Galois (1811–1832), portrait at age 15. Lie borrowed the lecture notes on his theory, and from then on resolved to make a Galois theory for differential equations as well. Public domain.
His ambition, from the very beginning, continued Galois. Galois used groups to unlock algebraic equations (permutations of a finite number of roots); what Lie wanted to do was make a Galois theory for differential equations as well — in his biography, Freudenthal’s words are: “Lie dreamed of a Galois theory of differential equations but did not really succeed”. The difficulty is this: an algebraic equation has only finitely many solutions, whereas a differential equation (for example one describing a vibrating string) has infinitely many solutions, varying continuously with the initial conditions. Lie wanted to look at all the solutions together, and then see how one solution changes continuously into another — and this led him to “continuous transformation groups”: groups in which one operation can be deformed continuously, little by little, into another. Such groups are infinitely large (a continuous change has to pass through infinitely many intermediate states), and yet they later became exactly the key to finding all the finite atoms of symmetry. This is the line that runs from EP2 and EP3 into this episode: the Galois of the discrete world was carried by Lie into the continuous world.

Figure 4 The preface of Lie’s “Theory of Transformation Groups”, 1893 — here he publicly continues Galois, and also draws a line between himself and Klein. Public domain.
After the spy affair of the prologue, he returned to Norway and soon finished his doctoral dissertation, and the Norwegian parliament created a chair especially for him. He carried on in Galois’s direction, and he also lived long enough — he could promote his own methods in person and train students, which is where he differed from Galois, who died young. He used multidimensional geometry to treat differential equations (treating the parameters of the equations as coordinates — the apparatus of coordinate geometry was founded by Descartes in the first half of the 17th century, in 1637). In 1886 he left Norway to succeed Klein in teaching at Leipzig; in 1898 he returned to Norway (Christiania, today’s Oslo, to a chair newly created especially for him), and in February 1899 he died of illness there.
The mathematics he founded has grown only more important since. The editors’ introduction to Lie’s Collected Works calls his theory “a work of art”, “a production in every way comparable with that […] of a Beethoven”; in 1974 the mathematician Dieudonné wrote that “the most unexpected theories, from arithmetic to quantum physics, all circle around this field, as around a giant axis.”
Those who took up the baton: spreading this theory out, completing it, and bringing it back to the finite
- Felix Klein(Felix Klein, 1849–1925): Lie’s close friend and collaborator. The two met in Berlin in 1869 and in the spring of 1870 worked on transformation groups together in Paris — this was exactly the seed of Klein’s 1872 “Erlangen program” (defining a geometry by a transformation group). But in 1892–93 the two fell out over the authorship/credit of the Erlangen program, and Lie, in the preface to his 1893 Theory of Transformation Groups, publicly drew a line between himself and Klein.
- Wilhelm Killing(Wilhelm Killing, 1847–1923): a Gymnasium teacher by profession, he independently achieved the classification of the complex simple Lie algebras and discovered those few exceptional algebras (that is, the later Killing–Cartan classification; the “Killing form” is also named after him). The two were contemporaries only five years apart, each arriving at this theory independently; they first had contact through Klein only in 1884, and met only once, in 1886 (they did not get on); they were rivals, not master and disciple.
- Élie Cartan(Élie Cartan, 1869–1951): his doctoral dissertation of 1894 made Killing’s classification rigorous and actually constructed those few exceptional simple Lie algebras — hence the name “Killing–Cartan classification”. He was not a colleague of Lie himself (dissertation 1894, Lie died 1899); he was the direct heir who completed this structure theory.
- Leonard Dickson(Leonard Dickson, 1874–1954): an American, who carried the construction of continuous Lie groups unchanged onto finite fields and built finite simple groups (those of type G₂ are still called “Dickson groups” today). This was a key step on the road from continuous → finite (continued in §4).
- William Burnside(William Burnside, 1852–1927): an Englishman, on the finite-group side. In 1904 he proved the pᵃqᵇ theorem, with the corollary: the order of a non-abelian finite simple group must be divisible by at least three distinct primes — which neatly frames the 60 = 2²·3·5 (A₅) of EP3 that §4 will come back to.

Figure 5 Those who took up the baton: Klein, Killing, Cartan, Dickson, Burnside — spreading Lie’s theory out, completing it, and bringing it back to the finite. For the sources of the portraits, see “Image sources” at the end.
§2 · The mathematics line: the “periodic table” of continuous symmetry
Lie took the baton from Galois and wanted to build a theory for continuous symmetry as well. But continuous symmetry is far more slippery than discrete symmetry — a circle can turn by any tiny amount, with no gaps in between. To build a “periodic table” for it, the first step is to understand the most basic thing: what does a “continuous symmetry group” actually look like, and how do we “weigh” its size?
1. What is a continuous transformation group (intuition)
How do we “weigh” the size of a continuous group? Counting how many elements it has does not work — the angles through which a circle can turn are infinitely many, and comparing any two continuous groups by “number of elements” is infinity against infinity, with no telling which is bigger. Ask a different question and it becomes clear: in this symmetry, how many directions are there that can be adjusted continuously and independently of each other? Think of each such direction as a “knob” that can be turned — turn it, and the symmetry changes continuously by a little, while the knobs do not affect one another. The number of knobs a continuous group has is a finite number, and it is what really captures the “size” and complexity of the group. We call this number the dimension (also called degrees of freedom) of the continuous group.
- Turning a disk. You can turn it by any angle — one continuous knob. There is only this one knob, so the rotational symmetry of the disk is 1-dimensional. Draw all the ways of turning themselves: turns continuously from to and joins back up with the starting point — these “ways of turning” themselves line up into a circle. One of the simplest continuous groups, , has the shape of a loop.
- Letting a rigid body slide freely on a plane. It can move left and right (1 knob), up and down (a 2nd), and also turn on the spot (a 3rd) — 3 independent kinds of motion, 3-dimensional.
- Throwing a tennis ball into three-dimensional space. It can translate along (3), and can also tumble about three axes (3) — 6 degrees of freedom, 6-dimensional.
“Dimension = the number of independent continuous kinds of motion” — this is all the intuition we need. Continuous groups can be 1-dimensional (the circle), 3-dimensional, 6-dimensional… even hundreds of dimensions.
Holding it in your hand: a continuous group is a family of matrices. The “ways of turning” above are not only a metaphor — each of them can be written as a matrix. Take the simplest, : “turning by the angle ” acts on a vector in the plane and turns it counterclockwise by ; written down, this is
The whole group is the set of all these matrices ( from to ). Joining two rotations together — first turning by , then by — is multiplying the two matrices, and the product is exactly a turn by :
(it can be checked with one use of the angle-addition formulas — “multiplying two operations in the group” here is genuine matrix multiplication). In three-dimensional space, “turning about an axis” is likewise a matrix, for example turning about the axis by :
A concrete number: take ; sends to ; once more, and it is sent to — two put together are exactly , corresponding to . “Multiplying = adding angles” lands in this way on genuine numbers.
(turning about the and axes are two other similar matrices); all such rotation matrices together make up . This is the core of this chapter: a continuous group, put down on paper, is a family of matrices — what is called a “Lie group” is, most of the time, a “continuous group made up of matrices”. The classification table below classifies exactly these matrix groups.

Figure 6 The simplest continuous group SO(2): turn by any angle θ, each way of turning corresponds to a matrix R(θ), and multiplying two rotations is exactly adding the angles.
2. Lie’s goal: classifying continuous symmetry too
With “dimension” as a ruler, back to the real business of classification. When Galois sorted out discrete symmetry, what he did was not only “describe it with groups”; he also took finite symmetry apart all the way down to atoms that cannot be broken apart — the finite simple groups (the of EP3 is one). Lie wanted to do the same for continuous symmetry, and so the first question popped up at once: does continuous symmetry also have “atoms”?
It does. Some continuous groups can be taken apart: for example the “rigid motions of the plane” (3-dimensional) of §1 are in fact two blocks put together, “translations” and “rotations”, and the translation block can be peeled off as a whole and stand on its own. But some continuous groups cannot be peeled however you try — you cannot find inside them a small block of continuous symmetry that can be lifted out on its own (in the language of EP3: there is no nontrivial continuous normal subgroup that can be quotiented out). A continuous group of this kind, which “can no longer be taken apart”, is an atom of continuous symmetry, mathematically called a simple Lie group. (three-dimensional rotations) is one: you cannot take “turning about some direction” apart into two smaller, separately independent continuous symmetries.
Example (can be taken apart vs cannot be broken apart): in the rigid motions of the plane (translations, 2 dimensions + turning, 1 dimension = 3 dimensions), the two dimensions of “translation” form a continuous normal subgroup, which can be quotiented out as a whole block and peeled off separately — so is not an atom; whereas in (turning about any axis) no such continuous normal subgroup that can be peeled off separately can be found — so it is an atom (a simple Lie group).
In this way, what Lie had to do was exactly the same as what Galois had done: first list all these “atoms” completely, and then every continuous symmetry in the world is nothing but something put together from them — just as chemists took all things apart onto one periodic table of the elements. On the day the table of atoms is complete, continuous symmetry will also have been thoroughly sorted out.
Lie did not get to finish this; those who carried on the relay were Killing (a schoolteacher, in the chain of people of §1) and Élie Cartan (the one who made the classification rigorous and actually constructed those few exceptions). They proved an astonishingly clean classification theorem — below is this “periodic table” of continuous symmetry groups.
First, let us be clear about one word.
Here the “periodic table” is borrowed as a metaphor, referring to the
classification table
that sorts the
continuous symmetry groups
(simple Lie groups) into categories like the chemical elements — it and the chemical
elements’
periodic table of §3
are not the same table: the former is the periodic table of
groups
, the latter is the periodic table of
elements
. What is really wonderful is that
the same mathematics of continuous symmetry
— at one end lays out its own
classification table of groups
(this section), and at the other end, in §3, determines the structure of the
periodic table of the chemical elements
. The same mathematics wrote down a table on each of two levels.

Figure 7 Lie’s “Theory of Transformation Groups” (Theorie der Transformationsgruppen, written with Engel, 1888–93). Public domain.
3. The Killing–Cartan periodic table: 4 great families + 5 exceptions
The table looks like this: all the atoms of continuous symmetry (simple Lie groups) fall exactly into four infinitely extending families — call them — plus five exceptions that belong to no family. First look at the four great families; in essence they are all some kind of “rotation”.
The family — the complex version of rotation. Replace the real coordinates in ordinary rotation with complex coordinates (each “axis” becomes a complex plane), and the rotations that preserve length make up . The smallest, , we have already seen: it is a double cover of the three-dimensional rotations (the electron spin of §3 lives exactly on this level).
The and families — honestly turning real space, split only by odd and even dimension. These two families are just the most familiar “turning a -dimensional real space”, : if the dimension is odd () it belongs to , if even () to . Why must odd and even part ways? Because in even dimensions rotation has an extra kind of symmetry, “pairing all the planes up two by two”, which odd dimensions do not have — this structural difference gives the two families different “fingerprints”, so they must be separated. is , is .
The family — rotations of “phase space” (symplectic symmetry). This one is the least intuitive, but it has a physical handle: in classical mechanics, describing a particle takes position + momentum in pairs, and the space held up by this “position–momentum pairing” is called phase space; the linear transformations that preserve this “position–momentum” pairing structure (mathematically called a symplectic structure) make up — it is exactly the linear version of what are called canonical transformations in classical mechanics: changing to a new set of position and momentum coordinates while leaving the form of Hamilton’s equations exactly unchanged. (Incidentally, to clear up a common misunderstanding: this is not “spacetime symmetry” — however spacetime is turned, the laws of physics do not change; that is another group, called the Lorentz group, which will be touched on at the end of §4; the symplectic group is in charge of the “position–momentum” pairing in phase space, not of spacetime.) Remember these four families in one sentence: turns complex space, turn real space (odd/even dimensions), turns phase space.
So what exactly is “rank”? Do not stop at empty words like ”≈ independent planes of rotation”; it has a very concrete meaning: how many independent planes you can turn at the same time without interfering with one another. In three-dimensional space, any two axes of rotation you pick will stir each other up, and at most one plane can be turned independently — so has rank 1. But once in four dimensions, “the plane” and “the plane” do not interfere with each other at all, and can each turn its own way at the same time — has rank 2. The higher the dimension, the more independent rotations can be twisted at the same time, and the larger the rank. Rank is the number of “how many twists can be made at the same time” in a continuous symmetry. (The rank of the -th member of a family is exactly ; apart from the smallest one or two at the start of each family, these groups are all atoms of the kind “that cannot be broken apart” described in the previous section.)
The four great families, written as matrices. Back to the core of §1 — “a continuous group is a family of matrices” — these four families are in essence each the totality of “matrices that preserve some structure”:
| Family | Group | Written as matrices | What it preserves |
|---|---|---|---|
| complex matrices | length in complex space () | ||
| real matrices | length in real space () | ||
| real matrices | the position–momentum pairing () |
The three phrases “turning complex space / turning real space / turning phase space” mean precisely these three rows of matrix conditions — this is the solid ground under “they are all some kind of rotation”. Take the smallest one of each family and actually write out the matrices:
The entries of are complex numbers ( complex, with the constraint preserving complex length); those of are real numbers (preserving real length, exactly the rotation of §1); is real too, but what it preserves is not length but “area” — is exactly the real matrices with determinant that are , that is, the linear transformations that twist without changing the area of a parallelogram, and this is the smallest “symplectic pairing”.
Example (what double-covering looks like): for turning about the axis by , the element is (, unitary). Add a full turn to the angle, to : because , we get — this is the same rotation (turning by and turning by make no difference in space), yet it is two different elements, and . This “two to one” is the “double cover”, and it is exactly the root of the electron’s spin ½ in §3.
(An honest footnote: what was picked above is the smallest member of each family, only to show what the matrices of the three “flavors” look like; in fact at this smallest level (rank 1), are exactly isomorphic to one another, a well-known “low-rank coincidence”. The four families only really part ways at rank — for example and are two different groups.)
Four infinite families — the story should have ended perfectly here. A table that is both clean and regular: four columns, each column extending downward without end. If the world of continuous symmetry were that tidy, it would be far too easy.
But when the classification is really pushed to the end, the result is not that regular. Killing and Cartan carried the classification to its end and found that in a corner of the table there were 5 more symmetries — they do not fit the mold of any of the families , and popped up extra:

Figure 8 The “periodic table” of continuous symmetry: 4 infinitely extending families A/B/C/D, plus 5 exceptions that belong to no family, G₂, F₄, E₆, E₇, E₈.
Three points about this result are worth noting: - They follow no pattern. Each of the four great families can be summed up in a sentence (“turning complex space”, “turning real space”…), but these 5 cannot be put together into a common “what they turn” — each has its own strange structure. - Neither more nor fewer, exactly 5. Not 0 (that would be regular), and not infinitely many (that would count as a kind of pattern too), but precisely 5, an inexplicable finite number. - It stops abruptly at . When the rank climbs to 8 (, 248 dimensions), that is the ceiling — if you want to attach one more, an "", the whole structure collapses into infinite dimensions and is no longer a finite building block. Nobody could have foreseen this wall at rank 8.

Figure 9 The five exceptions line up to E₈ (248 dimensions) and abruptly hit the ceiling — rank 8 is the ceiling; if you try to attach one more, the whole structure collapses into infinite dimensions.
A classification table that should have been regular and infinite finally grew into “four infinite families + 5 exceptions that abruptly hit a ceiling”.
⭐
This is the first time this series gets a taste of “exceptions”
— outside the four regular families, there really are a few other basic building blocks. But let us be clear: they are still
proper continuous symmetries, belonging to the regular classification of Lie groups, only
they do not look like those four families
, that is all. Their individual origins, and what is hidden in those 248 dimensions of ,
this episode only touches on
(left for later episodes). But please remember this picture:
a classification table whose main body is a few regular infinite families, yet with a few members in the corner that do not play by the rules.
Continuous symmetry, in this way, has its own “periodic table” — Killing–Cartan’s 4 great families + 5 exceptions (to stress it once more: this is the classification table of groups, not the chemists’ periodic table of the elements). In the next section, we look at what real things this continuous symmetry built: with its own hands it will fix the chemistry of our universe — that real periodic table of the elements.
And the origins of those 5 exceptions themselves are left for later episodes. But here let us first bury a bigger suspense: however strange they are, they are still on this classification table; and the quarry this series is really chasing may not be on the table at all. (Foreshadowing → Epilogue.)
4. One step further: the “representations” of a group, and a ruler that takes a whole section to use
Up to here, the “a continuous group is a family of matrices” of §2 referred to what the group itself looks like — itself is those rotation matrices. But the really useful step is to go one notch further: the same group can also “act” on other things.
The three-dimensional rotations do not only turn arrows in space; they also act on the states of electrons — turn an atom, and those “orbitals” of the electrons will be stirred along with it, exchanging places with one another. This action likewise assigns a matrix to every operation in the group (only these matrices act on the space of “electron states”, and can be much larger than ), and the assignment fits multiplication seamlessly: first turn by , then by , and the corresponding matrix is exactly the product of the two. Assigning a matrix in this way to each operation of a group — this thing itself (on the premise of the condition above, “agreeing with multiplication”) — is mathematically called a representation of the group.
A representation can often be “block-diagonalized”: choose the right coordinates, and that big pile of matrices will split simultaneously into a few small square blocks that do not interfere with one another, each block in charge of its own lot of states. The small blocks split down until they can split no further are called irreducible representations; their dimension (the side length of the small block) is a definite integer, one of the hardest fingerprints of the group.
Example (a visible representation): acting on the three orbitals is a 3-dimensional representation. A turn about the axis by sends , , and leaves unchanged; written as a matrix it is exactly . This -dimensional block can split no further — it is exactly the irreducible block of the next section that, for , has .
Remember this ruler well: group → representation → dimension. The whole physics line of the next section uses it again and again — the same ruler measures the periodic table of the elements at one end and elementary particles at the other.
(For the rigorous proofs here of why “after choosing the right coordinates the matrices become block-diagonal simultaneously”, “irreducible representations” and “characters” hold — complete reducibility, traces and characters, Schur’s lemma and the orthogonality relations — see Appendix 1 at the end.)
§3 · The physics line: where do those electron numbers in the periodic table actually come from
At the end of the previous episode, that set of glowing orbital clouds — is a sphere, a dumbbell, four petals — were the “shapes” an electron can occupy in an atom. Chemistry class teaches you a set of rules for counting electrons: a subshell () contains a number of orbitals, each orbital holds at most 2 electrons, and so hold 2, 6, 10, 14 electrons respectively.

Figure 10 The shapes of electron orbitals: s a sphere, p a dumbbell, d four lobes. PoorLeno, “Hydrogen density plots”, 2008. Public domain.
You have probably memorized this set of rules. What this section has to supply is the reasoning behind it — and from start to finish it uses only one tool: the ruler of the previous section, group → representation → dimension. Below we will take it out three times: the first time to measure “how many orbitals a subshell has”, the second time to measure “how many electrons an orbital has”, and the last time, to extend the same ruler all the way to elementary particles. are not numbers fudged together; they are the result of measuring twice with this ruler and then multiplying.
1. First, sort out the three levels: orbital → subshell → shell
- Orbital: one spatial state an electron can occupy in an atom — a definite shape plus orientation (for example a lobe pointing in the direction, of type). This is the smallest unit.
- Subshell: orbitals of the same kind of shape, differing only in orientation, are grouped into a subshell, that is, .
- Shell: the subshells with the same principal number , taken together, are one electron shell (the K, L, M… shells of chemistry).
So it is the orbitals that come first; above them, subshells are put together, and then shells. To count “how many electrons a subshell, a shell can hold”, we must first answer two most basic questions: how many orbitals are there in a subshell? How many electrons stand in an orbital?
2. Using the ruler the first time: the number of orbitals in a subshell = ‘s representation block
Why does the subshell have precisely 3 orbitals, and 5? Take the ruler of the previous section and measure once, and it becomes clear. In the cleanest picture (a single electron, no external field), an atom is the same however it is turned — it carries the full symmetry of three-dimensional rotations, (the “symmetry of the sphere” of the previous episode).
acting on electron states is one of its representations: each rotation is assigned a matrix, after choosing the right coordinates these matrices are block-diagonal, and each irreducible block that can split no further corresponds exactly to one subshell. And there is an iron law for the sizes of the irreducible blocks of — they can only be odd, . Each orbital in a block carries an integer label (the magnetic quantum number, , corresponding to “how fast it turns about the axis”), and counting them gives exactly :
This is the number of orbitals in a subshell — one for , three for , five for , seven for . Their shapes are exactly that set of glowing clouds from the previous episode (mathematically, the spherical harmonics ). The ruler’s first measurement gives the string of integers .
Example (the subshell): gives orbitals, with magnetic quantum numbers — corresponding to the three orientations () and (real combinations of ). This is exactly the block whose states in the previous section turns into one another, the -dimensional one.
Why can the blocks of
only
be odd-dimensional, ? It has to be proved rigorously from the algebra of angular momentum + the double cover; for the complete derivation see
Appendix 2
later.
3. Using the ruler the second time: how many electrons in an orbital = the spinor representation of (spin ½)
An orbital holds at most 2 electrons, one with spin up and one with spin down. This “2” is measured by the same ruler the second time — only this time the group being measured is the double cover of , .
Remember that sentence in §2: double-covers . The two are the same almost everywhere, yet they differ by a tiny bit: the representation blocks of can only be odd-dimensional (the string of the previous section), whereas its double cover has in addition that whole batch of half-integer representations that cannot get (dimensions ); the smallest nontrivial one among them is the 2-dimensional “spinor”. These 2 dimensions correspond exactly to the two states “up and down” of electron spin: spin ½ is nothing other than the spinor representation of . Two states, plus Pauli exclusion (two electrons cannot be in exactly the same state), and one orbital is exactly filled by 2.
Example (helium, ): both of helium’s electrons go into this one orbital — one with spin and one with , exactly the two basis states of the spinor; Pauli exclusion forbids a third, so stops here and helium’s first shell is full.
So by what right does the electron land in this half-integer spinor representation of , and not in those integer representations of ? The answer comes from relativity. In 1928 Dirac set out to write an equation for the electron that both agreed with relativity and contained only first derivatives; once these two requirements are laid down, the electron’s wave function must have 4 components, and the block among them that describes rotation turns out, when computed, to be exactly this spinor — spin ½. A clean and experimentally measurable mark: turn an electron through one full circle in space, and it does not return to how it was, but changes sign to ; it takes one more turn, in all, to be truly restored. “Restored only after two turns” is exactly the signature of the spinor representation — and exactly the true face of that “tiny bit” by which exceeds .

Figure 11 Paul Dirac (1902–1984). His 1928 equation requires the electron’s wave function to have 4 components, and the block among them that describes rotation is exactly the spinor of SU(2) — spin ½. © Nobel Foundation, 1933, public domain.
For why the spinor of is 2-dimensional and half-integer, and how it joins up with the integer representations of , see
Appendix 2; for the complete derivation of spin ½ from the Dirac equation see
Appendix 3; for the proof of “spin ½ ⟹ fermion ⟹ Pauli exclusion” see
Appendix 4
.
4. Totting up the account: →
The ruler has measured twice; multiply the two integers together, and that is the electron capacity of one subshell:
2, 6, 10, 14 — these are the widths of the four blocks of the periodic table. Then add up the subshells within one shell (principal number ), and that is the total number of electrons this shell can hold:

Figure 12 The same ruler measuring twice: the number of orbitals in each subshell (2ℓ+1) × 2 electrons per orbital = 2, 6, 10, 14 — exactly the widths of the four blocks s/p/d/f of the periodic table.
(A small reminder: a “row” in the periodic table and “an electron shell” do not completely coincide — electrons are filled in order of energy, and gets in ahead of , so the lengths of the rows of the table are . This is a detail of the filling order and does not change the total capacity of per shell.)
To close in one sentence: the electron configurations memorized for years in chemistry class have their root in two integers measured by the same ruler — what gives, (in charge of how many orbitals a subshell has), and what its double cover gives, (in charge of how many electrons an orbital has). One tool, measuring twice.
Example (carbon, ): the electron configuration of carbon is — the subshell could hold (that is, in , the ""), and carbon fills only . Carbon’s valence electrons () then, through hybridization, form four equivalent bonds, which hold up the whole of organic chemistry.
5. The same ruler, extended all the way to elementary particles
By now the ruler has measured out the whole periodic table of the elements. But its range goes far beyond this — extend the same “group → representation → dimension” once more, and what it measures is the carriers of the few fundamental forces deep inside matter.
The first two times, the ruler measured “how the group acts on electron states” (how big the blocks of the representation are); this time we use it differently, measuring “how big the group itself is” — that is, the number of independent knobs of §2 (the dimension of the group itself). And the three forces, electromagnetic, weak and strong, each come with a symmetry group, and however many knobs that group has, that is how many carrier particles the force has:
(The dimension of : the symmetry group of the strong nuclear force, , has knobs, and the corresponding gluons are exactly 8 kinds. As for the fourth force of nature — gravity — it is not in this framework: the graviton has spin and does not come from the dimension of any ; the gauge group of the Standard Model has only the three pieces .)
(To name them specifically: the carriers of the weak force are , and the of electromagnetism is the photon — the counts match the dimensions and of their respective groups directly.)
This is the real main line of this physics line: the same ruler measures out the periodic table of the elements at one end, and the kinds of elementary particles at the other. Lie’s mathematics of “continuous symmetry” was never an abstract toy — when nature set the rules of chemistry and matter, it used exactly this same language.
Next, we leave physics and return to a deeper mathematical question: how do these “atoms” of continuous symmetry walk back into the finite world?
§4 · Back to the question on the mathematics line: how do we get back to the “finite”?
In the first three sections we walked all the way into the infinite: Lie groups are continuous, a circle has infinitely many ways of turning, and turning a sphere has infinitely many poses. But the “atoms of symmetry” this series is chasing — the finite simple groups — are finite. The name Ronan gave this chapter is a rhetorical question: “a way back to finiteness” — how do we walk back from infinite Lie groups to finite atoms?
This section is that road back. It has three steps: first fold the “infinite” number line back into the finite (clock arithmetic, the one piece of hard material in this episode explained all the way to the bottom — borrowing only Bézout from §4 of the previous episode, with Euclid’s lemma and the properties of “finite fields” all derived from it on the spot); then move the construction of Lie groups onto this finite arithmetic (Dickson); finally use a theorem to frame what shape the atoms built this way have (Burnside) — and that shape brings us back exactly to the of EP3.
1. Folding the infinite back into the finite: clock arithmetic
You in fact use a “finite arithmetic” every day — reading the clock. It is 10 o’clock now; what time is it 5 hours later? Not 15 o’clock, but 3 o’clock: the clock face has only 12 numbers, and on reaching 12 it goes back to zero and starts over. Write this as a calculation: , but and are the same point on the clock face (differing by one whole round of 12). We write
read as ” is congruent to modulo ” — numbers that differ by a multiple of 12 count as the same on the clock face. So only 12 numbers are left on the clock face, , and this arithmetic of “wrapping around on reaching 12” is called arithmetic modulo 12, written .
Addition, subtraction and multiplication are all done as usual, then wrap around and take the remainder. Example: ; . This is a finite number system — only 12 numbers, yet addition, subtraction and multiplication are all self-consistent. The infinite line of integers is folded by “going round in circles” into one finite circle.

Figure 13 Clock arithmetic: 5 hours after 10 o’clock is 3 o’clock, because 15 ≡ 3 (mod 12). The infinite line of integers is folded by going round in circles into one finite circle.
But division goes wrong — zero divisors
Addition, subtraction and multiplication all go smoothly; only division overturns in . Look at a strange phenomenon:
Two numbers that are both not 0, multiplied together, equal 0. Such numbers are called zero divisors. In ordinary integers this would never happen (); but on the clock face is , so and join forces to “multiply each other away”.
Once zero divisors appear, division is ruined. "" ought to mean “solve ”. But in ask ”?” — we must solve : times any number is a multiple of , , and can never make . has no reciprocal; dividing by has no solution. The arithmetic of this clock face is a crippled number system “missing division”.
Choose a prime, and the crippling is repaired
Change to another clock face — a 7-hour clock, . Try looking for zero divisors again: multiply all nonzero numbers in pairs and take them modulo 7, and you will find that however you multiply, you cannot make 0. Why? Because is a prime: if , that means , and primes satisfy Euclid’s lemma — or . This lemma does not have to be memorized as an “iron law”; it can be derived on the spot (borrowing only Bézout from §4 of the previous episode): suppose ; then ( is a prime, with only and as factors, and rules out ); by Bézout there are integers with ; multiplying both sides by gives — both terms on the left are divisible by ( is known, is obvious), so . So when , one of must already be — there are no zero divisors.
With no zero divisors, division comes alive. Look in :
("" means solving ; the line above says exactly .) Check one by one: — times hits each of exactly once, so any result you want has a unique , and division can always be done. In particular , so the reciprocal of is .
Conclusion (explained thoroughly). For : - composite (, ): then are nonzero yet — there are zero divisors, and division is crippled. - a prime : no zero divisors, and every nonzero element has a reciprocal — addition, subtraction, multiplication and division all go through.
The second half, “every nonzero element has a reciprocal”, can also be proved on the spot: is coprime to , so by Bézout there are integers with ; modulo this is , and is the reciprocal of . (Bézout is a standard fact already used in §4 of the previous episode.)
A number system in which addition, subtraction, multiplication and division all go through, and which has only finitely many elements, is mathematically called a finite field, written . We have just proved: is a field is a prime. Primes are exactly the key that completes “going-round-in-circles arithmetic” into a whole number system.
Galois line ③ (the main line’s third appearance).
These finite fields were invented by none other than
Galois
— around 1830 he built and even (to this day a “finite field” is also called a
Galois field, written ). And Galois did not stop at arithmetic: in his deathbed letter of 1832 he also studied a batch of groups — in today’s terms, exactly (the version of the ""-type Lie group over a finite field), which are also among the earliest non-abelian simple groups in history. The one who really moved whole families of Lie groups onto finite fields
systematically
, building finite groups of Lie type in batches, was
Dickson, to be discussed below; but that batch of groups of Galois’s, seen in hindsight, falls exactly at the starting point of the same line. This Galois→Lie→finite line surfaces here for the third, and also the last, time.
2. Dickson: moving Lie groups onto finite fields
With the finite field , the road back to the finite is open.
Lie groups (the four great families A/B/C/D of §2) live on the real or complex numbers — so they are continuous and infinite: the entries of the matrices can take any real values. Dickson’s insight of 1901 was simple and powerful: replace all the “real numbers” in the same construction with “numbers of a finite field ”. The matrices are still the same kind of matrices, the group is still defined the same way, only the entries are changed from the infinite real numbers to the finitely many numbers of a finite field — and so the whole group all at once becomes finite.
What does it look like concretely? Take the simplest, type — the family of matrices. Over the real numbers, the matrix entries can take any real values, and there are infinitely many matrices. Change to (the 5-hour clock), and each entry can only take , for example
with addition, multiplication and the determinant all done by the clock arithmetic of the previous section (this is an element of , with determinant ). With only 5 numbers to fill the entries, there are only finitely many matrices — pick out those with determinant , then reduce by the center according to the rules, and the finite group obtained is exactly ( elements, ). The infinite continuous turntable, by the move of “putting in a finite number system”, is gathered into one finite atom of symmetry.
To put it vividly: take the same recipe for “making Lie groups”, replace all the real numbers in it with numbers in a finite field , and the infinite continuous group all at once shrinks into a finite segment. One Lie type one prime (power) one family of finite simple groups (these finite versions are still simple groups — this is the core conclusion proved in the Dickson/Chevalley construction, holding apart from a few exceptions with very small ; it is a detail of the construction, which this episode, as with Burnside, takes and uses without unfolding); there are infinitely many primes, so this machine churns out in batches a great pile of finite atoms of symmetry — the finite simple groups of Lie type.
Back to the two atoms of EP3.
Moving the simplest type onto gives exactly Galois’s family : - is exactly
( elements) — EP3’s “atom that cannot be broken apart” turns out to be a product of the Lie machine as well; - has
elements — in the “periodic table” of EP3’s epilogue, the column of Lie type is headed by , and that is exactly it. The same atom: EP3 ran into it along the road of “even permutations”, and this episode meets it again along the road of “continuous symmetry gathered into the finite” — two roads in, the same atom.
(The “switch arithmetic” of the smallest finite field is exactly the foundation of computers and error-correcting codes; going on into higher dimensions buries the foreshadowing for the “ultra-high-dimensional symmetries” later on, the Leech lattice and the Monster group — here only one sentence on it, left for EP6–8.)
3. Burnside: the shape of the atoms is framed
Dickson gave us a great pile of finite atoms. Do they have a common “look”? In 1904, Burnside gave an astonishing restriction:
Burnside’s theorem (the theorem, 1904).
A finite group whose order
is divisible by only one or two distinct primes
(that is, in form) is always a
solvable group
.
Turn it around (take the contrapositive), and that is the law of shape we want: for a non-abelian simple group (a “true atom” that cannot be broken apart and is not solvable), its order must be divisible by at least 3 distinct primes.
— A true atom of symmetry takes at least “three flavors of prime” to be built. With two or fewer, it is necessarily solvable and necessarily can be taken apart, and cannot be an atom.
Checking on the spot (back to EP3). The two smallest non-abelian simple groups we wrestled with in EP3 sit exactly on this lower bound:
Both have exactly three primes — not one fewer (Burnside does not allow fewer), and none extra. EP3’s “periodic table of non-abelian simple groups below 2000”, : factor each one, and the number of kinds of primes is , without exception — Burnside’s law of shape frames the whole table within it.

Figure 14 Back to the A₅ of EP3: 60 = 2²·3·5, exactly three primes, standing on Burnside’s lower bound. (The rotational symmetry group of the icosahedron is A₅.)
For the complete proof see
Appendix 5
at the end.
Burnside’s theorem is proved in full from the general toolbox of character theory (orthogonality relations + algebraic integers) (integrality of central characters → Lemma A → Lemma B → the main theorem → the contrapositive gives ” primes”, borrowing the toolbox without citing the conclusion itself from outside). Here in the main text we first use the conclusion: the shape it frames ( primes, with and exactly on the line) can be seen and computed clearly.
Connect the three steps: clock arithmetic folds the infinite number line into the finite field (primes are the key; invented by Galois); Dickson moves Lie groups onto this finite arithmetic and builds finite atoms of Lie type in batches (, including and ); Burnside then frames the common shape of every atom (the order contains distinct primes). Continuous symmetry, going round a whole circle, comes back to the finite atoms — and comes back to the of EP3.
Epilogue · Have they all been found?
This episode went in four steps: Sophus Lie took up Galois’s question and pushed symmetry from the discrete to the continuous; continuous symmetry has a “periodic table” of its own — four infinitely extending families, plus five unreasonable exceptions in the corner; this continuous symmetry is no castle in the air: with its own hands it fixed the width of every block of the real periodic table of the elements, and also counted how many carriers each of the three forces, electromagnetic, weak and strong, has; finally, moving it back to the finite, we obtained a great pile of finite atoms of symmetry, and Burnside also framed their common shape.
Yet one question hangs there: is this great pile of atoms that fell out of the Lie machine all of them? Or, outside all the regular families, is there some atom still hidden — belonging to nobody’s family, a lonely strange thing that is not in any periodic table?

Figure 15 Have they all been found? — perhaps outside all the regular families there is still hidden a lonely strange thing that belongs to nobody’s periodic table. (Foreshadowing → EP5)
The line of continuous symmetry comes to a pause here. But the business of “finding all the atoms of symmetry” is only just about to become hard. In the next episode, we walk into the war that was fought for thirty years — the classification of finite simple groups: how humanity used a proof of tens of thousands of pages to list all the atoms of symmetry clearly, and what exactly was waiting at the end of that list.
(→ EP5: The Thirty Years’ War · the classification of finite simple groups.)
Appendix 1 · Foundations of representation theory: complete reducibility, characters, Schur orthogonality
In the main text we repeatedly used two things that “look as if they go without saying”: first, that a representation can always “after choosing the right coordinates have all its matrices block-diagonalized simultaneously”; second, that one can use one number (the character — the sum of the diagonal of the matrix corresponding to a group element, , given formally in Section 2) to recognize a representation and to judge irreducibility. This appendix proves these two things clearly from the beginning. Unless stated otherwise, is always a finite-dimensional complex vector space, and is a representation — that is, it assigns to each group element an invertible matrix ( = the group made up of the invertible linear transformations on ), and preserves multiplication, (this is a “group homomorphism”).
1. Complete reducibility: breaking any representation into a direct sum of irreducibles
Theorem (Maschke / compact-group version).
Let be a finite-dimensional complex representation satisfying either of the following conditions: -
(finite group)
is a finite group; or -
(compact group)
is a compact Lie group (for example the and used in this series), and is continuous. Then can be written as a direct sum of irreducible subrepresentations
where each is -invariant () and irreducible.
(First, to make the terms in the theorem clear: = all rotations of three-dimensional space, that is, the orthogonal matrices with determinant that are ; = the unitary matrices with determinant that are ; a Lie group = a group whose elements can vary continuously and which is also a smooth manifold; compact means its parameter space is bounded and closed (for example the angle of rotation goes round once and comes back to where it started); a representation is irreducible if, apart from and itself, no subspace can be found that is invariant under all — that is, no smaller subrepresentation can be split off.)
The proof has four steps. The core trick is taking an average: “symmetrizing” an arbitrary inner product into a -invariant inner product.
(a) Constructing a -invariant inner product. First, on , take any Hermitian inner product (take a basis and use the standard inner product). Define a new inner product:
(The Haar measure here is the unique translation-invariant “uniform” measure on a compact group — generalizing the of finite groups to continuous groups, normalized so that the total measure is .)
It is still a Hermitian inner product: it is a (weighted) average of a family of Hermitian inner products, so sesquilinearity (linear in one slot, conjugate-linear in the other) / conjugate symmetry are preserved term by term; positive definiteness also holds —
and the term with in it is just , which equals if and only if ; in the compact-group case the integrand is continuous and nonnegative, and at takes the positive value , while the normalized Haar measure assigns positive measure to every nonempty open set (full support), so the integral of a continuous, nonnegative function that is positive at some point must be . So is positive definite.
The key is -invariance: for any ,
As runs through , also runs through (right multiplication is a bijection), so after renumbering, the sum equals . The compact-group case correspondingly uses the right-translation invariance of the Haar measure, (a compact group is unimodular, the left and right Haar measures coincide, so right-translation invariance holds). Hence
(b) Each is unitary with respect to . This is exactly the equation at the end of (a): preserves the inner product , and by definition it is a unitary operator, so (the adjoint taken with respect to the new inner product).
(c) The orthogonal complement of an invariant subspace is still invariant. Let be a -invariant subspace, and take its orthogonal complement (with respect to ). Take any ; we must show , that is, for all we have . By the unitarity of (b),
Because is invariant and , we have ; and , so the expression above . Hence , and is invariant. Therefore (in finite dimensions the orthogonal complement exists and complements fully)
(d) Induction on dimension. If is irreducible, the proposition already holds ( itself is its irreducible decomposition). Otherwise there is a proper nonzero invariant subspace , and by (c) we get , with both pieces of dimension strictly less than . By induction on dimension, each is further decomposed into a direct sum of irreducibles, and putting them together gives the irreducible direct-sum decomposition of .
Why “after choosing the right coordinates the matrices are block-diagonalized simultaneously” holds. Take the decomposition , in each take a -orthonormal basis, and put them together into an orthonormal basis of . In this basis, because each is invariant under all simultaneously, the matrix is block-diagonal for each :
and this block structure does not depend on (the same set of coordinates works for all group elements, because the decomposition itself does not depend on ). This is the rigorous basis for what the main text called “after choosing the right coordinates the matrices are simultaneously block-diagonal”. This series mainly uses the compact-group version (, ); the finite-group version (Maschke, whose key point is that the division by is always legitimate over the complex numbers) is the basis of the orthogonality relations of Section 3 and of Appendix 5 (Burnside). (Compare Dummit–Foote, Fulton–Harris, and Hall, Lie Groups, Lie Algebras, and Representations.)
Example (a real splitting: the plane rotations split into two lines over ). The 2-dimensional representation of the group of plane rotations ,
cannot be split over the real numbers — in the plane there is no line preserved by all rotations (a rotation turns every line away), so it is irreducible over . But the theorem is about complex representations. Put the same on , and it immediately has eigenvectors:
(check directly by substitution: ). So in the basis
— a direct sum of two one-dimensional irreducible representations, which is exactly what the complete reducibility theorem looks like on one of the simplest nontrivial examples ( is a compact Lie group, and falls under the compact-group version of the theorem): after complexification the rotation matrix is diagonalized, and the whole block splits into two independent one-dimensional subrepresentations. (Incidentally, , and the trace does not depend on the basis — confirming Section 2 again.)
2. The trace and the character
For a square matrix , define the trace
Lemma (cyclicity of the trace). .
Proof: expand directly,
Corollary (basis independence / conjugation invariance). If , then
So the trace depends only on the linear operator itself, not on the basis chosen.
From this we can define the character of the representation ,
which is well defined (independent of the basis). It has several properties that can be used immediately:
- A class function (constant on conjugacy classes). For any , So takes a constant value on each conjugacy class. (The conjugacy class of = the family of all elements of the form (); group elements that are “the same kind of operation, just seen from a different viewpoint” are grouped into one class — for example “turning by the angle ”, whatever the axis, is one class.)
- The identity element gives the dimension. .
- The character of a direct sum is additive. If , then in block-diagonal form , so
These three, together with the complete reducibility of Section 1, turn “recognizing a representation by one number” into something computable: the character of any representation is the sum of the characters of its irreducible components.
A concrete one: the 3-dimensional representation of . Take the abstract properties above and look at them clearly in the 3-dimensional representation of §2.4, ” acting on the three orbitals”. Turning about the axis by , in the basis:
The three properties can be seen on the spot:
- Basis independence: change to the spherical-harmonic basis ( is notation commonly used in physics; it is just a column vector/state vector, with a label attached to it; for these spherical harmonic functions see Appendix 2), and the same rotation becomes the diagonal matrix — the matrix looks completely different, yet the trace is still . The trace does not change with the basis.
- Class function: turning about the axis or about the axis by the same angle gives different matrices, yet both “turn by ” (the same conjugacy class), and their traces also both equal . So recognizes only the angle of rotation, not the axis.
- The identity element gives the dimension: when , , and .
This is exactly what the general formula for the character of ‘s -dimensional irreducible representation, , looks like at .
3. Schur’s lemma and the first orthogonality relation
Schur’s lemma.
Let , be irreducible representations, and an
intertwining operator
(a -equivariant linear map), that is, holds for all . Then:
(a)
either , or is an isomorphism;
(b)
if and (the same irreducible representation, with the algebraically closed as the field of scalars), then there exists such that .
Proof of (a). is an invariant subspace of : if , then , so . Since is irreducible, or . Likewise is an invariant subspace of : , and since is irreducible, or . If , then (injective), and (surjective), so is an isomorphism.
Proof of (b). Over , must have an eigenvalue (the characteristic polynomial has a root). The operator is still an intertwining operator ( commutes with everything, and is intertwining), and (it contains an eigenvector). By (a), is either an isomorphism or ; it is not injective, so it must be , that is, .
Example (Schur’s lemma, on the spinor). Take the 2-dimensional spinor representation (a spinor = the kind of representation state particular to that cannot hold, which changes sign under a full turn , ; see Appendix 2 §4 for details), and check the two parts by hand.
(b) What commutes with the whole group can only be multiplication by a number. Let commute with every rotation. First require it to commute with the rotation about the axis, (for all ): comparing the two sides of forces , so can only be diagonal. Then require it to commute with the rotation about the axis, , which forces . So — what commutes with the whole of is only multiplication by a number. This also amounts to proving once more that the spinor is irreducible (irreducible the intertwining algebra contains only multiplication by numbers).
(a) Between different irreducibles there is only zero. Between the spinor (2-dimensional) and the trivial representation (1-dimensional, each ), an intertwining operator is a row vector , which must satisfy for all : substituting gives , which forces . Between two non-isomorphic irreducibles, the only intertwining operator is — exactly (a).
Constructing intertwining operators by averaging. Let , be irreducible representations, of dimensions . For any linear map , define
It is an intertwining operator: for any ,
that is, . So by Schur:
- if (non-isomorphic irreducibles), then ;
- if , then , and taking the trace fixes :
Orthogonality of matrix coefficients (the Schur orthogonality relations). Take (the matrix unit that in position is and elsewhere ), and write out, of , the entry:
Substituting the conclusions of the two cases above (when , ) gives
By Section 1, each irreducible representation can be taken to be unitary (using a -orthonormal basis), so the second factor being substituted is , giving the symmetric form
The first orthogonality relation (irreducible characters are orthogonal). On the space of class functions define the inner product
Using , and the box above:
And , so
That is: the characters of different irreducible representations are orthogonal to one another, and each has unit length. So the irreducible characters form a set of orthonormal vectors in the space of class functions, and this turns “judging whether two irreducible representations are isomorphic” and “decomposing a general representation into irreducible components and counting the multiplicities” entirely into inner-product calculations (multiplicity ).
Example (checking the orthogonality relation on the spot on ). Take the smallest non-abelian group (, the permutations of three symbols). It has 3 conjugacy classes — , the three transpositions , the two three-cycles , of sizes respectively; and exactly 3 irreducible representations: the trivial , the sign , and the 2-dimensional standard representation (the same name as in Appendix 5). The character table (rows = irreducibles, columns = conjugacy classes):
| Character | (1 element) | transpositions (3) | three-cycles (2) |
|---|---|---|---|
| (trivial) | |||
| (sign) | |||
| (standard 2-dimensional) |
Compute on the spot with (the characters are all real, so the conjugation can be omitted):
- Each has unit length ( is the criterion for irreducibility):
- Pairwise orthogonal:
The three characters really do form an orthonormal set, — this is the first orthogonality relation, something you can see and touch. Demonstrating its use along the way: expand the regular representation (the regular representation = the -dimensional representation obtained by letting the group act on itself by left multiplication, with the group elements as basis; its character at the identity is , and elsewhere , so here ) in terms of them, and the multiplicities give , exactly (each irreducible appears times) — “counting multiplicities = computing inner products”, made good on the spot.
The compact-group version and the dependence on the appendices. For compact groups (, ) one need only replace by the normalized Haar integral : Schur’s lemma holds likewise for their finite-dimensional continuous irreducible representations, and the orthogonality relation becomes
(the Peter–Weyl theorem gives completeness). This compact-group orthogonality relation is the tool for decomposing any representation of and counting the multiplicities (Appendix 2 §5 confirms that each is irreducible); whereas the existence and exhaustiveness of the -dimensional irreducible blocks themselves are given by the raising-and-lowering ladder of in Appendix 2 + the double cover (the double cover = in , every two elements map to exactly the same rotation of , to ; see Appendix 2 §4 for details), and do not rely on orthogonality. As for Appendix 5 (Burnside’s theorem), it uses the finite-group version — its proof is built exactly on the first orthogonality relation above (and the column orthogonality relation and algebraic-integer arguments developed from it). (Compare Fulton–Harris, Hall.)
Appendix 2 · The irreducible representations of : spherical harmonics and (odd dimensions)
First, let us be clear about why we fix our eyes on this batch of functions. The main text, §3.2, explained that how many orbitals a subshell can hold is determined by the “representation blocks” of the rotational symmetry acting on electron states, and that the “shape” of each orbital — the of chemistry class — is exactly a set of functions called spherical harmonics . So this batch of functions is not some special functions popping up out of nowhere: they are the actual wave functions of the shapes an electron can occupy in an atom, the concrete carriers of the rotational symmetry acting on electron states.
With this purpose in mind, the route of this appendix is: first set out this batch of functions explicitly (the table + the shapes ), then derive from the raising-and-lowering ladder of the angular momentum algebra why they come in groups exactly, why the size of each group can only be the odd number , and why only the half of the groups with integer falls to . Conventions: in spherical coordinates is the polar angle and the azimuthal angle; the normalization is -orthonormal on the unit sphere, and the phase uses physics’ standard Condon–Shortley convention, so that (). Take (we only count dimensions).
1. The spherical harmonics : an explicit table
| (s) | ||
| (p) | ||
| (d) | ||
| (f) | ||
(In the rows of the table, taking the minus sign for and the plus sign for — the "" — is the expression of the Condon–Shortley phase in the general formula below.) The range of values of in each row is exactly , in all: give functions respectively.
The general closed form and the Legendre functions. The table above was not pieced together term by term — it is generated by one general formula, with the Legendre functions substituted in.
The general closed form of the spherical harmonics ():
Negative is given by conjugation (this guarantees that positive and negative pair up properly when real combinations are taken):
The Legendre polynomials (Rodrigues’ formula — differentiate to order and then normalize):
The associated Legendre functions (): differentiate to order , then attach a factor :
Convention (do not count the phase twice).
The here
does not carry
the Condon–Shortley phase — the phase has already been put into the above. Putting once on each side, in and in , would
double-count it; this series consistently puts it on the side (consistent with the table above).
The table is generated by substitution. Take (so that , since ):
- :
- :
- : , so where .
Every entry for in the table above is generated in this way from by substituting , and agrees term by term with the values in the table. (Compare the appendix of Sakurai, Modern Quantum Mechanics, and Hall.)
2. Real combinations and orbital shapes:
The complex spherical harmonics are eigenfunctions of (carrying ). To see the shapes of the “real orbitals” familiar from chemistry, take real linear combinations (cosine type for , sine type for ):
(From one checks directly that both combinations are real functions.)
- (s orbital, ). There is only a constant, independent of a sphere.
- (p orbitals, ). The three functions, turned into real form, are proportional to : That is, three dumbbells along the three axes .
- (d orbitals, ). The five real combinations are proportional respectively to that is, four four-lobed petal shapes () plus one (two lobes along with a ring around them in the plane). in all.
- (f orbitals, ). In the same way, these give more complicated lobed orbitals.
So the s/p/d/f subshells in the periodic table of the chemical elements hold orbitals respectively, exactly the dimensions of ‘s irreducible representations, () — spatial rotational symmetry directly determines the degeneracy of the subshells. (Compare Sakurai, Hall.)
3. The raising-and-lowering ladder of the angular momentum algebra: the dimension of each irreducible block
Staring directly at the continuous group gives us nothing to grab hold of (it has infinitely many elements). But the representations of a continuous group are completely controlled by its infinitesimal generators and their commutation relations — that is, by its Lie algebra. (“Commutation relations” are about how much two operations differ when their order is exchanged: write ; it measures the difference between “first , then ” and “first , then ”; being equal to means it makes no difference which comes first. Rotations precisely do not commute — turning first about and then about , and the other way round, do not give the same result — and this difference is exactly the content of the relation below.) The generators of are the three angular momentum operators (infinitesimal rotations about the three axes), and their commutation relations are
( = the totally antisymmetric symbol: and its cyclic permutations take , changing sign when any two indices are exchanged, and when an index repeats — it packs the three commutation relations into one line.) This algebra is written ; it is isomorphic to (the same set of commutation relations) — this point is crucial later in Section 4: precisely because the two algebras are the same, and share the same batch of representations, and Section 4 can use to pick: takes in the representations of all , while wants only the integer- half (odd dimensions). An “operation block” (irreducible representation) is a set of states that carries the action of simultaneously and from which no smaller invariant subspace can be split off. We ask: how big can such a block be?
Raising and lowering operators. Instead of , use
((2) is computed directly from (1); compare Sakurai eq. 3.157–3.158.) The first, , is the key: ” raises/lowers the eigenvalue of by ” — if , then
So is either , or a new state with eigenvalue . are operators that climb up and down this “ladder” of eigenvalues of .
They can of course be written as matrices. On a -dimensional block, are concrete matrices. The smallest, (-dimensional), is the cleanest — write the up state and the down state :
The abstract relations above can be checked at a glance: raises the down state to the up state, and raising again gives zero (, exactly the “top of the ladder”, ); does the reverse; and , matching (2). Along the way, let us also write out the Pauli matrices in full (they are exactly the three generators of this block, ):
so and give exactly the two raising and lowering matrices above — the same batch of things as the gauge forces of §3.5 and the that appeared in the short lesson earlier. (Higher work the same way, only the matrices are bigger; in an orthonormal basis each entry is given by the standard formula — note that this differs from the coefficient in (7) for the unnormalized basis, ; the two coincide only at .)
Algebraic classification: the dimension of each finite-dimensional irreducible block is exactly .
Let be a finite-dimensional irreducible representation. has at least one eigenvector over ; let its eigenvalue be some number. Climb upward repeatedly with ((3)), and we get a string of eigenvalues , pairwise distinct. But is finite-dimensional and can have only finitely many eigenvalues — this string cannot go on rising forever, and must hit :
Call this top, annihilated by , the highest-weight state, and write the top eigenvalue as (compare the of Sakurai eq. 3.169). Now generate downward from the top with :
The eigenvalues are again pairwise distinct, and again, because of finite dimension, must terminate: there exists such that
The key computation: to apply repeatedly; from plus (4), induction gives
Example (raising and lowering coefficients, computed on the spot for ). Take (three states , with eigenvalues ). Formula (7), , gives:
The coefficients are both (not ) — this shows that (7) gives unnormalized recursion coefficients; to change to the form of the physics books, ( gives , different from ), just divide each by its own norm.
(Induction: .) Now apply to the zero vector of (6):
and , so necessarily , that is,
This string of states has eigenvalues going all the way from to , in all, mutually distinct and therefore linearly independent; the subspace they span is closed under (and hence the whole algebra). is irreducible this subspace is . Hence
Incidentally: on the whole block (this is the invariant that commutes with all the , called the Casimir; it takes a single eigenvalue on the whole block, which is exactly the mark of “a block that can no longer be taken apart”; symbolic check = we separately verified case by case with symbolic computation; this belongs to the internal verification process and is not a mathematical term — it has been verified here for each in turn).
Completeness (“and this is all of them”). Conversely, for each , the coefficients of (5)(7) can exactly construct a -dimensional representation, and any two irreducible representations of the same dimension are isomorphic, and any finite-dimensional irreducible representation is isomorphic to one of them — this is the content proved rigorously by Hall Thm 4.32 (Sakurai only constructs, and does not prove completeness).
Summary (Section 3): the finite-dimensional irreducible blocks of the algebra have dimensions running exactly through , — that is, dimensions all occur. Note: both odd and even dimensions appear. The algebra alone cannot yet select “only odd dimensions”.
4. The double cover: only integer (odd dimensions ) descends to
is the same algebra, yet they correspond to two different groups: and . The relation between the two is a 2-to-1 double cover
(, these two elements, map to the same rotation — the identity rotation.) A representation of the algebra can always be integrated into a representation of — because is simply connected (simply connected = any closed loop in the space can be shrunk continuously to a point, “there are no holes”; it is exactly what guarantees that every representation of the Lie algebra can be uniquely “integrated” back into a group representation): by the Lie group–Lie algebra correspondence (a privilege of simply connected groups, see Hall §5.7), every representation of is uniquely “integrated” into a group representation of ( is not simply connected and has no such guarantee, which is exactly the reason for the detour through ). This representation can in turn descend to a representation of if and only if it is trivial on the covering kernel , that is,
Computing . is exactly the element “turn by ” (one full turn about any axis: in it is the identity, in it is ). A turn about the axis by , on the spin- block, is , and acting on it gives . By (10), takes , and every differs from by an integer, so is the same for all :
(The symbolic check has verified this one by one for .) Substituting into (12):
So there are two classes, clean and neat: - an integer (, dimension odd): descends to , and is a genuine rotation representation — these are the “operation blocks” under spherical symmetry of §3, corresponding to the spherical harmonics and the orbitals . - a half-integer (dimension even): , it does not descend to , and is a spinor representation exclusive to (a turn by changes the state into its negative, — this is the famous spin-½ sign, experimentally measurable). The smallest, (dimension ), is exactly the electron spin.
Example (the odd/even selection, read off the exponent). Take , with its value on being , and substitute for each : - : , , it does not descend to (the spin-½ spinor, exclusive to ); - : , ( an integer) , it descends to (the 3-dimensional block).
Half-integer gives , integer gives — the odd/even classification is read directly off the exponent . (Symbolic check done.)
This completes the proof of the statement that §3 used without proving: the irreducible operation blocks of are exactly all the odd dimensions (), and nothing else — Section 3 gives “the dimension of a block can only be , and this is all of them”, and Section 4 picks out among them integer = odd dimensions.
5. Another route: counting directly from harmonic polynomials
Put the on the sphere into correspondence with the homogeneous harmonic polynomials in three-dimensional space, and the dimension appears at once.
The space of harmonic homogeneous polynomials. Let
The space of homogeneous polynomials in three variables of degree , , has dimension (the number of monomials with , by stars and bars). The Laplace operator maps homogeneous polynomials of degree to homogeneous polynomials of degree , and this map is surjective — this is a key and nontrivial step, proved as follows: multiplying by gives an injection ; under the Fischer (apolar) inner product , the adjoint of “multiplying by ” is exactly (up to a positive constant), and the adjoint of an injection must be surjective, so is surjective. (Equivalently: the classical decomposition , see Stein–Weiss or Axler–Bourdon–Ramey, Harmonic Function Theory, Ch.5.) By surjectivity and the rank–nullity theorem,
(When the target , is trivially surjective, , giving ; the real content is at .)
Example (for , counting out on the spot). The homogeneous quadratic polynomials in three variables, , have the 6 monomial basis elements , so . The Laplace operator sends them into the space of constants ():
and the image space is the constants (). So the harmonic () part has , and a basis is exactly
(check: ; , all harmonic) — exactly 5, which are exactly, for , the five orbitals, (matching one to one the real combinations of Appendix 2 §2). Here is counted out.
The action of on it. acts on polynomials by . A rotation is a linear transformation and preserves degree; and because is rotation-invariant ( orthogonal, ), it preserves harmonicity. So is a representation of , of dimension .
The correspondence with the spherical harmonics. Restrict the homogeneous polynomials to the unit sphere . The restriction map is injective: a homogeneous polynomial is completely determined by its values on the sphere (). Its image is exactly the space spanned by the spherical harmonics of degree , so
Irreducibility (continuing the raising-and-lowering ladder of Section 3 of this appendix). The are common eigenfunctions of the angular momentum operators. The angular momentum operators here are the same set of generators acting on the integer- block in Section 3 of this appendix (physics books often write them as in the context of orbital angular momentum, ):
Any -invariant subspace is preserved by the Lie algebra generators . Because the eigenvalues of , , are pairwise distinct, one can first use a polynomial in to project any nonzero vector in onto some single eigenfunction ; then applying repeatedly reaches all of . So there is no proper nonzero invariant subspace, and is irreducible. This is the same thing as “the raising-and-lowering ladder has only one rung-string, of length ” in Section 3 of this appendix.
Conclusion: is the dimension of this irreducible representation of , and labels an orthonormal basis of it.
6. The three smallest cases (bringing the abstract down to earth)
- (dimension ): the trivial representation, . A scalar that does not change however it is turned — the orbital (spherically symmetric).
- (dimension ): (the Pauli matrices). , it does not descend to — the spinor exclusive to = the electron spin. It is the origin of the in “each orbital ×2” of §3, and also where the thread buried in §2, ” double-covers ”, is made good.
- (dimension ): , it descends to — this is the first genuine rotation block of beyond the scalars, the apparatus of “turning a vector” in ordinary three-dimensional space (), corresponding to the orbitals.
7. Back to §3: stand on a foundation
The subshell capacities counted out in the main text of §3,
now both have rigorous sources for their two factors: the odd dimension = ‘s integer- irreducible blocks [Sections 3 + 4 of this appendix]; the factor = ‘s spinor (the electron spin, the Pauli exclusion item of §3). “The orbitals that can hold electrons, the orbitals, exist because has a -dimensional operation block” — this is exactly the block selected by (14): for , the integer- odd-dimensional block.
Appendix 3 · Deriving the electron’s spin ½ from the Dirac equation
§3.3 used “the electron has spin ½” as a conclusion. Here we prove
why, physically,
the electron realizes it — relativity + a first-order wave equation
derive
a 4-component spinor field whose rotation generators are exactly (compare Peskin, An Introduction to QFT, §3.2 eq 3.22/3.23/3.25/3.27; the proof in the text is self-contained). The interface with
Appendix 2
: there (Appendix 2) we prove “spin ½ exists as a representation” (the spinor, which does not descend to ); this appendix proves “the electron is exactly it” — the turn by of §5 matches exactly (13) of Appendix 2, and the two foundations join up.
Take natural units , and the metric .
1. Relativity + first order: the shape of the Dirac equation
The non-relativistic Schrödinger equation is first order in time and second order in space — time and space are not on an equal footing, and it does not satisfy relativity. The most direct relativistic equation is Klein–Gordon:
(Notational conventions: the index runs over the four spacetime components ; is the partial derivative with respect to the -th coordinate; an index repeated up and down in the same term is summed by default (the Einstein convention), for example ; upper and lower indices are exchanged using the metric .) It comes from the relativistic energy–momentum relation . But it is second order in time, which historically brought the trouble of “the probability density is not positive definite”. Dirac’s idea: find a relativistic equation that is first order in time (and hence in all ). First order, linear in the components, and also Lorentz covariant (Lorentz transformations = the transformations of spacetime coordinates between different inertial frames in special relativity, including spatial rotations and velocity boosts; covariant means the equation keeps its form under these transformations) — the most general way of writing it is to introduce a set of constant matrices :
Here we do not yet know how many components has, nor what size of matrix is — below, these are derived from self-consistency.
2. Self-consistency derives the Clifford algebra
The hard constraint of relativity has not changed: every component of must still satisfy the energy–momentum relation, that is, satisfy Klein–Gordon (1). How do we derive (1) from (2)? Multiply (2) from the left by the operator :
is symmetric in , so only the symmetric part of contributes: . For (3) to come back exactly to Klein–Gordon (1) (that is, ), we must have
This is the Clifford algebra (Peskin eq. 3.22). It is not an assumption; it is derived from the two requirements “first order + relativity”: the must pairwise anticommute, with and .
3. The smallest solution is 4×4: so has 4 components
How big must satisfying (4) be at least? We need four matrices that pairwise anticommute, one squaring to and three squaring to . (ordinary numbers) obviously will not do (numbers all commute). is not enough either: among matrices there are at most three that mutually anticommute (exactly the Pauli matrices ), and four cannot be put together. The smallest matrices that can accommodate four are . A standard choice is the Weyl (chiral) basis (Peskin eq. 3.25, in blocks):
(Substitute into (4) and a check shows it holds — the symbolic check has verified all 16 .) So the in (2) must be an object with 4 components — it is not a scalar, nor an ordinary vector; it is a new kind of thing, called a Dirac spinor. “Why 4” now has an answer: is the smallest faithful dimension of the Clifford algebra in dimensions (faithful = different elements are assigned different matrices, that is, the representation is injective and does not squash information).
Example (checking the Clifford algebra by hand). Take a few pairs from the Weyl basis of (5), and in blocks check directly (using and ):
- : , so () ✓
- : , so () ✓
- (time–space mixed): , , sum () ✓
- (space mixed): each block gives (Pauli anticommutation), so ✓
All four kinds (time–time, space–space, time–space, space–space) hit. All sixteen are computed this way one by one (the symbolic check has done all ); it is clear that the set of in (5) really does satisfy the Clifford algebra of (4) — the two requirements “first order + relativity” force into this anticommuting form.
4. Rotation generators = : spin ½ drops out
How do the 4 components of change under Lorentz transformations (including rotations)? The uniquely fix a set of generators (Peskin eq. 3.23):
(In the formula, are antisymmetric transformation parameters: the independent components are exactly rotation angles + boosts, analogous to, in , the angle .) We care only about the few for spatial rotations, that is, (). Substitute (5) and compute directly (the symbolic check verified each one):
Example (spin ½ really drops out: computing ). Use the Weyl basis (5) to compute directly the spatial rotation generator . Here (that is, the block that appeared above when checking Clifford anticommutation) together with (so ) gives
That is, the generator of rotation about the axis is , with eigenvalues (each twofold) — spin ½ computed out on the spot, each copy being exactly the of Appendix 2 (Pauli ). (Symbolic check done.)
(Peskin eq. 3.27.) That is to say, the generator of rotation about the -th axis is exactly . Recognizing it as angular momentum, the spin operator is
Three things together nail it down as “spin ½”: - They satisfy the angular momentum algebra: (and cyclically) — so the really are a set of angular momenta (a representation of ), not a name given at random. - Casimir: — corresponding to the spin quantum number . - Eigenvalues of : , eigenvalues (each twofold). are the two spin states (up / down); the twofold multiplicity of each eigenvalue comes from the two chiral copies, left- and right-handed, , into which the 4-component spinor splits under rotation (each copy being one , see §5). (Chirality and “particle / antiparticle” are two different things — the latter comes from the positive- and negative-frequency solutions in field quantization, see Peskin from §3.3 on; this appendix does not unfold it.)
This completes the proof that “the electron has spin ½”: as long as the electron is a field satisfying a relativistic, first-order wave equation, it is necessarily a 4-component Dirac spinor, whose rotation generators , that is, spin . Spin is not an assumption added from outside — it is a compulsory product of relativity + quantum mechanics.
5. Joining up with Appendix 2: the Dirac spinor is the physical realization of that of Appendix 2
Under pure rotations, the of (7) is block-diagonal — the 4-component spinor splits into two copies of 2 components each, each copy transforming under rotation by , exactly the representation of in Appendix 2. Test it with the cleanest mark — a full turn by :
A turn by changes the spinor into its negative — this is exactly what formula (13) of Appendix 2, , gives at : (and exactly the line of §2, ” double-covers ”). The two foundations join up here: Appendix 2 proves from symmetry that “this spin-½ representation exists and changes sign under a turn by ”, and this appendix proves from relativity that “the electron field is exactly it”.
6. Back to §3.3
The electron, as a relativistic spin-½ particle, has exactly and only two spin states, — this is the origin of the factor in “each spatial orbital ×2” of §3.3 (foundation = this appendix). Both factors of the subshell capacity of §3 have now come down to earth: the odd dimension comes from Appendix 2 (‘s integer- representations), and the factor comes from this appendix (the electron’s spin ½ = ‘s ).
On to the next piece (Appendix 4): this appendix proved that the electron
is
spin ½, but “spin ½ ⟹ necessarily a fermion ⟹ Pauli exclusion (two electrons cannot occupy the same state, so each orbital is filled by at most this many)” is
another theorem
—
the spin–statistics theorem, whose complete derivation is in
Appendix 4
(full proof for the electron + an honest outside citation for the general case).
Appendix 4 · From spin ½ to fermions and Pauli exclusion
§3.3 used “the electron is a spin-½
fermion, obeying
Pauli exclusion
” as a conclusion. Appendix 3 has already proved “the electron
is
spin ½”; this appendix supplies ”
spin ½ ⟹ fermion ⟹ Pauli
”.
Two levels of depth:
the electron version (full proof)
— quantization of the spin-½ Dirac field
can only use anticommutators
(compare Peskin §3.5);
the general version (honest outside citation)
— any half-integer spin ⟹ fermion (the spin–statistics theorem; its complete proof belongs to axiomatic QFT, citing Streater–Wightman / Duck–Sudarshan, the same boundary as for Burnside / Artin / Kummer).
Take .
1. Quantizing the electron field
Appendix 3 gave the Dirac field (4 components, spin ½). Treat it as a quantum field and expand it in momentum modes (Peskin eq. 3.87, schematically):
creates particles (electrons), creates antiparticles (positrons), . Only one question is left: should satisfy commutation relations (bosonic) or anticommutation relations (fermionic)? This is not a free choice — as we will see below, only one choice is self-consistent.
2. Using commutators: the energy has no lower bound (the vacuum collapses)
Substitute into the Hamiltonian (the Hamiltonian = the operator of the system’s total energy, whose eigenvalues are the energies; below, saying it “has/has no lower bound” means whether the energy can fall without limit, whether there is a lowest-energy state (the vacuum)), and we get (the structure of Peskin eq. 3.90)
Note that in front of the antiparticle term there is a minus sign. Now try the bosonic commutator , that is, , and substitute:
is the number of antiparticles, which can take with no upper bound; in front of it is a minus sign — for every additional antiparticle put in, the energy drops by , and it can keep dropping to . The Hamiltonian has no lower bound, there is no lowest-energy state (vacuum), and the whole theory is not self-consistent. Bosonic quantization, for a spin-½ field, does not work.
3. Switching to anticommutators: the energy has a lower bound (fermions)
Change to the fermionic anticommutator , that is, , and substitute into (2):
The minus sign is turned into a plus sign by the anticommutator’s . Now , is bounded below and positive definite above a constant, and a stable vacuum exists. Self-consistent. Conclusion: the spin-½ Dirac field can only be quantized with anticommutators — it must be a fermion. This is the electron version of the spin–statistics theorem: spin-½ anticommutation fermion. (For the same energy signs as (3)/(4), the symbolic check computed with a single mode: anticommutation gives , bounded below; commutation gives , not bounded below.)
Example (computing the sign flip of the energy with a single mode). Take a single antiparticle mode ; its contribution to the Hamiltonian is (that minus sign of the antiparticle term of (2)), : - Bosonic (): contribution , with no upper bound energies dropping all the way to , no lower bound (the vacuum collapses). - Fermionic (): contribution , energies , bounded below — the minus sign is turned into a plus sign by the anticommutation’s .
The same minus sign: commutation gives , anticommutation gives something bounded — this is the arithmetic kernel of why a spin-½ field can only anticommute. (Symbolic check done.)
4. Anticommutation ⟹ Pauli exclusion
The fermionic anticommutator gives its sharpest consequence on a single mode. In the quantization of (4), take , that is,
“Create an electron with momentum and spin ” applied twice — into the same quantum state, a second electron cannot be squeezed. Equivalently, the eigenvalues of each mode’s occupation-number operator are only or (verified by the symbolic check): a state is either empty or holds one electron, there is no third possibility. This is exactly the Pauli exclusion principle.
Example (a realization of a single-mode fermion + the two-electron Slater determinant).
(i) One mode can hold only or . The Fock space of a single mode has just two states ; take , and in this basis
Check three things directly: ✓; ✓; occupation number — the eigenvalues are only ; a state is either empty or holds one electron, there is no third possibility.
(ii) The antisymmetry of two electrons = the Slater determinant. Two electrons in the single-particle states : the total wave function of identical fermions must be antisymmetric (it changes sign when the two electrons are exchanged), and it is written exactly as a Slater determinant:
The key: if the two electrons want to occupy the same state, , the two columns of the determinant are the same — the wave function is identically zero, and this state does not exist at all. This is the wave-function version of Pauli exclusion, and it and the of (i) are two ways of saying the same thing.
Compare bosons, : the eigenvalues of are with no upper bound — any number of bosons can crowd into one state (photons can pile up without limit, which is how the laser comes about). The fermions’ “at most one per state” and the bosons’ “unlimited per state” are divided exactly by anticommutation vs commutation, and that in turn is decided by whether the spin is half-integer / integer.
5. The general version (honest outside citation)
The above is the full proof for the electron (the spin-½ Dirac field). Generalizing it to any spin gives
The spin–statistics theorem.
In a quantum field theory satisfying relativistic invariance, microcausality (fields at spacelike separation commute/anticommute) and positive-definite energy:
fields of integer spin must commute (bosons), and fields of half-integer spin must anticommute (fermions).
Its complete rigorous proof has to call on the whole machinery of axiomatic QFT — the Wightman axioms, the analytic continuation of Wightman functions, the PCT theorem — which is an entire graduate course, and this appendix does not unfold it. Following this series’ established boundary of honesty, a precise statement + the source noted: Streater–Wightman, PCT, Spin and Statistics, and All That; and the accessible yet rigorous monograph Duck–Sudarshan, Pauli and the Spin-Statistics Theorem. (This is in the same tier as the treatment of Burnside in §3 and of Artin and Kummer in §4/§5: take the conclusion, give the source, do not reprove it in the main text.)
6. Closing §3.3
The three foundations together make the statement of §3.3, “the electron is a spin-½ fermion, obeying Pauli exclusion”, come fully down to earth for the electron: - Appendix 2: the operation blocks of can only be odd-dimensional, (the spherical harmonics ). - Appendix 3: relativity + a first-order equation (Dirac) derive that the electron is spin ½ (‘s ) — each spatial orbital carries spin states. - Appendix 4 (this one): spin ½ ⟹ anticommutation ⟹ fermion ⟹ at most one electron per quantum state (Pauli).
So an subshell has spatial orbitals, each orbital spin states, mutually distinct single-electron states in all; Pauli says at most one electron per state, so this shell, filled, holds exactly
The widths of that periodic table of the elements of §3 now have all three foundations firmly tamped down — from the representation theory of the continuous rotation group , to the spin of the relativistic electron, to the Pauli principle of spin–statistics, with not one gap left.
Appendix 5 · Burnside’s theorem: the order of a non-abelian simple group contains at least 3 primes
§4 used a law of shape:
the order of a non-abelian simple group must be divisible by at least 3 distinct primes
(so the two smallest atoms of EP3, and , stand exactly on the lower bound), and at the time treated it as an
honest outside citation
. Here we
prove it in full
— it is equivalent to
Burnside’s theorem
(a group whose order is divisible by only 1 or 2 primes is necessarily solvable).
Depth (full proof): of the same nature as §4 borrowing Bézout —
we borrow the general toolbox of character theory
(orthogonality relations + algebraic integers, citing D&F §15.3/§18.3 and Isaacs Ch2–3), but
prove Burnside itself in full
(compared formula by formula with D&F §19.2).
(What follows is a purely group-theoretic foundation — Appendices 2/3/4 are physics, this appendix is mathematics. First, the group-theory terms that recur in this appendix: a simple group = a group with no normal subgroup other than and itself (“cannot be broken apart”); a normal subgroup = a subgroup satisfying , equivalently the kernel of some group homomorphism; a solvable group = a group for which there is a normal series whose successive quotient groups are all abelian (intuitively, “it can be taken apart layer by layer into abelian blocks”).)
0. The borrowed toolbox (cited, not reproved here)
The following are standard results of a chapter on character theory, which this appendix takes and uses (just as §4 takes and uses Bézout): 1. Orthogonality relations: row, ; column (the second orthogonality relation): for , if , otherwise . ( = the subgroup made up of all group elements that commute with , called the centralizer of ; its index — in general the index of a subgroup is , the number of cosets of — is exactly the size of the conjugacy class containing .) 2. Degrees divide the group order: divides . 3. Algebraic integers: roots of some monic polynomial with integer coefficients. Properties — roots of unity are algebraic integers; the algebraic integers form a ring; the algebraic integers in ; Kronecker’s theorem — if all the Galois conjugates of an algebraic integer (the Galois conjugates of = the other roots of the same minimal polynomial (monic, integer coefficients) as ) have absolute value , then it is either or a root of unity. 4. Character values are algebraic integers: is a sum of roots of unity (the representation matrix has finite order, is diagonalizable, and its eigenvalues are roots of unity), so , and is an algebraic integer.
1. The central characters are algebraic integers (D&F Prop 4)
For a class , take the class sum . It commutes with all (conjugation only permutes ), so by Schur’s lemma is a scalar; taking the trace gives
Multiplying two class sums, , with structure constants (counting “how many pairs of elements multiply to land in ”). Substituting the scalar relation gives — this shows that the subring spanned by is a finitely generated -module, so each is an algebraic integer.
2. Lemma A: on a coprime class, or acts as a scalar
Lemma A.
Let , , and let the class satisfy , . Then
either , or (that is, is a scalar matrix)
.
Proof. By (1), is an algebraic integer (§1); is also an algebraic integer (§0.4). , so by Bézout take integers with ; then
is an integer combination of two algebraic integers, and is still an algebraic integer. Write . is a sum of roots of unity, so ; each of its Galois conjugates likewise has the form “a sum of roots of unity ”, and is also . By Kronecker, or is a root of unity. In the former case ; in the latter , that is, ‘s root-of-unity eigenvalues are all equal, and is a scalar.
Example (seeing the integrality of central characters on ). Take ‘s 2-dimensional standard representation (values , transpositions , three-cycles , that is, the character table in Appendix 1 Section 3). The central character () on the two nontrivial classes:
Both are integers (and hence algebraic integers) — exactly what ” is an algebraic integer” of §1 looks like. By contrast: taking directly on the three-cycle class gives , not an integer. So the quantity in Burnside’s argument whose integrality can be guaranteed and which can be pressed into use is the one carrying the class-size factor , namely , and not the bare — this one-step difference is exactly the fulcrum of the whole proof.
(Symbolic check: ‘s two-dimensional standard representation , transposition class of size , → ; whereas the three-cycle class has size , is not coprime, and is not an algebraic integer — showing that coprimality is the key to Lemma A.)
3. Lemma B: a nontrivial class of prime-power size exists ⟹ not a non-abelian simple group (D&F Lemma 7)
Lemma B.
If has a
non-identity
conjugacy class with ( prime, ), then has a proper normal subgroup (),
and so is not a non-abelian simple group
.
Proof. Take (). The second orthogonality relation comparing column with column (): . The trivial character contributes , so
Suppose, to the contrary, that every nontrivial irreducible satisfies ” or ”. Then every nonzero term on the left of (2) has , that is, , so is an algebraic integer; but , contradicting “the algebraic integers in ”.
So there exists a nontrivial with and . Then , and by Lemma A, since , is a scalar. Then: - If is faithful (): scalar ⟹ commutes with everything in ⟹ ⟹ the class has size , contradicting . - So is not faithful: is a normal subgroup, (not faithful), ( nontrivial).
Either way, has a proper normal subgroup and is not a non-abelian simple group.
(Symbolic check: has prime-power classes of sizes → cannot be simple ( normal); has prime-power classes of sizes → cannot be simple ( normal); the nontrivial classes of have sizes , not one of which is a prime power → Lemma B cannot touch it, and gets to be a simple group — and this string of sizes is exactly EP3’s .)
4. The main theorem: solvable
Burnside’s theorem.
A finite group whose order is divisible by only one or two distinct primes is solvable.
Proof (by induction on ). When or a prime power: groups of prime-power order are nilpotent (a nilpotent group = a class of groups stronger than “solvable”; all groups of prime-power order (-groups) are nilpotent, and nilpotent implies solvable; only this one implication is used here), nilpotent ⟹ solvable, and it holds. Let (, otherwise it is a prime power and we are done). Take a Sylow -subgroup (a Sylow -subgroup = a subgroup of order exactly (the highest power of in ), the subgroup stuffed fullest with “the part”); the center of a -group is nontrivial, so take , . Then , so the class size
is a power of . Two cases: - : then , and is a proper normal subgroup (when is non-abelian, ; if is abelian it is directly solvable). - : by Lemma B, has a proper normal subgroup .
Either way, has a proper normal subgroup . and ( = the quotient group obtained by treating the normal subgroup as a whole as the identity element, of order ) both divide (still primes), and by the induction hypothesis both are solvable; “subgroup and quotient solvable ⟹ group solvable” (a small fact used in §5), so is solvable.
Example (the main theorem in the forward direction: is solvable). The main theorem says (at most two primes) solvable. Take (, two primes): the theorem predicts it is solvable, and indeed there is a normal series whose successive quotients are all abelian:
where is the Klein four-group, normal in . The three quotients are all abelian is solvable — exactly what the main theorem guarantees when contains only two primes. (Compare the orders of those non-abelian simple groups of §4, which all contain primes: simple and non-abelian not solvable by the contrapositive of the main theorem, the order cannot be . The two directions close up here.)
5. Closing: back to the ” primes” of §4
Take the contrapositive: a non-abelian simple group (not solvable, and cannot be broken apart) cannot be of the form , that is, its order must be divisible by at least distinct primes. So the two smallest non-abelian simple groups of EP3 sit exactly on the lower bound:
both with exactly primes, not one fewer. In EP3’s “periodic table of non-abelian simple groups ”, , each has kinds of primes — Burnside’s law of shape is now proved in full from the toolbox.
6. Boundary update
After Appendix 5, the Burnside of §4 is upgraded from “honest outside citation” to “full proof” (borrowing only the general toolbox of character theory, without citing the conclusion itself from outside). The honest outside citations remaining in the whole of §3/§4/§5 are then only three, of pure field theory: Artin’s theorem, the Kummer converse [Lagrange resolvents], and the normal closure of a radical extension is still radical. The four physical/mathematical foundations (Appendix 2, representations of the rotation group · Appendix 3, Dirac spin ½ · Appendix 4, spin–statistics and Pauli · Appendix 5, Burnside) are now all firmly tamped down.
Sources
- Ronan, Symmetry and the Monster, Ch5–7 (narrative skeleton)
- Mathematics: Dummit–Foote, Abstract Algebra, 3rd ed. (§3.2 cosets/Lagrange · §7–9 rings and fields · §14.3 finite fields · §19.2 Burnside p^aq^b); Carter, Visual Group Theory (SO(3)/intuition for representations)
- Lie biography: MacTutor https://mathshistory.st-andrews.ac.uk/Biographies/Lie/ · Helgason “Sophus Lie, the mathematician” (MIT OCW 18.755) · review of the Stubhaug biography https://plus.maths.org/content/mathematician-sophus-lie
- The spy affair / the Franco-Prussian War: Quanta 2025-12 https://www.quantamagazine.org/what-are-lie-groups-20251203/ · Franco-Prussian War https://en.wikipedia.org/wiki/Franco-Prussian_War
Image sources
- Historical material · all public domain: Sophus Lie · Galois (portrait at 15) · Lie 1888, Theory of Transformation Groups · Lie’s 1893 preface · J. C. Dahl, Winter at the Sognefjord (1827) · hydrogen orbital density clouds (PoorLeno, 2008).
- Portraits of the five who took up the baton: Felix Klein (PD-1923) · Wilhelm Killing (photographed 1870, Atelier Aug. R. Rosenberg, Kunstbibliothek SMB) · Élie Cartan (PD-US) · Leonard Dickson (MacTutor History of Mathematics archive) · William Burnside (Copyrighted free use).
- Paul Dirac: © Nobel Foundation, 1933 (public domain).
- Animations: SO(2) rotation · Killing–Cartan periodic table · the E₈ wall · electron shells 2·6·10·14 · clock arithmetic — all original animations made for this film (Manim).
- People: Klein https://www.britannica.com/biography/Felix-Klein · Killing https://mathshistory.st-andrews.ac.uk/Biographies/Killing/ · Cartan https://mathshistory.st-andrews.ac.uk/Biographies/Cartan/ · Dickson https://en.wikipedia.org/wiki/Leonard_Eugene_Dickson · Burnside https://en.wikipedia.org/wiki/Burnside%27s_theorem
- Quotations: Dieudonné 1974 (carried in both the Stubhaug biography pp.375-377 + Ronan’s endnotes) · Brahmagupta (Colebrooke 1817 djvu) · Picard is actually Lie→Picard (Fritsche 1992 https://www.heldermann-verlag.de/jlt/jlt02/FRITPL.PDF)