Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§3.2, p. 8 — Requirement 3 bounds the depth of a purchase decision tree by N + 1, so only finitely many trees satisfy Requirements 1–3

Proved
DecisionForest.Universal.depth_le_and_finite

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

decision-treediscrete-choicefinitenessp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let N≥0N\ge 0N≥0 be the number of products. Recall that a purchase decision tree splits on products (Requirement 1), that Requirement 3 asks the splits along every root-to-leaf path to carry pairwise distinct products, and that the depth of a tree is the number of nodes on a longest root-to-leaf path (a single leaf has depth 111).

  1. Every purchase decision tree ttt satisfying Requirement 3 has
Depth(t)≤N+1.\mathrm{Depth}(t)\le N+1 .Depth(t)≤N+1.
  1. The set of purchase decision trees satisfying Requirements 1–3 is finite.

The first part says that a path can test each of the NNN products at most once; the second part is what makes "a distribution over FN+1F_{N+1}FN+1​" in Theorem 1 a distribution over a finite set.

Formalization Note Trees are the inductive type PTree N, whose split nodes carry products of Fin N, so Requirement 1 holds for every tree of the type; IsPurchaseTree is Requirement 2 together with Requirement 3. Finiteness is Set.Finite.

Differences from the source:

  • encoding: products {1,…,N}\{1,\dots,N\}{1,…,N} → Fin N (product kkk is k - 1); reason: Lean convention, same instances.
  • encoding: Requirement 1 as a condition on trees → built into the type PTree N; reason: every split carries a product by construction, same trees.
Preamble
import Mathlib
import Definitions.Def_DecisionForest_Universal_Setting
Formal statement
namespace DecisionForest.Universal

theorem depth_le_and_finite (N : ℕ) :
    (∀ t : PTree N, Req3 t → depth t ≤ N + 1) ∧ {t : PTree N | IsPurchaseTree t}.Finite := by sorry

end DecisionForest.Universal
Source
Chen and Mišić, Decision Forest: A Nonparametric Approach to Modeling Irrational Choice, arXiv:1904.11532v3, p. 8, §3.2 (remark after the definition of depth)
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