Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 1, p. ec2 — a constructed tree that violates Requirement 2 has weight λ_t = 0 in (EC.5)

Proved
DecisionForest.Universal.prodWeight_eq_zero_of_not_req2

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

decision-treediscrete-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 and let o=(oS)S⊆N\mathbf o=(o_S)_{S\subseteq\mathcal N}o=(oS​)S⊆N​ be a tuple of purchase options. If the balanced tree tot_{\mathbf o}to​ of the proof of Theorem 1 violates Requirement 2, i.e. some leaf of tot_{\mathbf o}to​ buys a product that is not among the products found present on the path to it, then its weight (EC.5) vanishes:

λo=∏S⊆NP(oS∣S)=0.\lambda_{\mathbf o}=\prod_{S\subseteq\mathcal N}\mathbf P(o_S\mid S)=0 .λo​=S⊆N∏​P(oS​∣S)=0.

Consequently the trees violating Requirement 2 can be removed from the forest without changing the model, and the remaining trees lie in FN+1F_{N+1}FN+1​.

Formalization Note The hypothesis is ¬ Req2 (fullTree o). In fullTree o the products found present on the way to the leaf of assortment SSS are exactly the products of SSS, so the hypothesis says that oSo_SoS​ is a product outside SSS for some SSS.

Differences from the source:

  • reading: "for some trees ojto^t_jojt​ will not be contained in SjS_jSj​ … P(ojt∣Sj)\mathbf P(o^t_j\mid S_j)P(ojt​∣Sj​) is zero whenever ojt∉Sjo^t_j\notin S_jojt​∈/Sj​" → the hypothesis is that the tree violates Requirement 2, i.e. some oSo_SoS​ is a product outside SSS; reason: the no-purchase option 000 is never in SjS_jSj​, never violates Requirement 2, and P(0∣Sj)\mathbf P(0\mid S_j)P(0∣Sj​) need not vanish (taking P(0∣S)=1\mathbf P(0\mid S)=1P(0∣S)=1 for all SSS gives a choice model), so the sentence is about products; the literal reading for o=0o=0o=0 is false.
  • encoding: products {1,…,N}\{1,\dots,N\}{1,…,N} → Fin N, options N+\mathcal N^+N+ → Option (Fin N); tuples indexed by assortments instead of j=1,…,2Nj=1,\dots,2^Nj=1,…,2N; reason: Lean convention, same instances.
Preamble
import Mathlib
import Definitions.Def_DecisionForest_Universal_Setting
Formal statement
namespace DecisionForest.Universal

theorem prodWeight_eq_zero_of_not_req2 (N : ℕ) (P : Option (Fin N) → Finset (Fin N) → ℝ)
    (hP : IsChoiceModel P) (o : Finset (Fin N) → Option (Fin N))
    (h : ¬ Req2 (fullTree o)) : prodWeight P o = 0 := by sorry

end DecisionForest.Universal
Source
Chen and Mišić, Decision Forest: A Nonparametric Approach to Modeling Irrational Choice, arXiv:1904.11532v3, p. ec2 (PDF 31), proof of Theorem 1, paragraph after (EC.5)
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