LeanMachineLearning

argmin_spec🔗

Lemma

No docstring.

🔗theorem
argmin_spec.{u_1, u_2} {ι : Type u_1} {α : Type u_2} [LinearOrder α]
  [Fintype ι] [Nonempty ι] (f : ι → α) : f (argmin f) = Function.min f
argmin_spec.{u_1, u_2} {ι : Type u_1}
  {α : Type u_2} [LinearOrder α]
  [Fintype ι] [Nonempty ι] (f : ι → α) :
  f (argmin f) = Function.min f

Code

lemma argmin_spec : ∀ {ι : Type u_1} {α : Type u_2} [inst : LinearOrder α] [inst_1 : Fintype ι] [inst_2 : Nonempty ι] (f : ι → α),
  f (argmin f) = Function.min f
Proof

                    Actions: Source · Open Issue

                  

                

              

            

              Meaning unchanged since v4.33.0-rc1-29-gce231eb, the oldest
          revision on record (2026-07-30). Its file was edited 2026-08-12 (9fc3d89, “bump”) without changing what it means.

            

              Self-contained, with its dependencies inlined and proofs replaced by sorry: download the raw file · open it in the Lean web editor.

            

              Dependency graph

            

            
            

              

            
            

              Audit surface: 3 project declarations, 12 external constants

            

              ✓ Proved: no sorry anywhere in its closure

            

              This is the tool's own reading of one build's recorded axioms, and it is not robust against an author who wants it to pass. Checking meant to be relied on should go through Comparator, which replays the proof through the kernel from an export against an explicit list of permitted axioms.