At good primes, the degrees of irreducible factors give the cycle lengths of a Frobenius element. I want the notation, the mechanism, and the failure mode visible at the same time.
Set-up
For a separable polynomial \(f\in K[x]\), the Galois group permutes its roots faithfully. Factorisations, discriminants, and resolvents constrain the resulting subgroup of \(S_n\).
There are two layers here: the object \(\mathsf D\) and the law \(\mathsf C\). Writing them separately makes the direction of \(\Longrightarrow\) visible and keeps an accidental converse from slipping in.
The calculation
The middle display is intentionally dense: it is where signs, bounds, multiplicities, or normalising factors are most likely to be lost.
What survives abstraction
The compact alignment is a local map of the argument: assumptions on the first row, consequence on the second. Any generalisation must preserve that dependency.
The boundary
A discriminant square distinguishes containment in \(A_n\), but it usually does not determine the entire Galois group by itself.
This is enough machinery for one note: an exact object, a worked case, a structural law, and a clearly marked boundary. Each layer can now be tested independently.