§6: no extra cq corner for erasure MAC
OpenQAlgorithms.Papers.Independent.Support50.P02.erasure_side_informationLet and let be the controlled-erasure MAC that flags Alice's computational-basis outcome and coherently transfers Bob's -dimensional input on outcome . Fix any pure ensemble on Alice's inputs and an independent pure Bob reference/input pair, and let be their output under . If , then the new cq corner lies in the old rectangle for that very state:
This is pointwise for every positive blocklength and every such input, without optimization. The hypothesis precisely restricts the claimed corner to nonnegative operational rates; negative information coordinates are not in the source's rate rectangles.
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P02
noncomputable section
open scoped BigOperators Matrix ComplexConjugate
namespace QAlgorithms.Papers.Independent.Support50.P02
open QAlgorithms.Papers.Independent.Information100.P67
(squaredFidelity receiverChannel complementaryChannel IsDegradable)
open QAlgorithms.Papers.Independent.Information100.P21 (Op)
open QAlgorithms.Papers.Independent.Information100.P03 (PureEnsemble)
open QAlgorithms.Papers.Independent.Dependency50.P19 (epr)
attribute [local instance] Classical.propDecidable Classical.decEq
variable {A B C E R S I J : Type*}
variable [Fintype A] [DecidableEq A] [Fintype B] [DecidableEq B]
variable [Fintype C] [DecidableEq C] [Fintype E] [DecidableEq E]
variable [Fintype R] [DecidableEq R] [Fintype S] [DecidableEq S]
variable [Fintype I] [DecidableEq I] [Fintype J] [DecidableEq J]
/-- No extra erasure cq corner, PDF p.31, with the channel defined on pp.32–33.
This is pointwise at EVERY positive blocklength, not merely optimized-region equality.
The new corner is an operational rate pair when its quantum coordinate is nonnegative;
negative information corners are not elements of the source's nonnegative rectangles. -/
theorem erasure_side_information (d n : ℕ) (hd : 0 < d) (hn : 0 < n)
(D : CQMacData (Fin n → Bool) (Fin n → Fin d))
(hcorner : 0 ≤ D.coherent (macPower (controlledErasure d) n)) :
D.Rectangle (macPower (controlledErasure d) n)
(D.sideClassical (macPower (controlledErasure d) n),
D.coherent (macPower (controlledErasure d) n)) := by sorry
end QAlgorithms.Papers.Independent.Support50.P02
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every pair of positive natural numbers , consider any data consisting of a finite ensemble of unit vectors on , real weights summing to one, a positive integer , and a unit vector on , where . Let send the false-control block trace to an extra erasure index, retain the true-control block, and set cross entries to zero, and apply this map independently to the input pairs. Define
where the factors are reordered so that each channel receives one Boolean input and one -dimensional input. Put
with for the continuous functional calculus of . Under the hypothesis , the assertion is precisely that belongs to the rectangle determined by these same data, namely
No existence of data satisfying the hypothesis is asserted.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.