AFTD Auto-Formalizing Theoretical Domains

is_k_submod_kernel

def

A 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 coordinatewise nondecreasing on [0,1]², and each first partial derivative of H is coordinatewise nonincreasing on [0,1]².

Statement

def is_k_submod_kernel (H : ℝ → ℝ → ℝ) : Prop
Defined in
arXiv:2610.26677, Lemma 2.1
Verified
21 Oct 2026
Axioms
none listed
Used by 8
  • not_k_submod_hidden_fn_orthant_diminishing_returnsThe statement k_submod_hidden_fn_orthant_diminishing_returns is false: The definition is_k_submod_kernel lacks…
  • k_submod_kernel_projThe coordinate projection function (fun x _ => x) : ℝ → ℝ → ℝ satisfies is_k_submod_kernel.
  • c1_k_submod_kernel_projThe first coordinate projection function (fun x _ => x) : ℝ → ℝ → ℝ satisfies is_c1_k_submod_kernel.
  • is_c1_k_submod_kernelA bivariate function H : ℝ → ℝ → ℝ satisfies is_c1_k_submod_kernel if the map (fun p : ℝ × ℝ => H p.1 p.2) is continuously differentiable…
  • 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_properties is false: The definition is_k_submod_kernel lacks 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…
  • 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

The definition is_k_submod_kernel is a predicate on a function H : ℝ → ℝ → ℝ asserting that all of the following seven conditions hold: 1. H 0 0 = 0: $H(0, 0) = 0$. 2. 0 < H 1 0: $H(1, 0) > 0$. 3. ∀ x y, 0 ≤ x → x ≤ 1 → 0 ≤ y → y ≤ 1 → H x y ≤ H 1 0: For all $x, y \in [0, 1]$, $H(x, y) \le H(1, 0)$. 4. ∀ x₁ x₂ y, 0 ≤ x₁ → x₁ ≤ x₂ → x₂ ≤ 1 → 0 ≤ y → y ≤ 1 → H x₁ y ≤ H x₂ y: For all $x_1, x_2, y \in \mathbb{R}$ 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)$ ($H$ is non-decreasing in its first argument on $[0, 1]^2$). 5. ∀ x y₁ y₂, 0 ≤ x → x ≤ 1 → 0 ≤ y₁ → y₁ ≤ y₂ → y₂ ≤ 1 → H x y₁ ≤ H x y₂: For all $x, y_1, y_2 \in \mathbb{R}$ 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)$ ($H$ is non-decreasing in its second argument on $[0, 1]^2$). 6. ∀ x₁ x₂ y₁ y₂, 0 ≤ x₁ → x₁ ≤ x₂ → x₂ ≤ 1 → 0 ≤ y₁ → y₁ ≤ y₂ → y₂ ≤ 1 → deriv (fun t => H t y₂) x₂ ≤ deriv (fun t => H t y₁) x₁: For all $x_1, x_2, y_1, y_2 \in \mathbb{R}$ with $0 \le x_1 \le x_2 \le 1$ and $0 \le y_1 \le y_2 \le 1$, the derivative (with respect to the first argument) $\left.\frac{d}{dt} H(t, y_2)\right|_{t = x_2} \le \left.\frac{d}{dt} H(t, y_1)\right|_{t = x_1}$. 7. ∀ x₁ x₂ y₁ y₂, 0 ≤ x₁ → x₁ ≤ x₂ → x₂ ≤ 1 → 0 ≤ y₁ → y₁ ≤ y₂ → y₂ ≤ 1 → deriv (fun t => H x₂ t) y₂ ≤ deriv (fun t => H x₁ t) y₁: For all $x_1, x_2, y_1, y_2 \in \mathbb{R}$ with $0 \le x_1 \le x_2 \le 1$ and $0 \le y_1 \le y_2 \le 1$, the derivative (with respect to the second argument) $\left.\frac{d}{dt} H(x_2, t)\right|_{t = y_2} \le \left.\frac{d}{dt} H(x_1, t)\right|_{t = y_1}$.

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

/-- Kernel conditions: H(0,0)=0, H(1,0)>0, bounded by H(1,0), coordinatewise nondecreasing, and coordinatewise nonincreasing first partial derivatives on [0,1]^2. -/
def is_k_submod_kernel (H : ℝ → ℝ → ℝ) : Prop :=
  H 0 0 = 0 ∧
  0 < H 1 0 ∧
  (∀ x y, 0 ≤ x → x ≤ 1 → 0 ≤ y → y ≤ 1 → H x y ≤ H 1 0) ∧
  (∀ x₁ x₂ y, 0 ≤ x₁ → x₁ ≤ x₂ → x₂ ≤ 1 → 0 ≤ y → y ≤ 1 → H x₁ y ≤ H x₂ y) ∧
  (∀ x y₁ y₂, 0 ≤ x → x ≤ 1 → 0 ≤ y₁ → y₁ ≤ y₂ → y₂ ≤ 1 → H x y₁ ≤ H x y₂) ∧
  (∀ x₁ x₂ y₁ y₂, 0 ≤ x₁ → x₁ ≤ x₂ → x₂ ≤ 1 → 0 ≤ y₁ → y₁ ≤ y₂ → y₂ ≤ 1 →
    deriv (fun t => H t y₂) x₂ ≤ deriv (fun t => H t y₁) x₁) ∧
  (∀ x₁ x₂ y₁ y₂, 0 ≤ x₁ → x₁ ≤ x₂ → x₂ ≤ 1 → 0 ≤ y₁ → y₁ ≤ y₂ → y₂ ≤ 1 →
    deriv (fun t => H x₂ t) y₂ ≤ deriv (fun t => H x₁ t) y₁)
See it in the graphDiscuss this resultChallenge it