Claim Map
01 boundary kernel
The paper proves the first load-bearing arrow of the TFPT series: [formula in source] All later discrete, physical, and numerical structures are treated as unavailable here. The purpose is to make the boundary primitive kernel auditable on its own.
Opening source excerpt. Formulas and the full argument remain in the original document.
Source location and explicit evidence links
documents/archive--tfpt-45--01_boundary_kernel/sections/001-section-claim-map.tex · lines 90 to 110
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.