Smooth min entropy from fixed-reference alpha entropy
ProvedQAlgorithms.Papers.Independent.Support50.P23.smoothMinFromAlphaLet and be normalized finite-dimensional states. For every and ,
Smoothing uses the closed subnormalized root-fidelity ball and holds the reference fixed. No support hypothesis is imposed: support failure can give , and gives smooth min entropy . This is the bridge from Petz entropy to one-shot smooth min entropy.
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P23
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]
/-- Theorem 7, PDF p.4, (22). No support restriction is added. All epsilon>0 are
retained; epsilon>=1 makes the left hand side +infinity. -/
theorem smoothMinFromAlpha [Nonempty A] [Nonempty B]
(rho : Matrix (A × B) (A × B) ℂ) (sigma : Matrix B B ℂ)
(hrho : IsDensityMatrix rho) (hsigma : IsDensityMatrix sigma)
(epsilon alpha : ℝ) (hepsilon : 0 < epsilon) (halpha : 1 < alpha) (halpha2 : alpha ≤ 2) :
finiteAlpha rho sigma alpha -
((Real.logb 2 (2 / epsilon ^ 2) / (alpha - 1) : ℝ) : EReal) ≤
sineSmoothFixedMin rho sigma epsilon := by sorry
end QAlgorithms.Papers.Independent.Support50.P23
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be finite, nonempty index types with decidable equality, and let on and on be positive semidefinite complex matrices of trace one. Let satisfy and , with no upper bound assumed on . Put , define , otherwise, and define
where , otherwise, and matrix functions use continuous functional calculus. For any , let be the extended-real supremum of real satisfying , and let be the supremum of these values over with and , where . Then
in the extended reals. Zero is permitted; when , it belongs to the smoothing set and makes the right-hand side .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.