Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-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.

Completely positive maps

Definition

Let H and K be finite-dimensional complex inner-product spaces and write L(H) and L(K) for their vector spaces of complex-linear endomorphisms with pointwise operations (Finite-dimensional vector space, and its dimension dim⁡FV; infinite-dimensional means having no finite basis, Real and complex inner-product spaces and their induced length, The space L(V,W) of linear maps with pointwise addition and scalar multiplication, L(V,W) is a vector space over the common scalar field). Let Φ:L(H)→L(K) be complex-linear. For each integer r≥1, put R=Cr with its standard ordered register basis (Finite registers and their ordered computational bases). Write an operator X∈L(H⊗R) in its unique r×r block form X=[Xij] with Xij∈L(H), and define Φ(r)(X) to have blocks [Φ(Xij)] on K⊗R. Lemma Finite ancilla amplification is a well-defined block map proves that this block rule defines a linear map on the full operator space for every finite r. For r=1, the extension is Φ under the canonical unitary identifications x↦x⊗e0 and y↦y⊗e0 proved in that lemma.

The map Φ is completely positive if, for every finite r≥1, Φ(r) sends every nonnegative operator on H⊗R to a nonnegative operator on K⊗R (Non-negative and positive operators). The quantifier includes r=1; complete positivity therefore implies positivity. No Kraus, Choi, or Stinespring characterization is part of this definition.

Depends on

Used by

Dependency tree · two levels

37 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