The number of standard tableaux of shape lambda is n factorial divided by the product of all hook lengths. A small computation will anchor the general statement before the abstraction takes over.
Notation
A partition \(\lambda\vdash n\) is both a decreasing sequence and a Ferrers diagram. Statistics such as hook lengths \(h_{ij}\) turn the diagram into exact product formulas.
The definition determines which expressions are legal; only then does the identity become meaningful. An equality in \(\mathcal A\) may change ambient meaning, so I keep \(\mathsf D\) separate from \(\mathsf C\).
Stress the formula
The middle display is intentionally dense: it is where signs, bounds, multiplicities, or normalising factors are most likely to be lost.
Interpretation
The compact alignment is a local map of the argument: assumptions on the first row, consequence on the second. Any generalisation must preserve that dependency.
Limit of the argument
Partitions forget order, compositions retain it, and tableaux add labels subject to row and column rules. Interchanging these objects changes the count.
With the dependency made explicit, the same pattern can be recognised safely in nearby problems. A changed hypothesis should now be easy to spot.