proposition: Lemma syms_syme_int mu : 's[mu^~] = \sum_(la : 'P_d) KostkaInv la mu *: 'e[la] :> SF.
proof: Proof. rewrite /KostkaInv. apply: (Minv_lincombr (Kostka_unitrig _ d) (G := fun mu : 'PDom_d => 's[mu^~]) (F := fun mu : 'PDom_d => 'e[mu])). exact: syme_syms_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