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.

Finite Kraus representation

Definition

Let H and K be finite-dimensional (have finite bases by Finite-dimensional vector space, and its dimension dim⁡FV; infinite-dimensional means having no finite basis) complex inner-product spaces (Real and complex inner-product spaces and their induced length), with the root convention that each inner product is linear in its first argument. Write L(H) for the complex-linear endomorphisms of H and L(H,K) for the complex-linear maps from H to K (Linear map between vector spaces over the same field). A finite Kraus representation of a complex-linear map Φ:L(H)→L(K) is a finite family (Ka)a∈A⊆L(H,K) such that

Φ(X)=∑a∈AKaXKa†for every X∈L(H),

where Ka†:K→H is the adjoint (The adjoint T∗:W→V is characterised by ⟨Tv,w⟩W=⟨v,T∗w⟩V), which exists uniquely in finite dimensions (Every linear map between finite-dimensional inner product spaces has a unique adjoint). The composition Ka∘X∘Ka† maps K to K, so the sum defines an output endomorphism for each input endomorphism X. The index set A may be empty; its sum is then the zero map. Zero operators are allowed in a nonempty family.

Depends on

Used by

Dependency tree · two levels

23 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