AFTD Auto-Formalizing Theoretical Domains

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.
Verified
08 Oct 2026
Axioms
propext
Built on 3
  • TotalPreorderA total preorder: a preorder where ≤ is total (complete). This is weaker than LinearOrder — it does NOT require antisymmetry or…
  • List.argMaxOnA chosen maximizer of f on the non-empty list head :: tail, computed by a left fold that keeps the running maximizer (ties keep…
  • List.foldl_max_gefoldl_max_ge: every element's f-image is ≤ that of the running maximizer kept by the left fold. The induction generalizes the…
Used by 2

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
See it in the graphDiscuss this resultChallenge it