Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Conditional min-entropy dominates the actual-marginal reference bound

Open
QAlgorithms.Papers.Independent.Intakenext100.P63.conditional_min_actual_marginal

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

prove2quantum

Let ρAB\rho^{AB}ρAB be a normalized bipartite density matrix on nonzero finite-dimensional spaces, and put ρB=Tr⁡AρAB\rho^B=\operatorname{Tr}_A\rho^{AB}ρB=TrA​ρAB. Define Hmin⁡(A∣B)ρ=−log⁡2min⁡{λ:ρAB≤λ(IA⊗σB), σB a normalized density}H_{\min}(A|B)_\rho=-\log_2\min\{\lambda:\rho^{AB}\le\lambda(I_A\otimes\sigma^B),\ \sigma^B\text{ a normalized density}\}Hmin​(A∣B)ρ​=−log2​min{λ:ρAB≤λ(IA​⊗σB), σB a normalized density}. With inverse square roots taken on the support and zero eigenvalues mapped to zero,

Hmin⁡(A∣B)ρ≥−log⁡2∥(IA⊗(ρB)−1/2)ρAB(IA⊗(ρB)−1/2)∥op=:H∞(A∣B)ρ.H_{\min}(A|B)_\rho\ge-\log_2\left\|(I_A\otimes(\rho^B)^{-1/2})\rho^{AB}(I_A\otimes(\rho^B)^{-1/2})\right\|_{\rm op}=:H_\infty(A|B)_\rho.Hmin​(A∣B)ρ​≥−log2​​(IA​⊗(ρB)−1/2)ρAB(IA​⊗(ρB)−1/2)​op​=:H∞​(A∣B)ρ​.

Here the norm is the Euclidean operator norm. No full-rank assumption is imposed. The inequality compares optimization over all normalized references to the particular actual marginal reference.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P63
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Intakenext100.P63

open QAlgorithms Filter

open QAlgorithms.Papers.Independent.Information100.P63 (Mat)

open QAlgorithms.Papers.Independent.Information100.P04 (Measurement)

open QAlgorithms.Papers.Independent.Information100.P27 (shannon labelInformation)

open QAlgorithms.Papers.Independent.Information100.P71 (channelPower dilationMap SupportIncluded)

open QAlgorithms.Papers.Independent.Bridge50.P47 (SymmetricIndex universalSymmetricDilation)

open QAlgorithms.Learning (IsDistribution)

open scoped Matrix ComplexConjugate ComplexOrder

attribute [local instance] Classical.propDecidable Classical.decEq

/-- PDF p.9, Definition 7: comparison with the actual marginal reference.
The inverse is on its support and the norm is the Euclidean operator norm. -/
theorem conditional_min_actual_marginal {A B : Type}
    [Fintype A] [DecidableEq A] [Nonempty A]
    [Fintype B] [DecidableEq B] [Nonempty B]
    (rho : Mat (A × B)) (hrho : IsDensityMatrix rho) :
    marginalMinEntropy rho ≤ conditionalMinBits rho := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P63

end
Source
Weak locking capacity of quantum channels can be much larger than private capacity, arXiv:1403.6361v3, PDF p. 9, Definition 7, supporting comparison with the actual marginal reference
Read-back

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

Let A,BA,BA,B be finite nonempty types with decidable equality, and let ρ\rhoρ be a positive semidefinite complex matrix on A×BA\times BA×B with trace 111. Put (ρB)bb′=∑aρ(a,b),(a,b′)(\rho_B)_{bb'}=\sum_a\rho_{(a,b),(a,b')}(ρB​)bb′​=∑a​ρ(a,b),(a,b′)​, let R=f(ρB)R=f(\rho_B)R=f(ρB​) under continuous functional calculus for f(x)=(x)−1f(x)=(\sqrt{x})^{-1}f(x)=(x​)−1, and put S=IA⊗RS=I_A\otimes RS=IA​⊗R; in particular, f(0)=0f(0)=0f(0)=0. Define the extended real number

Hmin⁡(X)=sup⁡{λ∈R:∃ σ⪰0, tr⁡σ=1,2−λIA⊗σ−X⪰0},\mathsf H_{\min}(X)= \sup\left\{\lambda\in\mathbb R: \exists\,\sigma\succeq0,\ \operatorname{tr}\sigma=1,\quad 2^{-\lambda}I_A\otimes\sigma-X\succeq0\right\},Hmin​(X)=sup{λ∈R:∃σ⪰0, trσ=1,2−λIA​⊗σ−X⪰0},

where the supremum is taken in the extended real line, and let real⁡(Hmin⁡(X))\operatorname{real}(\mathsf H_{\min}(X))real(Hmin​(X)) denote its conversion to a real number, which sends either infinity to 000. Then

−log⁡2∥SρS∥op≤real⁡(Hmin⁡(ρ)),-\log_2\|S\rho S\|_{\mathrm{op}} \le \operatorname{real}(\mathsf H_{\min}(\rho)),−log2​∥SρS∥op​≤real(Hmin​(ρ)),

where ∥⋅∥op\|\cdot\|_{\mathrm{op}}∥⋅∥op​ is the Euclidean operator norm and log⁡2\log_2log2​ is the total real logarithm, with log⁡20=0\log_2 0=0log2​0=0.

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