AFTD Auto-Formalizing Theoretical Domains

dual_cert_p

def

For each natural number m, p(m) is the largest integer p >= 2 such that p + (p-2)(p-1)/2 < m, or 1 if no such integer exists.

Statement

def dual_cert_p (m : ℕ) : ℕ
Defined in
arXiv:2611.17360 line 121
Verified
16 Nov 2026
Axioms
none listed
Built on 1
  • triangular_numberFor any natural number k, the k-th triangular number is defined as k(k+1)/2.
Used by 1
  • signed_relationFor a dimension n : ℕ, an index j : ℕ, and a vector x : Fin n → ℝ, signed_relation n j x is the real number (∑ t ∈ Finset.range p, coord…

Read back from the Lean

dual_cert_p is a function mapping a natural number $m$ to a natural number, defined as: Let $s$ be the finite set of natural numbers $p \in [2, m]$ such that $p + \text{triangular\_number}(p - 2) < m$. If $s$ is nonempty, dual_cert_p m is the maximum element of $s$; otherwise, it is $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

/-- The integer p(m) used in the signed relation for gap m. -/
def dual_cert_p (m : ℕ) : ℕ :=
  let s := (Finset.Icc 2 m).filter (fun p => p + triangular_number (p - 2) < m)
  if h : s.Nonempty then s.max' h else 1
See it in the graphDiscuss this resultChallenge it