Theorem 3: exact primal feasibility characterization
ProvedQAlgorithms.Papers.Independent.Support50.P11.primal_feasibility_iffFix a finite CPTP channel , a density matrix on , a positive integer , a real number , and Boolean flags , at least one true, selecting NS and PPTp respectively. Let be the unnormalized Choi matrix in reference–output order and ordinary partial transpose on . A forward-assisted code with the selected properties, average input exactly , and channel fidelity exactly exists if and only if: for , ; for , an operator exists with
All comparisons are Loewner inequalities. This retains both directions and the prescribed input state. The scalar branch corrects the printed proof's division by .
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P11
noncomputable section
open scoped Matrix ComplexConjugate ComplexOrder ENNReal
namespace QAlgorithms.Papers.Independent.Support50.P11
open QAlgorithms.Papers.Independent.Information100.P34 (choi dephasing permutationMatrix)
open QAlgorithms.Papers.Independent.Information100.P21 (pt)
open QAlgorithms.Papers.Independent.Dependency50.P09 (tensorAction)
open QAlgorithms.Papers.Independent.Information100.P76 (swapMatrix)
open QAlgorithms.Papers.Independent.Information100.P69 (replacer)
open QAlgorithms.Papers.Independent.Gap20.P19 (wernerIsometry)
attribute [local instance] Classical.propDecidable
attribute [local instance] Classical.decEq
section Statements
variable {I O : Type} [Fintype I] [Nonempty I] [Fintype O] [Nonempty O]
/-- PDF pp.6--7, Theorem 3, (31)--(35). The proof divides by K^2-1;
the printed scalar boundary is corrected to f=1 at K=1. The specified rho is retained. -/
theorem primal_feasibility_iff
(N : Superop I O) (hN : IsChannel N) (K : ℕ) (hK : 0 < K)
(s p : Bool) (hflags : s = true ∨ p = true)
(rho : Matrix I I ℂ) (hrho : IsDensityMatrix rho) (f : ℝ) :
(∃ Z : Superop (Fin K × O) (I × Fin K),
IsForwardCode K (flagsClass s p) Z ∧ codeAverageInput K Z = rho ∧
channelFidelity K (link K N Z) = f) ↔
(if K = 1 then f = 1 else
∃ L : Matrix (I × O) (I × O) ℂ, Primal K s p rho L ∧ f = primalObjective N L) := by sorry
end Statements
end QAlgorithms.Papers.Independent.Support50.P11
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For finite index types , with their required finite structures and decidable equality, let be a channel, let be a natural number, let be Boolean flags with at least one true, let be a positive semidefinite matrix on with trace , and let . A channel means a function admitting a finite Kraus representation on all matrices, with . Write for transpose on the second register, so , and write to mean is positive semidefinite. A permitted forward code is a channel for which some channel satisfies for every ; if is true it must also satisfy for every , for some channel , and if is true then must be a channel, where . Define
The linked-map score is
The assertion is that there exists a permitted code with and if and only if the following conditional statement holds: when , ; when , there exists a matrix on such that
where , is ordinary transpose, and all scalar reciprocals have their total-field meanings, including value zero at a zero denominator. Thus the branch on the right requires only , in addition to the theorem’s hypotheses; the two flags being false is excluded.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.