Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6-luna)
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.

Replacing Bob's key by a copy of Alice's costs the correctness error

Statement

Let K,T be finite nonempty alphabets and let HE be a nonzero finite-dimensional adversary space. Consider a normalized state classical in A,B,T,

ρABTE=∑a,b∈K, t∈T∣a,b,t⟩⟨a,b,t∣⊗REa,b,t,

where each REa,b,t is nonnegative. Define Alice's ATE marginal by

ρATE:=∑a,t∣a,t⟩⟨a,t∣⊗∑bREa,b,t,

and let γABTE:=C(ρATE) for the classical key-copy channel C of The finite classical key-copy map is a quantum channel. Then

D(ρABTE,γABTE)=Pr⁡[KA≠KB]=∑a≠b,ttr⁡(REa,b,t).

Facts & Assumptions

Given: The normalized finite block state in the Statement and its finite alphabets.

[F1]

Density operator and The basis-independent trace of an endomorphism of a finite-dimensional vector space: a state is nonnegative with trace one, and trace is the sum of finite diagonal entries.

[F2]

The finite classical key-copy map is a quantum channel and Finite-dimensional quantum channel: C is completely positive and trace-preserving and copies each classical A block into the shared key block (A,B); complete positivity includes positivity on states by Completely positive maps.

[F3]

Trace Distance: for density operators, D(X,Y)=12∥X−Y∥1.

[F4]

Trace norm of a finite classical block operator: the trace norm of a finite self-adjoint block-diagonal operator is the sum of the block trace norms.

[F5]

Trace Norm Unitary Invariance And Positive Formula: for every nonnegative operator P, ∥P∥1=tr⁡(P).

[F6]

Trace Norm Duality And Norm Properties: the trace norm is homogeneous, in particular ∥−P∥1=∥P∥1.

Proof

1.1givenF1F2algebra

The blocks of ρATE are the finite sums ∑bREa,b,t, so they are nonnegative. Their traces sum to the trace of ρABTE by [F1], hence to one; therefore ρATE is a density operator. Complete positivity and trace preservation [F2] show that γABTE=C(ρATE) is also a density operator, as required for [F3].

2.1givenF2step 1.1

By [F2], γABTE has block ∑bREa,b,t in each key-diagonal slot (a,a,t) and zero in every slot (a,b,t) with b≠a. Thus ρABTE−γABTE has block REa,b,t in each slot with a≠b, block −∑b≠aREa,b,t in slot (a,a,t), and zero elsewhere. Each displayed nonzero block is self-adjoint because it is a positive block or its negative.

3.1givenF3F4F5F6step 1.1step 2.1algebra∎

Apply [F4] to these orthogonal classical blocks. For a≠b, [F5] gives ∥REa,b,t∥1=tr⁡(REa,b,t). The sum ∑b≠aREa,b,t is nonnegative, so [F5] and [F6] give ∥−∑b≠aREa,b,t∥1=∑b≠atr⁡(REa,b,t). Therefore ∥ρABTE−γABTE∥1=2∑a≠b,ttr⁡(REa,b,t). Dividing by 2 as in [F3] proves the equality with the mismatch probability.

Depends on

Used by

Dependency tree · two levels

48 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