proposition: Lemma Schur_oversize d (sh : 'P_d) : (size sh > n)%N -> Schur sh = 0.
proof: Proof. Proof using. move=> Hn; apply big1 => t _; exfalso. have:= size_tabsh t; rewrite -(size_map size) -/(shape t) shape_tabsh. by move=> /(leq_trans Hn); rewrite ltnn. Qed.
imports: HB(structures) mathcomp(all_ssreflect) mathcomp(ssralg) mathcomp(ssrcomplements freeg mpoly) tools ordtype partition tableau