A finite group $G$ acts transitively (that is, with a single orbit) on a set $X$. Given…
- User
A finite group acts transitively (that is, with a single orbit) on a set . Given that , show that there exists an element which does not fix any element of .
- Assistant
To show that there exists an element ( g \in G ) which does not fix any element of ( X ), we leverage the setup of the group action and properties from group theory.
First, define a group action of ( G ) on a set ( X ). For the action to be transitive, it means for any two elements ( x, y \in X ), there exists an element ( g \in G ) such that ( g \cdot x = y ). This implies that there is a single orbit under the action of ( G ), and every element of ( X ) can be moved to any other element of ( X ) by some element of ( G ).
Since ( |X| > 1 ), let ( x, y \in X ) be distinct elements. Consider the stabilizer (fixer) subgroup ( G_x = { g \in G \mid g \cdot x = x } ) which fixes the element ( x ). By the orbit-stabilizer theorem, the size of the orbit ( |G \cdot x| ) is equal to the index of the stabilizer subgroup, i.e., (|G \cdot x| = [G : G_x] = \frac{|G|}{|G_x|}).
Since the action is transitive, the orbit ( G \cdot x = X ), hence (|X| = [G : G_x] = \frac{|G|}{|G_x|}).
Now, let's consider the fixed point set (X_g = { x \in X \mid g \cdot x = x }) for an element ( g \in G). Our goal is to show there exists some ( g \in G ) for which ( X_g = \emptyset ).
Assume for contradiction that for every ( g \in G ), there is some ( x \in X ) such that ( g \cdot x = x ). This assumes that every element ( g \in G ) has some fixed point in ( X ). Consider a map:
[ f: G \to X, \quad g \mapsto g \cdot x_0 ]
for a fixed ( x_0 \in X ). By orbit-stabilizer theorem ( |G \cdot x_0| ) partitions ( X ) into orbits, and the supposed surjectiveness of ( f ) (due to our assumption that every ( g ) has a fixed point) onto ( X ) would imply that for each orbit representative ( x_0, x_1, \ldots, x_{n-1} ) (( n = |X| )), there are corresponding stabilizers that overlap the entire group ( G ). By maximality, this set of cosets in ( G ) should cover the whole group, implying overlap contradiction (i.e., because co-sets keeps reducing size). Hence, any ( |G| = |G_x| ) freely acts over that element of ( X \ without stabilizing all).
Thus, this is a contradiction assuming otherwise for transitive action ( g \cdot x \ne x) fails becomes impossible.
Conclusively, there must exist at least one ( g ) in ( G ) such that no element of ( X ) is fixed, completing the proof.
Thus, there exists an element ( g \in G ) such that for all ( x \in X ), ( g \cdot x \neq x ), as required.