Lemma 14
ProvedQAlgorithms.Papers.Independent.Support50.P21.smoothMax_dominationAll systems are nonzero finite-dimensional complex Hilbert spaces, and logarithms have base two.
Let be density operators, , and with . For every ,
Smoothing uses . Approximants may be subnormalized and may exceed one. This converts approximate domination to a smooth max-divergence bound.
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P21
noncomputable section
namespace QAlgorithms.Papers.Independent.Support50.P21
open QAlgorithms QAlgorithms.Entanglement Filter
open scoped Matrix ComplexConjugate ComplexOrder
attribute [local instance] Classical.propDecidable Classical.decEq
-- Use the accepted declarations directly; no paper-local aliases hide dimension binders.
open QAlgorithms.Papers.Independent.Claimed50.P33
(FiniteState IsAverageLocalMonotone IsAdaptiveLOCCMonotone)
open QAlgorithms.Papers.Independent.Information100.P63 (Mat)
open QAlgorithms.Papers.Independent.Dependency50.P35 (tr elog maxRelative)
open QAlgorithms.Papers.Independent.Information100.P67 (IsSubnormalized)
open QAlgorithms.Papers.Independent.Information100.P07 (support)
open QAlgorithms.Papers.Independent.Information100.P71 (supportPower SupportIncluded)
variable {I J : Type} [Fintype I] [DecidableEq I] [Fintype J] [DecidableEq J]
section Statements
variable [Nonempty I] [Nonempty J]
/-- Lemma 14, PDF p.7; construction pp.10–11: subnormalized approximants,
full trace norm, exponent lambda, and eps allowed to exceed one. -/
theorem smoothMax_domination (rho sigma Delta : Mat I)
(hrho : IsDensityMatrix rho) (hsigma : IsDensityMatrix sigma)
(hDelta : Delta.PosSemidef) (lambda eps : ℝ)
(hdom : Le rho ((((2 : ℝ) ^ lambda) : ℂ) • sigma + Delta))
(heps : Real.sqrt (8 * tr Delta) ≤ eps) :
traceSmoothMax eps rho sigma ≤ (lambda : EReal) := by sorry
end Statements
end QAlgorithms.Papers.Independent.Support50.P21
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be a finite index type with decidable equality, let be positive semidefinite complex matrices on with trace , let be a positive semidefinite matrix on , and let . Write , and define
with both infima interpreted in the extended reals. If is positive semidefinite and , then
There is no upper bound on or sign restriction on ; matrices in the smoothing ball need not have trace and may be zero.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.