Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Linear-path integral representation of relative entropy

Open
QAlgorithms.Papers.Independent.Support50.P17.linearPath

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

prove2quantum

Let A≥0A\ge0A≥0 and B>0B>0B>0 be square complex matrices on the same nonzero finite-dimensional Hilbert space. Their traces need not agree and AAA may be singular. Put Δ=B−A\Delta=B-AΔ=B−A and use natural spectral logarithms. The real scalar function s↦Re⁡Tr⁡[Δlog⁡(A+sΔ)]s\mapsto\operatorname{Re}\operatorname{Tr}[\Delta\log(A+s\Delta)]s↦ReTr[Δlog(A+sΔ)] is integrable on [0,1][0,1][0,1], and

S(A∥B)=Re⁡Tr⁡(A−B)+Re⁡Tr⁡[Δlog⁡B]−∫01Re⁡Tr⁡[Δlog⁡(A+sΔ)] ds.S(A\|B)=\operatorname{Re}\operatorname{Tr}(A-B) +\operatorname{Re}\operatorname{Tr}[\Delta\log B] -\int_0^1\operatorname{Re}\operatorname{Tr}[\Delta\log(A+s\Delta)]\,ds.S(A∥B)=ReTr(A−B)+ReTr[ΔlogB]−∫01​ReTr[Δlog(A+sΔ)]ds.

At a zero eigenvalue the endpoint logarithm is assigned zero for this integrand; changing that single endpoint value does not change the integral. The entropy itself uses the zero-weight spectral convention.

This is the separately displayed linear specialization (12); it does not replace the deferred arbitrary-path assertion.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P17
Formal statement
noncomputable section

open MeasureTheory

open scoped Matrix ComplexOrder Matrix.Norms.L2Operator

namespace QAlgorithms.Papers.Independent.Support50.P17

attribute [local instance] Classical.propDecidable Classical.decEq

-- Reuse the exact frozen support predicate and signed, unnormalised entropy.

open QAlgorithms.Papers.Independent.Dependency50.P21 (IsSupported relativeEntropy)

/-- PDF pp.4–5, Lemma 1, displayed linear-path identity (12), independently of
its under-specified arbitrary-path claim. A may be singular; equal trace is not assumed.
Integrability of the actual real scalar integrand is part of the conclusion. -/
theorem linearPath {I : Type*} [Fintype I] [DecidableEq I] [Nonempty I]
    (A B : Matrix I I ℂ) (hA : A.PosSemidef) (hB : B.PosDef) :
    let f : ℝ → ℝ := fun s =>
      ((B - A) * cfc Real.log (A + (s : ℂ) • (B - A))).trace.re
    IntegrableOn f (Set.Icc (0 : ℝ) 1) ∧
      relativeEntropy A B =
        (((A - B).trace.re + ((B - A) * cfc Real.log B).trace.re -
          ∫ s in Set.Icc (0 : ℝ) 1, f s : ℝ) : EReal) := by sorry

end QAlgorithms.Papers.Independent.Support50.P17

end
Source
Continuity bounds on the quantum relative entropy - II, arXiv:1105.2656v3, PDF p. 4, Lemma 1, explicit linear-path result (12)
Read-back

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

For every finite, nonempty index type III with decidable equality, every positive semidefinite complex matrix AAA, and every positive definite complex matrix BBB indexed by III, define f(s)=Re⁡tr⁡((B−A)log⁡(A+s(B−A)))f(s)=\operatorname{Re}\operatorname{tr}((B-A)\log(A+s(B-A)))f(s)=Retr((B−A)log(A+s(B−A))), with the matrix logarithm given by continuous functional calculus and scalar value log⁡0=0\log0=0log0=0. Then fff is Lebesgue integrable on [0,1][0,1][0,1], and

D(A∥B)=Re⁡tr⁡(A−B)+Re⁡tr⁡((B−A)log⁡B)−∫[0,1]f(s) ds,D(A\|B)=\operatorname{Re}\operatorname{tr}(A-B) +\operatorname{Re}\operatorname{tr}((B-A)\log B) -\int_{[0,1]}f(s)\,ds,D(A∥B)=Retr(A−B)+Retr((B−A)logB)−∫[0,1]​f(s)ds,

where the right side is embedded into the extended reals and D(A∥B)=Re⁡tr⁡((x↦xlog⁡x)(A)−Alog⁡B)D(A\|B)=\operatorname{Re}\operatorname{tr}((x\mapsto x\log x)(A)-A\log B)D(A∥B)=Retr((x↦xlogx)(A)−AlogB), since BBB is invertible. No equality of traces is assumed, and AAA may be singular, including A=0A=0A=0.

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