AFTD Auto-Formalizing Theoretical Domains

linearOrderMin

def

The minimum element of Fin n with respect to a linear order L, for n > 0.

Statement

def linearOrderMin {n : ℕ} (hn : 0 < n) (L : LinearOrder (Fin n)) : Fin n
Defined in
arXiv:2610.34762 Section 2
Verified
01 Nov 2026
Axioms
none listed
Used by 3
  • subset_transfer_two_comparisonsSuppose an algorithm on k objects succeeds in minimum selection with probability at least p on every strict order and uses at most two…
  • comparison_algorithm_success_probThe probability that a comparison algorithm A on n objects selects the minimum element under linear order L.
  • lift_linear_order_min_eqIf the global minimum of a linear order on Fin n lies in the range of an embedding f from Fin k to Fin n with f(j) = m, then j is the…

Read back from the Lean

Given a natural number n, a hypothesis hn that 0 < n, and a linear order L on Fin n, linearOrderMin hn L defines the minimum element of Fin n (taken over all elements, i.e., Finset.univ) with respect to the linear order L.

Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.

Lean source view module on GitHub

/-- The minimum element of `Fin n` with respect to a linear order `L`, for `0 < n`. -/
def linearOrderMin {n : ℕ} (hn : 0 < n) (L : LinearOrder (Fin n)) : Fin n :=
  @Finset.min' (Fin n) L Finset.univ
    (Finset.univ_nonempty_iff.mpr (Fin.pos_iff_nonempty.mp hn))
See it in the graphDiscuss this resultChallenge it