Math 741 .

HW 4
Enkhzaya Enkhtaivan (Eza)
October 5, 2016
Problem A. Prove that if s and s0 are in the same orbit of a set X on which a group G is
acting, then their stabilizer groups are conjugate to each other. Conversely, prove that any
conjugate of StabG (s) is a stabilizer of an element of X.
Proof. We are given that there exists some g G such that s0 = gs. Lets consider an
arbitrary h StabG (s). Then, s0 = gs = g(hs) = (gh)s = (ghg 1 g)s = (ghg 1 )(gs) =
(ghg 1 )s0 , which means that ghg 1 StabG (s0 ). Note that if h1 6= h2 ., then clearly gh1 g 1 6=
gh2 g 1 . Therefore, gStabG (s)g 1 = StabG (s0 ).
To prove the converse, take any g G and consider H = gStabG (s)g 1 . Denote s0 = gs
and we claim that H = StabG (s0 ). That H StabG (s0 ) directly follows from the previous
part. For the opposite direction, take arbitrary g 0 StabG (s0 ). Then, gs = s0 = g 0 s0 =
g 0 (gs) s = (g 1 g)s = s = (g 1 g 0 g)s. Thus, g 1 g 0 g = h, for some h StabG (s) or
g 0 = ghg 1 gStabG (s)g 1 . This proves that StabG (s0 ) H.
Let H and H 0 be subgroups of a group G, and let x be an element of G. We denote by
HxH 0 the set of elements of the form hxh0 , with h H and h0 H 0 , respectively. We call
HxH a double coset of the pair (H, H 0 ).
Problem B1. Show that G decomposes as a disjoint union of double cosets of (H, H 0 ).
Proof. Let x, y G, x 6= y and y HxH 0 . So y = hxh0 for some h H and h0 H 0 .
Now consider arbitrary z HyH 0 . z = h1 yh01 = h1 (hxh0 )h01 = (h1 h)x(h0 h01 ) HxH 0 ,
because h1 H, h01 H 0 . Similarly, if t HxH 0 t = sxs0 for some s H, s0 H 0 . Thus,
t = sxs0 = (sh1 )y(h01 s0 ) HyH 0 . This proves that HyH 0 = HxH 0 , for every y HxH 0 ,
given x G. If z HxH 0 HyH 0 , then HxH 0 = HzH 0 = HyH 0 . Thus, it means that any
two double cosets of the pair (H, H 0 ) is either the same or disjoint from each other.
Problem B2. Let G = GL2 (R) and let B the subgroup of upper triangular matrices. Prove
that G decomposes into exactly two double cosets of (B, B). (This is an example of the socalled Bruhat decomposition which is of great importance in the theory of algebraic groups
and their representations.)
Proof. Let P1 = I2 and P2 = ( 01 10 ) are the two permutation matrices of size 2x2. We claim
that our G decomposes as G = (BP1 B) (BP2 B). First, consider BP1 B = B 2 := {U U 0 :
U, U 0 B}. Note that the product of any two upper triangular matrices are again an upper
1

triangular matrix. In addition, it is evident that B B 2 , as I2 B. Hence, B = B 2 . Hence,

it suffices to check that BP2 B = G \ B.
To prove that BP2 B G \ B, take two arbitrary matrices U1 = ( x0 yz ) B and U2 =
( a0 cb ) B. Since we are operating
in GL2 (R), det(U1 ) = xz 6= 0, det(U2 ) = ac 6= 0. It


ay by+cx
follows that U1 P2 U2 = az bz .. This matrix is not upper triangular because we have just
established that a 6== 0 and c 6= 0. Hence,
 BPB G \ B.
a b
As for the opposite direction, if X =
G \ B, c 6= 0, then we can decompose it
c d
as following:
 d
 bcad   d   bcad 
1
a (0 1) 1
=
X = ( ac db ) = a c
c
c
c
1 0
c

0 1

0 1

. Note that this is possible because X G \ B i.e. c 6= 0. Therefore, BP2 B = G \ B and we

are done.
Problem B3. Let G be the symmetric group Sn and let H be the subgroup of permutations
which fix 1. Describe the double coset decompositions of Sn into double cosets of (H, H).
Proof. Let Hk be the subgroup of premutations of Sn which send 1 to k, for k = 1, 2, ..., n. In
particular, we have H1 = H. Clearly, we have the following decomposition of Sn = tnk=1 Hk .
We claim that this is exactly the decomposition of Sn into double cosets of H.
Lets consider a permutation Sn such that (1) = j, j 6= 1. Clearly, ( )(1) =
( )(1) = (j) 6= 1, whenever , H. So it follows that H H is exactly H(j) , as
described above.
Problem C. We say a group G acts doubly transitively on S if G acts tranistively on the
set of pairs (s1 , s2 ) of distinct elements of S. Suppose G acts transitively on S and let H be
the stabilizer of an element s of G. Show that G acts doubly transitively if and only if G
decomposes into exactly two double cosets of (H, H).
Proof. First suppose that G acts doubly transitively on S. Then, s1 , s2 S, s1 6= s2 , s1 , s2 6=
s, there exists some h H such that hs1 = s2 and hs = s. Now since, G is also transitive,
there exists g
/ H such that gs = s1 . Hence, we see that s2 = (hg)s. Because s2 was
arbitrary, this essentially means that S s = Hgs. Thus, if g 0 G \ H, then g 0 s = (hg)s,
for some h
H. Therefore, G = H HgH, as desired. Note
for some h H. So, g 0 = hg h,
that this union is disjoint because H fixes s, while no element of HgH fixes s as we have
just checked.
As for the other direction, suppose that G is transitive and decomposes as G = H HgH,
for some g G \ H. Since G is transitive, we can write S = Gs. Since
Problem D. If G has transitive, fixed point free action on a set S, then this action is
isomorphic to the regular group action on itself.
Proof. To begin with, one can immediately notice that the class equation implies |S| = |G|
because there is only one orbit, which is the entire set S, and there is no fixed point of the
group action. Hence, it suffices to find a bijection between S and G that respects the group
action i.e, f (gh) = g.f (h), g, h G. Let us pick an arbitrary s S and send e G to s.
2

In other words, denote s = f (e). Then, complete the definition of f by letting f (g) = g.s =
g.f (e). Thus, g, h G, we have that f (gh) = (gh).s = (gh).f (e) = g.(h.f (e)) = g.f (h).
Therefore, f is the bijection that respects Gs action on S.
Problem E. How many orbits are there if Sn is acting on the set X, the set of ordered
triplets of the set {1, 2, ..., n}?.


Proof. First of all, X = n3 3! = n(n 1)(n 2). For every (a, b, c) X, there exists
a permutation of Sn such that ((a, b, c)) = (b, a, c). Hence, this group action has no
fixed point. On the other hand, given an ordered triple of 1, 2, ..., n, there exactly (n 3)!
permutations that fixes the ordered triple. Hence, every stabilizer has the size (n 3)!.
Therefore, the class equation becomes the following:
|X| = n(n 1)(n 2) = 0 +

r
X
i=1

|Sn |
= rn(n 1)(n 2)
(n 3)!

. Consequently, our group action only has one, r = 1, orbit.