§2.3: co-degradable pair construction (24)–(25)
ProvedQAlgorithms.Papers.Independent.Gap20.P19.coDegradableFlagsAll 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 have isometric dilations with possibly different environments. Suppose CPTP maps satisfy and on every operator. Then the normalized sum-flag dilation realizes
is degradable, and .
The cross-degrading maps are assumptions on the pair. No existence assertion about additional co-degradable pairs is made.
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]
/-- Section 2.3, PDF p.11, (24)–(25): cross-degraders are hypotheses on
the pair; their environments remain distinct. Minimal Kraus ranks add. -/
theorem coDegradableFlags [Nonempty A] [Nonempty B] [Nonempty E] [Nonempty F]
(U : Matrix (B × E) A ℂ) (V : Matrix (B × F) A ℂ)
(hU : IsIsometry U) (hV : IsIsometry V)
(X : Superop B E) (Y : Superop B F) (hX : IsChannel X) (hY : IsChannel Y)
(hcrossX : ∀ rho, X (receiverChannel V rho) = complementaryChannel U rho)
(hcrossY : ∀ rho, Y (receiverChannel U rho) = complementaryChannel V rho) :
receiverChannel (coFlagDilation U V) = coFlags (receiverChannel U) (receiverChannel V) ∧
IsDegradable (coFlagDilation U V) ∧
(choi (coFlags (receiverChannel U) (receiverChannel V))).rank =
(choi (receiverChannel U)).rank+(choi (receiverChannel V)).rank := 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, and let and satisfy . Write , , and similarly for . Suppose and are channels, meaning matrix maps admitting finite Kraus representations with , and suppose, for every matrix on , and . Define by , , with all other entries zero, and define to have diagonal flag blocks and , and zero off-diagonal flag blocks. Then the receiver map of equals ; moreover, and there exists a channel from matrices on to matrices on such that its application to the receiver output of equals the complementary output of , for every input matrix. Finally,
where .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.