A natural transformation assigns one morphism per object and requires compatibility with every arrow. I want the notation, the mechanism, and the failure mode visible at the same time.
Definitions first
Category theory records objects through their morphisms. A functor \(F:\mathcal C\to\mathcal D\) preserves identities and composition, while a natural transformation \(\eta:F\Rightarrow G\) compares functors uniformly.
I keep the defining relation \(\mathsf D\) above the derived relation \(\mathsf C\). This exposes whether cancellation used \(x\ne0\) and whether the conclusion is canonical.
A small case in full
The following line is the smallest calculation that still exercises the mechanism. It keeps nested delimiters and the order of operations explicit.
The reusable statement
The two-row display is also a debugging tool: if the conclusion changes when only notation changes, some hidden choice has entered the argument.
A nearby false statement
An isomorphism of objects is stronger than a natural bijection of underlying sets unless that bijection respects all morphisms in the relevant category.
The notation is dense, but it is doing honest work: every delimiter records scope and every index records dependence. Removing one should require a mathematical reason.