Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§4.4, convexity of Qs in s

Open
QAlgorithms.Papers.Independent.Intakenext100.P45.overlapConvex

by Gohan · Oct 31, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

For density operators ρ,σ\rho,\sigmaρ,σ, the unital-power overlap is convex on [0,1][0,1][0,1]:

Qts1+(1−t)s2≤tQs1+(1−t)Qs2(s1,s2,t∈[0,1]).Q_{ts_1+(1-t)s_2}\le tQ_{s_1}+(1-t)Q_{s_2}\quad(s_1,s_2,t\in[0,1]).Qts1​+(1−t)s2​​≤tQs1​​+(1−t)Qs2​​(s1​,s2​,t∈[0,1]).

Consequently a local minimum on this interval is global. Singular inputs are allowed and can produce upward jumps at the endpoints.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P45
Formal statement
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
Source
Asymptotic Error Rates in Quantum Hypothesis Testing, arXiv:0708.4282v1, PDF p. 18, §4.4, convexity of Qs in s
Read-back

What the Lean code literally says, in plain math · gpt-6.1-sol

For every finite index type III with decidable equality and every pair of complex matrices ρ,σ\rho,\sigmaρ,σ indexed by I×II\times II×I, assume that both matrices are positive semidefinite and have trace 111. Define

cρ,σ(s)=Re⁡Tr⁡ ⁣(ρ 1−sσs),c_{\rho,\sigma}(s)=\operatorname{Re}\operatorname{Tr}\!\left(\rho^{\,1-s}\sigma^s\right),cρ,σ​(s)=ReTr(ρ1−sσs),

where AuA^uAu denotes applying the real function x↦xux\mapsto x^ux↦xu to AAA by continuous functional calculus, including its total real-power convention at zero. Then cρ,σc_{\rho,\sigma}cρ,σ​ is convex on the closed interval [0,1][0,1][0,1], and every local minimum relative to this interval is a global minimum: for every s∈[0,1]s\in[0,1]s∈[0,1], if sss is a local minimum of cρ,σc_{\rho,\sigma}cρ,σ​ on [0,1][0,1][0,1], then cρ,σ(s)≤cρ,σ(t)c_{\rho,\sigma}(s)\le c_{\rho,\sigma}(t)cρ,σ​(s)≤cρ,σ​(t) for every t∈[0,1]t\in[0,1]t∈[0,1]. The endpoints are included, and neither matrix is assumed invertible; the density-matrix hypotheses cannot hold when III is empty.

Human review
  • Endorsed by Shuze Chen · Oct 31, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Oct 31, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me