k_submod_meet
def
Meet of two assignments x and y in Fin n → Option (Fin k): at each coordinate e, it is x e if x e = y e, and none otherwise.
Statement
def k_submod_meet {n k : ℕ} (x y : Fin n → Option (Fin k)) : Fin n → Option (Fin k)- Defined in
- arXiv:2610.26677, line 98
- Verified
- 21 Oct 2026
- Axioms
- none listed
- Used by 3
- 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.
- is_k_submodularA function f : (Fin n → Option (Fin k)) → ℝ is k-submodular if for all x and y, f (x ⊓ y) + f (x ⊔ y) ≤ f x + f y.
- not_k_submod_hidden_fn_propertiesThe statement
k_submod_hidden_fn_propertiesis false: The definitionis_k_submod_kernellacks a differentiability/continuity…
Read back from the Lean
k_submod_meet defines a function taking implicit natural numbers n and k, and two functions x, y : Fin n → Option (Fin k), and returning a function Fin n → Option (Fin k). For each e : Fin n, the output value is:
- some i if x e = some i and y e = some j with i = j (that is, if x e = y e = some i);
- none otherwise (if x e ≠ y e, or if both are none).
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
/-- Coordinatewise meet of two assignments Fin n → Option (Fin k). -/ def k_submod_meet {n k : ℕ} (x y : Fin n → Option (Fin k)) : Fin n → Option (Fin k) := fun e => match x e, y e with | some i, some j => if i = j then some i else none | _, _ => none