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
- k_submodular_of_monotone_of_orthant_diminishing_returnsA monotone function on assignments Fin n → Option (Fin k) that satisfies orthant diminishing returns is k-submodular.
- k_submod_c1_hidden_fn_propertiesFor all natural numbers n > 0 and k ≥ 2, every hidden label assignment σ : Fin n → Fin k, and every function H : ℝ → ℝ → ℝ satisfying…
- not_k_submod_hidden_fn_propertiesThe statement
k_submod_hidden_fn_propertiesis false: The definitionis_k_submod_kernellacks a differentiability/continuity… - k_submod_hidden_fn_monotoneFor n > 0, k ≥ 2, σ : Fin n → Fin k, and H : ℝ → ℝ → ℝ satisfying is_k_submod_kernel, the function k_submod_hidden_fn H σ satisfies…
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