OAI/Combinatorics/UniformKServer/CommonAnchorTravel.lean

GitHub source file

7 declarations, 0 contain sorry, 0 declared as axioms

The diagonal term of tree matching is genuine retained heavy-anchor travel. No claim is made about an unsupported prefix.

  1. def OAI.UniformKServer.PartitionTree.actualAllocation line 17
  2. theorem OAI.UniformKServer.PartitionTree.park_witness line 21
  3. def OAI.UniformKServer.PartitionTree.labelTravel line 32
  4. theorem OAI.UniformKServer.PartitionTree.labelTravel_nonneg line 38
  5. theorem OAI.UniformKServer.PartitionTree.common_label_bound line 45
  6. theorem OAI.UniformKServer.PartitionTree.all_label_sum line 76
  7. theorem OAI.UniformKServer.PartitionTree.common_travel_le line 99