OAI/Combinatorics/EditApproximation/Binary/FractionControlSpace.lean
18 declarations, 0 contain sorry, 0 declared as axioms
- def
OAI.EditApproximation.SignedBinary.addInvocationsline 8 - theorem
OAI.EditApproximation.SignedBinary.addInvocations_le_workline 16 - def
OAI.EditApproximation.SignedBinary.mulInvocationsline 28 - theorem
OAI.EditApproximation.SignedBinary.mulInvocations_le_workline 30 - def
OAI.EditApproximation.BinaryFraction.addInvocationsline 39 - theorem
OAI.EditApproximation.BinaryFraction.addInvocations_add_one_le_workline 46 - def
OAI.EditApproximation.BinaryFraction.mulInvocationsline 57 - theorem
OAI.EditApproximation.BinaryFraction.mulInvocations_add_one_le_workline 60 - def
OAI.EditApproximation.BinaryFraction.signedLtInvocationsline 70Source documentation
Signed comparison may compare both words with zero. Its total recursive Boolean-comparison frames are bounded by the explicitly counted work.
def signedLtInvocations (a b : SignedBinary) : ℕ := …
Mentions: OAI.EditApproximation.SignedBinary
- theorem
OAI.EditApproximation.BinaryFraction.signedLtInvocations_le_workline 76 - def
OAI.EditApproximation.BinaryFraction.compareInvocationsline 87Source documentation
Actual fraction-comparison invocation count, including signed comparison.
def compareInvocations (a b : BinaryFraction) : ℕ := …
Mentions: OAI.EditApproximation.BinaryFraction
- theorem
OAI.EditApproximation.BinaryFraction.compareInvocations_le_workline 93 - def
OAI.EditApproximation.BinaryFraction.canonicalizeInvocationsline 103 - theorem
OAI.EditApproximation.BinaryFraction.canonicalizeInvocations_le_workline 106 - def
OAI.EditApproximation.BinaryFraction.canonicalAddInvocationsline 114 - theorem
OAI.EditApproximation.BinaryFraction.canonicalAddInvocations_le_workline 117 - def
OAI.EditApproximation.BinaryFraction.canonicalMulInvocationsline 125 - theorem
OAI.EditApproximation.BinaryFraction.canonicalMulInvocations_le_workline 128