§VIII, Theorem 7 first implication (58)
ProvedQAlgorithms.Papers.Independent.Gap48.P40.relativeEntropyImpliesTraceApproximationAll matrices act on a complex Hilbert space of positive finite dimension . A state is positive semidefinite with trace one. All logarithms are natural, and denotes support-aware Umegaki relative entropy, with value when support containment fails. Fix a state on a positive finite-dimensional Hilbert space , and let be a state on for each positive integer . Then
This is exactly the forward implication (58). The full theorem, including its defective converse, has a separate deferral record.
import Definitions.Def_QAlgorithms_Papers_Independent_Gap48_P40
noncomputable section
open scoped Matrix ComplexConjugate ComplexOrder Topology Matrix.Norms.L2Operator
open Filter MeasureTheory Asymptotics
open QAlgorithms
open QAlgorithms.Papers.Independent.Dependency50.P21 (relativeEntropy)
open QAlgorithms.Papers.Independent.Information100.P50 (IsUINorm)
open QAlgorithms.Papers.Independent.Information100.P56 (entropy)
open QAlgorithms.Papers.Independent.Information100.P60 (copies)
open QAlgorithms.Papers.Independent.Information100.P44 (Mat)
namespace QAlgorithms.Papers.Independent.Gap48.P40
/-- PDF p.12, Theorem 7, first implication (58) only. Positive copy counts
are k+1; sigma is normalized on the full tensor power. The converse is deferred. -/
theorem relativeEntropyImpliesTraceApproximation {d : ℕ} (hd : 0 < d)
(rho : Mat d) (hrho : IsDensityMatrix rho)
(sigma : (k : ℕ) → Matrix (Fin (k + 1) → Fin d) (Fin (k + 1) → Fin d) ℂ)
(hsigma : ∀ k, IsDensityMatrix (sigma k))
(hlimit : Tendsto (fun k => relativeEntropy (copies (k + 1) rho) (sigma k))
atTop (nhds (0 : EReal))) :
Tendsto (fun k => traceNorm (copies (k + 1) rho - sigma k)) atTop (nhds (0 : ℝ)) := by sorry
end QAlgorithms.Papers.Independent.Gap48.P40
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every positive natural number , every positive semidefinite complex matrix with trace , and every sequence of positive semidefinite trace- complex matrices indexed by pairs of strings in , define by
If as , with convergence in the extended reals, then
in the real numbers. Here is , using matrix functional calculus and , when , and is otherwise; logarithms are natural with . The matrices and need not be invertible. The sequence starts at , for which contains one copy of , and the conclusion concerns the full trace norm, without a factor of .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.