remark3
OpenQAlgorithms.Papers.Independent.Support50.P15.remark3For let be the minimum in Eq. (6) and . For every this minimum is attained. Its scalar minimizing pair is unique when . The witnesses obey
The analogous entropy identity holds for . Every ordered state pair of nonzero entropy difference attains if and only if it is obtained from a minimizing witness pair by conjugating both states with the same unitary. At zero difference equality holds exactly for identical states. Thus uniqueness is simultaneous unitary equivalence of the ordered pair, and no uniqueness of the scalar pair is claimed at zero.
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)
/-- Remark 3, PDF p.4, with uniqueness proved pp.20--22. A common unitary acts on the ordered pair. -/
theorem remark3 (d : ℕ) (hd : 2 ≤ d) :
(∀ delta ∈ Set.Icc (-Real.log d) (Real.log d), ∃ s r, minimizingPair d delta s r) ∧
(∀ delta ∈ Set.Icc (-Real.log d) (Real.log d), delta ≠ 0 →
∃! sr : ℝ × ℝ, minimizingPair d delta sr.1 sr.2) ∧
(∀ s ∈ Set.Icc (0 : ℝ) (massLimit d), ∀ r ∈ Set.Icc (0 : ℝ) (massLimit d),
entropy (family d s) = degenerateSpectrumEntropy d s ∧ entropy (family d r) = degenerateSpectrumEntropy d r ∧
∀ (ha : IsDensityMatrix (family d s)) (hb : IsDensityMatrix (family d r)),
stateRelativeNats ⟨family d s, ha⟩ ⟨family d r, hb⟩ = binaryRelative s r) ∧
(∀ (a b : EntropyState d) (delta : ℝ), delta ≠ 0 → difference a.val b.val = delta →
(stateRelativeNats a b = tightBound d delta ↔
∃ s r, minimizingPair d delta s r ∧
∃ u : Matrix.unitaryGroup (Fin d) ℂ,
a.val = (u : Matrix (Fin d) (Fin d) ℂ) * family d s * (u : Matrix (Fin d) (Fin d) ℂ)ᴴ ∧
b.val = (u : Matrix (Fin d) (Fin d) ℂ) * family d r * (u : Matrix (Fin d) (Fin d) ℂ)ᴴ)) ∧
(∀ a b : EntropyState d, difference a.val b.val = 0 →
(stateRelativeNats a b = tightBound d 0 ↔ a = b)) := 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 every natural number , let states mean complex positive semidefinite matrices of trace , define with applied by continuous functional calculus, and define if , otherwise . All logarithms are natural, with . Write
where , if , if and , and otherwise; empty infima are . Call minimizing for when it satisfies the displayed feasibility conditions and , and put . The theorem asserts that every has a minimizing pair, and that this ordered pair is unique whenever in that interval. For every , it asserts and , and, for every choice of witnesses that these two matrices are states, . For any states and real satisfying , it asserts
where is a complex unitary matrix. Finally, for all states with , it asserts if and only if .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.