|Orbit(s)| = |G| when action is fixed-point free

  • Thread starter Mr Davis 97
  • Start date
In summary, we are trying to prove that if a finite group ##G## has a fixed-point free action on a set ##S##, then for any element ##s\in S##, the orbit of ##s## under ##G## has the same number of elements as ##G##. By exhibiting a bijection between ##G## and the orbit of ##s##, we can conclude that both sets have the same number of elements. This is a useful formula for finite groups, known as the orbit-stabilizer theorem.
  • #1
Mr Davis 97
1,462
44

Homework Statement


Prove that if ##G## is a finite group and the action of ##G## on ##S## is fixed-point free, then for any ##s\in S## we have ##| \operatorname{Orbit}_G(s)|=|G|##.

Homework Equations

The Attempt at a Solution


We are trying to show that two finite sets have the same number of elements. By set theory, this means that we must exhibit a bijection between the two sets.

Let ##s \in S##, and consider the following map: ##\phi : G \to \operatorname{Orbit}_G(s)## such that ##\phi (g) = g \cdot s##.

This map is injective: Let ##a,b \in G## and suppose that ##\phi (a) = \phi (b)##. Then ##a \cdot s = b \cdot s##. But then ##b^{-1} \cdot (a \cdot s) = b^{-1} \cdot (b \cdot s) = (b^{-1} b) \cdot s = e_g \cdot s = s##. So ##(b^{-1} a)\cdot s = s##. However, the action is fixed-point free, meaning that ##b^{-1} a = e_G \implies a = b##.

This map is clearly surjective: Since every element in the codomain is of the form ##g \cdot s## and since we can always choose ##g## such that we get ##g \cdot s## back, ##\phi## maps to every element in the codomain.

Since ##\phi## is a bijection between ##G## and ##\operatorname{Orbit}_G(s)##, we conclude that ##|\operatorname{Orbit}_G(s)|=|G|##.
 
Physics news on Phys.org
  • #2
Looks o.k. The general formula (standard and very useful) is (for finite groups)
$$
|G|=|G.x|\cdot |G_x| \text{ where } G.x=\operatorname{Orbit}_G(x) \text{ and } G_x=\operatorname{Stab}_G(x) = \operatorname{Fix}_G(x)=\{\,g\in G \,|\,g.x=x\,\}
$$
The fixed points form a subgroup which is called stabilizer of ##x##. The proof is basically the same, only that we don't have injectivity and thus cosets ##G/G_x## instead.
 
  • Like
Likes Mr Davis 97

FAQ: |Orbit(s)| = |G| when action is fixed-point free

1. What does the equation "|Orbit(s)| = |G| when action is fixed-point free" mean?

The equation means that the number of orbits, denoted by |Orbit(s)|, is equal to the number of elements in the group G, denoted by |G|, when the action of the group on a set is fixed-point free.

2. What is the significance of a fixed-point free action in this equation?

A fixed-point free action means that no element in the group G maps to itself, or in other words, the action of the group does not have any fixed points. This is important because it allows for a one-to-one correspondence between the elements in the group and the orbits, resulting in the equation |Orbit(s)| = |G|.

3. How is this equation related to group theory?

This equation is a fundamental result in group theory, known as the Orbit-Stabilizer Theorem. It relates the size of a group to the number of its orbits under a fixed-point free action. It is a powerful tool in understanding the structure and properties of groups.

4. Can you provide an example of this equation in action?

One example is the group of rotations in three-dimensional space, known as the special orthogonal group SO(3). Under a fixed-point free action, this group has exactly two orbits - the set of all rotations around a fixed axis and the set of all rotations around an arbitrary axis. Therefore, |Orbit(s)| = 2, which is equal to the size of the group, |G| = 2.

5. How does this equation impact other areas of mathematics?

The Orbit-Stabilizer Theorem has applications in many areas of mathematics, including graph theory, combinatorics, and number theory. It also has connections to other mathematical concepts, such as the Burnside's lemma and the Cauchy-Frobenius lemma. Overall, this equation plays a crucial role in understanding and analyzing various mathematical structures and systems.

Similar threads

Back
Top