OAI/Combinatorics/EditApproximation/Binary/BinaryDyadicCeiling.lean

GitHub source file

15 declarations, 0 contain sorry, 0 declared as axioms

The dyadic envelope is found by a bounded sequence of exact Boolean comparisons. The scan starts at 2⁻ᴮ, doubles at most 2B times, and uses the stored fraction width B; no real logarithm is evaluated.

  1. theorem OAI.EditApproximation.powerTwoWord_value line 16
  2. theorem OAI.EditApproximation.powerTwoWord_length line 25
  3. theorem OAI.EditApproximation.BinaryFraction.inversePowerTwo_value line 32
  4. theorem OAI.EditApproximation.BinaryFraction.inversePowerTwo_width line 38
  5. theorem OAI.EditApproximation.BinaryFraction.doubleFraction_value line 43
  6. theorem OAI.EditApproximation.BinaryFraction.doubleFraction_width line 47
  7. theorem OAI.EditApproximation.BinaryFraction.dyadicCeiling_eq_of_bounds line 54
  8. theorem OAI.EditApproximation.BinaryFraction.dyadicScanWithWork_value line 62
  9. theorem OAI.EditApproximation.BinaryFraction.dyadicScanWithWork_width line 87
  10. theorem OAI.EditApproximation.BinaryFraction.dyadicScanWithWork_cost line 99
  11. theorem OAI.EditApproximation.BinaryFraction.positive_value_lower line 117
  12. theorem OAI.EditApproximation.BinaryFraction.dyadicCeilingWithWork_value line 135
  13. theorem OAI.EditApproximation.BinaryFraction.dyadicCeilingWithWork_width line 152
  14. theorem OAI.EditApproximation.BinaryFraction.dyadicCeilingWithWork_cost line 158
  15. theorem OAI.EditApproximation.BinaryFraction.dyadicCeilingWithWork_cost_le line 167