AFTD Auto-Formalizing Theoretical Domains

is_c1_k_submod_kernel

deforiginal

A bivariate function H : ℝ → ℝ → ℝ satisfies is_c1_k_submod_kernel if the map (fun p : ℝ × ℝ => H p.1 p.2) is continuously differentiable of class C^1 (ContDiff ℝ 1) and H satisfies is_k_submod_kernel H.

Statement

def is_c1_k_submod_kernel (H : ℝ → ℝ → ℝ) : Prop
Related work
arXiv:2610.26677, Lemma 2.1 and proof of Lemma 2.2
Verified
22 Oct 2026
Axioms
none listed
Built on 1
  • is_k_submod_kernelA two-variable kernel H : ℝ → ℝ → ℝ satisfies the hidden-label conditions if H(0,0) = 0, H(1,0) > 0, H(x,y) ≤ H(1,0) on [0,1]², H is…
Used by 3

Read back from the Lean

A definition is_c1_k_submod_kernel of a predicate on functions H : ℝ → ℝ → ℝ, asserting that: 1. The uncurried function (fun p : ℝ × ℝ => H p.1 p.2) is of class $C^1$ on $\mathbb{R} \times \mathbb{R}$ (ContDiff ℝ 1). 2. H satisfies is_k_submod_kernel, which is the conjunction of: - $H(0, 0) = 0$; - $0 < H(1, 0)$; - For all $x, y \in [0, 1]$, $H(x, y) \le H(1, 0)$; - For all $x_1, x_2, y$ with $0 \le x_1 \le x_2 \le 1$ and $0 \le y \le 1$, $H(x_1, y) \le H(x_2, y)$ (monotonicity in the first argument on $[0, 1]$); - For all $x, y_1, y_2$ with $0 \le x \le 1$ and $0 \le y_1 \le y_2 \le 1$, $H(x, y_1) \le H(x, y_2)$ (monotonicity in the second argument on $[0, 1]$); - For all $x_1, x_2, y_1, y_2$ with $0 \le x_1 \le x_2 \le 1$ and $0 \le y_1 \le y_2 \le 1$, the derivative of $t \mapsto H(t, y_2)$ at $x_2$ is at most the derivative of $t \mapsto H(t, y_1)$ at $x_1$ (i.e. the partial derivative with respect to the first argument is componentwise non-increasing on $[0, 1]^2$); - For all $x_1, x_2, y_1, y_2$ with $0 \le x_1 \le x_2 \le 1$ and $0 \le y_1 \le y_2 \le 1$, the derivative of $t \mapsto H(x_2, t)$ at $y_2$ is at most the derivative of $t \mapsto H(x_1, t)$ at $y_1$ (i.e. the partial derivative with respect to the second argument is componentwise non-increasing on $[0, 1]^2$).

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

/-- Predicate for a continuously differentiable bivariate kernel satisfying the k-submodularity kernel conditions. -/
def is_c1_k_submod_kernel (H : ℝ → ℝ → ℝ) : Prop := ContDiff ℝ 1 (fun p : ℝ × ℝ => H p.1 p.2) ∧ is_k_submod_kernel H
See it in the graphDiscuss this resultChallenge it