Formal Verification of Sidon Set Upper Bounds in Lean 4 with Mathlib: Erdos Problem 30

20260 citationsPreprintgreen Open Access

Authors

Kenneth A. Mendoza · University of Mendoza

Abstract

A Lean 4 formalization of the two principal upper bounds for Sidon sets (B2 sets), addressing Erdos Problem 30. 1131 lines of verified Lean 4 code, zero sorry stubs. Proves the Lindstrom bound (1969) and Balogh-Furedi-Roy bound (2023) — current best published upper bound. First formal verification of any Sidon set upper bound beyond the elementary k(k-1) le 2N.

Topics & Keywords

graph theory and CDMA systems Coding theory and cryptography Advanced Graph Theory Research

Publication Details

Published in: Zenodo (CERN European Organization for Nuclear Research)

DOI: 10.5281/zenodo.19324239

Command Palette

Formal Verification of Sidon Set Upper Bounds in Lean 4 with Mathlib: Erdos Problem 30

Authors

Abstract

Topics & Keywords

Publication Details