1,663
edits
(Bluelinking 1 books for verifiability.) #IABot (v2.1alpha3) 
(→Definition: clarified things by explaining them in order) 

==Definition==
Fix a partition λ of ''n''. This determines a [[Young diagram]] with ''n'' boxes. A [[Young tableau]] of shape λ is a way of labelling the boxes of this Young diagram by distinct numbers <math>1, \dots, n</math>.
A '''tabloid''' is an equivalence class of Young tableaux where two labellings are equivalent if one is obtained from the other by permuting the entries of each row. For each Young tableau ''T'' of shape λ let <math>\{T\}</math> be the corresponding tabloid. The symmetric group on ''n'' points acts on the set of Young tableaux of shape λ. Consequently, it acts on tabloids, and on the vector space ''V'' with the tabloids as basis.
:<math>E_T=\sum_{\sigma\in Q_T}\epsilon(\sigma)\{\sigma(T)\} \in V</math>
where ''Q''<sub>''T''</sub> is the subgroup of permutations, preserving (as sets) all columns of ''T'' and <math>\epsilon(\sigma)</math> is the sign of the permutation σ. The Specht module of the partition λ is the module generated by the elements ''E''<sub>''T''</sub> as ''T'' runs through all tableaux of shape λ.
The Specht module has a basis of elements ''E''<sub>''T''</sub> for ''T'' a [[standard Young tableau]].
