Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§6.2.2: attained extrema, radius monotonicity, zero smoothing

Open
QAlgorithms.Papers.Independent.Intakenext100.P07.smoothing_properties

by Gohan · Oct 31, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

All quantum systems below are finite-dimensional complex Hilbert spaces of positive dimension, and logarithms are binary. A normalized state is positive semidefinite with trace one; a subnormalized state has trace at most one. Marginals are partial traces. Here FFF is squared algebraic fidelity, F∗F_*F∗​ is squared generalized fidelity, P=1−F∗P=\sqrt{1-F_*}P=1−F∗​​ is purified distance, and Δ(ρ,τ)=max⁡0≤M≤I∣Tr⁡((ρ−τ)M)∣\Delta(\rho,\tau)=\max_{0\le M\le I}|\operatorname{Tr}((\rho-\tau)M)|Δ(ρ,τ)=max0≤M≤I​∣Tr((ρ−τ)M)∣. The symbols Hmin⁡H_{\min}Hmin​ and Hmax⁡H_{\max}Hmax​ denote conditional min- and max-entropy, with values +∞+\infty+∞ and −∞-\infty−∞ at zero. Smoothing optimizes over all subnormalized states in the purified-distance ball; every entropy radius satisfies 0≤ε<Tr⁡ρ0\le\varepsilon<\sqrt{\operatorname{Tr}\rho}0≤ε<Trρ​.

Both smooth entropy extrema are attained; Hmin^ε increases and Hmax^ε decreases in radius; at zero radius they equal the respective unsmoothed entropies.

ε≤ε′⟹Hmin⁡ε≤Hmin⁡ε′,Hmax⁡ε≥Hmax⁡ε′,Hmin⁡0=Hmin⁡,Hmax⁡0=Hmax⁡.\varepsilon\le\varepsilon^\prime\Longrightarrow H_{\min}^{\varepsilon}\le H_{\min}^{\varepsilon^\prime},\quad H_{\max}^{\varepsilon}\ge H_{\max}^{\varepsilon^\prime},\qquad H_{\min}^0=H_{\min},\quad H_{\max}^0=H_{\max}.ε≤ε′⟹Hminε​≤Hminε′​,Hmaxε​≥Hmaxε′​,Hmin0​=Hmin​,Hmax0​=Hmax​.

This result records the source’s operational or structural relation, with the stated endpoint and attainment clauses retained.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P07
Formal statement
noncomputable section

open Filter

open scoped BigOperators Matrix ComplexConjugate ComplexOrder Matrix.Norms.L2Operator Topology

namespace QAlgorithms.Papers.Independent.Intakenext100.P07

attribute [local instance] Classical.propDecidable Classical.decEq

variable {I J A B C D X Y Z : Type*}

variable [Fintype I] [DecidableEq I] [Fintype J] [DecidableEq J]

variable [Fintype A] [DecidableEq A] [Fintype B] [DecidableEq B]

variable [Fintype C] [DecidableEq C] [Fintype D] [DecidableEq D]

variable [Fintype X] [DecidableEq X] [Fintype Y] [DecidableEq Y]

variable [Fintype Z] [DecidableEq Z]

/-- NODE paper:1504.00233#6.smoothingproperties
§6.2.2: attained extrema, radius monotonicity, zero smoothing, arXiv:1504.00233v5, PDF p.98. -/
theorem smoothing_properties [Nonempty A] [Nonempty B] (r : paperMat (A × B)) (hr : paperSubnormalized r)
    (e ep : ℝ) (he : Radius r e) (hep : Radius r ep) :
    (∃ t ∈ paperBall r e, paperSmoothMin r e = paperHmin t) ∧ (∃ t ∈ paperBall r e, paperSmoothMax r e = hmax t) ∧
    (e ≤ ep → paperSmoothMin r e ≤ paperSmoothMin r ep ∧ paperSmoothMax r ep ≤ paperSmoothMax r e) ∧
    paperSmoothMin r 0 = paperHmin r ∧ paperSmoothMax r 0 = hmax r := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P07

