Theorem 3: full-rank pure output and environment dimension
ProvedQAlgorithms.Papers.Independent.Support50.P01.fullRankOutput_environmentDimensionLet , , 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 a minimal environment, . If some unit vector satisfies , then
This identifies the minimal environment dimension from a full-rank output of a pure input.
Formalization Note The printed extra application , after defining , is corrected to , as used in the source proof.
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 p.13, Theorem 3: the printed rank N(rho), after rho=N(psi), is ill-typed
for rectangular channels. The proof uses rank rho=dim B, which is stated here.
A minimal environment is required; arbitrary isometric padding would refute the claim. -/
theorem fullRankOutput_environmentDimension (ha : 0<a) (hb : 0<b) (he : 0<e)
(U : Matrix (Fin b × Fin e) (Fin a) ℂ) (hU : ConjugateDegradable U)
(hminimal : e = (outputFirstChoi (receiverChannel U)).rank)
(hfull : ∃ psi : EuclideanSpace ℂ (Fin a), ‖psi‖ = 1 ∧
(receiverChannel U (pureDensity psi)).rank = b) : b=e := 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 . Define and . Assume and that there exists a map with finitely many Kraus matrices satisfying and
Assume also that , where , and that there exists a unit vector for which . Then . The transpose above is ordinary transpose, and ; the full-rank assumption is required for at least one such unit vector.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.