§4.6, unitary and ancilla invariances
OpenQAlgorithms.Papers.Independent.Intakenext100.P45.invariancesFor finite-dimensional density operators , a unitary , and any ancillary density operator ,
The ancilla may be singular and have any finite dimension. These invariances support channel monotonicity.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P45
noncomputable section
namespace QAlgorithms.Papers.Independent.Intakenext100.P45
open QAlgorithms Filter
open scoped Matrix ComplexConjugate ComplexOrder ENNReal BigOperators Topology
open QAlgorithms.Papers.Independent.Information100.P07
(support positivePart positiveProjection IsProjection)
open QAlgorithms.Papers.Independent.Information100.P56 (IsLaw)
open QAlgorithms.Papers.Independent.Information100.P60 (Mat copies)
open QAlgorithms.Papers.Independent.Dependency50.P28 (logNonnegativeExtended relativeEntropy)
open QAlgorithms.Papers.Independent.Claimed50.P15 (positiveMatrixRpow)
attribute [local instance] Classical.propDecidable Classical.decEq
variable {I J : Type} [Fintype I] [DecidableEq I] [Fintype J] [DecidableEq J]
/-- arXiv:0708.4282v1, PDF p.18: §4.6, unitary and ancilla invariances. -/
theorem invariances (rho sigma : Mat I)
(hrho : IsDensityMatrix rho) (hsigma : IsDensityMatrix sigma)
(U : Matrix.unitaryGroup I ℂ) (tau : Mat J) (htau : IsDensityMatrix tau) :
chernoffInfimum ((U : Mat I)*rho*(U : Mat I)ᴴ) ((U : Mat I)*sigma*(U : Mat I)ᴴ) =
chernoffInfimum rho sigma ∧
chernoffInfimum (Matrix.kronecker rho tau) (Matrix.kronecker sigma tau) =
chernoffInfimum rho sigma := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P45
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every pair of finite index types with decidable equality, let be positive semidefinite complex matrices indexed by with trace , let be any unitary matrix on , and let be a positive semidefinite complex matrix indexed by with trace . Define
where powers use continuous functional calculus and total real powers. Then both equalities
hold, where . No matrix among is assumed invertible; their trace conditions exclude empty or .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.