AFTD Auto-Formalizing Theoretical Domains

k_submod_hidden_fn

def

For implicit n and k, a bivariate function H : ℝ → ℝ → ℝ, a hidden assignment σ : Fin n → Fin k, and a partial assignment x : Fin n → Option (Fin k), k_submod_hidden_fn H σ x is defined as H (c / n) ((m - c) / n) / H 1 0, where c is the number of elements e with x e = some (σ e) and m is the number of elements e with x e ≠ none.

Statement

noncomputable def k_submod_hidden_fn {n k : ℕ} (H : ℝ → ℝ → ℝ) (σ : Fin n → Fin k)
    (x : Fin n → Option (Fin k)) : ℝ
Defined in
arXiv:2610.26677, Eq. (6)
Verified
21 Oct 2026
Axioms
none listed
Used by 5

Read back from the Lean

For implicit natural numbers n and k, a function H : ℝ → ℝ → ℝ, a function σ : Fin n → Fin k, and a function x : Fin n → Option (Fin k), k_submod_hidden_fn is defined as the real number: H (c / n) ((m - c) / n) / H 1 0 where: - c is the number of indices e : Fin n such that x e = some (σ e), cast to ℝ; - m is the number of indices e : Fin n such that x e ≠ none, cast to ℝ; and all divisions and subtractions are in ℝ.

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

/-- The normalized hidden-label kernel function f_σ on assignments. -/
noncomputable def k_submod_hidden_fn {n k : ℕ} (H : ℝ → ℝ → ℝ) (σ : Fin n → Fin k)
    (x : Fin n → Option (Fin k)) : ℝ :=
  let c := (Finset.univ.filter (fun e => x e = some (σ e))).card
  let m := (Finset.univ.filter (fun e => x e ≠ none)).card
  H ((c : ℝ) / n) (((m : ℝ) - (c : ℝ)) / n) / H 1 0
See it in the graphDiscuss this resultChallenge it