Eq. (6) — is the lower envelope of its discrete tangents (coefficients index-corrected)
ProvedFastFashion.Approx.eq_6_tangent_envelopeIn the setting of the model file (independent Poisson family with rates , period ), for every size and every ,
where , , and the tangent with index is the constant . That is, every discrete tangent lies above at , and some tangent equals it.
This representation is what the approximation (8) truncates to finitely many tangents.
Formalization Note Corrected coefficients. The paper prints and , under which involves and (6) fails; the slopes here are re-indexed so that is the -th term of (5), matching the paper's own description of . Minimum. The paper takes the minimum over and extends to ; the statement takes it over , and the infinite tangent does not change the minimum. The minimum is stated as IsLeast of the set of tangent values (lower bound and attainment), not as a real infimum.
import Mathlib import Definitions.Def_FastFashion_Structure_Model import Definitions.Def_FastFashion_Approx_Tangents
namespace FastFashion.Approx
open MeasureTheory ProbabilityTheory
/-- Eq. (6) (Caro–Gallien, p. 12), with the slopes re-indexed so that `a_k` is the `(k+1)`-th term
of (5): `𝔼[τ_s ∧ T]` is the least value of the discrete tangents
`a_i(λ_s)(q_s − i) + b_i(λ_s)`, `i ∈ ℕ ∪ {∞}` (the tangent at `∞` being the constant `T`), and the
least value is attained. -/
theorem eq_6_tangent_envelope {S Ω : Type*} [MeasurableSpace Ω]
(P : Measure Ω) [IsProbabilityMeasure P] (lam : S → ℝ) (N : S → ℝ → Ω → ℕ)
(hN : FastFashion.Structure.IsPoissonFamily lam N P) (hlam : ∀ s, 0 < lam s) (T : ℝ) (hT : 0 < T)
(s : S) (q : S → ℕ) :
IsLeast (Set.range fun i : WithTop ℕ => tangent (lam s) T i (q s : ℝ)) (FastFashion.Structure.hA N P T {s} q) := by sorry
end FastFashion.Approx
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.