OAI/Combinatorics/UniformKServer/PrefixCounts.lean

GitHub source file

4 declarations, 0 contain sorry, 0 declared as axioms

Literal subtree-count costs are controlled by labeled coordinate-key edits, without a tree-height or cardinality factor.

  1. theorem OAI.UniformKServer.PrefixMovement.diff_triangle line 17
  2. theorem OAI.UniformKServer.PrefixMovement.count_cast line 21
  3. theorem OAI.UniformKServer.PrefixMovement.count_variation line 28
  4. theorem OAI.UniformKServer.PrefixMovement.count_split line 49