Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 1, p. ec2 — the weights (EC.5), λ_t = ∏_j P(o^t_j | S_j), are nonnegative and sum to one

Proved
DecisionForest.Universal.prodWeight_isDistribution

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

discrete-choicep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1probability-distribution

Let P(⋅∣⋅)\mathbf P(\cdot\mid\cdot)P(⋅∣⋅) be a discrete choice model on NNN products. For a tuple o=(oS)S⊆N\mathbf o=(o_S)_{S\subseteq\mathcal N}o=(oS​)S⊆N​ of purchase options, one per assortment, define as in (EC.5)

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

Then λo≥0\lambda_{\mathbf o}\ge 0λo​≥0 for every tuple o\mathbf oo, and

∑o∈(N+)2Nλo=1,\sum_{\mathbf o\in(\mathcal N^+)^{2^{\mathcal N}}}\lambda_{\mathbf o}=1,o∈(N+)2N∑​λo​=1,

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

These are the weights the proof of Theorem 1 puts on the trees tot_{\mathbf o}to​; the statement says they form a probability distribution.

Formalization Note Tuples are functions o : Finset (Fin N) → Option (Fin N) and λo\lambda_{\mathbf o}λo​ is prodWeight P o.

Differences from the source:

  • encoding: trees indexed by t=1,…,(N+1)2Nt=1,\dots,(N+1)^{2^N}t=1,…,(N+1)2N through an enumeration o1,…,o(N+1)2N\mathbf o^1,\dots,\mathbf o^{(N+1)^{2^N}}o1,…,o(N+1)2N of tuples → weights indexed by the tuples themselves; reason: same family of numbers.
  • 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 prodWeight_isDistribution (N : ℕ) (P : Option (Fin N) → Finset (Fin N) → ℝ)
    (hP : IsChoiceModel P) :
    (∀ o : Finset (Fin N) → Option (Fin N), 0 ≤ prodWeight P o) ∧
      ∑ o : Finset (Fin N) → Option (Fin N), prodWeight P o = 1 := 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, (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