§5.3, thresholds and pure-state case
OpenQAlgorithms.Papers.Independent.Intakenext100.P45.conditionalThresholdsFor a nonorthogonal density pair with overlap masses ,
Equality holds in one bound exactly when it holds in the other. If both states are pure then , both equalities hold, and below and equals at and above that threshold. All conditional divisions are protected by positive overlap.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P45
noncomputable section
namespace QAlgorithms.Papers.Independent.Intakenext100.P45
open QAlgorithms Filter
open scoped Matrix ComplexConjugate ComplexOrder ENNReal BigOperators Topology
open QAlgorithms.Papers.Independent.Information100.P07
(support positivePart positiveProjection IsProjection)
open QAlgorithms.Papers.Independent.Information100.P56 (IsLaw)
open QAlgorithms.Papers.Independent.Information100.P60 (Mat copies)
open QAlgorithms.Papers.Independent.Dependency50.P28 (logNonnegativeExtended relativeEntropy)
open QAlgorithms.Papers.Independent.Claimed50.P15 (positiveMatrixRpow)
attribute [local instance] Classical.propDecidable Classical.decEq
variable {I J : Type} [Fintype I] [DecidableEq I] [Fintype J] [DecidableEq J]
/-- arXiv:0708.4282v1, PDF pp.26,27: §5.3, thresholds and pure-state case. -/
theorem conditionalThresholds (rho sigma : Mat I)
(hrho : IsDensityMatrix rho) (hsigma : IsDensityMatrix sigma)
(hpsi0 : 0 < (rho*support sigma).trace.re)
(hpsi1 : 0 < (sigma*support rho).trace.re) :
-Real.log (rho*support sigma).trace.re ≤ supportConditionalEntropy sigma rho ∧
-Real.log (sigma*support rho).trace.re ≤ supportConditionalEntropy rho sigma ∧
(supportConditionalEntropy sigma rho = -Real.log (rho*support sigma).trace.re ↔
supportConditionalEntropy rho sigma = -Real.log (sigma*support rho).trace.re) ∧
(densityIdempotence rho → densityIdempotence sigma →
(rho*support sigma).trace.re=(sigma*support rho).trace.re ∧
supportConditionalEntropy sigma rho = -Real.log (rho*support sigma).trace.re ∧
supportConditionalEntropy rho sigma = -Real.log (sigma*support rho).trace.re ∧
∀ r : ℝ, 0 ≤ r → quantumExponent rho sigma r =
if r < -Real.log (sigma*support rho).trace.re then ⊤
else ((-Real.log (sigma*support rho).trace.re : ℝ) : EReal)) := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P45
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be a finite type with decidable equality, and let be positive semidefinite complex matrices of trace one. For each matrix , let be the orthogonal projection onto its operator range. Assume and . For , put , , and , with logarithms given by continuous functional calculus for the total real logarithm, including . The assertion is
In addition, if and , then , both displayed lower bounds are equalities, and for every real ,
Here for and otherwise, matrix powers use continuous functional calculus for real powers with , and the supremum is extended-real. The finite branch includes equality at the threshold.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.