Thermal entropy and its inverse on the nonnegative ray
ProvedQAlgorithms.Papers.Independent.Support50.P06.thermalEntropy_functionPropertiesOn , let , with . The function is nonnegative, nondecreasing and concave. Its inverse on is nonnegative, nondecreasing and convex, and
The accepted inverse is zero at zero and, for positive , the infimum of , a nonempty set bounded below. These properties justify entropy-matched thermal parameters, including the vacuum endpoint.
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P06
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, footnote 4: nonnegativity, monotonicity, concavity of g and
nonnegativity, monotonicity, convexity of its genuine inverse, including both
inverse identities at zero. The inverse upper-level sets are nonempty and
bounded below on the positive domain; no empty real-infimum value is used. -/
theorem thermalEntropy_functionProperties :
(∀ N : ℝ, 0 ≤ N → 0 ≤ g N) ∧
MonotoneOn g (Set.Ici 0) ∧ ConcaveOn ℝ (Set.Ici 0) g ∧
(∀ S : ℝ, 0 ≤ S → 0 ≤ thermalEntropyInverse S) ∧
MonotoneOn thermalEntropyInverse (Set.Ici 0) ∧
ConvexOn ℝ (Set.Ici 0) thermalEntropyInverse ∧
(∀ N : ℝ, 0 ≤ N → thermalEntropyInverse (g N) = N) ∧
(∀ S : ℝ, 0 ≤ S → g (thermalEntropyInverse S) = S) := by sorry
end QAlgorithms.Papers.Independent.Support50.P06
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Define
where the logarithm is the total real logarithm, with , and the infimum is the real infimum used in the definition. The assertion is that for every , that is nondecreasing and concave on , that for every , that is nondecreasing and convex on , and that the two identities
hold. All these statements include the endpoint , at which both displayed functions equal .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.