Signed Integer Addition Is Primitive Recursive
ProvedMonodromy.IntegerPrimrec.addThe binary function on ℤ×ℤ is primitive recursive with respect to Mathlib’s canonical encodings of signed integers. There is no sign or magnitude restriction on either input.
Original proof dependencies: Monodromy.IntegerPrimrec.cases, Monodromy.IntegerPrimrec.difference, Monodromy.IntegerPrimrec.difference_eq, Monodromy.IntegerPrimrec.difference_primrec, Monodromy.IntegerPrimrec.negSucc, Monodromy.IntegerPrimrec.ofNat, Monodromy.IntegerPrimrec.split.
Proof elaboration dependencies: Monodromy.IntegerPrimrec.cases, Monodromy.IntegerPrimrec.difference, Monodromy.IntegerPrimrec.difference_eq, Monodromy.IntegerPrimrec.difference_primrec, Monodromy.IntegerPrimrec.negSucc, Monodromy.IntegerPrimrec.ofNat, Monodromy.IntegerPrimrec.split.
module public import Definitions.Def_Monodromy_IntegerPrimrec public import Mathlib.Computability.Primrec.Basic public import Mathlib.Data.Int.ModEq public import Mathlib.Tactic.Ring @[expose] public section open Monodromy open Monodromy.IntegerPrimrec
theorem Monodromy.IntegerPrimrec.add : Primrec₂ ((· + ·) : ℤ → ℤ → ℤ) := by sorry
Read-back
What the Lean code literally says, in plain math · OpenAI Codex (independent agent)
The total binary function sending to is primitive recursive in Mathlib's standard encodings of integers and pairs by natural numbers. This is a statement about the entire signed-integer addition function, with no hypotheses restricting either argument, so zero and negative inputs are included; the primitive-recursive claim concerns a total encoded computation and makes no assertion about geometric continuation or a particular compiled program.
Confirmed by the mission captain (proposal self-audit).