Burnside lemma says that ∣Orb(G)∣≡1/∣G∣∑g∈Gfix(g)|Orb(G)| \equiv 1/|G| \sum_{g \in G} fix(g). We prove this as follows:

∑g∈Gfix(g)=∑g∈G∣{x:g(x)=x}∣=∣{(g,x):g(x)=x}∣=∑x∈X∣{x:g(x)=x}∣=∑x∈XStab(x) \begin{aligned} &\sum_{g \in G} fix(g) \\ &= \sum_{g \in G} |\{x : g(x) = x \}| \\ &= |\{(g, x) : g(x) = x \}| \\ &= \sum_{x \in X}|\{x : g(x) = x \}| \\ &= \sum_{x \in X} Stab(x) \end{aligned}
=∑x∈XStab(x)=∑x∈X∣G∣/∣Orb(x)∣=∣G∣∑o∈orbits∑x∈o1/∣o∣=∣G∣num.orbits \begin{aligned} &= \sum_{x \in X} Stab(x) \\ &= \sum_{x \in X} |G|/|Orb(x)| \\ &= |G| \sum_{o \in orbits} \sum_{x \in o} 1/|o| \\ &= |G| \texttt{num.orbits} \\ \end{aligned}

So we have derived:

∑g∈Gfix(g)=∣G∣num.orbits1/∣G∣(∑g∈Gfix(g))=num.orbits \begin{aligned} &\sum_{g \in G} fix(g) = |G| \texttt{num.orbits} \\ &1/|G| (\sum_{g \in G} fix(g)) = \texttt{num.orbits} \\ \end{aligned}

If we have a transformation that fixes many things, ie, fix(g)fix(g) is large, then this gg is not helping "fuse" orbits of xx together, so the number of orbits will increase.