Expand the Column antisymmetrizer of a Young tableau:
If two entries in one column of lie in the same row of , their transposition belongs to both and the row stabilizer of , so the terms cancel in pairs. The assumption therefore says that every row of meets every column of in at most one entry.
The first row of has entries, while has exactly nonempty columns. It must consequently contain exactly one entry from each column of . Permuting within each column puts these entries in the first row positions of . Delete the matched first rows and repeat the argument on the remaining Young diagram. The product of the resulting column permutations is an element for which the row sets of are those of . Thus
This is the nonzero column antisymmetrizer criterion.
The assumed one-dimensional-image property gives
for some . The coefficient of in is one, so
The tabloid bilinear form is invariant, and the involution on the group algebra fixes the Column antisymmetrizer of a Young tableau because inversion preserves sign. Therefore
which proves the formula.
Choose a copy of inside and a nonzero polytabloid in it. Its image under a suitable Column antisymmetrizer of a Young tableau is nonzero. By the fact allowed in the question, this can happen only if dominates . Hence implies .
Let be the Column antisymmetrizer of a Young tableau. For a tabloid , if two entries from one column of lie in one row of , their column transposition fixes and pairs every term of with its negative. Thus .
Otherwise each row of meets each column of at most once. Matching entries within columns then gives a column permutation for which . Reindexing the antisymmetrizer gives . Hence every basis tabloid maps into , while , and therefore