Manuscript Hawk01-B@1 · Hawk01-B.tex · theorem · cfa976f1
Theorem: Complete endpoint preservation
Endpoint completion and the no-remnant condition · lines 1159–1208 · proof included or linked
Hawk01-B@1#thm:endpoint, Hawk01-B@1#eq:endpointcomplement, Hawk01-B@1#eq:endpointerrors, Hawk01-B@1#eq:endpointentropy, Hawk01-B@1#eq:endpointMI
The endpoint map is an energy-conserving isometry and transfers every residual key, transfer-time record, and pending logical system into radiation. Its complement is
Hence
For input ,
and for the Bell input,
The endpoint conditional information increment is .
Proof. The maps send an orthonormal residual basis to an orthonormal endpoint radiation basis with one fixed source factor. Every term preserves residual-plus-radiation energy. There is no residual record or purifier outside that fixed factor.
On completed branches, the earlier occupied block is decoded using . On pending branches, the endpoint occupied subspace contains the encrypted logical system and its key label; apply there. The branch labels are orthogonal. This is an explicit exact decoder on the emitted state.
Alternatively, (eq:endpointcomplement) and Theorem thm:exact establish exact recovery. The full radiation map is an isometric encoding, so it preserves the nonzero spectrum of , proving (eq:endpointentropy). The reference statements follow from purity, or from exact decoding. Their increment over (eq:MIradiation) is .
Displayed formulas in this passage
Hawk01-B@1#eq:endpointcomplement · line 1164
Hawk01-B@1#eq:endpointerrors · line 1169
Hawk01-B@1#eq:endpointentropy · line 1174
Hawk01-B@1#eq:endpointMI · line 1179