Optional arithmetic compression on the canonical branch
tfpt minimal kernel clean
The following identity is not needed for the minimal carrier theorem itself, but it is a compact bridge relation that is often useful in short downstream notes. Define the occupancy count [formula in source] Then [formula in source] On the canonical branch, [formula in source] so the hard chain becomes [formula in source]
Opening source excerpt. Formulas and the full argument remain in the original document.
Source location and explicit evidence links
_archive/paper-latex/tfpt_minimal_kernel_clean.tex · lines 482 to 507
These are recorded citation relations. A source citation or topic match does not establish a mathematical or physical result.
No explicit verification citation is attached to this section in the registry.