Unnumbered appendix result (87): finite pure-ancilla representation
ProvedQAlgorithms.Papers.Independent.Gap48.P36.finite_ancilla_representationAll Hilbert spaces have positive finite dimension. Channels are completely positive and trace preserving; conjugates use the same normalized pure-environment dilation. For every channel there are a positive finite ancilla dimension , its first unit basis vector , and a rectangular partial isometry such that every matrix satisfies
This retains the finite pure-ancilla representation (87), without the unsupported surrounding rank prescription.
import Definitions.Def_QAlgorithms_Papers_Independent_Gap48_P36
noncomputable section
namespace QAlgorithms.Papers.Independent.Gap48.P36
open scoped BigOperators Matrix Kronecker ComplexConjugate ComplexOrder ENNReal
open QAlgorithms.Papers.Independent.Claimed50.P48
open QAlgorithms.Papers.Independent.Information100.P67 (receiverChannel complementaryChannel)
open QAlgorithms.Papers.Independent.Information100.P56 (entropy normalizedChoi)
open QAlgorithms.Papers.Independent.Information100.P50 (schattenNorm)
open QAlgorithms.Papers.Independent.Information100.P03 (convexRoof)
open QAlgorithms.Papers.Independent.Dependency50.P45 (holevoCapacity)
attribute [local instance] Classical.propDecidable Classical.decEq
variable {A B C D E K L A2 B2 C2 : Type*}
variable [Fintype A] [DecidableEq A] [Fintype B] [DecidableEq B]
variable [Fintype C] [DecidableEq C] [Fintype D] [DecidableEq D]
variable [Fintype E] [DecidableEq E] [Fintype K] [DecidableEq K]
variable [Fintype L] [DecidableEq L] [Fintype A2] [DecidableEq A2]
variable [Fintype B2] [DecidableEq B2] [Fintype C2] [DecidableEq C2]
/-- Unnumbered finite ancilla representation (87), PDF pp.28–29.
No unsupported rank d*kappa constraint is added. -/
theorem finite_ancilla_representation [Nonempty A] [Nonempty B]
(Phi : Superop A B) (hPhi : IsChannel Phi) :
∃ r : ℕ, ∃ hr : 0 < r, ∃ U : Matrix (B × Fin r) (A × Fin r) ℂ,
PartialIsometry U ∧ ∀ rho, Phi rho =
traceRight (U * (rho ⊗ₖ pureDensity (ket (⟨0,hr⟩ : Fin r))) * Uᴴ) := by sorry
end QAlgorithms.Papers.Independent.Gap48.P36
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For any finite nonempty index types , each equipped with decidable equality, and any map that admits a finite Kraus representation with , there exist a natural number and a complex matrix with rows indexed by and columns indexed by , satisfying , such that every complex matrix on satisfies
Here is the coordinate vector at index , and the displayed partial trace sends a matrix to the matrix with entry at . The identity holds for arbitrary , including matrices that are not density matrices; the asserted condition on is precisely .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.