AFTD Auto-Formalizing Theoretical Domains

List.argMaxOn

defimported Lean

A chosen maximizer of f on the non-empty list head :: tail, computed by a left fold that keeps the running maximizer (ties keep the later element). Computable: the fold needs only a decidable comparison [DecidableLE Y]; correctness (argMaxOn_mem / argMaxOn_ge) needs the total preorder.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
variable {X Y : Type*} in
def List.argMaxOn [TotalPreorder Y] [DecidableLE Y] (f : X → Y)
    (head : X) (tail : List X) : X
Defined in
EconCSLib, `List.argMaxOn`
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 1
  • TotalPreorderA total preorder: a preorder where ≤ is total (complete). This is weaker than LinearOrder — it does NOT require antisymmetry or…
Used by 8

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
variable {X Y : Type*} in
/-- A chosen maximizer of `f` on the non-empty list `head :: tail`, **computed** by a left fold that keeps the running maximizer (ties keep the later element). Computable: the fold needs only a decidable comparison `[DecidableLE Y]`; correctness (`argMaxOn_mem` / `argMaxOn_ge`) needs the total preorder. -/
def List.argMaxOn [TotalPreorder Y] [DecidableLE Y] (f : X → Y)
    (head : X) (tail : List X) : X :=
  tail.foldl (fun a z => if f a ≤ f z then z else a) head
See it in the graphDiscuss this resultChallenge it