AFTD Auto-Formalizing Theoretical Domains

threshold_schedule

def

Given horizon T : ℕ, increments a : Fin (T - 1) → NNReal, reset price K : ℝ, and call t : Fin T, threshold_schedule T a K t : Bool is decide (K ≤ (acc : ℝ) + (h : ℝ)) where (h, acc) = threshold_state T a K t.

Statement

noncomputable def threshold_schedule (T : ℕ) (a : Fin (T - 1) → NNReal) (K : ℝ) (t : Fin T) : Bool
Defined in
arXiv:2611.06955, Definition 5
Verified
08 Nov 2026
Axioms
none listed
Built on 1
  • threshold_stateGiven horizon T : ℕ, increments a : Fin (T - 1) → NNReal, and reset price K : ℝ, threshold_state T a K : Fin T → NNReal × NNReal is…
Used by 2

Read back from the Lean

Given a time horizon T : ℕ, a sequence of increments a : Fin (T - 1) → NNReal, a threshold K : ℝ, and a time step t : Fin T, threshold_schedule T a K t computes a boolean indicating whether K ≤ (acc : ℝ) + (h : ℝ), where (h, acc) : NNReal × NNReal is the state obtained by threshold_state T a K t.

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

/-- The schedule produced by the threshold rule on a session with horizon T, increments a, and reset price K. -/
noncomputable def threshold_schedule (T : ℕ) (a : Fin (T - 1) → NNReal) (K : ℝ) (t : Fin T) : Bool := let (h, acc) := threshold_state T a K t
  decide (K ≤ (acc : ℝ) + (h : ℝ))
See it in the graphDiscuss this resultChallenge it