proposition: Lemma symm_syms_int la : 'm[la] = \sum_(mu : 'P_d) KostkaInv la mu *: 's[mu] :> SF.
proof: Proof. rewrite /KostkaInv. apply: (Minv_lincombl (Kostka_unitrig _ d) (F := fun mu => 's[mu]) (G := fun mu => 'm[mu])). exact: syms_symm_int. Qed.
imports: HB(structures) mathcomp(all_ssreflect) mathcomp(ssralg ssrint fingroup perm) mathcomp(ssrcomplements freeg mpoly) sorted tools ordtype permuted partition skewpart composition Yamanouchi std tableau stdtab skewtab permcent antisym Schur_mpoly therule Schur_altdef unitriginv