The maximum antichain size equals the minimum number of chains covering a finite poset. A small computation will anchor the general statement before the abstraction takes over.
Set-up
A finite poset \((P,\le)\) has intervals \([x,y]\) and an incidence algebra. Chains, antichains, and order ideals reveal different slices of its comparability structure.
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\).
The calculation
The middle display is intentionally dense: it is where signs, bounds, multiplicities, or normalising factors are most likely to be lost.
What survives abstraction
What survives the example is not its particular numbers but the relation encoded by the two rows below. That relation is the part worth transporting to a new setting.
The boundary
Width and height refer to antichains and chains in the poset, not to geometric dimensions of a drawing.
With the dependency made explicit, the same pattern can be recognised safely in nearby problems. A changed hypothesis should now be easy to spot.