remark4
OpenQAlgorithms.Papers.Independent.Support50.P15.remark4Fix and let be the maximum in Eq. (7). The finite restriction of is smooth in a neighborhood of zero, and
Consequently its cubic Taylor polynomial is , the cubic lower bound of Theorem 2. The bound holds for with the largest possible quadratic coefficient; it fails arbitrarily close to zero on the negative side. For , put and . The explicit states satisfy
Their cubic lower bound with tends to as . This quantifies local optimality and supplies an explicit comparison family; the approximate ten-percent illustration is not an additional uniform theorem.
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 4, PDF p.5: smoothness, cubic Taylor data, optimal quadratic coefficient,
negative-side failure, and the explicit comparison family. -/
theorem remark4 (d : ℕ) (hd : 2 ≤ d) :
let f := fun x => (tightBound d x).toReal
(∃ e > 0, e < Real.log d ∧ ContDiffOn ℝ ⊤ f (Set.Ioo (-e) e)) ∧
f 0 = 0 ∧ deriv f 0 = 0 ∧ deriv (deriv f) 0 = 1 / maxVariance d ∧
deriv (deriv (deriv f)) 0 = 1 / (maxVariance d) ^ 2 ∧
(∀ x ∈ Set.Icc (0 : ℝ) (Real.log d), (x ^ 2 / (2 * maxVariance d) : ℝ) ≤ tightBound d x) ∧
(∀ c : ℝ, (∀ x ∈ Set.Icc (0 : ℝ) (Real.log d), (c * x ^ 2 : ℝ) ≤ tightBound d x) →
c ≤ 1 / (2 * maxVariance d)) ∧
(∀ e > 0, ∃ x ∈ Set.Ioo (-min e (Real.log d)) 0,
tightBound d x < (x ^ 2 / (2 * maxVariance d) : ℝ)) ∧
(∀ t ∈ Set.Ioo (-1 : ℝ) 1,
difference (family d ((1 + t) / 2)) (family d ((1 - t) / 2)) = t * Real.log ((d : ℝ) - 1) ∧
binaryRelative ((1 + t) / 2) ((1 - t) / 2) = (t * Real.log ((1 + t) / (1 - t)) : ℝ) ∧
tightBound d (t * Real.log ((d : ℝ) - 1)) ≤ binaryRelative ((1 + t) / 2) ((1 - t) / 2) ∧
∃ ha : IsDensityMatrix (family d ((1 + t) / 2)),
∃ hb : IsDensityMatrix (family d ((1 - t) / 2)),
stateRelativeNats ⟨family d ((1 + t) / 2), ha⟩ ⟨family d ((1 - t) / 2), hb⟩ =
binaryRelative ((1 + t) / 2) ((1 - t) / 2)) ∧
(∀ t ∈ Set.Ioo (-1 : ℝ) 1, Tendsto
(fun n : ℕ => cubicBound (maxVariance n) (t * Real.log ((n : ℝ) - 1)))
atTop (nhds (2 * t ^ 2))) := 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 , define , with , and . Define if , if and , and otherwise; put . Let
where takes values in the extended reals and an empty feasible set has infimum . Let be the real conversion of , which sends either infinity to . There exists with such that is infinitely continuously differentiable on , and
For every , ; moreover, every real satisfying throughout that interval obeys . For every , there exists such that . For , let be diagonal with first entry and all other entries , and write , using spectral functional calculus. For density matrices , meaning positive semidefinite matrices of trace , define to be unless , and otherwise to be . Then, for every ,
and both displayed matrices are density matrices whose relative entropy equals that binary expression. Finally, for every ,
Here ranges over all natural numbers, including ; its initial values use the total real logarithm and division operations, with and division by zero equal to .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.