AFTD Auto-Formalizing Theoretical Domains

is_k_diagonal_on

def

Let V be a finite subset of U. A function f : U^k -> ℚ is k-diagonal on V if for all x : Fin k -> U with all coordinates in V, f(x) ≠ 0 if and only if all entries of x are equal.

Statement

def is_k_diagonal_on {U : Type*} {k : ℕ} (V : Finset U) (f : (Fin k → U) → ℚ) : Prop
Defined in
arXiv:2610.26686 Section 3, above Lemma 3
Verified
22 Oct 2026
Axioms
none listed
Used by 1

Read back from the Lean

For a type U, a natural number k, a finite set V : Finset U, and a function f : (Fin k → U) → ℚ, is_k_diagonal_on V f asserts that for every function x : Fin k → U, if x i ∈ V for all i : Fin k, then f x ≠ 0 if and only if x i = x j for all i j : Fin k (that is, f(x) is nonzero on $V^k$ precisely when all components of x are equal).

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

/-- A k-ary function f on U is k-diagonal on V if on tuples from V it is non-zero exactly when all entries are equal. -/
def is_k_diagonal_on {U : Type*} {k : ℕ} (V : Finset U) (f : (Fin k → U) → ℚ) : Prop := ∀ x : Fin k → U, (∀ i, x i ∈ V) → (f x ≠ 0 ↔ ∀ i j : Fin k, x i = x j)
See it in the graphDiscuss this resultChallenge it