OAI/Combinatorics/EditApproximation/Numerics/RationalRefinement.lean
8 declarations, 0 contain sorry, 0 declared as axioms
Rational execution of the Bellman and refinement operations
Every finite minimum, cone cost, warmup iteration, and refinement update is computed in rational arithmetic. The real analysis used elsewhere is the exact cast of these operations. An absent online candidate returns the cone minimum, avoiding an extended-real value in the implementation.
- theorem
OAI.EditApproximation.rationalMinimum_castline 21 - def
OAI.EditApproximation.RationalBellmanAction.toRealline 30 - theorem
OAI.EditApproximation.rationalActionValue_castline 38 - theorem
OAI.EditApproximation.rationalBellman_castline 47 - def
OAI.EditApproximation.rationalWarmupline 57 - theorem
OAI.EditApproximation.rationalWarmup_castline 62 - theorem
OAI.EditApproximation.rationalRefinementUpdate_castline 78 - theorem
OAI.EditApproximation.rationalRefinementUpdate_noneline 84