eq37
OpenQAlgorithms.Papers.Independent.Support50.P15.eq37Let and let be normalized states in a common positive finite dimension. No common-support assumption is needed. Writing for the trace norm,
Support failures give infinity on the left. This retains the full intermediate chain and supplies an endpoint-distance lower bound even when the entropy change vanishes.
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P15
noncomputable section
attribute [local instance] Classical.propDecidable
open scoped Matrix ComplexConjugate ENNReal Matrix.Norms.L2Operator
open Filter MeasureTheory
namespace QAlgorithms.Papers.Independent.Support50.P15
open QAlgorithms.Papers.Independent.Information100.P56 (entropy)
/-- Eq. (37), PDF p.12, with every intermediate term and no unnecessary full-rank premise. -/
theorem eq37 {d k : ℕ} (hd : 0 < d) (hk : 0 < k) (a : Fin (k + 1) → EntropyState d) :
let total := ∑ j : Fin k, stateRelativeNats (a j.castSucc) (a j.succ)
let sq : ℝ := ∑ j : Fin k, (traceNorm ((a j.castSucc).val - (a j.succ).val)) ^ 2 / 2
let av : ℝ := (k : ℝ) / 2 * (∑ j : Fin k,
traceNorm ((a j.castSucc).val - (a j.succ).val) / k) ^ 2
(sq : EReal) ≤ total ∧ av ≤ sq ∧
(traceNorm ((a 0).val - (a (Fin.last k)).val)) ^ 2 / (2 * (k : ℝ)) ≤ av := by sorry
end QAlgorithms.Papers.Independent.Support50.P15
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For all positive natural numbers and every sequence of positive semidefinite complex matrices of trace , define , using spectral functional calculus. Define if , and otherwise
with . Put
Then , where is embedded into the extended reals, , and
No full-rank assumption is imposed, so is allowed to be ; dimension is included.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.