Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Definitions for Continuity bounds on the quantum relative entropy - II

Definition
QAlgorithms_Papers_Independent_Support50_P17

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

prove2quantum

The objects the formalized statements of Continuity bounds on the quantum relative entropy - II (arXiv:1105.2656) are stated in. Each was checked against the paper by a blind read-back and a moderator.

  • zeroExtendedLogCorrection: PDF p.6, (13), and p.8: the continuous zero-alpha extension of the correction. Only alpha,T ≥ 0 are used in statements.
  • regularisedRelativeEntropy: PDF p.2 and p.9, (21): fixed dimension-dependent positive normalization c. The arguments shifted by I have trace d+1, not one.
  • resolventIntegrand: PDF p.3, (6): the genuine resolvent integrand, with s meaning sI.
  • logarithmDerivativeMap: PDF p.3, (6): entrywise Lebesgue integral for the logarithmic derivative map. For B positive definite every entry is integrable on (0,infinity); the actual convergence needed in Lemma 3 is included in its conclusion, not assumed. The definition's values outside this domain are not used.
  • propositionA: PDF p.8: the first explicit extremal matrix of Proposition 1.
  • propositionB: PDF p.8: the second explicit extremal matrix of Proposition 1.
  • regularisedRho: PDF p.9: Diag(1−t,t,0), padded with zeros in higher dimensions. The sharpness statement uses d≥3.
  • regularisedSigma: PDF p.9: Diag(1−t,0,t), padded with zeros in higher dimensions.
Definition code
import Mathlib
import Definitions.Def_QAlgorithms_Defs_Information
import Definitions.Def_QAlgorithms_Defs_MatrixDistances
import Definitions.Def_QAlgorithms_Defs_QuantumOutputMetrics
import Definitions.Def_QAlgorithms_Papers_Independent_Dependency50_P21

/-!
Statements from Audenaert and Eisert, arXiv:1105.2656v3, PDF pp.2–9.
All logarithms are natural. The shifted matrices are never renormalized.
The arbitrary-path part of Lemma 1 and the dimensional necessity remark are
explicitly deferred in HARD.md; the separately displayed linear formula is retained.
The support and signed entropy definitions are imported from the pinned accepted
Dependency50.P21 module, as explicitly required by the repair instructions.
The other imports are Mathlib and frozen Defs modules.
Compilation is pending the batch handoff.
-/

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 p.6, (13), and p.8: the continuous zero-alpha extension of the correction.
Only alpha,T ≥ 0 are used in statements. -/
def zeroExtendedLogCorrection (alpha T : ℝ) : ℝ :=
  if alpha = 0 then 0 else -alpha * Real.log (1 + T / alpha)

/-- PDF p.2 and p.9, (21): fixed dimension-dependent positive normalization c.
The arguments shifted by I have trace d+1, not one. -/
def regularisedRelativeEntropy {I : Type*} [Fintype I] [DecidableEq I]
    (c : ℝ) (rho sigma : Matrix I I ℂ) : EReal :=
  (c : EReal) * relativeEntropy (rho + 1) (sigma + 1)

/-- PDF p.3, (6): the genuine resolvent integrand, with s meaning sI. -/
def resolventIntegrand {I : Type*} [Fintype I] [DecidableEq I]
    (B D : Matrix I I ℂ) (s : ℝ) : Matrix I I ℂ :=
  (B + (s : ℂ) • (1 : Matrix I I ℂ))⁻¹ * D *
    (B + (s : ℂ) • (1 : Matrix I I ℂ))⁻¹

/-- PDF p.3, (6): entrywise Lebesgue integral for the logarithmic derivative map.
For B positive definite every entry is integrable on (0,infinity); the actual
convergence needed in Lemma 3 is included in its conclusion, not assumed.
The definition's values outside this domain are not used. -/
def logarithmDerivativeMap {I : Type*} [Fintype I] [DecidableEq I]
    (B D : Matrix I I ℂ) : Matrix I I ℂ :=
  fun i j => ∫ s in Set.Ioi (0 : ℝ), resolventIntegrand B D s i j

/-- PDF p.8: the first explicit extremal matrix of Proposition 1. -/
def propositionA (alpha T : ℝ) : Matrix (Fin 2) (Fin 2) ℂ :=
  Matrix.diagonal ![((1 + T : ℝ) : ℂ), (alpha : ℂ)]

/-- PDF p.8: the second explicit extremal matrix of Proposition 1. -/
def propositionB (alpha T : ℝ) : Matrix (Fin 2) (Fin 2) ℂ :=
  Matrix.diagonal ![(1 : ℂ), ((T + alpha : ℝ) : ℂ)]

