Proof of Theorem 1, p. ec2 — a constructed tree that violates Requirement 2 has weight λ_t = 0 in (EC.5)
ProvedDecisionForest.Universal.prodWeight_eq_zero_of_not_req2decision-treediscrete-choicep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1
Let be a discrete choice model on products and let be a tuple of purchase options. If the balanced tree of the proof of Theorem 1 violates Requirement 2, i.e. some leaf of buys a product that is not among the products found present on the path to it, then its weight (EC.5) vanishes:
Consequently the trees violating Requirement 2 can be removed from the forest without changing the model, and the remaining trees lie in .
Formalization Note The hypothesis is ¬ Req2 (fullTree o). In fullTree o the products found present on the way to the leaf of assortment are exactly the products of , so the hypothesis says that is a product outside for some .
Differences from the source:
- reading: "for some trees will not be contained in … is zero whenever " → the hypothesis is that the tree violates Requirement 2, i.e. some is a product outside ; reason: the no-purchase option is never in , never violates Requirement 2, and need not vanish (taking for all gives a choice model), so the sentence is about products; the literal reading for is false.
- encoding: products →
Fin N, options →Option (Fin N); tuples indexed by assortments instead of ; 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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.