Manuscript Hawk01-B@1 · Hawk01-B.tex · theorem · cfa976f1

Theorem: Accessible and complementary channels

Internally generated key and sequential logical transfer › Complete prefix channels · lines 848–904 · proof included or linked

Hawk01-B@1#thm:prefixchannels, Hawk01-B@1#eq:accessibleprefix, Hawk01-B@1#eq:complementprefix, Hawk01-B@1#eq:localkey, Hawk01-B@1#eq:localdata

Back to manuscript

For , with all emitted blocks accessible,

The complete residual complement is

where embeds the pending logical system into its residual summand. Every individual emitted block is message-independent:

Proof. Trace the orthogonal residual summands in (eq:accumulated). Different key labels also become diagonal because their residual supports are orthogonal. This gives (eq:accessibleprefix).

Conversely, tracing removes cross terms in the key. Tracing occupied/vacuum radiation removes cross terms between different transfer times and between transfer and pending branches. The resulting residual state is (eq:complementprefix).

The local formulas follow by tracing all other radiation blocks and applying Lemma lem:twirl.

Displayed formulas in this passage

  • Hawk01-B@1#eq:accessibleprefix · line 851

  • Hawk01-B@1#eq:complementprefix · line 863

  • Hawk01-B@1#eq:localkey · line 877

  • Hawk01-B@1#eq:localdata · line 877

Nearby in this section