For over 250 years, the irrationality of the Euler-Mascheroni constant (
This repository contains a constructive proof of the irrationality of
"The key lies in finding a representation where the remainder of the series can be shown to be 'too small' to allow for a rational denominator." — Jonathan Sondow
The proof proceeds by contradiction. We assume
The Lean 4 implementation verifies:
-
$Z > 0$ : Proved by showing the constant is strictly greater than the partial sum via the lower trap. -
$Z < 1$ : Proved by showing the gap is smaller than the smallest possible non-zero rational increment$1/q$ . - 🏁 The Checkmate: Lean’s library confirms no integer
$Z$ exists such that$0 < Z < 1$ , falsifying the rational assumption.
Figure 1: Geometric Realization of Sondow’s Identity and the Tail Trap Mechanism.
The left panel illustrates
Traditional paper proofs can struggle with analytic tail estimates and the risk of errors in remainder bounds. By encoding the proof in Lean 4, we have:
- Eliminated the risk of analytic error by using a dependently typed theorem prover.
- Replaced heuristic bounds with machine-checked integer arithmetic verified by the Lean kernel.
- Achieved computational certainty by bypassing floating-point types in favor of exact cross-multiplication.
To maintain the integrity of the verification, the following files are included:
- 📄 A Formal Proof of the Irrationality of the Euler-Mascheroni Constant.pdf The academic manuscript detailing the mathematical framework, Sondow’s Identity, and the Tail Trap mechanism.
- 💻
Proof_Of_Euler-Mascheroni_Constant_Irrationality.leanThe complete Lean 4 source code, including data structures, series summation, and the final contradiction theorem. - 🖼️ Geometric Visualization of Sondow’s Identity and the Tail Trap Mechanism.jpg The high-resolution academic figure (Figure 1) illustrating the geometric logic of the proof and the formal verification flow.
- Copy the contents of
Proof_Of_Euler-Mascheroni_Constant_Irrationality.lean. - Visit the Lean 4 Web Editor.
- Paste the code into the editor.
This work is licensed under a Creative Commons Attribution 4.0 International License (CC-BY-4.0).
The author acknowledges the assistance of a large language model, Gemini, for its role as a formalization assistant in preparing these materials.