Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Monotonicity of the thermal entropy difference

Proved
QAlgorithms.Papers.Independent.Support50.P06.g_difference_monotone

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

prove2quantum

Let g(x)=(x+1)ln⁡(x+1)−xln⁡xg(x)=(x+1)\ln(x+1)-x\ln xg(x)=(x+1)ln(x+1)−xlnx, with 0ln⁡0=00\ln0=00ln0=0. For a fixed real ccc with 0≤c<10\le c<10≤c<1,

0≤x≤y⟹g(x)−g(cx)≤g(y)−g(cy).0\le x\le y\quad\Longrightarrow\quad g(x)-g(cx)\le g(y)-g(cy).0≤x≤y⟹g(x)−g(cx)≤g(y)−g(cy).

The closed domain includes x=0x=0x=0 and the parameter includes c=0c=0c=0. This is the nondecrease used to choose the upper endpoint in equation (12).

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P06
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Support50.P06

open MeasureTheory Filter

open scoped ENNReal BigOperators Topology

open QAlgorithms.RealRegisters (Hilbert)

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

open QAlgorithms.Papers.Independent.Next46.P32
  (NumberString FockKernel identicalThermalKernel vacuum productCoherentKernel
   jointMix bobMarginal charlieMarginal pureLoss broadcast mixedOutput
   spectralEntropyNats FockPOVM realFockTracePair modeEnergy complexNormal
   StrongConjecture2)

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

open QAlgorithms.Papers.Independent.Claimed50.P11 (thermalEntropyInverse)

attribute [local instance] Classical.propDecidable Classical.decEq

/-- PDF p.3, after (12): nondecrease on the entire closed nonnegative ray,
including c=0 and x=0. No derivative at zero is assumed. -/
theorem g_difference_monotone (c : ℝ) (hc : 0 ≤ c) (hc_one : c < 1) :
    MonotoneOn (fun x : ℝ => g x - g (c * x)) (Set.Ici 0) := by sorry

end QAlgorithms.Papers.Independent.Support50.P06

end
Source
Capacity of the Bosonic Wiretap Channel and the Entropy Photon-Number Inequality, arXiv:0801.0841v1, PDF p. 3, §III, scalar monotonicity used in (12)
Read-back

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

For every real ccc with 0≤c<10\le c<10≤c<1, the function x↦g(x)−g(cx)x\mapsto g(x)-g(cx)x↦g(x)−g(cx) is nondecreasing on [0,∞)[0,\infty)[0,∞), where

g(x)=(x+1)log⁡(x+1)−xlog⁡xg(x)=(x+1)\log(x+1)-x\log xg(x)=(x+1)log(x+1)−xlogx

uses the total real logarithm, with log⁡0=0\log0=0log0=0. Explicitly, whenever 0≤x≤y0\le x\le y0≤x≤y,

g(x)−g(cx)≤g(y)−g(cy).g(x)-g(cx)\le g(y)-g(cy).g(x)−g(cx)≤g(y)−g(cy).

This includes c=0c=0c=0 and x=0x=0x=0; it does not include c=1c=1c=1.

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

    Confirmed by the moderator at approval.

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