List.le_argMaxOn_head
theoremverifiedformalizationimported Lean
The argmax achieves at least the head's value.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in variable {X Y : Type*} in theorem List.le_argMaxOn_head [TotalPreorder Y] [DecidableLE Y] (f : X → Y) (head : X) (tail : List X) : f head ≤ f (argMaxOn f head tail)
- Formalizes
- EconCSLib, `List.le_argMaxOn_head`
- 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.le_argMaxOn_head← List.le_argMaxOn_head (EconCSLib/Foundation/Argmax.lean:136): 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.argMaxOn_geSoundness: every element's
f-image is≤the chosen maximizer's. - List.argMaxOnA chosen maximizer of
fon the non-empty listhead :: tail, computed by a left fold that keeps the running maximizer (ties keep…
- TotalPreorderA total preorder: a preorder where
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in variable {X Y : Type*} in /-- The argmax achieves at least the head's value. -/ theorem List.le_argMaxOn_head [TotalPreorder Y] [DecidableLE Y] (f : X → Y) (head : X) (tail : List X) : f head ≤ f (argMaxOn f head tail) := argMaxOn_ge f head tail head List.mem_cons_self