Denote by Sn the group of permutations of the sequence
(1,2,…,n). Suppose that G is a subgroup of Sn, such
that for every π∈G∖{e} there exists a unique
k∈{1,2,…,n} for which π(k)=k. (Here e is the
unit element in the group Sn.) Show that this k is the same for
all π∈G∖{e}.
Solution (official)
Let us consider the action of G on the set
X={1,…,n}. Let
Gx={g∈G:g(x)=x}andGx={g(x):g∈G}
be the stabilizer and the orbit of x∈X under this action,
respectively. The condition of the problem states that
G=x∈X⋃Gx(1)
and
Gx∩Gy={e}for all x=y.(2)
We need to prove that G=Gx for some x∈X.
Let Gx1,…,Gxk be the distinct orbits of the action of
G. Then one can write (1) as
G=i=1⋃ky∈Gxi⋃Gy.(3)
It is well known that
∣Gx∣=∣Gx∣∣G∣.(4)
Also note that if y∈Gx then Gy=Gx and thus
∣Gy∣=∣Gx∣. Therefore,
∣Gx∣=∣Gx∣∣G∣=∣Gy∣∣G∣=∣Gy∣for all y∈Gx.(5)
Combining (3), (2), (4) and (5) we get
∣G∣−1=∣G∖{e}∣=i=1⋃ky∈Gxi⋃Gy∖{e}=i=1∑k∣Gxi∣∣G∣(∣Gxi∣−1),
hence
1−∣G∣1=i=1∑k(1−∣Gxi∣1).(6)
If for some i,j∈{1,…,k}∣Gxi∣,∣Gxj∣≥2 then
i=1∑k(1−∣Gxi∣1)≥(1−21)+(1−21)=1>1−∣G∣1
which contradicts with (6), thus we can assume that
∣Gx1∣=⋯=∣Gxk−1∣=1.
Then from (6) we get ∣Gxk∣=∣G∣, hence Gxk=G.
How the field did
contestants scored
322
average (of 10)
1.20
solved (≥ 80%)
6.8%
near-0 (≤ 10%)
84.8%
discrimination
0.40
Score distribution (field cohort)
Computed on contestants with a meaningful total (field cohort); discrimination is the corrected item–total correlation.