Lemma 2
ProvedQAlgorithms.Papers.Independent.Gap20.P19.pureOutputRangesAll 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 a minimal isometric dilation of a degradable channel , with complement . For any finite family of unit vectors , define vector subspaces and . Then
The spanning implication relates output supports to the minimal environment.
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 2, PDF pp.8–9. Bj and Ej are vector subspaces. The common
dilation is minimal, preventing false spanning conclusions after padding. -/
theorem pureOutputRanges [Nonempty A] [Nonempty B] [Nonempty E]
(U : Matrix (B × E) A ℂ) (hU : IsDegradable U)
(hmin : MinimalDilation (receiverChannel U) U) :
∀ m : ℕ, ∀ psi : Fin m → EuclideanSpace ℂ A,
(∀ j, IsState (psi j)) →
(∀ j, (receiverChannel U (pureDensity (psi j))).rank =
(complementaryChannel U (pureDensity (psi j))).rank) ∧
((⨆ j, matrixRange (receiverChannel U (pureDensity (psi j)))) = ⊤ →
(⨆ j, matrixRange (complementaryChannel U (pureDensity (psi j)))) = ⊤) := 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 index types with decidable equality, and let be a complex matrix. Define and , where partial traces sum diagonal entries over the indicated factor. Assume that and there exists a channel from to such that for every matrix ; here a channel means a map for finitely many matrices satisfying . Also assume that is minimal in the following precise sense: for every natural number and every matrix , if for all , then , without any isometry requirement on this competing . Then, for every natural number and every family of norm-one vectors , each pair , has equal matrix rank, and
The quantification includes : the rank assertions then have no instances, and the implication has a false antecedent because the span of the empty family is zero while is nonempty.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.