§VII.A, Lemma 10: convexity of the second qubit objective
ProvedQAlgorithms.Papers.Independent.Gap48.P40.secondQubitObjectiveConvexFor , put . This is the canonical pure-state projector for after diagonal phase symmetry. Write with continuous zero-weight terms. If and , put . Then
is convex on .
This includes the zero-residual-weight endpoint of objective (45).
import Definitions.Def_QAlgorithms_Papers_Independent_Gap48_P40
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 pp.9–10, Lemma 10: objective (45), including eta=0. -/
theorem secondQubitObjectiveConvex (beta T : ℝ) (hbeta : 0 < beta ∧ beta ≤ 1 / 2)
(hT : beta < T ∧ T ≤ 1 - beta) :
ConvexOn ℝ (Set.Icc (-1 : ℝ) 1) (qubitObjectiveTwo beta T) := by sorry
end QAlgorithms.Papers.Independent.Gap48.P40
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every pair of real numbers satisfying and , the following real-valued function is convex on :
Here if , and otherwise; , logarithms are natural, and functional calculus uses . The conversion to a real number sends either infinity to zero. Convexity asserts the usual inequality for every two points in and every convex combination of them. The endpoints and are included; when , no satisfies the stated strict and weak inequalities.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.