AFTD Auto-Formalizing Theoretical Domains

vector_seq_max_entry

def

The maximum entry max_{i, j} a_i(j) of a vector sequence a : Fin n → Fin k → ℕ, defined as the supremum of a i j over all pairs (i, j).

Statement

def vector_seq_max_entry {n k : ℕ} (a : Fin n → Fin k → ℕ) : ℕ
Defined in
arXiv:2610.26970 Def 1.1
Verified
24 Oct 2026
Axioms
none listed
Used by 2

Read back from the Lean

Given natural numbers n and k (implicit) and a function a : Fin n → Fin k → ℕ, vector_seq_max_entry defines the natural number obtained by taking the supremum (maximum) of a(i, j) over all pairs (i, j) in Fin n × Fin k via Finset.univ.sup.

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 maximum coordinate entry among all vectors in a sequence. -/
def vector_seq_max_entry {n k : ℕ} (a : Fin n → Fin k → ℕ) : ℕ :=
  Finset.univ.sup (fun p : Fin n × Fin k => a p.1 p.2)
See it in the graphDiscuss this resultChallenge it