= Free extension of nested partial unary operations
{title2=$F_n\dashv G_n$}
For an object of the <nested partial unary operation category> $\mathcal C_n$, adjoining the next operation freely gives one new value at each defined fixed point of the previous operation. Each new value starts an infinite free chain under the first unary operation; the other old operations are undefined on those new points. The new top operation consequently has no fixed points, so subsequent free extensions add no points. This gives a <left adjoint> to forgetting the last operation; extensions of maps along the chains are forced by the first target operation.
Back to article page
