AFTD Auto-Formalizing Theoretical Domains

is_k_submod_monotone

def

A function f : (Fin n → Option (Fin k)) → ℝ is monotone if x ≤ y under the componentwise order implies f x ≤ f y.

Statement

def is_k_submod_monotone {n k : ℕ} (f : (Fin n → Option (Fin k)) → ℝ) : Prop
Defined in
arXiv:2610.26677, line 107
Verified
21 Oct 2026
Axioms
none listed
Built on 1
  • k_submod_leComponentwise partial order on assignments Fin n → Option (Fin k), where x ≤ y if for every element e, x e = none or x e = y e.
Used by 4

Read back from the Lean

Given natural numbers n and k, a function f : (Fin n → Option (Fin k)) → ℝ satisfies is_k_submod_monotone if for all x, y : Fin n → Option (Fin k), if k_submod_le x y holds, then f x ≤ f y.

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

/-- Monotonicity of a function on assignments with respect to the componentwise order. -/
def is_k_submod_monotone {n k : ℕ} (f : (Fin n → Option (Fin k)) → ℝ) : Prop := ∀ x y, k_submod_le x y → f x ≤ f y
See it in the graphDiscuss this resultChallenge it