Quantitative approach to order one
ProvedQAlgorithms.Papers.Independent.Support50.P23.alphaNearOneLet and be normalized finite-dimensional states. Define . On its finite branch, . If , then
For the displayed order interval is empty. The finite parameter bounds the error when approaching the von Neumann order.
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]
/-- Lemma 8, PDF p.5, (25). Finite eta is the admissible branch of the printed
interval; eta=infinity leaves no admissible alpha. -/
theorem alphaNearOne [Nonempty A] [Nonempty B]
(rho : Matrix (A × B) (A × B) ℂ) (sigma : Matrix B B ℂ)
(hrho : IsDensityMatrix rho) (hsigma : IsDensityMatrix sigma)
(heta : entropyConvergenceParameter rho sigma ≠ ⊤) (alpha : ℝ) (halpha : 1 < alpha)
(halphaUpper : alpha < 1 + Real.logb 2 3 / (4 * Real.logb 2 (entropyConvergenceParameter rho sigma).toReal)) :
fixedVonNeumann rho sigma -
((4 * (alpha - 1) * (Real.logb 2 (entropyConvergenceParameter rho sigma).toReal) ^ 2 : ℝ) : EReal) ≤
finiteAlpha rho sigma alpha := 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. Put , let , and define when , and otherwise. For , and also for any real , define if and this support condition fails, and otherwise define , where , otherwise, , and otherwise; matrix functions use continuous functional calculus. Define , , for finite extended-real , and . Assume , write for its real value, and let satisfy
Then in the extended reals. Division is total: if , the upper bound becomes , so the two hypotheses on cannot both hold.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.