Paired natural-number arithmetic for dyadic critical-root certificates
DefinitionDerivativeChainPrivate_dyadic_kernelderivative-chain-privatedyadic-certificate-20261018
Pure paired reciprocal-sum arithmetic and Boolean endpoint-sign checks. The soundness and full polynomial theorem are separate obligations. No global derivative-chain bound is asserted by these definitions.
Definition code
import Mathlib.Data.Nat.Basic
set_option autoImplicit false
namespace DerivativeChainPrivate.DyadicKernel
def pairedSums (numerator square : ℕ) (parentSquares : List ℕ) : ℕ × ℕ :=
parentSquares.foldl (fun p r =>
if r < square then (p.1+numerator/(square-r),p.2)
else (p.1,p.2+numerator/(r-square))) (0,0)
def endpoint (degree w : ℕ) (parentSquares : List ℕ) (positive : Bool) : Bool :=
let p := pairedSums (2^85*w) (w*w) parentSquares
let pos := p.1 + if degree % 2 = 1 then 2^84/w else 0
if positive then decide (p.2+degree < pos) else decide (pos+degree < p.2)
def signs (degree : ℕ) (parentSquares : List ℕ) (points : List (ℕ × Bool)) : Bool :=
points.all (fun p => endpoint degree p.1 parentSquares p.2)
end DerivativeChainPrivate.DyadicKernel
Source