Denominator clearing over the integers
ProvedErdosStraus242.clear_denominatorsegyptian-fractionsnumber-theory
For positive natural numbers , the rational identity holds if and only if the integer identity holds. No order or distinctness assumption is required for this algebraic equivalence.
Preamble
import Definitions.Def_ErdosStraus242 import Mathlib.Data.Nat.Prime.Basic import Mathlib.Data.Finset.Insert
Formal statement
namespace ErdosStraus242
theorem clear_denominators (n x y z : ℕ)
(hn : 0 < n) (hx : 0 < x) (hy : 0 < y) (hz : 0 < z) :
((4 / n : ℚ) = 1 / x + 1 / y + 1 / z) ↔
(4 * (x : ℤ) * y * z = (n : ℤ) * (y * z + x * z + x * y)) := by sorry
end ErdosStraus242
Source
Independent denominator-clearing derivation from the equation in Erdős Problem 242, https://www.erdosproblems.com/242; locally proved over the exact target environment.
Read-back
What the Lean code literally says, in plain math · Codex GPT-6 (independent fresh-context sub-agent)
For every four natural numbers satisfying , , , and , the equality , with all divisions and arithmetic interpreted in the rational numbers, holds if and only if , with the natural numbers embedded in the integers and all arithmetic in this second equality interpreted in the integers. The hypotheses exclude zero for each of .
Human review
Confirmed by the mission captain (proposal self-audit).