AFTD Auto-Formalizing Theoretical Domains

Online.OnlineAlgorithm.run_cons

theoremverifiedformalizationimported Lean

Online.OnlineAlgorithm.run_cons

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Online Online.OnlineAlgorithm in
variable {α σ β : Type*} in
theorem Online.OnlineAlgorithm.run_cons (alg : OnlineAlgorithm α σ β)
    (s : σ) (r : α) (rs : List α) :
    alg.run s (r :: rs) =
      match alg.step s (some r) with
      | (s', some o) => (s', some o)
      | (s', none)   => alg.run s' rs
Formalizes
EconCSLib, `Online.OnlineAlgorithm.run_cons`
Lean proof
By Claude (from the file's git history), from github.com/gametheoryinlean/EconCSLib at 1a88f809b538 (Copyright (c) 2026 EconCSLib contributors. All rights reserved, Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.30.0.
Verified
08 Oct 2026
Axioms
none — Lean reports it depends on no axioms
Built on 3
  • Online.OnlineAlgorithmA deterministic online algorithm as a state machine. The state State summarises the relevant past; step consumes the current state and…
  • Online.OnlineAlgorithm.runDrive the machine across the requests, halting at the first step that emits an output. When the genuine requests are exhausted without…
  • Online.OnlineAlgorithm.run_nilOn no requests, run is exactly the end-of-input step.
Used by 2

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Online Online.OnlineAlgorithm in
variable {α σ β : Type*} in
theorem Online.OnlineAlgorithm.run_cons (alg : OnlineAlgorithm α σ β)
    (s : σ) (r : α) (rs : List α) :
    alg.run s (r :: rs) =
      match alg.step s (some r) with
      | (s', some o) => (s', some o)
      | (s', none)   => alg.run s' rs := rfl
See it in the graphDiscuss this resultChallenge it