For a finite group action, the number of orbits is the average number of points fixed by a group element. The point is to make the formal expression readable enough to audit line by line.
Set-up
A permutation in \(S_n\) is best read through its disjoint cycle type. Group actions then translate algebra into orbits \(Gx\), stabilisers \(G_x\), and fixed-point counts.
The first display fixes the mathematical data. I label it \(\mathsf{data}\) mentally, while the next is the \(\mathsf{claim}\); the bridge between them is the displayed \(\Longrightarrow\), not an automatic implication.
The calculation
Now evaluate one representative case. The result should agree with the structural law above, but it is obtained without assuming the conclusion.
What survives abstraction
A good test for understanding is to change the presentation while keeping the invariant fixed. The aligned form makes that comparison unusually easy.
The boundary
Cycle notation suppresses fixed points, so the ambient symmetric group still matters. The cycle \((1\,2\,3)\) in \(S_3\) and in \(S_8\) has different centralisers.
The result is compact enough to reuse without pretending that the caveat has disappeared. The worked line remains the quickest consistency check.