Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Convexity of the single-mode lower bound

Proved
QAlgorithms.Papers.Independent.Advance50.P24.lowerBoundConvex

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

prove2quantum

For every N>0N>0N>0, define L(η,N)=g(ηN)−g((1−η)N)L(\eta,N)=g(\eta N)-g((1-\eta)N)L(η,N)=g(ηN)−g((1−η)N) for η>1/2\eta>1/2η>1/2 and zero otherwise, where g(x)=(1+x)log⁡(1+x)−xlog⁡xg(x)=(1+x)\log(1+x)-x\log xg(x)=(1+x)log(1+x)−xlogx in nats and g(0)=0g(0)=0g(0)=0. Then

η⟼L(η,N)is convex on [0,1].\eta\longmapsto L(\eta,N)\quad\text{is convex on }[0,1].η⟼L(η,N)is convex on [0,1].

This includes both the zero branch and the endpoint η=1\eta=1η=1. It is a scalar analytic statement, with no capacity or derivative hypothesis.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Advance50_P24
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Advance50.P24

open MeasureTheory Filter

open scoped BigOperators ENNReal Topology ComplexOrder Matrix.Norms.Elementwise

open QAlgorithms.Papers.Independent.Claimed50.P39 (g)

open QAlgorithms.Papers.Independent.Support50.P06
  (BosonicPrivateCode randomizedPrivateCodePhotonBudget
   holevoMessagePrivacyCapacityNats)

open QAlgorithms.Papers.Independent.Next46.P32
  (NumberString FockKernel beamCoefficient vacuum bobMarginal charlieMarginal
   spectralEntropyNats realFockTracePair)

open QAlgorithms.Papers.Independent.Dependency50.P16 (majorizedBy)

open QAlgorithms.Papers.Independent.Renew46.P30 (passiveEntry)

open QAlgorithms.Papers.Independent.Dependency50.P33 (State)

open QAlgorithms.Papers.Independent.Next46.P32 (FockPOVM)

attribute [local instance] Classical.propDecidable Classical.decEq

/-- Lemma 2, PDF p.5: full convexity, including eta=1 and the zero branch.
The printed positive photon budget is retained; no derivative condition is assumed. -/
theorem lowerBoundConvex (N : ℝ) (hN : 0 < N) :
    ConvexOn ℝ (Set.Icc (0 : ℝ) 1) (fun eta => lowerBound eta N) := by sorry

end QAlgorithms.Papers.Independent.Advance50.P24

end
Source
Private-Capacity Bounds for Bosonic Wiretap Channels, arXiv:1202.1126v1, PDF p. 5, Lemma 2: convexity of the single-mode lower bound
Read-back

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

For every real N>0N>0N>0, the function LN:[0,1]→RL_N:[0,1]\to\mathbb RLN​:[0,1]→R given by

LN(η)={g(ηN)−g((1−η)N),η>12,0,η≤12,g(x)=(x+1)log⁡(x+1)−xlog⁡x,L_N(\eta)= \begin{cases} g(\eta N)-g((1-\eta)N),&\eta>\tfrac12,\\ 0,&\eta\le\tfrac12, \end{cases} \qquad g(x)=(x+1)\log(x+1)-x\log x,LN​(η)={g(ηN)−g((1−η)N),0,​η>21​,η≤21​,​g(x)=(x+1)log(x+1)−xlogx,

is convex on the closed interval [0,1][0,1][0,1]. Explicitly, for η1,η2∈[0,1]\eta_1,\eta_2\in[0,1]η1​,η2​∈[0,1] and a,b≥0a,b\ge0a,b≥0 with a+b=1a+b=1a+b=1, it satisfies LN(aη1+bη2)≤aLN(η1)+bLN(η2)L_N(a\eta_1+b\eta_2)\le aL_N(\eta_1)+bL_N(\eta_2)LN​(aη1​+bη2​)≤aLN​(η1​)+bLN​(η2​). The value at η=12\eta=\tfrac12η=21​ is supplied by the zero branch, both interval endpoints are included, logarithms are natural with log⁡0=0\log0=0log0=0, and the hypothesis excludes N=0N=0N=0.

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

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Oct 29, 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