Isotropic Subgroups
📂Abstract AlgebraIsotropic Subgroups
Definition
Let’s consider G as a group, and define X as a G-set. For x∈X and g∈G, let Xg:={x∈X ∣ gx=x} and Gx:={g∈G ∣ gx=x}. We define the Isotropy Subgroup of G with respect to x as Gx.
Explanation
To get a grasp of what an isotropy subgroup is, one needs to understand the action of a group.

For the set of points and lines on the left side of the above figure
X:={1,2,3,4,C,p1,p2,p3,p4,s1,s2,s3,s4,d1,d2,m1,m2}
consider the icosahedral group G=D4. X becomes a D4-set. In simple terms, Xg is a set unaffected by g, while Gx becomes a subgroup that cannot influence x. Here, C is the center of X, and ρ0 is the identity of G, which for every x,g, satisfies C∈Xg and ρ0∈Gx.
Let’s verify whether the examples below actually align with the figure above:
Xρ0=Xρ1=Xμ1=G1=Gs3=Gd1=XC{C,p1,p3,s1,s3,m1,m2}{ρ0,δ2}{ρ0,μ1}{ρ0,ρ2,δ1,δ2}
Here, when there exists g∈G satisfying gx1=x2 for x1,x2∈X, let’s define the equivalence relation x1∼x2. If x belongs to the cell of the partition by ∼, that cell is called the orbit of x and is denoted as Gx. Though it might look complicated, it simply means that X is split into parts like {C},{1,2,3,4},{p1,p2,p3,p4},{s1,s2,s3,s4},{d1,d2},{m1,m2}.
It’s important to note that Gx and Gx are distinguished by whether they are subscripts or not. For example, G1 acts as an isotropy subgroup that cannot influence 1, which is G1={ρ0,δ2}, and G1 is the orbit of 1, which is G1={1,2,3,4}.
Generally speaking, consider the following theorem. It looks like it reminds us of Lagrange’s theorem, but a closer look at the notation reveals it’s somewhat unrelated.
Theorem
If X is a G-set, then ∣Gx∣=(G:Gx) holds. If G is a finite group, then ∣Gx∣ is a divisor of ∣G∣.
Proof
Assume x1∈Gx, then there exists g1∈G satisfying g1x=x1. When ψ:Gx→G/Gx is defined as ψ(x1):=g1Gx, showing that ψ is a bijection completes the proof.
Part 1. ψ is a function.
Assuming g1x=x1, suppose there exists g1′∈Gx satisfying g1’x=x1. Then, g1x=g1’x and x=(g1−1g1’)x, thus (g1−1g1’)∈Gx must hold. Therefore, g1′∈g1Gx, and since g1Gx=g1’Gx, ψ is a function.
Part 2. ψ is injective.
If x1,x2∈Gx and assuming ψ(x1)=ψ(x2), then there exists g1,g2∈G satisfying x1=g1x, x2=g2x, and g2∈g1Gx. For some g∈Gx, g2=g1g, and x2=g2x=g1(gx)=g1x=x1 holds. Since ψ(x1)=ψ(x2)⟹x1=x2, ψ is injective.
Part 3. ψ is surjective.
For a coset of Gx, g1Gx, if g1x=x1, then g1Gx=ψ(x1) holds. Since x1∈Gx is valid for all ψ(x1), ψ is surjective.
Parts 1~3 demonstrated that ψ is a bijection, thereby proving the following:
∣Gx∣=∣G/Gx∣=(G:Gx)
Part 4.
If ∣G∣<∞, then ∣G∣=∣Gx∣(G:Gx)=∣Gx∣∣Gx∣ holds, making ∣Gx∣ a divisor of ∣G∣.
■