Lemma in Theorem 3 proof: kernel bound
OpenQAlgorithms.Papers.Independent.Intakenext100.P42.kernel_boundprove2quantum
For , define if either argument is zero, if , and otherwise . Then
This is the kernel bound used in the pure-state minimizer argument, with its diagonal and zero boundaries resolved explicitly.
Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P42
Formal statement
noncomputable section
open scoped Matrix ComplexConjugate ComplexOrder ENNReal Topology
namespace QAlgorithms.Papers.Independent.Intakenext100.P42
open QAlgorithms QAlgorithms.Entanglement
open QAlgorithms.Papers.Independent.Dependency50.P21 (relativeEntropy)
open QAlgorithms.Papers.Independent.Information100.P56 (entropy)
open QAlgorithms.Papers.Independent.Information100.P04 (copies)
open QAlgorithms.Papers.Independent.Bridge50.P49 (groupedProduct)
attribute [local instance] Classical.propDecidable Classical.decEq
/-- Lemma, PDF p.13, Eqs.(27)–(30): zero weights and the diagonal use their defined limits. -/
theorem kernel_bound (p q : ℝ) (hp : p ∈ Set.Icc 0 1) (hq : q ∈ Set.Icc 0 1) :
0 ≤ kernelG p q ∧ kernelG p q ≤ 1 := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P42
end
Source
Entanglement Measures and Purification Procedures, arXiv:quant-ph/9707035v2, PDF p. 13, Lemma in Theorem 3 proof: kernel bound
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every pair of real numbers , define
Then . In particular, the zero case takes precedence over the equal-argument case, so , while for .
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.