OAI/Combinatorics/MatrixRemoval/CanonicalModeEntries.lean

GitHub source file

7 declarations, 0 contain sorry, 0 declared as axioms

Exact level-based entry formulas for the canonical flat-class host.

  1. theorem OAI.Problem348.Construction.variableEntry_same_plus line 8
  2. theorem OAI.Problem348.Construction.variableEntry_same_minus line 17
  3. theorem OAI.Problem348.Construction.variableEntry_child_parent_plus line 27
  4. theorem OAI.Problem348.Construction.variableEntry_child_parent_minus line 34
  5. theorem OAI.Problem348.Construction.class_eq_leaf_of_depth_eq line 42

    Source documentation

    Maximal depth is exactly the shared leaf class.

    theorem class_eq_leaf_of_depth_eq {h : ℕ} {v : VariablePosition h}
    (hv : depth v = h) : v.1 = Fin.last (2 * h) := by
…

    Mentions: OAI.Problem348.Construction.VariablePosition, OAI.Problem348.Construction.depth

  6. theorem OAI.Problem348.Construction.node_eq_index_of_depth_eq line 51

    Source documentation

    At leaf depth a node labels a unique position, since its block has size one.

    theorem node_eq_index_of_depth_eq {h : ℕ} {v : VariablePosition h}
    (hv : depth v = h) : node v = v.2.val := by
…

    Mentions: OAI.Problem348.Construction.VariablePosition, OAI.Problem348.Construction.depth, OAI.Problem348.Construction.node

  7. theorem OAI.Problem348.Construction.eq_leaf_of_depth_eq line 55