Theorem 10.4, p. 174 — method-of-types bound on type-class size
ProvedModernOnlineLearning.Portfolio.theorem_10_4information-theorymethod-of-typesonline-learningp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-bookp2o-v1
Let an alphabet have symbols, and let . For a realizable type of length- sequences, let be the set of sequences of that type. Then
with . The bound controls how many stock-choice paths share one empirical allocation.
Formalization Note A type is required to arise from an actual sequence, exactly as the source’s condition. Real exponentiation has the required convention.
Preamble
import Mathlib import Definitions.Def_ModernOnlineLearning_Portfolio_Setting set_option autoImplicit false
Formal statement
namespace ModernOnlineLearning.Portfolio
/-- Theorem 10.4, p. 174: the method-of-types cardinality bound. -/
theorem theorem_10_4 {d T : ℕ} (hd : 2 ≤ d) (hT : 1 ≤ T)
(n : Fin d → ℝ) (hn : n ∈ possibleTypes d T) :
(typeClass (d := d) (T := T) n).card ≤
∏ i : Fin d, (n i) ^ (-(n i) * (T : ℝ)) := by sorry
end ModernOnlineLearning.Portfolio
Source
Orabona, arXiv:1912.13213v10, Theorem 10.4, p. 174
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.