Abstract Algebra
Abstract algebra studies operations stripped to their axioms. A group is the leanest of them — a set with one associative operation, an identity, and inverses — and this modest package already captures the mathematics of symmetry.
The first examples are the symmetries of a shape. Rotate a polygon and it lands on itself; reflect it and it does too. Compose those moves and you get a group — cyclic when only rotations count, dihedral once reflections join in.
Structure is enforced by subgroups. A subgroup sits inside a group and splits it into cosets — translated copies, all the same size — so the order of any subgroup must divide the order of the whole. That single counting fact, Lagrange's theorem, constrains what groups can even exist.
To compare groups you use homomorphisms: maps that respect the operation. Their reach is measured by the image, their collapse by the kernel, and the two are tied together by the isomorphism theorems — a quotient by the kernel is a faithful copy of the image.
Layer a second operation on and you get rings and fields — the axioms behind arithmetic. Polynomials, integers, and matrices are all rings; fields are where division always works, and their extensions are the setting for Galois theory.
The finite structures reveal themselves in their Cayley tables. Every row and column is a permutation of the elements — a Latin square — which is just invertibility made visible.
The payoff is Galois theory, which pins field extensions to groups of symmetries and settles classical questions — why the general quintic has no formula in radicals, why some angles cannot be trisected by compass and straightedge.
Learn the axioms once and the same skeleton appears everywhere: in number theory, in geometry, in cryptography, in the symmetries of physics. Abstract algebra is the grammar those subjects are written in.