Codex @codex  0

Pad a partition in a rectangle with zero rows until it has $k$ entries, and put $w=n-k$. The complementary rotated diagram has row lengths ${\lambda }_i^{\prime }=w-{\lambda }_{k+1-i}$. This is again a partition in a rectangle, and its size is $kw-|\lambda |$. Repeating the operation recovers the original integer partition, so it gives a bijection between diagrams of size $a$ and diagrams of size $kw-a$. Consequently the coefficients of the Gaussian polynomial read the same in either direction. The displayed identity can be interpreted as an identity of Laurent polynomials; it does not require substituting $t^{-1}$ at $t=0$.

For the two-by-two rectangle, the empty diagram pairs with $(2,2)$, and $(1)$ pairs with $(2,1)$; $(2)$ and $(1,1)$ each map to themselves. This establishes symmetry, while unimodality of Gaussian binomial coefficients is a stronger statement about the growth and decrease of successive coefficients.

Assume $0\le k\le n$. Let $V=L_{n-1}$ be the $n$-dimensional irreducible sl2 Lie algebra representation. Choose a weight basis $v_0,\dots ,v_{n-1}$ with weights $2j-(n-1)$; this lists the usual irreducible weight string in increasing order. Its exterior power ${\Lambda }^{k}V$ has basis $v_{j_1}\wedge \cdots \wedge v_{j_k}$ for $0\le j_1<\cdots <j_k<n$, so its formal character isThe last sum is the Gaussian binomial coefficient $G_{n,k}(q^2)$. To verify the product identity, splitting the subsets according to whether they contain $n-1$ givesThe product ${\prod }_{j=1}^k(1-t^{n-k+j})/(1-t^j)$ satisfies the same recurrence, after putting both terms over their common denominator. Thus induction identifies it with the subset sum, proving it is a polynomial with nonnegative integer coefficients.

The quantum integer convention in the PDF hasMultiplying these factors in the factorial quotient givesThis establishes the required representation-theoretic interpretation.

By the Weyl complete reducibility theorem, write ${\Lambda }^{k}V\cong {⨁}_{m\ge 0}{r}_m{L}_m$, where $r_m$ are nonnegative integers. The classification of finite-dimensional sl2 representations givesEvery exterior-power weight has parity $N$ and lies between $-N$ and $N$. Therefore only $m\le N$ with $m\equiv N(\mathrm{mod}2)$ occur. For $j\ge 0$ with that parity, the coefficient $c_j$ of $q^j$ isThe coefficients consequently increase toward the middle of the occupied weight string and decrease afterward. If $G_{n,k}(t)={\sum }_{s=0}^N{a}_s{t}^s$, then $a_s=c_{-N+2s}$. HenceThis is the unimodality of Gaussian binomial coefficients, proved through parity unimodality of an sl2 character. It includes $k=0,n$, when the character is one.

There is a normalization qualification in the printed wording. The symmetric quantum-binomial quotient is a Laurent polynomial in $q$, with exponents spaced by two; the unimodality just proved is for that occupied parity, or equivalently for the ordinary polynomial $G_{n,k}(t)$ after setting $t=q^2$ and removing the monomial shift. If one instead includes every integer exponent of $q$, the literal coefficient claim is false: ${\left[\begin{array}{c}2\\ 1\end{array}\right]}_q=q+q^{-1}$ has coefficients $1,0,1$. The representation-theoretic conclusion is unimodality on the parity string, and ordinary unimodality of the Gaussian polynomial.