Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generated
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

The abort-aware ideal output and conditional marginals are states

Statement

For a protocol output and fixed adversarial strategy as in Abort-aware real and ideal QKD outputs and security errors, the real full output is a density operator. If pacc>0, the normalized accepted state ρABTE⊤ and the block-defined marginals ρATE⊤,ρTE⊤ are density operators; so are τA, τAB, τA⊗ρTE⊤ and the ideal full output ρABTEideal. If pacc=0, the ideal full output equals the real abort-only state.

Facts & Assumptions

Given: The finite protocol output blocks, their nonnegativity and total trace one, and pacc as in the Definition.

[F1]

Finite authenticated key-distribution protocol: the output is block diagonal in A,B,T with nonnegative adversary blocks, the abort block is shared by both parties, and the sum of all block traces is one.

[F2]

Abort-aware real and ideal QKD outputs and security errors: pacc is the trace sum of accepted blocks, and the conditional marginals and ideal state are the displayed finite block sums.

[F3]

Density operator: a density operator is nonnegative with trace one on a nonzero finite-dimensional space.

[F4]

Finite registers and their ordered computational bases and Ordered tensor registers, their inner product, and wire permutations: the stated key/transcript product vectors are orthonormal and retain their displayed factor order.

[F5]

The basis-independent trace of an endomorphism of a finite-dimensional vector space: in an ordered basis the trace is the finite sum of diagonal entries, so traces add over the displayed classical blocks.

Proof

1.1givenF1F2F3F4F5algebra

The real state is nonnegative because its orthogonal classical blocks are nonnegative by [F1]. Its trace is the sum of their traces by [F5], which is one by [F1], so it is a density operator by [F3]. If pacc>0, dividing each accepted block by pacc preserves nonnegativity and makes the trace sum equal to one; hence ρABTE⊤ is a density operator.

2.1givenF2F3F4F5step 1.1algebra

In the explicit sums of [F2], each ATE block is pacc−1∑bωEa,b,t and each TE block is pacc−1∑a,bωEa,b,t. These are nonnegative finite sums. By [F5], their traces sum to pacc−1pacc=1, so both marginals are density operators by [F3]. The states τA and τAB are diagonal with m entries equal to 1/m and all other entries zero, so each is nonnegative with trace one. In the product register, τA⊗ρTE⊤ has one block m−1ρTE⊤ per key, hence is nonnegative and has trace m(m−1)=1.

3.1givenF1F2F3F4F5F6algebra∎

The ideal accepted blocks occur only at key pairs (a,a) and equal m−1∑b,cωEb,c,t for each a,t; they are nonnegative and their total trace is pacc by [F5]. Its abort blocks are the original nonnegative blocks with total trace 1−pacc by [F1]–[F2]. These lie in mutually orthogonal classical slots, so the full ideal state is nonnegative and has trace pacc+1−pacc=1, hence is a density operator by [F3]. If pacc=0, nonnegativity makes each accepted block's trace nonnegative; their sum is zero, so each trace is zero. By [F6], each such block has only nonnegative eigenvalues summing to zero and is therefore zero. The accepted ideal block is also zero, so the ideal output equals the real abort-only state.

Depends on

Used by

Cited to discharge well-definedness by Abort-aware real and ideal QKD outputs and security errors.

Dependency tree · two levels

35 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources