Generic outer factors and the complete interval identity
DefinitionPrivateContinualCounting_Kraft_Supplement_GenericOuterFor any measurable density on the published circle that is even and positive almost everywhere, with integrable, define
The candidate real scalar data are the real parts of the Taylor coefficients of . Analyticity, coefficient realness, exact convolution, outer membership, boundary moduli and norm identities remain theorem obligations. In particular the density is not restricted to one coming from an envelope .
For a coefficient sequence let . The interval-identity predicate records the finite-sum equality, monotonicity in , membership , its norm/integral identity, convergence and the exact supremum:
It states boundedness before using the real supremum. For the canonical weight and doubling constant , define the width-uniform constant supplied by Appendix C:
Here is the published envelope constant. This interface supports both the canonical counter and the arbitrary spectral density of Corollary 1.3.
import Definitions.Def_PrivateContinualCounting_Kraft_Supplement_Covariance
open MeasureTheory ProbabilityTheory Filter
set_option autoImplicit false
namespace PrivateContinualCounting.Kraft.Supplement
/-- Generic density interface, independent of an envelope g. Conditions here concern
only the input density; every analytic fact about the outer function remains to prove. -/
def IsOuterDensity (f : ℝ → ℝ) : Prop :=
Measurable f ∧ (∀ᵐ θ ∂circleMeasure, 0 < f θ) ∧
(∀ᵐ θ ∂circleMeasure, f (-θ) = f θ) ∧ Integrable f circleMeasure ∧
Integrable (fun θ => Real.log (f θ)) circleMeasure ∧
Integrable (fun θ => 1 / f θ) circleMeasure
noncomputable def densityOuter (f : ℝ → ℝ) (z : ℂ) : ℂ :=
Complex.exp (∫ θ, (circlePoint θ + z) / (circlePoint θ - z) *
((1/2 : ℂ) * (Real.log (f θ) : ℂ)) ∂circleMeasure)
noncomputable def densityData (f : ℝ → ℝ) : LTIData ℝ 1 where
l j _ := (taylorAtZero (fun z => densityOuter f z / (1-z)) j).re
r k _ := (taylorAtZero (fun z => 1 / densityOuter f z) k).re
/-- Finite convolution coefficient [z^m](p_w h). -/
noncomputable def productCoeff (h : ℕ → ℂ) (w m : ℕ) : ℂ :=
∑ j ∈ Finset.range w, if j ≤ m then h (m-j) else 0
/-- The full identity, including monotonicity, convergence, norm, integral and supremum.
Boundedness is stated explicitly before the real supremum is used. -/
def IntervalIdentity (d : LTIData ℝ 1) (h : ℕ → ℂ) (f : ℝ → ℝ) : Prop :=
∀ w : ℕ, 0 < w →
(∀ a : ℕ, scalarIntervalVariance d 1 a w =
d.deltaSq * ∑ m ∈ Finset.range (a+w), ‖productCoeff h w m‖^2) ∧
Monotone (fun a => scalarIntervalVariance d 1 a w) ∧
InfoShareH2.H2 (productCoeff h w) ∧
hardyNormSq (productCoeff h w) = (∫ θ, prefixKernel w θ * f θ ∂circleMeasure) ∧
Tendsto (fun a => scalarIntervalVariance d 1 a w) atTop
(nhds (d.deltaSq * hardyNormSq (productCoeff h w))) ∧
BddAbove (Set.range (fun a => scalarIntervalVariance d 1 a w)) ∧
sSup (Set.range (fun a => scalarIntervalVariance d 1 a w)) =
d.deltaSq * (∫ θ, prefixKernel w θ * f θ ∂circleMeasure)
/-- Appendix C's constant, uniform in start and width including widths 1 and 2. -/
noncomputable def intervalConstant (g : ℝ → ℝ) (D : ℝ) : ℝ :=
(∫ θ, 1 / spectralWeight g θ ∂circleMeasure) *
max (envelopeConstant D)
(4 * (∫ θ, spectralWeight g θ ∂circleMeasure) / (Real.log 3)^2)
end PrivateContinualCounting.Kraft.Supplement