§4.4, convexity of Qs in s
OpenQAlgorithms.Papers.Independent.Intakenext100.P45.overlapConvexFor density operators , the unital-power overlap is convex on :
Consequently a local minimum on this interval is global. Singular inputs are allowed and can produce upward jumps at the endpoints.
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.4, convexity of Qs in s. -/
theorem overlapConvex (rho sigma : Mat I)
(hrho : IsDensityMatrix rho) (hsigma : IsDensityMatrix sigma) :
ConvexOn ℝ (Set.Icc (0 : ℝ) 1) (chernoffOverlap rho sigma) ∧
(∀ s ∈ Set.Icc (0 : ℝ) 1,
IsLocalMinOn (chernoffOverlap rho sigma) (Set.Icc 0 1) s →
∀ t ∈ Set.Icc (0 : ℝ) 1, chernoffOverlap rho sigma s ≤ chernoffOverlap rho sigma t) := 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 finite index type with decidable equality and every pair of complex matrices indexed by , assume that both matrices are positive semidefinite and have trace . Define
where denotes applying the real function to by continuous functional calculus, including its total real-power convention at zero. Then is convex on the closed interval , and every local minimum relative to this interval is a global minimum: for every , if is a local minimum of on , then for every . The endpoints are included, and neither matrix is assumed invertible; the density-matrix hypotheses cannot hold when is empty.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.