Documentation

Bdd.DecisionTree

inductive DecisionTree (n : ℕ) :
Instances For
    def instDecidableEqDecisionTree.decEq {n✝ : ℕ} (x✝ x✝¹ : DecisionTree n✝) :
    Decidable (x✝ = x✝¹)
    Equations
    Instances For
      Equations
      Instances For
        @[simp]
        theorem DecisionTree.evaluate_leaf {n : ℕ} {v : Vector Bool n} {b : Bool} :
        (leaf b).evaluate v = b
        @[simp]
        theorem DecisionTree.evaluate_branch {n : ℕ} {v : Vector Bool n} {j : Fin n} {l h : DecisionTree n} :
        (branch j l h).evaluate v = bif v[j] then h.evaluate v else l.evaluate v
        Equations
        Instances For
          inductive DecisionTree.usesVar {n : ℕ} (i : Fin n) :
          Instances For
            theorem DecisionTree.usesVar_iff {n : ℕ} (i : Fin n) (T : DecisionTree n) :
            theorem DecisionTree.lift_evaluate {n n' : ℕ} {h : n ≤ n'} {T : DecisionTree n} {I : Vector Bool n'} :
            (lift h T).evaluate I = T.evaluate (Vector.cast ⋯ (I.take n))
            theorem DecisionTree.relabel_injective {n : ℕ} {T1 T2 : DecisionTree n} {f : ℕ → ℕ} {hf : ∀ (i : Fin n), f ↑i < f n} {h : ∀ (i i' : Fin n), usesVar i T1 → usesVar i' T2 → f ↑i = f ↑i' → i = i'} :
            relabel hf T1 = relabel hf T2 → T1 = T2