Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§VII.A, Lemma 9: convexity of the first qubit objective

Proved
QAlgorithms.Papers.Independent.Gap48.P40.firstQubitObjectiveConvex

by Goku · Oct 22, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

For t∈[−1,1]t\in[-1,1]t∈[−1,1], put P(t)=12(1+t1−t21−t21−t)P(t)=\frac12\begin{pmatrix}1+t&\sqrt{1-t^2}\\\sqrt{1-t^2}&1-t\end{pmatrix}P(t)=21​(1+t1−t2​​1−t2​1−t​). This is the canonical pure-state projector for t=cos⁡(2α)t=\cos(2\alpha)t=cos(2α) after diagonal phase symmetry. Write D(A∥B)=Tr⁡[A(log⁡A−log⁡B)]D(A\|B)=\operatorname{Tr}[A(\log A-\log B)]D(A∥B)=Tr[A(logA−logB)] with continuous zero-weight terms. If 0<β≤1/20<\beta\le1/20<β≤1/2 and 0≤T≤β0\le T\le\beta0≤T≤β, then

t⟼D(diag⁡(β+T,β−T)+(1−2β)P(t)∥βI+(1−2β)P(t))t\longmapsto D(\operatorname{diag}(\beta+T,\beta-T)+(1-2\beta)P(t)\|\beta I+(1-2\beta)P(t))t⟼D(diag(β+T,β−T)+(1−2β)P(t)∥βI+(1−2β)P(t))

is convex on [−1,1][-1,1][−1,1].

This states convexity of the source objective (44) itself.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Gap48_P40
Formal statement
noncomputable section

open scoped Matrix ComplexConjugate ComplexOrder Topology Matrix.Norms.L2Operator

open Filter MeasureTheory Asymptotics

open QAlgorithms

open QAlgorithms.Papers.Independent.Dependency50.P21 (relativeEntropy)

open QAlgorithms.Papers.Independent.Information100.P50 (IsUINorm)

open QAlgorithms.Papers.Independent.Information100.P56 (entropy)

open QAlgorithms.Papers.Independent.Information100.P60 (copies)

open QAlgorithms.Papers.Independent.Information100.P44 (Mat)

namespace QAlgorithms.Papers.Independent.Gap48.P40

/-- PDF p.9, Lemma 9: convexity of the actual objective (44). -/
theorem firstQubitObjectiveConvex (beta T : ℝ) (hbeta : 0 < beta ∧ beta ≤ 1 / 2)
    (hT : 0 ≤ T ∧ T ≤ beta) :
    ConvexOn ℝ (Set.Icc (-1 : ℝ) 1) (qubitObjectiveOne beta T) := by sorry

end QAlgorithms.Papers.Independent.Gap48.P40

end
Source
Continuity bounds on the quantum relative entropy, arXiv:quant-ph/0503218v3, PDF p. 9, §VII.A, Lemma 9: convexity of the first qubit objective
Read-back

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

For every pair of real numbers β,T\beta,Tβ,T satisfying 0<β≤120<\beta\le\tfrac120<β≤21​ and 0≤T≤β0\le T\le\beta0≤T≤β, the following real-valued function of ttt is convex on the closed interval [−1,1][-1,1][−1,1]:

t⟼[D ⁣(diag⁡(β+T,β−T)+(1−2β)ψtψt∗ ∥ βI2+(1−2β)ψtψt∗)]R,ψt=((1+t)/2(1−t)/2).t\longmapsto \left[ D\!\left( \operatorname{diag}(\beta+T,\beta-T)+(1-2\beta)\psi_t\psi_t^* \,\middle\|\, \beta I_2+(1-2\beta)\psi_t\psi_t^* \right) \right]_{\mathbb R}, \qquad \psi_t= \begin{pmatrix} \sqrt{(1+t)/2}\\ \sqrt{(1-t)/2} \end{pmatrix}.t⟼[D(diag(β+T,β−T)+(1−2β)ψt​ψt∗​∥βI2​+(1−2β)ψt​ψt∗​)]R​,ψt​=((1+t)/2​(1−t)/2​​).

Here D(R∥S)D(R\|S)D(R∥S) is Re⁡tr⁡(f(R)−Rlog⁡S)\operatorname{Re}\operatorname{tr}(f(R)-R\log S)Retr(f(R)−RlogS) when ker⁡S⊆ker⁡R\ker S\subseteq\ker RkerS⊆kerR, and +∞+\infty+∞ otherwise, with f(x)=xlog⁡xf(x)=x\log xf(x)=xlogx, natural logarithms, and functional-calculus values log⁡0=f(0)=0\log0=f(0)=0log0=f(0)=0; the conversion [⋅]R[\cdot]_{\mathbb R}[⋅]R​ sends either extended-real infinity to zero. Convexity means that the value at λt+(1−λ)u\lambda t+(1-\lambda)uλt+(1−λ)u is at most λ\lambdaλ times the value at ttt plus 1−λ1-\lambda1−λ times the value at uuu, for all t,u∈[−1,1]t,u\in[-1,1]t,u∈[−1,1] and 0≤λ≤10\le\lambda\le10≤λ≤1. The cases T=0T=0T=0, T=βT=\betaT=β, β=12\beta=\tfrac12β=21​, and t=±1t=\pm1t=±1 are included.

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

    Confirmed by the moderator at approval.

  • Endorsed by Goku · Oct 22, 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