Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 1, p. ec3 — the forest of all (N + 1)^{2^N} balanced trees with weights (EC.5) reproduces P(o | S)

Proved
DecisionForest.Universal.forest_marginal

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

decision-forestdiscrete-choicep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let P(⋅∣⋅)\mathbf P(\cdot\mid\cdot)P(⋅∣⋅) be a discrete choice model on NNN products. For every tuple o=(oS)S⊆N\mathbf o=(o_S)_{S\subseteq\mathcal N}o=(oS​)S⊆N​ of purchase options let tot_{\mathbf o}to​ be the balanced tree of the proof of Theorem 1 and λo=∏SP(oS∣S)\lambda_{\mathbf o}=\prod_{S}\mathbf P(o_S\mid S)λo​=∏S​P(oS​∣S) its weight (EC.5). Then for every assortment S⊆NS\subseteq\mathcal NS⊆N and every option o∈N+o\in\mathcal N^+o∈N+,

∑oλo⋅I{o=A^(S,to)}=P(o∣S),\sum_{\mathbf o}\lambda_{\mathbf o}\cdot\mathbb I\{o=\hat A(S,t_{\mathbf o})\}=\mathbf P(o\mid S),o∑​λo​⋅I{o=A^(S,to​)}=P(o∣S),

the sum running over all (N+1)2N(N+1)^{2^N}(N+1)2N tuples.

The left-hand side is the decision forest model (3) of the forest {to}\{t_{\mathbf o}\}{to​} with weights λ\lambdaλ, before the trees violating Requirement 2 are removed; this identity is the last step of the proof of Theorem 1.

Formalization Note The sum is over all functions o : Finset (Fin N) → Option (Fin N), and I{o=A^(S,to)}\mathbb I\{o=\hat A(S,t_{\mathbf o})\}I{o=A^(S,to​)} is if choose (fullTree o) S = o' then 1 else 0.

Differences from the source:

  • encoding: the forest FFF of trees t=1,…,(N+1)2Nt=1,\dots,(N+1)^{2^N}t=1,…,(N+1)2N and P(F,λ)(o∣Si)\mathbf P^{(F,\lambda)}(o\mid S_i)P(F,λ)(o∣Si​) → the sum over tuples o\mathbf oo of λo I{o=A^(S,to)}\lambda_{\mathbf o}\,\mathbb I\{o=\hat A(S,t_{\mathbf o})\}λo​I{o=A^(S,to​)}; reason: the trees of the forest are indexed by the tuples, same sum.
  • encoding: products {1,…,N}\{1,\dots,N\}{1,…,N} → Fin N, options N+\mathcal N^+N+ → Option (Fin N) with none the option 000; reason: Lean convention, same instances.
Preamble
import Mathlib
import Definitions.Def_DecisionForest_Universal_Setting
Formal statement
namespace DecisionForest.Universal

theorem forest_marginal (N : ℕ) (P : Option (Fin N) → Finset (Fin N) → ℝ)
    (hP : IsChoiceModel P) (S : Finset (Fin N)) (o' : Option (Fin N)) :
    ∑ o : Finset (Fin N) → Option (Fin N),
      prodWeight P o * (if choose (fullTree o) S = o' then 1 else 0) = P o' S := by sorry

end DecisionForest.Universal
Source
Chen and Mišić, Decision Forest: A Nonparametric Approach to Modeling Irrational Choice, arXiv:1904.11532v3, p. ec3 (PDF 32), proof of Theorem 1, final display
Human review
  • Endorsed by Shuze Chen · Oct 23, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 23, 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