Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-generatedPipeline-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.

Secrecy and correctness are separate requirements

Example

For K={0,1}, no abort, a one-element transcript, and a one-dimensional adversary system, consider two finite output laws. In the first, Alice's key is uniform but Bob always outputs its complement: secrecy error is 0 and correctness error is 1. In the second, both parties always output 0: correctness error is 0 and secrecy error is 1/2. Thus neither condition implies the other.

Facts & Assumptions

Given: The two normalized classical output states described in the Example.

[F1]

Abort-aware real and ideal QKD outputs and security errors: the correctness error is the probability of unequal accepted outputs, and secrecy compares Alice's accepted key with a uniform key independent of transcript and Eve.

[F2]

Trace Distance: trace distance of density operators is half the trace norm of their difference.

[F3]

Trace Norm Spectral Formula: for an orthogonal diagonal decomposition, the trace norm is the sum of absolute eigenvalues.

[F4]

QKD composable secrecy is bounded by correctness plus secrecy: the real-ideal distance is at most the sum of the correctness and secrecy errors.

Verification

Given: Let ρ(1)=12∣0,1,t⟩⟨0,1,t∣+12∣1,0,t⟩⟨1,0,t∣ and ρ(2)=∣0,0,t⟩⟨0,0,t∣, with Eve's one-dimensional factor suppressed.

1.1givenF1F2F3algebra

For ρ(1), Alice's marginal is I/2, so it is already uniform and independent of the trivial transcript-adversary state; hence εsec=0. Every output pair differs, so εcor=1. The real state is supported on {∣0,1,t⟩,∣1,0,t⟩} while the ideal state is supported on the orthogonal set {∣0,0,t⟩,∣1,1,t⟩}. Their difference therefore has positive and negative parts each of trace one, giving δid=1 by [F2]–[F3].

2.1givenF1F2F3F4algebra∎

For ρ(2), the parties always agree, so εcor=0. Alice's accepted state is ∣0⟩⟨0∣, and ∣0⟩⟨0∣−I/2 has eigenvalues 1/2,−1/2; hence εsec=1/2. The real-ideal output difference has the same two eigenvalues, so δid=1/2. Both cases satisfy [F4] with equality, while each has exactly one of the two component errors zero.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

33 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