Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Positive-part smoothing estimate

Proved
QAlgorithms.Papers.Independent.Support50.P23.positivePartSmoothing

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

prove2quantum

Let ρAB\rho_{AB}ρAB​ and σB\sigma_BσB​ be normalized finite-dimensional states and λ>0\lambda>0λ>0. Compute Δ=(ρAB−λIA⊗σB)+\Delta=(\rho_{AB}-\lambda I_A\otimes\sigma_B)_+Δ=(ρAB​−λIA​⊗σB​)+​ by positive-part functional calculus and put ε=2tr⁡Δ\varepsilon=\sqrt{2\operatorname{tr}\Delta}ε=2trΔ​. Then

Hmin⁡ε(A∣B)ρ∣σ≥−log⁡2λ.H_{\min}^{\varepsilon}(A|B)_{\rho|\sigma}\ge-\log_2\lambda.Hminε​(A∣B)ρ∣σ​≥−log2​λ.

The radius can be zero or at least one; the closed ball and extended entropy cover these cases. This estimates smooth min entropy from the positive tail of an operator difference.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P23
Formal statement
noncomputable section

open Filter

open scoped ENNReal ComplexConjugate ComplexOrder

namespace QAlgorithms.Papers.Independent.Support50.P23

attribute [local instance] Classical.propDecidable

-- Exact accepted bodies. Other similarly named catalogue entries use different
-- smoothing, conditioning order, logarithm base, or channel-level objects.

open QAlgorithms.Papers.Independent.Gap20.P03 (fixedMin)

open QAlgorithms.Papers.Independent.Dependency50.P36 (relativeEntropy)

open QAlgorithms.Papers.Independent.Information100.P67 (IsSubnormalized)

open QAlgorithms.Papers.Independent.Information100.P69 (matrixPower)

variable {A B C D I : Type*}

variable [Fintype A] [Fintype B] [Fintype C] [Fintype D] [Fintype I]

variable [DecidableEq A] [DecidableEq B] [DecidableEq C] [DecidableEq D] [DecidableEq I]

/-- Lemma 15, PDF p.8, (C1). Radius sqrt(2 tr positivePart) is computed, including
zero and radii>=1. Neither a smoothing witness nor its entropy bound is assumed. -/
theorem positivePartSmoothing [Nonempty A] [Nonempty B]
    (rho : Matrix (A × B) (A × B) ℂ) (sigma : Matrix B B ℂ)
    (hrho : IsDensityMatrix rho) (hsigma : IsDensityMatrix sigma)
    (lambda : ℝ) (hlambda : 0 < lambda) :
    ((-Real.logb 2 lambda : ℝ) : EReal) ≤
      sineSmoothFixedMin rho sigma (thresholdRadius rho sigma lambda) := by sorry

end QAlgorithms.Papers.Independent.Support50.P23

end
Source
A Fully Quantum Asymptotic Equipartition Property, arXiv:0811.1221v3, PDF p. 8, Lemma 15: positive-part smoothing estimate, (C1)
Read-back

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

Let A,BA,BA,B be nonempty finite types with decidable equality, let ρ\rhoρ on CA×B\mathbb C^{A\times B}CA×B and σ\sigmaσ on CB\mathbb C^BCB be positive semidefinite matrices of trace 111, and let λ>0\lambda>0λ>0 be real. Set J=IA⊗σJ=I_A\otimes\sigmaJ=IA​⊗σ and

δ=2 Re⁡tr⁡(ρ−λJ)+,\delta=\sqrt{2\,\operatorname{Re}\operatorname{tr}(\rho-\lambda J)_+},δ=2Retr(ρ−λJ)+​​,

where X+X_+X+​ applies x↦max⁡(x,0)x\mapsto\max(x,0)x↦max(x,0) to the eigenvalues of the Hermitian matrix XXX. Then

−log⁡2λ≤sup⁡τ⪰0, Re⁡tr⁡τ≤11−F0(ρ,τ)2≤δ sup⁡{r∈R:2−rJ−τ⪰0},F0(ρ,τ)=Re⁡tr⁡ρ τρ.-\log_2\lambda\le \sup_{\substack{\tau\succeq0,\ \operatorname{Re}\operatorname{tr}\tau\le1\\ \sqrt{1-F_0(\rho,\tau)^2}\le\delta}} \ \sup\{r\in\mathbb R:2^{-r}J-\tau\succeq0\}, \qquad F_0(\rho,\tau)=\operatorname{Re}\operatorname{tr}\sqrt{\sqrt\rho\,\tau\sqrt\rho}.−log2​λ≤τ⪰0, Retrτ≤11−F0​(ρ,τ)2​≤δ​sup​ sup{r∈R:2−rJ−τ⪰0},F0​(ρ,τ)=Retrρ​τρ​​.

Both suprema and the inequality are interpreted in the extended reals. The allowed τ\tauτ include zero and need not have trace 111; there is no hypothesis that δ<1\delta<1δ<1, nor any support-inclusion hypothesis.

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