end
Source
Quantum Information Processing with Finite Resources -- Mathematical Foundations, arXiv:1504.00233v5, PDF p. 98, §6.2.2: attained extrema, radius monotonicity, zero smoothing
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, and let rrr be a complex matrix indexed by A×BA\times BA×B, positive semidefinite with Re⁡tr⁡r≤1\operatorname{Re}\operatorname{tr}r\le1Retrr≤1. Let e,e′∈Re,e'\in\mathbb Re,e′∈R satisfy 0≤e<Re⁡tr⁡r0\le e<\sqrt{\operatorname{Re}\operatorname{tr}r}0≤e<Retrr​ and 0≤e′<Re⁡tr⁡r0\le e'<\sqrt{\operatorname{Re}\operatorname{tr}r}0≤e′<Retrr​; in particular, these hypotheses exclude r=0r=0r=0. Define

R(u,v)=Re⁡tr⁡u vu,P(u,v)=1−(R(u,v)+(1−Re⁡tr⁡u)(1−Re⁡tr⁡v))2,R(u,v)=\operatorname{Re}\operatorname{tr}\sqrt{\sqrt u\,v\sqrt u},\qquad P(u,v)=\sqrt{1-\left(R(u,v)+\sqrt{(1-\operatorname{Re}\operatorname{tr}u)(1-\operatorname{Re}\operatorname{tr}v)}\right)^2},R(u,v)=Retru​vu​​,P(u,v)=1−(R(u,v)+(1−Retru)(1−Retrv)​)2​,

where matrix square roots are given by real functional calculus, and put Be(r)={u:u⪰0, Re⁡tr⁡u≤1, P(u,r)≤e}\mathcal B_e(r)=\{u:u\succeq0,\ \operatorname{Re}\operatorname{tr}u\le1,\ P(u,r)\le e\}Be​(r)={u:u⪰0, Retru≤1, P(u,r)≤e}. For a matrix uuu on A×BA\times BA×B, define the extended-real quantities

Hmin⁡(u)=sup⁡{ℓ∈R:∃s⪰0, Re⁡tr⁡s≤1, u⪯2−ℓ(IA⊗s)},Hmax⁡(u)=sup⁡s⪰0Re⁡tr⁡s≤1L ⁣(R(u,IA⊗s)2),H_{\min}(u)=\sup\left\{\ell\in\mathbb R:\exists s\succeq0,\ \operatorname{Re}\operatorname{tr}s\le1,\ u\preceq2^{-\ell}(I_A\otimes s)\right\}, \quad H_{\max}(u)=\sup_{\substack{s\succeq0\\\operatorname{Re}\operatorname{tr}s\le1}}L\!\left(R(u,I_A\otimes s)^2\right),Hmin​(u)=sup{ℓ∈R:∃s⪰0, Retrs≤1, u⪯2−ℓ(IA​⊗s)},Hmax​(u)=s⪰0Retrs≤1​sup​L(R(u,IA​⊗s)2),

where sss is indexed by BBB, X⪯YX\preceq YX⪯Y means Y−X⪰0Y-X\succeq0Y−X⪰0, and L(0)=−∞L(0)=-\inftyL(0)=−∞, while L(x)=log⁡2xL(x)=\log_2xL(x)=log2​x for x≠0x\ne0x=0, using the total real logarithm. Set Hmin⁡e(r)=sup⁡u∈Be(r)Hmin⁡(u)H_{\min}^e(r)=\sup_{u\in\mathcal B_e(r)}H_{\min}(u)Hmine​(r)=supu∈Be​(r)​Hmin​(u) and Hmax⁡e(r)=inf⁡u∈Be(r)Hmax⁡(u)H_{\max}^e(r)=\inf_{u\in\mathcal B_e(r)}H_{\max}(u)Hmaxe​(r)=infu∈Be​(r)​Hmax​(u). The assertion is that both extrema at radius eee are attained by matrices in Be(r)\mathcal B_e(r)Be​(r), possibly by different matrices; that e≤e′e\le e'e≤e′ implies both Hmin⁡e(r)≤Hmin⁡e′(r)H_{\min}^e(r)\le H_{\min}^{e'}(r)Hmine​(r)≤Hmine′​(r) and Hmax⁡e′(r)≤Hmax⁡e(r)H_{\max}^{e'}(r)\le H_{\max}^e(r)Hmaxe′​(r)≤Hmaxe​(r); and that Hmin⁡0(r)=Hmin⁡(r)H_{\min}^0(r)=H_{\min}(r)Hmin0​(r)=Hmin​(r) and Hmax⁡0(r)=Hmax⁡(r)H_{\max}^0(r)=H_{\max}(r)Hmax0​(r)=Hmax​(r).

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

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Oct 31, 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