10:54in productionCh. 1 · The end of the radical dream/ 10:54 · ceiling 15 min
Computing & AI · Physics
Évariste Galois
Galois didn’t just solve an old problem — he invented the language to say why some problems can’t be solved at all.
Galois defined solvability by radicals in terms of group structure — not calculation. He introduced normal subgroups, solvable groups, and finite fields. His results are exact, general, and still operative. They do not extend to algorithms, numerics, or physics. His work matters because it draws a permanent line between what is algebraically decidable and what is not.
He solved a 350-year-old problem — not by computing more, but by redefining what 'solving' means.
3:05
The group is the equation
Solvability depends not on the coefficients, but on the symmetry of the roots’ permutations.
4:52
Tools before theory
Normal subgroups and finite fields weren’t applications — they were the first tools forged for the new algebra.
7:13
Two separate breakthroughs
His continued-fraction result is self-contained, exact, and unrelated to group theory — proof he worked across domains.
Worth your time?
Yes. Study the whole thing.
4.5/ 5
What works
group-theoretic solvability criterion
definition of normal subgroups
introduction of finite fields
mirror-image theorem for quadratic surd continued fractions
What does not
experimental validation
numerical computation
physical application
algorithmic implementation
Study it if
computer scientists
cryptographers
algebraists
Skip it if
physicists
biologists
engineers without algebraic modelling needs
The written brief1 min read
What the work claims
A polynomial equation is solvable by radicals if and only if its Galois group is solvable. A reduced quadratic surd and the negative reciprocal of its conjugate have purely periodic continued fractions whose repeating blocks are mirror images. Finite fields and normal subgroups were introduced as foundational algebraic objects.
How it was done
Galois related solvability of polynomial equations to the structure of a group of permutations of their roots — the Galois group — and introduced proper decomposition of groups, leading to the definition of normal subgroups.
What holds up
His necessary and sufficient condition for solvability by radicals holds. His characterisation of solvable groups via nested normal subgroups with abelian quotients holds. His mirror-image theorem for continued fractions of reduced quadratic surds holds. His introduction of finite fields and normal subgroups holds.
What does not
The sources do not report any experimental validation, numerical computation, or application to physical systems. Nothing is said about computational complexity, algorithmic implementation, or extension beyond polynomials and quadratic surds.
Why it matters beyond the lab
These ideas define the boundary between what can and cannot be computed algebraically — a distinction that shapes modern computer algebra, error-correcting codes, and cryptographic protocols built on finite fields.
Is it worth your time
Yes. His criteria remain the definitive test for radical solvability, and his definitions underpin modern algebra, cryptography, and coding theory.