Theorem 15: sorted block-sum bound (inequality clause)
OpenQAlgorithms.Papers.Independent.Gap48.P36.sorted_block_boundAll Hilbert spaces have positive finite dimension. Channels are completely positive and trace preserving; conjugates use the same normalized pure-environment dilation. Let be a basis of unitaries on , including , with . Let , , and . Write and , with density inputs, Schatten norm, and von Neumann entropy. Reorder all labeled weights by a permutation as and define . For each real ,
The additional equality/decomposability assertion is inventoried separately as deferred. Ties never merge distinct labels.
import Definitions.Def_QAlgorithms_Papers_Independent_Gap48_P36
noncomputable section
namespace QAlgorithms.Papers.Independent.Gap48.P36
open scoped BigOperators Matrix Kronecker ComplexConjugate ComplexOrder ENNReal
open QAlgorithms.Papers.Independent.Claimed50.P48
open QAlgorithms.Papers.Independent.Information100.P67 (receiverChannel complementaryChannel)
open QAlgorithms.Papers.Independent.Information100.P56 (entropy normalizedChoi)
open QAlgorithms.Papers.Independent.Information100.P50 (schattenNorm)
open QAlgorithms.Papers.Independent.Information100.P03 (convexRoof)
open QAlgorithms.Papers.Independent.Dependency50.P45 (holevoCapacity)
attribute [local instance] Classical.propDecidable Classical.decEq
variable {A B C D E K L A2 B2 C2 : Type*}
variable [Fintype A] [DecidableEq A] [Fintype B] [DecidableEq B]
variable [Fintype C] [DecidableEq C] [Fintype D] [DecidableEq D]
variable [Fintype E] [DecidableEq E] [Fintype K] [DecidableEq K]
variable [Fintype L] [DecidableEq L] [Fintype A2] [DecidableEq A2]
variable [Fintype B2] [DecidableEq B2] [Fintype C2] [DecidableEq C2]
/-- Theorem 15 inequality clause, PDF pp.22–24: a permutation preserves tied labels.
Its additional equality/decomposability clause is separately deferred. -/
theorem sorted_block_bound (d : ℕ) [NeZero d]
(T : UnitaryBasis (Fin d) K) (a : K → ℝ) (ha : ProbabilityWeights a)
(e : (Fin d × Fin d) ≃ K) (hs : SortedRows a e) (p : ℝ) (hp : 1 ≤ p) :
nu (ENNReal.ofReal p) (randomUnitary T.matrix a) =
nu (ENNReal.ofReal p) (randomComplement T.matrix a) ∧
nu (ENNReal.ofReal p) (randomUnitary T.matrix a) ≤ blockBound p a e := by sorry
end QAlgorithms.Papers.Independent.Gap48.P36
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be a nonzero natural number, let be a finite type with decidable equality, and let be complex matrices with a distinguished label , satisfying , , , and if and otherwise. Let satisfy and , and let be a bijection such that
For any real , define and define , indexed by , by . For a map , set , where , using matrix functional calculus. Then
The quantifiers include and , and weights may vanish.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.