Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedprecheck pending
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.

Every finite extension is obtained from a purification by a channel

Statement

Let ωZA be any finite-dimensional state with Tr⁡ZωZA=ρA, and let ∣ψ⟩RA purify ρA with R a copy of A. There is a CPTP map Λ:R→Z with (Λ⊗id⁡A)(∣ψ⟩⟨ψ∣)=ωZA.

Facts & Assumptions

Given: Nonzero finite-dimensional spaces A,Z, states ρA and ωZA with Tr⁡ZωZA=ρA, and a purification ∣ψ⟩RA where R is a copy of A.

[F1]

Purifications exist and are unitarily equivalent after padding: Purifications exist and are unitarily equivalent after padding.

[F3]

Finite-dimensional quantum channel: Finite-dimensional quantum channel.

[F4]

An isometry followed by partial trace is a channel: An isometry followed by partial trace is a channel.

[F6]

Partial trace over a finite tensor factor, Ordered tensor registers, their inner product, and wire permutations, Finite wire permutations are unitary basis permutations, and The product basis is orthonormal and tensor dimensions multiply: the tensor factors have the declared order, factor reordering is unitary, and tracing the auxiliary factor after applying a channel to R gives the corresponding marginal on ZA.

[F7]

Proof

1.1F1F2F3F7givenalgebraconstruct

Choose a finite purification ∣Ω⟩ZAF of ωZA by [F1] and reorder its factors as A(ZF). Let ρA=∑j=1rλj∣aj⟩⟨aj∣ be a spectral decomposition on its positive support, obtained from [F7]. Expand each purification in the product basis using this same eigenbasis on A: ∣ψ⟩RA=∑j=1r∣rj0⟩R∣aj⟩A,∣Ω⟩A(ZF)=∑j=1r∣aj⟩A∣zj0⟩ZF. The partial-trace coordinate formula [F2] and the fact that both A marginals equal ρA show that the coefficient vectors have Gram matrices ⟨rj0,rk0⟩=λjδjk and ⟨zj0,zk0⟩=λjδjk. Thus ∣rj⟩:=∣rj0⟩/λj and ∣zj⟩:=∣zj0⟩/λj are orthonormal and ∣ψ⟩RA=∑j=1rλj∣rj⟩R∣aj⟩A,∣Ω⟩A(ZF)=∑j=1rλj∣aj⟩A∣zj⟩ZF. This coefficient argument also handles repeated positive eigenvalues because the chosen basis is fixed before either expansion.

2.1F1F2F3F5F6givenalgebraconstructstep 1.1

Let d=dim⁡R=dim⁡A. In every case set G=Cd, fix its first coordinate unit vector ∣0⟩G, and append it to ∣Ω⟩. Since Z and the purifying space F are nonzero, dim⁡(Z⊗F⊗G)≥d. Denote the resulting orthonormal Schmidt partners by ∣zj′⟩=∣zj⟩∣0⟩G. The map U0:span⁡{∣rj⟩}→span⁡{∣zj′⟩} given by U0∣rj⟩=∣zj′⟩ is an isometry. Extend {∣rj⟩} to an orthonormal basis of R and choose the same number of additional orthonormal vectors in the orthogonal complement of the zj′ in Z⊗F⊗G; [F5] and the target dimension bound ensure this is possible. Sending the added basis vectors to those target vectors extends U0 to a linear isometry U:R→Z⊗F⊗G on all of R. By construction, (U⊗IA)∣ψ⟩ is exactly the padded purification ∣Ω⟩⊗∣0⟩G, after reordering to Z(F⊗G)A. This construction includes the singular case r<d, since it extends U on all zero-Schmidt directions of R.

3.1F1F3F4F6givenalgebraconstructstep 2.1∎

Define Λ(X)=Tr⁡F⊗G(UXU∗) from L(R) to L(Z). Since U is an isometry, [F4] makes Λ completely positive and trace-preserving on the full operator space. Applying it to the reference factor of ∣ψ⟩⟨ψ∣ traces F⊗G from the pure state ∣(U⊗IA)ψ⟩⟨(U⊗IA)ψ∣, leaving its ZA marginal, which is ωZA by construction and is unchanged by the appended pure G register [F6]. Thus (Λ⊗id⁡A)(∣ψ⟩⟨ψ∣)=ωZA, as required.

Depends on

Used by

Dependency tree · two levels

71 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