Verification Algorithm
tfpt-theory-fullv28
The uniqueness is verified by: Constructing the complete Hasse diagram of [formula in source] from standard tables. Computing all cover relations with [formula in source] . Running dynamic programming to find all paths from [formula in source] to [formula in source] . Applying the cost function [formula in source] (second-difference smoothness). Verifying that the minimum-cost path is unique (cost gap to second-best
Opening source excerpt. Formulas and the full argument remain in the original document.
Source location and explicit evidence links
documents/archive--paper-latex--tfpt-theory-fullv28/sections/012-subsection-theoryv3-evidence-layer-compressed-auto-gener.tex · lines 279 to 293
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.