Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedverified 2026-10-15 (gpt-6-luna, gpt-6.1-sol, and delegated Codex review/repair agents; see completed run evidence)
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.

Finite bounded Kraus instrument

Definition

Assume the Axiom of Countable Choice, written ACω (The Axiom of Countable Choice (ACω)). Let H be a nonzero complex Hilbert space with inner product linear in its first argument (Hilbert space, Real and complex inner-product spaces and their induced length). Write B(H) for the bounded linear operators on H (The spaces (\mathcal B(X,Y)) and (\mathcal B(X)) of bounded linear operators); for M∈B(H), M∗ is its Hilbert adjoint, characterized by ⟨Mx,y⟩=⟨x,M∗y⟩ (The Hilbert-space adjoint of a bounded operator).

Under this same ACω hypothesis, Hilbert-adjoint identities gives M∗∈B(H) and ∥M∗∥=∥M∥.

A finite bounded Kraus instrument datum on H consists of an integer m≥1, integers qa≥0 for a=1,…,m, and bounded operators Ma,r∈B(H) for r=1,…,qa. It is normalized when

∑a=1m∑r=1qaMa,r∗Ma,r=IH.

Empty inner sums are zero. For each outcome a, define its outcome operator and operation by

Ea:=∑r=1qaMa,r∗Ma,r,Ja(X):=∑r=1qaMa,rXMa,r∗(X∈B(H)).

These formulas take values in B(H): the adjoint theorem above makes each Ma,r∗ bounded, and ∥Ma,rXMa,r∗x∥≤∥Ma,r∥ ∥X∥ ∥Ma,r∗∥ ∥x∥=∥Ma,r∥2 ∥X∥ ∥x∥; the sums are finite. This definition specifies only the displayed finite Kraus form; it is not a representation theorem for arbitrary instruments and does not assert that an apparatus realizes these data.

Depends on

Dependency tree · 2 levels

Sources