← All Papers · Formal Verification

Integer Basics: Foundational Properties of Integer Arithmetic

Tamás Nagy, Ph.D. Updated 2026-04-18 Proof Record Formal Verification Lean-Verified
Mathematics verified. Core theorems are machine-checked in Lean 4. Prose and presentation may not have been human-reviewed.
View in Graph BibTeX

Summary

We present formal proofs of six foundational theorems in integer arithmetic: commutativity of addition and multiplication over ℤ, absorption of zero under multiplication, non-negativity of squared differences, and the dichotomy that every natural number is either zero or positive. All results are machine-verified in the Lean 4 proof assistant.
Length
992 words
Claims
12 theorems
Status
Draft
Target
Archive-only

Browse all Formal Verification papers →