AFTD Auto-Formalizing Theoretical Domains

MatrixGame.AdmissibleSequence.IsRowUsefulInWindow

defimported Lean

A pure row i is useful in the window [s, s + t*] if there is a step inside the window at which i is among the row player's argmax choices.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Finset BigOperators in
set_option linter.unusedSectionVars false in
variable {I J : Type*} [Fintype I] [Fintype J] [Nonempty I] [Nonempty J] in
variable {A : MatrixGame I J ℝ} in
def MatrixGame.AdmissibleSequence.IsRowUsefulInWindow (s : AdmissibleSequence A) (start length : ℕ) (i : I) : Prop
Defined in
EconCSLib, `MatrixGame.AdmissibleSequence.IsRowUsefulInWindow`
Lean proof
By xbei (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 listed
Built on 5

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Finset BigOperators in
set_option linter.unusedSectionVars false in
variable {I J : Type*} [Fintype I] [Fintype J] [Nonempty I] [Nonempty J] in
variable {A : MatrixGame I J ℝ} in
/-- A pure row `i` is **useful** in the window `[s, s + t*]` if there is a step inside the window at which `i` is among the row player's argmax choices. -/
def MatrixGame.AdmissibleSequence.IsRowUsefulInWindow (s : AdmissibleSequence A) (start length : ℕ) (i : I) : Prop :=
  ∃ k, start ≤ k ∧ k < start + length ∧ s.iSeq k = i
See it in the graphDiscuss this resultChallenge it