PRCPrimeCalibrationForcesNonunitIdentityBranchTransportTarget_of_comparable_trace
plain-language theorem explainer
Prime calibration that forces identity orientation to respect comparable finite δ-orbit traces on nonunit directions also forces identity-branch transport across all nonunit directions. Anyone assembling the native-cost uniqueness blocker or the universal foundation certificate cites this implication. The argument is a one-line specialization: instantiate the global comparable-trace target and apply the character-level comparable-trace-to-transport lemma.
Claim. Assume that whenever a ratio character $\chi$ is prime-direction calibrated, its identity orientation on nonunit directions respects comparability of finite $\delta$-orbit traces. Then, for every such $\chi$, if any nonunit direction remains identity-oriented, that identity branch transports to every other nonunit direction.
background
In the Primitive Recognition Calculus, a ratio character $\chi$ assigns to each ratio orbit another orbit and is the discrete skeleton from which a native cost is recovered. Prime-direction calibration constrains how $\chi$ behaves on prime generators. Nonunit directions are orbits away from the unit class; identity orientation means $\chi$ keeps that direction on the identity branch rather than the reciprocal branch.
Two blocker targets package the same branch-coupling demand at different strengths. The comparable-trace target asks that identity orientation respect comparability of finite $\delta$-orbit traces on nonunit directions (a trace-order sharpening). The branch-transport target asks the positive transport form: if one nonunit direction stays identity-oriented under prime calibration, that identity branch must reach every nonunit direction.
Upstream, the character-level lemma already shows that respecting comparable trace implies branch transport for a fixed $\chi$. The present declaration lifts that implication from a single character to the quantified prime-calibration targets used in the uniqueness certificate stack.
proof idea
Term-mode specialization, not a new calculation. Introduce a ratio character $\chi$ together with the hypotheses that it is a PRC ratio character and is prime-direction calibrated. Apply the global comparable-trace target hypothesis to those data to obtain the character-level property that identity orientation respects comparable finite $\delta$-orbit traces. Feed that property into the upstream lemma that turns comparable-trace respect into nonunit identity-branch transport. The resulting transport property is exactly the body of the branch-transport target.
why it matters
This is one direction of the equivalence between the branch-transport target and the comparable-trace target, and it is the half used when a proof already has the sharper trace-order form and needs the transport packaging. Downstream it feeds the iff theorem equating those two targets, the local-orbit orientation transport target built from local comparable trace, and the product no-mixed-orientation target via the identity-comparable-trace bridge.
Those targets sit inside the native-cost uniqueness blocker certificate and, through the certificate stack, inside the conditional universal foundation certificate. In the Recognition forcing picture this is bookkeeping on the discrete character side that underwrites uniqueness of the native cost before the J-cost and T5 uniqueness step are recovered; it does not itself force $\phi$ or the eight-tick structure, but it closes a branch-coupling gap that would otherwise leave alternative orientations open.
Switch to Lean above to see the machine-checked source, dependencies, and usage graph.