From Wikipedia, the free encyclopedia
Note: This draft page is used to work out the derivation of the formula and will be merged back to Frobenius formula .
The proof here relies on some basic facts about Schur polynomials
s
λ
{\displaystyle s^{\lambda }}
, distinguished symmetric polynomials parametrized by partitions
λ
{\displaystyle \lambda }
. The properties that we need to use are
Schur polynomials are an integral basis for the ring of symmetric functions .
(Cauchy formula )
∏
1
1
−
x
i
y
i
=
∑
λ
s
λ
(
x
)
s
λ
(
y
)
.
{\displaystyle \prod {1 \over 1-x_{i}y_{i}}=\sum _{\lambda }s^{\lambda }(x)s^{\lambda }(y).}
For
Δ
=
∏
i
<
j
(
x
i
−
x
j
)
{\displaystyle \Delta =\prod _{i<j}(x_{i}-x_{j})}
, we have
Δ
⋅
s
λ
{\displaystyle \Delta \cdot s^{\lambda }}
is a polynomial such that
By Property 1., for each symmetric polynomial P , we can write
P
=
∑
λ
ω
λ
(
P
)
s
λ
{\displaystyle P=\sum _{\lambda }\omega _{\lambda }(P)s^{\lambda }}
for the integers
ω
λ
(
P
)
{\displaystyle \omega _{\lambda }(P)}
. First we establish the following:
For a symmetric polynomial P ,
the coefficient of
x
λ
{\displaystyle x^{\lambda }}
in P is
∑
μ
K
μ
λ
ω
μ
(
P
)
{\displaystyle \sum _{\mu }K_{\mu \lambda }\omega _{\mu }(P)}
for some unique integers
K
μ
λ
{\displaystyle K_{\mu \lambda }}
(called the Kostka numbers ). For a symmetric polynomial P ,
ω
λ
(
P
)
{\displaystyle \omega _{\lambda }(P)}
is the coefficient of
x
1
ℓ
1
⋅
…
⋅
x
k
ℓ
k
{\displaystyle x_{1}^{\ell _{1}}\cdot {\dots }\cdot x_{k}^{\ell _{k}}}
in
Δ
⋅
P
{\displaystyle \Delta \cdot P}
. Writing
P
μ
=
P
1
i
1
⋅
…
⋅
P
n
i
n
{\displaystyle P^{\mu }=P_{1}^{i_{1}}\cdot {\dots }\cdot P_{n}^{i_{n}}}
(
i
j
{\displaystyle i_{j}}
= the number of j in
μ
{\displaystyle \mu }
) and viewing
ω
λ
{\displaystyle \omega _{\lambda }}
as a function
C
(
μ
)
↦
ω
λ
(
P
μ
)
{\displaystyle C(\mu )\mapsto \omega _{\lambda }(P^{\mu })}
,
ω
λ
{\displaystyle \omega _{\lambda }}
are orthonormal with respect to the inner product on the space of class functions on
S
n
{\displaystyle S_{n}}
.
The proof is now completed by descending induction on partitions
λ
{\displaystyle \lambda }
, as follows. Let
S
λ
=
S
λ
1
×
⋯
×
S
λ
k
{\displaystyle S_{\lambda }=S_{\lambda _{1}}\times \dots \times S_{\lambda _{k}}}
be the subgroup of
S
n
{\displaystyle S_{n}}
(so-called the Young subgroup),
U
λ
=
Ind
S
λ
S
n
(
1
)
{\displaystyle U_{\lambda }=\operatorname {Ind} _{S_{\lambda }}^{S_{n}}(1)}
the representation induced from the trivial representation and
ψ
λ
{\displaystyle \psi _{\lambda }}
its character. The basic case is not hard to see; thus, assume that for all
μ
>
λ
{\displaystyle \mu >\lambda }
,
χ
μ
=
ω
μ
{\displaystyle \chi _{\mu }=\omega _{\mu }}
(
ω
μ
{\displaystyle \omega _{\mu }}
is viewed as a class function as above). The Mackey formula for an induced character says
ψ
λ
(
C
(
μ
)
)
=
[
S
d
:
S
λ
]
#
(
C
(
μ
)
)
#
(
C
(
μ
)
)
∩
S
λ
)
.
{\displaystyle \psi _{\lambda }(C(\mu ))={[S_{d}:S_{\lambda }] \over \#(C(\mu ))}\#(C(\mu ))\cap S_{\lambda }).}
...
Hence,
ψ
λ
=
ω
λ
+
∑
ν
>
λ
K
ν
λ
χ
ν
{\displaystyle \psi _{\lambda }=\omega _{\lambda }+\sum _{\nu >\lambda }K_{\nu \lambda }\chi _{\nu }}
.
By the linear independence of characters , this is possible only when
ω
λ
=
χ
λ
{\displaystyle \omega _{\lambda }=\chi _{\lambda }}
.