OAI/Combinatorics/EditApproximation/Binary/BinaryRawCost.lean

GitHub source file

13 declarations, 0 contain sorry, 0 declared as axioms

Bit-operation bounds for the literal Boolean arithmetic calls and bounded-width power loops used inside the entropy optimizer.

  1. theorem OAI.EditApproximation.BinaryFraction.representation_storageBits_le line 11
  2. theorem OAI.EditApproximation.BinaryFraction.neg_width line 24
  3. theorem OAI.EditApproximation.BinaryFraction.invWithWork_width line 26
  4. theorem OAI.EditApproximation.BinaryFraction.subWithWork_cost line 36
  5. theorem OAI.EditApproximation.BinaryFraction.divWithWork_cost line 41
  6. theorem OAI.EditApproximation.BinaryFraction.powWithWork_cost_of_width line 50
  7. def OAI.EditApproximation.BinaryFraction.powerWordBudget line 63
  8. theorem OAI.EditApproximation.BinaryFraction.powWithWork_width_abs_le_one line 66
  9. theorem OAI.EditApproximation.BinaryFraction.powWithWork_cost_abs_le_one line 72
  10. theorem OAI.EditApproximation.BinaryFraction.representation_den_bits_le_width line 83
  11. def OAI.EditApproximation.BinaryFraction.dotWordBudget line 89
  12. theorem OAI.EditApproximation.BinaryFraction.dotListWithWork_width_in line 92
  13. theorem OAI.EditApproximation.BinaryFraction.dotListWithWork_cost_in line 107