AFTD Auto-Formalizing Theoretical Domains

step_function_sigma

def

The step function from ℝ to ℤ that maps t to 0 if |t| ≤ 2/3, to 1 if t > 2/3, and to -1 if t < -2/3.

Statement

noncomputable def step_function_sigma (t : ℝ) : ℤ
Defined in
arXiv:2611.16690, Hilbert's 17th problem for symmetric functions: undecidability and a counterexample, Proof of Theorem 3.1 (1)
Verified
13 Nov 2026
Axioms
none listed

Read back from the Lean

The function step_function_sigma maps a real number t to an integer defined conditionally as: - 0 if |t| ≤ 2 / 3, - 1 if |t| > 2 / 3 and 0 < t (equivalently, t > 2 / 3), - -1 otherwise (equivalently, t < -2 / 3).

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 three-valued step function mapping t to 0 if |t| ≤ 2/3 and to the sign of t otherwise. -/
noncomputable def step_function_sigma (t : ℝ) : ℤ := if |t| ≤ 2 / 3 then 0 else if 0 < t then 1 else -1
See it in the graphDiscuss this resultChallenge it