AFTD Auto-Formalizing Theoretical Domains

OfflineArrival

structure

The state of an arrival in the offline benchmark, tracking its arrival data, the set of resources already probed for it, and whether it has been matched.

Statement

structure OfflineArrival (n : ℕ)
Defined in
scout/2611-03598-online-matching-with-arbitrary-stochastic-rewards.md:417
Verified
04 Nov 2026
Axioms
none listed
Built on 1
  • OMSRArrivalAn arrival in online bipartite matching with stochastic rewards and patience facing n offline resources, consisting of a patience budget…
Used by 4
  • optDPFor resource weights w : Fin n → ℝ, fuel : ℕ, available resources S : Finset (Fin n), and arrival states arrs : Fin m → OfflineArrival n,…
  • omsr_patience_single_arrival_optimalFor all n and all non-negative weights w, there exists a randomized online policy R for n resources such that on every arrival list arrs…
  • omsr_single_arrival_optimal_probeSeq_existsFor any resource weights w ≥ 0 and single arrival arr, there exists a valid probe sequence L from the full resource set univ whose probe…
  • offlineOptValueThe expected reward of the adaptive offline benchmark OPT on a list of arrivals arrs with resource weights w, defined by running optDP…

Read back from the Lean

A structure OfflineArrival parameterized by a natural number $n$, containing: 1. arrival: an object of type OMSRArrival n, 2. probed: a finite subset of Fin n (Finset (Fin n)), 3. matched: a boolean value (Bool).

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

/-- Arrival state in the adaptive offline benchmark. -/
structure OfflineArrival (n : ℕ) where
  arrival : OMSRArrival n
  probed : Finset (Fin n)
  matched : Bool
See it in the graphDiscuss this resultChallenge it