List.argMaxOn_mem
theoremverifiedformalizationimported Lean
The chosen maximizer is a member of the list.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in variable {X Y : Type*} in theorem List.argMaxOn_mem [TotalPreorder Y] [DecidableLE Y] (f : X → Y) (head : X) (tail : List X) : argMaxOn f head tail ∈ head :: tail
- Formalizes
- EconCSLib, `List.argMaxOn_mem`
- 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.List.argMaxOn_mem← List.argMaxOn_mem (EconCSLib/Foundation/Argmax.lean:124): verbatim
- Verified
- 08 Oct 2026
- Axioms
propext- Built on 3
- List.foldl_max_mem
foldl_max_mem: the running maximizer kept by the left fold lies in the candidate listacc :: l. - TotalPreorderA total preorder: a preorder where
≤is total (complete). This is weaker thanLinearOrder— it does NOT require antisymmetry or… - List.argMaxOnA chosen maximizer of
fon the non-empty listhead :: tail, computed by a left fold that keeps the running maximizer (ties keep…
- List.foldl_max_mem
- Used by 1
- GameTree.value_Node_eq_some_child_valueThe value at a node is itself the value of some child (the argmax). Specifically,
argMaxOn ... ∈ value h :: valueList t, so it equals…
- GameTree.value_Node_eq_some_child_valueThe value at a node is itself the value of some child (the argmax). Specifically,
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in variable {X Y : Type*} in /-- The chosen maximizer is a member of the list. -/ theorem List.argMaxOn_mem [TotalPreorder Y] [DecidableLE Y] (f : X → Y) (head : X) (tail : List X) : argMaxOn f head tail ∈ head :: tail := foldl_max_mem f tail head