AFTD Auto-Formalizing Theoretical Domains

is_optimal_schedule

def

A schedule r_star : Fin T → Bool is optimal with hindsight for increments a : Fin (T - 1) → NNReal and reset price K : ℝ if for every schedule r : Fin T → Bool, rent_or_buy_cost T a K r_star ≤ rent_or_buy_cost T a K r.

Statement

def is_optimal_schedule (T : ℕ) (a : Fin (T - 1) → NNReal) (K : ℝ) (r_star : Fin T → Bool) : Prop
Defined in
arXiv:2611.06955, Definition 3
Verified
08 Nov 2026
Axioms
none listed
Built on 1
  • rent_or_buy_costGiven horizon T : ℕ, increments a : Fin (T - 1) → NNReal, reset price K : ℝ, and a schedule r : Fin T → Bool, rent_or_buy_cost T a K r : ℝ…

Read back from the Lean

The predicate is_optimal_schedule T a K r_star asserts that for all schedules r : Fin T → Bool, the rent-or-buy cost rent_or_buy_cost T a K r_star is less than or equal to rent_or_buy_cost T a K r.

Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.

Lean source view module on GitHub

/-- A schedule r_star is optimal with hindsight for a session if its total cost is at most that of any schedule. -/
def is_optimal_schedule (T : ℕ) (a : Fin (T - 1) → NNReal) (K : ℝ) (r_star : Fin T → Bool) : Prop := ∀ r : Fin T → Bool, rent_or_buy_cost T a K r_star ≤ rent_or_buy_cost T a K r
See it in the graphDiscuss this resultChallenge it