remark9
ProvedQAlgorithms.Papers.Independent.Support50.P15.remark9For every integer , put and let be Eq. (7). Then
Its optimizing parameter is the unique root in of . There are and an integer such that, for all ,
The root is strictly interior, so the real logarithm and divisions do not create endpoint roots. These formulas provide a scalar method to evaluate the optimal variance bound.
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 9, PDF p.8, root characterization on p.25 and bounds on pp.23--24.
Asymptotic constants and thresholds precede dimension. -/
theorem remark9 :
(∀ d : ℕ, 2 ≤ d → easyVariance d - 1 < maxVariance d ∧ maxVariance d < easyVariance d ∧
(∃! r : ℝ, r ∈ Set.Ioo 0 (1 / 2) ∧
(1 - 2 * r) * Real.log ((1 - r) / r * ((d : ℝ) - 1)) = 2) ∧
(1 - 2 * optimalMass d) * Real.log ((1 - optimalMass d) / optimalMass d * ((d : ℝ) - 1)) = 2) ∧
(∃ c > 0, ∃ d0 : ℕ, 3 ≤ d0 ∧ ∀ d ≥ d0,
0 ≤ easyVariance d - maxVariance d ∧
easyVariance d - maxVariance d ≤ c / (Real.log d) ^ 2 ∧
|optimalMass d - (1 / 2 - 1 / Real.log ((d : ℝ) - 1))| ≤ c / (Real.log d) ^ 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 each natural , define
and let be the classically chosen real from the condition and , with an unspecified choice if no such real exists. For every natural , , there exists exactly one satisfying
and the chosen satisfies this equation. Furthermore, there exist a real and a natural such that for every natural ,
All logarithms are natural.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.