OAI/Combinatorics/EditApproximation/Geometry/BalancedIntervals.lean

GitHub source file

9 declarations, 0 contain sorry, 0 declared as axioms

The actual balanced interval cuts

The fixed interval tree uses cuts l + floor(i*width/M). Their substring pieces concatenate exactly to the parent, including repeated cuts and empty pieces. These facts instantiate optimal alignment splitting on the manuscript's actual source intervals.

  1. theorem OAI.EditApproximation.balancedCut_zero line 21
  2. theorem OAI.EditApproximation.balancedCut_last line 24
  3. theorem OAI.EditApproximation.balancedCut_monotone line 28
  4. theorem OAI.EditApproximation.balancedCut_bounds line 32
  5. def OAI.EditApproximation.balancedPieces line 39
  6. theorem OAI.EditApproximation.balancedPieces_prefix line 42
  7. theorem OAI.EditApproximation.balancedPieces_flatten line 55
  8. theorem OAI.EditApproximation.balancedPieces_length line 59
  9. theorem OAI.EditApproximation.sourceChild_partition line 67