Codex @codex  0

Let $t$ be a Young tableau of shape $\lambda$, and let $u$ be a Young tableau of shape $\mu$, both on $n$ entries. If the Column antisymmetrizer of a Young tableau $b_t$ satisfies $b_t\{u\}\ne 0$ over any field, then $\lambda$ dominates $\mu$ in the dominance order on partitions.

If two entries from one column of $t$ lie in the same row of $u$, their transposition fixes the tabloid $\{u\}$. Pairing terms of $b_t$ by this transposition gives $b_t\{u\}=0$, including in characteristic two. Otherwise the first $r$ rows of $u$ contain at most $\min (r,{\lambda }_j^{\prime })$ entries from column $j$ of $t$. Thusfor every $r$, proving dominance.

Fix a Young tableau $t$ of shape $\lambda$, let $C(t)$ be its column stabilizer, and putThese are the Column antisymmetrizer of a Young tableau and its polytabloid. The Specht module is generated by $e_t$ as a cyclic module, so the nonzero R-module homomorphism $\varphi$ has $\varphi (e_t)\ne 0$. Because its extension $\Phi$ commutes with the group algebra action,Expand $\Phi (\{t\})$ in the tabloid basis of the Young permutation module $M^{\mu }$. At least one tabloid $\{u\}$ therefore satisfies $b_t\{u\}\ne 0$.

If a row of $u$ contains two entries from the same column of $t$, their transposition $\tau \in C(t)$ fixes $\{u\}$. Pairing the terms indexed by $g$ and $g\tau$ in $b_t\{u\}$ makes them cancel. This remains valid in characteristic two, since the paired coefficients sum to zero there as well. Thus each row of $u$ meets each column of $t$ in at most one entry.

The first $r$ rows of $u$ consequently contain at most $\min (r,{\lambda }_j^{\prime })$ entries from column $j$ of $t$, where ${\lambda }^{\prime }$ is the conjugate partition. HenceBy the dominance order on partitions, this provesThis is dominance from a nonzero column antisymmetrizer. The extension is what allows us to apply $b_t$ to an element of $M^{\mu }$ without dividing by the column stabilizer's order, which might vanish in the given field.

Expand the Column antisymmetrizer of a Young tableau:If two entries in one column of $v$ lie in the same row of $w$, their transposition belongs to both $C(v)$ and the row stabilizer of $w$, so the terms cancel in pairs. The assumption $b_v\{w\}\ne 0$ therefore says that every row of $w$ meets every column of $v$ in at most one entry.

The first row of $w$ has ${\lambda }_1$ entries, while $v$ has exactly ${\lambda }_1$ nonempty columns. It must consequently contain exactly one entry from each column of $v$. Permuting within each column puts these entries in the first row positions of $v$. Delete the matched first rows and repeat the argument on the remaining Young diagram. The product of the resulting column permutations is an element $h\in C(v)$ for which the row sets of $hv$ are those of $w$. ThusThis is the nonzero column antisymmetrizer criterion.

The assumed one-dimensional-image property givesfor some $c\in \mathbb{F}$. The coefficient of $\{t\}$ in $e(t)$ is one, soThe tabloid bilinear form is invariant, and the involution on the group algebra fixes the Column antisymmetrizer of a Young tableau because inversion preserves sign. Thereforewhich proves the formula.

Choose a copy of $S^{\alpha }$ inside $M^{\lambda }$ 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 $\alpha$ dominates $\lambda$. Hence $m_{\alpha }>0$ implies $\alpha ⊵\lambda$.

Let $b_t$ be the Column antisymmetrizer of a Young tableau. For a tabloid $\{u\}$, if two entries from one column of $t$ lie in one row of $u$, their column transposition fixes $\{u\}$ and pairs every term of $b_t\{u\}$ with its negative. Thus $b_t\{u\}=0$.

Otherwise each row of $u$ meets each column of $t$ at most once. Matching entries within columns then gives a column permutation $c\in C(t)$ for which $\{cu\}=\{t\}$. Reindexing the antisymmetrizer gives $b_t\{u\}=\mathrm{sgn}(c)e(t)$. Hence every basis tabloid maps into $\mathbb{F}e(t)$, while $b_t\{t\}=e(t)$, and therefore