List.argMaxOn_ge
theoremverifiedformalizationimported Lean
Soundness: every element's f-image is ≤ the chosen maximizer's.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in variable {X Y : Type*} in theorem List.argMaxOn_ge [TotalPreorder Y] [DecidableLE Y] (f : X → Y) (head : X) (tail : List X) : ∀ x ∈ head :: tail, f x ≤ f (argMaxOn f head tail)
- Formalizes
- EconCSLib, `List.argMaxOn_ge`
- 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_ge← List.argMaxOn_ge (EconCSLib/Foundation/Argmax.lean:130): verbatim
- Verified
- 08 Oct 2026
- Axioms
propext- Built on 3
- 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_ge
foldl_max_ge: every element'sf-image is≤that of the running maximizer kept by the left fold. The induction generalizes the…
- TotalPreorderA total preorder: a preorder where
- Used by 2
- GameTree.value_Node_geKey optimality lemma: at a
Node m h t, the moverm's coordinate of the backward-induction value dominates every child's. - List.le_argMaxOn_headThe argmax achieves at least the head's value.
- GameTree.value_Node_geKey optimality lemma: at a
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in variable {X Y : Type*} in /-- Soundness: every element's `f`-image is `≤` the chosen maximizer's. -/ theorem List.argMaxOn_ge [TotalPreorder Y] [DecidableLE Y] (f : X → Y) (head : X) (tail : List X) : ∀ x ∈ head :: tail, f x ≤ f (argMaxOn f head tail) := foldl_max_ge f tail head