/-- PDF p.9: Diag(1−t,t,0), padded with zeros in higher dimensions.
The sharpness statement uses d≥3. -/
def regularisedRho (d : ℕ) (t : ℝ) : Matrix (Fin d) (Fin d) ℂ :=
  Matrix.diagonal fun i =>
    if i.val = 0 then ((1 - t : ℝ) : ℂ) else if i.val = 1 then (t : ℂ) else 0

/-- PDF p.9: Diag(1−t,0,t), padded with zeros in higher dimensions. -/
def regularisedSigma (d : ℕ) (t : ℝ) : Matrix (Fin d) (Fin d) ℂ :=
  Matrix.diagonal fun i =>
    if i.val = 0 then ((1 - t : ℝ) : ℂ) else if i.val = 2 then (t : ℂ) else 0

/-- PDF p.2: a matrix is supported in itself. -/
example {I : Type*} [Fintype I] [DecidableEq I] (A : Matrix I I ℂ) :
    IsSupported A A := le_rfl

/-- PDF p.3, (2): the scalar identity has zero divergence from itself. -/
example : relativeEntropy (1 : Matrix (Fin 1) (Fin 1) ℂ) 1 = 0 := by
  have hs : IsSupported (1 : Matrix (Fin 1) (Fin 1) ℂ) 1 := le_rfl
  simp [relativeEntropy, hs, cfc_one]

/-- PDF p.6: the correction has its stated zero-alpha value. -/
example (T : ℝ) : zeroExtendedLogCorrection 0 T = 0 := by
  simp [zeroExtendedLogCorrection]

/-- PDF p.6: zero distance gives zero correction. -/
example (alpha : ℝ) : zeroExtendedLogCorrection alpha 0 = 0 := by
  simp [zeroExtendedLogCorrection]

/-- PDF p.2: normalization c=1 leaves the shifted entropy unchanged. -/
example {I : Type*} [Fintype I] [DecidableEq I] (rho sigma : Matrix I I ℂ) :
    regularisedRelativeEntropy 1 rho sigma = relativeEntropy (rho + 1) (sigma + 1) := by
  simp [regularisedRelativeEntropy]

/-- PDF p.3: zero direction has identically zero resolvent integrand. -/
example {I : Type*} [Fintype I] [DecidableEq I] (B : Matrix I I ℂ) (s : ℝ) :
    resolventIntegrand B 0 s = 0 := by
  simp [resolventIntegrand]

/-- PDF pp.3–4: the logarithmic derivative map sends zero to zero. -/
example {I : Type*} [Fintype I] [DecidableEq I] (B : Matrix I I ℂ) :
    logarithmDerivativeMap B 0 = 0 := by
  ext i j
  simp [logarithmDerivativeMap, resolventIntegrand]

/-- PDF p.8: the first diagonal entry of the proposed extremal A. -/
example (alpha T : ℝ) : propositionA alpha T 0 0 = ((1 + T : ℝ) : ℂ) := by
  simp [propositionA]

/-- PDF p.8: the second diagonal entry of the proposed extremal B. -/
example (alpha T : ℝ) : propositionB alpha T 1 1 = ((T + alpha : ℝ) : ℂ) := by
  simp [propositionB]

/-- PDF p.9: at t=0 the two explicit states coincide, including their zero padding. -/
example (d : ℕ) : regularisedRho d 0 = regularisedSigma d 0 := by
  simp [regularisedRho, regularisedSigma]

/-- PDF p.9: the nonzero second entry of the first sharpness state is t. -/
example (t : ℝ) : regularisedRho 3 t 1 1 = (t : ℂ) := by
  simp [regularisedRho]

/-- PDF p.9: the nonzero third entry of the second sharpness state is t. -/
example (t : ℝ) : regularisedSigma 3 t 2 2 = (t : ℂ) := by
  simp [regularisedSigma]

end QAlgorithms.Papers.Independent.Support50.P17
Source
Continuity bounds on the quantum relative entropy - II, arXiv:1105.2656v3, https://arxiv.org/abs/1105.2656v3
Read-back

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

QAlgorithms.Papers.Independent.Support50.P17.logarithmDerivativeMap

For any finite index type III with decidable equality and arbitrary complex matrices B,DB,DB,D indexed by III, this defines the matrix whose (i,j)(i,j)(i,j) entry is

∫(0,∞)[(B+s1)−1D(B+s1)−1]ij ds,\int_{(0,\infty)} \left[(B+s\mathbf1)^{-1}D(B+s\mathbf1)^{-1}\right]_{ij}\,ds,∫(0,∞)​[(B+s1)−1D(B+s1)−1]ij​ds,

