DecisionTree.eval
defimported Lean
Evaluates a decision tree on an input $x$: a leaf returns its stored bit, and a branch
on variable $i$ follows the high subtree when $x_i$ is true and the low subtree
otherwise.
Statement
set_option relaxedAutoImplicit false in set_option autoImplicit false in def DecisionTree.eval {n : ℕ} : DecisionTree n → (Fin n → Bool) → Bool
- Defined in
- TCSlib, `DecisionTree.eval`
- Lean proof
- By Hydroxyi, from github.com/Shilun-Allan-Li/tcslib at
c8a02591b1e5(Copyright (c) 2026 TCSlib contributors. All rights reserved, Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.25.0.DecisionTree.eval← DecisionTree.eval (TCSlib/BooleanAnalysis/DecisionTree.lean:70): verbatim
- Verified
- 07 Oct 2026
- Axioms
- none listed
- Built on 1
- DecisionTreeA decision tree on $n$ Boolean variables: a leaf $\mathtt{leaf}\,b$ outputs $b$, and a branch $\mathtt{branch}\,i\,lo\,hi$ queries…
- Used by 5
- dtDepthThe decision-tree depth of $f : (\mathrm{Fin}\,n \to \mathrm{Bool}) \to \mathrm{Bool}$ is the least $d$ such that some decision tree of…
- DecisionTree.signEval_eq_sum_coeffsWalsh expansion of a decision tree's sign function. Let $T$ be a decision tree on $n$ Boolean variables, computing the $\pm 1$-valued…
- DecisionTree.buildFull_evalThe complete tree computes
fon every input it is consistent with. Proof sketch. Induction on the number of variables still to be… - DecisionTree.exists_dtree_of_dtDepthAttainment of the decision-tree depth. For every Boolean function $f : (\mathrm{Fin}\,n \to \mathrm{Bool}) \to \mathrm{Bool}$, there is a…
- DecisionTree.signEvalThe $\pm 1$-valued function computed by a decision tree $T$, namely $x \mapsto \mathrm{boolToSign}(T.\mathrm{eval}\,x)$, where…
Lean source view module on GitHub
set_option relaxedAutoImplicit false in set_option autoImplicit false in /-- Evaluate decision tree `T` on input `x`. -/ def DecisionTree.eval {n : ℕ} : DecisionTree n → (Fin n → Bool) → Bool | .leaf b, _ => b | .branch i lo hi, x => if x i then hi.eval x else lo.eval x