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

Isometric Stinespring representation

Definition

Let H, K, and E 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), and let V:H→K⊗E be a linear isometry (Linear isometries, and orthogonal or unitary operators on finite-dimensional inner product spaces), so V†V=IH by Finite-dimensional linear isometries satisfy the adjoint identity. The map

ΦV(X):=Tr⁡E(VXV†),X∈L(H),

is the isometric Stinespring form associated with V. An isometric Stinespring representation (Linear map between vector spaces over the same field) of Φ:L(H)→L(K) is such a formula, where Tr⁡E is the finite partial trace (Partial trace over a finite tensor factor) under the tensor convention Ordered tensor registers, their inner product, and wire permutations, together with its chosen finite environment E and isometry V. The composition V∘X∘V† is an endomorphism of K⊗E, and the partial trace maps it linearly to an endomorphism of K. Thus the displayed formula defines a complex-linear map on the full input operator space. This definition makes no existence assertion for an arbitrary map.

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