Lemma 1: support dimensions and spanning of the environment
ProvedQAlgorithms.Papers.Independent.Support50.P01.support_dimensions_and_spanningLet , , and have positive finite dimensions and fixed orthonormal bases. Fix an isometry and define the channel and its genuine complement . Density operators are positive semidefinite with trace one, and all entropies use base-two logarithms with . Write , , and , with arbitrary entangled block inputs. Conjugate degradability means one CPTP map satisfies for every operator ; conjugate antidegradability reverses the receiver and environment in this identity. Assume conjugate degradability and fix any finite family of unit vectors . Set and , writing also for its rank-one projector. Then
The minimal-environment condition is imposed only on the spanning conclusion.
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P01
noncomputable section
namespace QAlgorithms.Papers.Independent.Support50.P01
open scoped BigOperators Matrix ComplexConjugate ComplexOrder
open Filter
open QAlgorithms.Papers.Independent.Information100.P67
(receiverChannel complementaryChannel IsDegradable dilationPower maximumCoherentInformation)
open QAlgorithms.Papers.Independent.Information100.P22 (coherentInformation quantumCapacity)
open QAlgorithms.Papers.Independent.Information100.P08 (maximallyMixed)
open QAlgorithms.Papers.Independent.Dependency50.P41 (EntanglementBreaking)
open QAlgorithms.Papers.Independent.Dependency50.P40 (outputFirstChoi)
attribute [local instance] Classical.propDecidable
attribute [local instance] Classical.decEq
variable {a b e c : ℕ}
/-- PDF pp.12–13, Lemma 1: equal support dimensions and environment spanning.
Minimality e=Choi rank is required only for the second conclusion. -/
theorem support_dimensions_and_spanning (ha : 0<a) (hb : 0<b) (he : 0<e)
(U : Matrix (Fin b × Fin e) (Fin a) ℂ) (hU : ConjugateDegradable U)
(m : ℕ) (psi : Fin m → EuclideanSpace ℂ (Fin a)) (hpsi : ∀ j, ‖psi j‖ = 1) :
(∀ j, (receiverChannel U (pureDensity (psi j))).rank =
(complementaryChannel U (pureDensity (psi j))).rank) ∧
(e = (outputFirstChoi (receiverChannel U)).rank →
(⨆ j, LinearMap.range (receiverChannel U (pureDensity (psi j))).mulVecLin) = ⊤ →
(⨆ j, LinearMap.range (complementaryChannel U (pureDensity (psi j))).mulVecLin) = ⊤) := by sorry
end QAlgorithms.Papers.Independent.Support50.P01
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be positive natural numbers and . Put and . Assume and that there exists a finite Kraus map from to matrices, with , such that for every complex matrix , using ordinary transpose. For any natural number and any family of unit vectors , one has
Furthermore, if , where , and if the sum of the ranges of the matrices is all of , then the sum of the ranges of is all of . Here sums of ranges mean their linear span, and . The case is included: the rank assertions are then vacuous, and the receiver-spanning antecedent is false because .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.