Lemma 9
ProvedQAlgorithms.Papers.Independent.Gap20.P19.degradingRangeContainmentAll Hilbert spaces are finite dimensional, complex, and nonzero. A channel is completely positive and trace preserving on every operator. Write for its Choi rank, the minimum pure-environment dimension. Receiver and complementary channels are always obtained from the same isometry.
Let be an isometric dilation of , and let be a CPTP map satisfying on every operator. For a unit input vector , put and . Every vector , including unnormalized vectors, satisfies
This controls the action of a particular degrader on pure-output support subspaces.
import Definitions.Def_QAlgorithms_Papers_Independent_Gap20_P19
noncomputable section
namespace QAlgorithms.Papers.Independent.Gap20.P19
open scoped BigOperators Matrix ComplexConjugate ComplexOrder Kronecker
open Filter Topology
open QAlgorithms.Papers.Independent.Information100.P67
(IsIsometry receiverChannel complementaryChannel IsDegradable IsAntidegradable
maximumCoherentInformation dilationPower)
open QAlgorithms.Papers.Independent.Claimed50.P48
(MinimalDilation indexedKrausDilation arbitraryVectorComplement superopTensor tensorDilation)
open QAlgorithms.Papers.Independent.Claimed50.P24 (ChannelEB)
open QAlgorithms.Papers.Independent.Information100.P60 (wernerHolevo)
open QAlgorithms.Papers.Independent.Gap48.P36 (finWeyl WeylLabel)
open QAlgorithms.Papers.Independent.Information100.P69 (choi)
open QAlgorithms.Papers.Independent.Information100.P50 (matrixRange)
open QAlgorithms.Papers.Independent.Information100.P08 (IsPure)
attribute [local instance] Classical.propDecidable Classical.decEq
variable {A B C E F R K A2 B2 E2 : Type}
variable [Fintype A] [DecidableEq A] [Nonempty A]
variable [Fintype B] [DecidableEq B] [Nonempty B]
variable [Fintype C] [DecidableEq C] [Nonempty C]
variable [Fintype E] [DecidableEq E] [Nonempty E]
variable [Fintype F] [DecidableEq F] [Nonempty F]
variable [Fintype R] [DecidableEq R] [Nonempty R]
variable [Fintype K] [DecidableEq K]
variable [Fintype A2] [DecidableEq A2] [Nonempty A2]
variable [Fintype B2] [DecidableEq B2] [Nonempty B2]
variable [Fintype E2] [DecidableEq E2] [Nonempty E2]
/-- Lemma 9, PDF pp.16–17. The contained vector need not be normalized;
its zero case gives the zero range. The degrader is CPTP on all operators. -/
theorem degradingRangeContainment [Nonempty A] [Nonempty B] [Nonempty E]
(U : Matrix (B × E) A ℂ) (hU : IsIsometry U)
(D : Superop B E) (hD : IsChannel D)
(hdegrade : ∀ rho, D (receiverChannel U rho) = complementaryChannel U rho)
(psi : EuclideanSpace ℂ A) (hpsi : IsState psi)
(phi : EuclideanSpace ℂ B)
(hphi : (fun b => phi b) ∈ matrixRange (receiverChannel U (pureDensity psi))) :
matrixRange (D (pureDensity phi)) ≤ matrixRange (complementaryChannel U (pureDensity psi)) := by sorry
end QAlgorithms.Papers.Independent.Gap20.P19
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be nonempty finite types with decidable equality, let satisfy , and let be a map on receiver matrices with a finite Kraus representation , where and . Assume that, for every matrix , , with partial trace defined by summing matching indices of the discarded factor. For every with and every belonging to the range of the matrix , one has
The ranges are the images of the corresponding matrix linear maps. The vector need not be normalized or nonzero, so is included.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.