Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 10.4, p. 174 — method-of-types bound on type-class size

Proved
ModernOnlineLearning.Portfolio.theorem_10_4

by mikedeng1 · Oct 9, 2026 · Mathlib 0df444a (Lean v4.33.1)

information-theorymethod-of-typesonline-learningp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-bookp2o-v1

Let an alphabet have d≥2d\ge2d≥2 symbols, and let T≥1T\ge1T≥1. For a realizable type n=(n1,…,nd)n=(n_1,\ldots,n_d)n=(n1​,…,nd​) of length-TTT sequences, let TT(n)\mathcal T_T(n)TT​(n) be the set of sequences of that type. Then

∣TT(n)∣≤∏i=1dni−niT,|\mathcal T_T(n)|\le\prod_{i=1}^{d}n_i^{-n_iT},∣TT​(n)∣≤i=1∏d​ni−ni​T​,

with 00=10^0=100=1. 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 n∈Qn\in Qn∈Q condition. Real exponentiation has the required 000^000 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
  • Endorsed by Shuze Chen · Oct 9, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 9, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me