Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

6.10

Open
QAlgorithms.Papers.Independent.Intakenext100.P07.supported_optimizers

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ρ​.

There are separate optimizers for smooth min and smooth max in the support of ρ_A⊗ρ_B; each is subnormalized and within radius ε.

Hmin⁡ε(A∣B)ρ=Hmin⁡(A∣B)ρ~min⁡,Hmax⁡ε(A∣B)ρ=Hmax⁡(A∣B)ρ~max⁡,H_{\min}^{\varepsilon}(A|B)_\rho=H_{\min}(A|B)_{\widetilde\rho_{\min}},\qquad H_{\max}^{\varepsilon}(A|B)_\rho=H_{\max}(A|B)_{\widetilde\rho_{\max}},Hminε​(A∣B)ρ​=Hmin​(A∣B)ρ​min​​,Hmaxε​(A∣B)ρ​=Hmax​(A∣B)ρ​max​​,

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.10
6.10, arXiv:1504.00233v5, PDF p.99. -/
theorem supported_optimizers [Nonempty A] [Nonempty B] (r : paperMat (A × B)) (hr : paperSubnormalized r) (e : ℝ) (he : Radius r e) :
    (∃ t ∈ paperBall r e, paperSupported t (Matrix.kronecker (traceRight r) (traceLeft r)) ∧ paperSmoothMin r e = paperHmin t) ∧
    (∃ t ∈ paperBall r e, paperSupported t (Matrix.kronecker (traceRight r) (traceLeft r)) ∧ paperSmoothMax r e = hmax t) := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P07

end
Source
Quantum Information Processing with Finite Resources -- Mathematical Foundations, arXiv:1504.00233v5, PDF p. 99, 6.10
Read-back

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

Let A,BA,BA,B be finite nonempty index types with decidable equality, let r⪰0r\succeq0r⪰0 be a complex matrix on A×BA\times BA×B with Re⁡tr⁡r≤1\operatorname{Re}\operatorname{tr}r\le1Retrr≤1, and let e∈Re\in\mathbb Re∈R satisfy 0≤e<Re⁡tr⁡r0\le e<\sqrt{\operatorname{Re}\operatorname{tr}r}0≤e<Retrr​. Define

P(X,Z)=1−(Re⁡tr⁡X ZX+(1−Re⁡tr⁡X)(1−Re⁡tr⁡Z))2,Be(r)={X⪰0:Re⁡tr⁡X≤1, P(X,r)≤e}.P(X,Z)=\sqrt{1-\left( \operatorname{Re}\operatorname{tr}\sqrt{\sqrt X\,Z\sqrt X} +\sqrt{(1-\operatorname{Re}\operatorname{tr}X) (1-\operatorname{Re}\operatorname{tr}Z)} \right)^2}, \qquad \mathcal B_e(r)=\{X\succeq0: \operatorname{Re}\operatorname{tr}X\le1,\ P(X,r)\le e\}.P(X,Z)=1−(RetrX​ZX​​+(1−RetrX)(1−RetrZ)​)2​,Be​(r)={X⪰0:RetrX≤1, P(X,r)≤e}.

For matrices XXX on A×BA\times BA×B, define

Hmin⁡(X)=sup⁡{ℓ∈R:∃σ⪰0, Re⁡tr⁡σ≤1, X⪯2−ℓ(1A⊗σ)},H_{\min}(X)=\sup\{\ell\in\mathbb R: \exists \sigma\succeq0,\ \operatorname{Re}\operatorname{tr}\sigma\le1,\ X\preceq2^{-\ell}(\mathbf1_A\otimes\sigma)\},Hmin​(X)=sup{ℓ∈R:∃σ⪰0, Retrσ≤1, X⪯2−ℓ(1A​⊗σ)}, Hmax⁡(X)=sup⁡σ⪰0Re⁡tr⁡σ≤1log⁡∗(Re⁡tr⁡X(1A⊗σ)X)2,Hmin⁡e(r)=sup⁡X∈Be(r)Hmin⁡(X),Hmax⁡e(r)=inf⁡X∈Be(r)Hmax⁡(X).H_{\max}(X)= \sup_{\substack{\sigma\succeq0\\ \operatorname{Re}\operatorname{tr}\sigma\le1}} \log_*\left(\operatorname{Re}\operatorname{tr} \sqrt{\sqrt X(\mathbf1_A\otimes\sigma)\sqrt X}\right)^2, \quad H_{\min}^e(r)=\sup_{X\in\mathcal B_e(r)}H_{\min}(X), \quad H_{\max}^e(r)=\inf_{X\in\mathcal B_e(r)}H_{\max}(X).Hmax​(X)=σ⪰0Retrσ≤1​sup​log∗​(RetrX​(1A​⊗σ)X​​)2,Hmine​(r)=X∈Be​(r)sup​Hmin​(X),Hmaxe​(r)=X∈Be​(r)inf​Hmax​(X).

These entropy extrema are extended-real; log⁡∗0=−∞\log_*0=-\inftylog∗​0=−∞ and otherwise log⁡∗=log⁡2\log_*=\log_2log∗​=log2​, square roots use continuous functional calculus, and X⪯YX\preceq YX⪯Y means Y−X⪰0Y-X\succeq0Y−X⪰0. Let rA=Tr⁡Brr_A=\operatorname{Tr}_B rrA​=TrB​r and rB=Tr⁡Arr_B=\operatorname{Tr}_A rrB​=TrA​r, obtained by summing matching indices of the traced subsystem. There exists tmin⁡∈Be(r)t_{\min}\in\mathcal B_e(r)tmin​∈Be​(r) with ker⁡(rA⊗rB)⊆ker⁡tmin⁡\ker(r_A\otimes r_B)\subseteq\ker t_{\min}ker(rA​⊗rB​)⊆kertmin​ and Hmin⁡e(r)=Hmin⁡(tmin⁡)H_{\min}^e(r)=H_{\min}(t_{\min})Hmine​(r)=Hmin​(tmin​), and there exists, separately, tmax⁡∈Be(r)t_{\max}\in\mathcal B_e(r)tmax​∈Be​(r) with ker⁡(rA⊗rB)⊆ker⁡tmax⁡\ker(r_A\otimes r_B)\subseteq\ker t_{\max}ker(rA​⊗rB​)⊆kertmax​ and Hmax⁡e(r)=Hmax⁡(tmax⁡)H_{\max}^e(r)=H_{\max}(t_{\max})Hmaxe​(r)=Hmax​(tmax​). The radius hypothesis excludes trace-zero rrr.

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