using Lebesgue integration separately for each complex entry. No positivity, invertibility, or integrability assumption is imposed. Matrix inverses are total, with singular matrices assigned zero, and an entry’s integral is zero if that entry’s integrand is not integrable. Empty III is permitted.

QAlgorithms.Papers.Independent.Support50.P17.propositionA

For arbitrary real numbers α,T\alpha,Tα,T, this defines the complex 2×22\times22×2 diagonal matrix diag⁡(1+T,α)\operatorname{diag}(1+T,\alpha)diag(1+T,α), with both off-diagonal entries zero. No sign restrictions are imposed.

QAlgorithms.Papers.Independent.Support50.P17.propositionB

For arbitrary real numbers α,T\alpha,Tα,T, this defines the complex 2×22\times22×2 diagonal matrix diag⁡(1,T+α)\operatorname{diag}(1,T+\alpha)diag(1,T+α), with both off-diagonal entries zero. No sign restrictions are imposed.

QAlgorithms.Papers.Independent.Support50.P17.regularisedRelativeEntropy

For any finite index type III with decidable equality, any real ccc, and arbitrary complex matrices ρ,σ\rho,\sigmaρ,σ indexed by III, this defines an extended real number cD(ρ+1∥σ+1)cD(\rho+\mathbf1\|\sigma+\mathbf1)cD(ρ+1∥σ+1), where 1\mathbf11 is the identity matrix and

D(X∥Y)={Re⁡tr⁡ ⁣((x↦xlog⁡x)(X)−X(log⁡)(Y)),ker⁡Y⊆ker⁡X,+∞,otherwise.D(X\|Y)= \begin{cases} \operatorname{Re}\operatorname{tr}\!\left((x\mapsto x\log x)(X)-X(\log)(Y)\right),&\ker Y\subseteq\ker X,\\ +\infty,&\text{otherwise}. \end{cases}D(X∥Y)={Retr((x↦xlogx)(X)−X(log)(Y)),+∞,​kerY⊆kerX,otherwise.​

The matrix functions are given by continuous functional calculus, and multiplication by ccc takes place in the extended reals. There are no positivity, trace, or sign assumptions on the arguments; III may be empty.

QAlgorithms.Papers.Independent.Support50.P17.regularisedRho

For every natural number ddd and real ttt, this defines a complex diagonal matrix indexed by 0,…,d−10,\ldots,d-10,…,d−1, whose diagonal entry at index 000 is 1−t1-t1−t, at index 111 is ttt, and at every other index is zero. Thus d=0d=0d=0 gives the empty matrix and d=1d=1d=1 gives the single entry 1−t1-t1−t; no restriction such as 0≤t≤10\le t\le10≤t≤1 is assumed.

QAlgorithms.Papers.Independent.Support50.P17.regularisedSigma

For every natural number ddd and real ttt, this defines a complex diagonal matrix indexed by 0,…,d−10,\ldots,d-10,…,d−1, whose diagonal entry at index 000 is 1−t1-t1−t, at index 222 is ttt, and at every other index is zero. Thus d=0d=0d=0 gives the empty matrix, d=1d=1d=1 gives the single entry 1−t1-t1−t, and d=2d=2d=2 gives diag⁡(1−t,0)\operatorname{diag}(1-t,0)diag(1−t,0); no restriction on ttt is assumed.

QAlgorithms.Papers.Independent.Support50.P17.resolventIntegrand

For any finite index type III with decidable equality, arbitrary complex matrices B,DB,DB,D indexed by III, and any real sss, this defines the matrix (B+s1)−1D(B+s1)−1(B+s\mathbf1)^{-1}D(B+s\mathbf1)^{-1}(B+s1)−1D(B+s1)−1. No positivity or invertibility is required. The inverse is the total matrix inverse, which is the zero matrix when its argument is singular; the empty index type is also allowed.

QAlgorithms.Papers.Independent.Support50.P17.zeroExtendedLogCorrection

For arbitrary real numbers α,T\alpha,Tα,T, this defines g(α,T)=0g(\alpha,T)=0g(α,T)=0 when α=0\alpha=0α=0, and g(α,T)=−αlog⁡(1+T/α)g(\alpha,T)=-\alpha\log(1+T/\alpha)g(α,T)=−αlog(1+T/α) otherwise. No positivity assumptions are imposed. Here the real logarithm is total: log⁡0=0\log 0=0log0=0, and for a negative argument it equals the logarithm of its absolute value.

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