Corollary to Theorem 1: pinching
OpenQAlgorithms.Papers.Independent.Intakenext100.P42.pinching_contractivityAll registers are finite and nonempty; all input density matrices are positive semidefinite with trace one.
Let satisfy F2, F3, unit-vector F5b, and block additivity F5a on the positive subnormalized domain. Let be a finite complete family of pairwise orthogonal Hermitian projectors, and let be density matrices. Then
This is the summed-block consequence of pinching contractivity, including zero blocks.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P42
noncomputable section
open scoped Matrix ComplexConjugate ComplexOrder ENNReal Topology
namespace QAlgorithms.Papers.Independent.Intakenext100.P42
open QAlgorithms QAlgorithms.Entanglement
open QAlgorithms.Papers.Independent.Dependency50.P21 (relativeEntropy)
open QAlgorithms.Papers.Independent.Information100.P56 (entropy)
open QAlgorithms.Papers.Independent.Information100.P04 (copies)
open QAlgorithms.Papers.Independent.Bridge50.P49 (groupedProduct)
attribute [local instance] Classical.propDecidable Classical.decEq
/-- Corollary, PDF p.10, Eq.(15): the right-hand projectors occur in BOTH blocks. -/
theorem pinching_contractivity (D : DistanceFamily) (h2 : UnitaryInvariantDistance D) (h3 : F3 D)
(h5a : F5a D) (h5b : F5b D)
{I K : Type} [Fintype I] [Fintype K] [DecidableEq I] [Nonempty I]
(P : K → Matrix I I ℂ) (hP : CompleteProjectors P)
(sigma rho : Matrix I I ℂ) (hsigma : IsDensityMatrix sigma) (hrho : IsDensityMatrix rho) :
(∑ k, D (P k * sigma * P k) (P k * rho * P k)) ≤ D sigma rho := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P42
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be an extended real valued family on pairs of complex square matrices on finite types with decidable equality. Assume simultaneous unitary conjugation leaves unchanged on density matrices; partial trace over any nonempty finite factor does not increase on density matrices; and tensoring both arguments with the same pure matrix , for any unit vector on a nonempty finite ancillary type with decidable equality, leaves unchanged. These assumptions apply on every nonempty finite underlying type with decidable equality. Also assume that, for every such underlying type, every finite outcome type, every family of mutually orthogonal Hermitian idempotents summing to the identity, and every density pair ,
Here a density matrix is positive semidefinite with complex trace , , and partial trace over means . Then, for every nonempty finite type with decidable equality, every finite type , every family of complex matrices on satisfying
and every density pair on ,
No decidable equality or nonemptiness assumption is imposed on ; if is empty, the completeness hypothesis is impossible because is nonempty.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.