§VII.A, Lemma 9: convexity of the first qubit objective
ProvedQAlgorithms.Papers.Independent.Gap48.P40.firstQubitObjectiveConvexFor , put . This is the canonical pure-state projector for after diagonal phase symmetry. Write with continuous zero-weight terms. If and , then
is convex on .
This states convexity of the source objective (44) itself.
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 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
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 of is convex on the closed interval :
Here is when , and otherwise, with , natural logarithms, and functional-calculus values ; the conversion sends either extended-real infinity to zero. Convexity means that the value at is at most times the value at plus times the value at , for all and . The cases , , , and are included.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.