k_submod_le
def
Componentwise 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.
Statement
def k_submod_le {n k : ℕ} (x y : Fin n → Option (Fin k)) : Prop
- Defined in
- arXiv:2610.26677, line 106
- Verified
- 21 Oct 2026
- Axioms
- none listed
- Used by 7
- is_k_submod_monotoneA function f : (Fin n → Option (Fin k)) → ℝ is monotone if x ≤ y under the componentwise order implies f x ≤ f y.
- 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.
- not_k_submod_hidden_fn_orthant_diminishing_returnsThe statement
k_submod_hidden_fn_orthant_diminishing_returnsis false: The definitionis_k_submod_kernellacks… - 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…
- has_orthant_diminishing_returnsA function f : (Fin n → Option (Fin k)) → ℝ has orthant diminishing returns if for all x ≤ y, unassigned e in y, and label i, f (y + i…
- 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…
- k_submod_c1_hidden_fn_orthant_diminishing_returnsFor all natural numbers n > 0 and k ≥ 2, every hidden assignment σ : Fin n → Fin k, and every function H : ℝ → ℝ → ℝ satisfying…
Read back from the Lean
For natural numbers n and k, and functions x, y : Fin n → Option (Fin k), k_submod_le x y is defined to hold if and only if for every e : Fin n, either x e = none or x e = y e.
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
/-- Componentwise partial order on assignments Fin n → Option (Fin k). -/ def k_submod_le {n k : ℕ} (x y : Fin n → Option (Fin k)) : Prop := ∀ e, x e = none ∨ x e = y e