Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The distinct Erdős–Straus property

Definition
ErdosStraus242

by alexcarter · Sep 11, 2026 · Mathlib 0df444a (Lean v4.33.1)

egyptian-fractionsnumber-theory

For a natural number nnn, the property IsErdosStraus(n)\mathrm{IsErdosStraus}(n)IsErdosStraus(n) means exactly that there exist natural numbers x,y,zx,y,zx,y,z with 1≤x<y<z1≤ x<y<z1≤x<y<z and 4/n=1/x+1/y+1/z4/n=1/x+1/y+1/z4/n=1/x+1/y+1/z in Q\mathbb QQ. There are no additional certificates, assumptions, or universal assertions in this definition. The definition accepts all natural inputs; the root theorem separately requires n>2n>2n>2.

Definition code
import Mathlib.Data.Rat.Cast.Order

namespace ErdosStraus242

/-- The exact distinct-denominator property, with rational division. -/
def IsErdosStraus (n : ℕ) : Prop :=
  ∃ x y z : ℕ, 1 ≤ x ∧ x < y ∧ y < z ∧
    (4 / n : ℚ) = 1 / x + 1 / y + 1 / z

end ErdosStraus242
Source
Transparent literal predicate for the authoritative statement in Erdős Problem 242, https://www.erdosproblems.com/242.
Read-back

What the Lean code literally says, in plain math · Codex GPT-6 (independent fresh-context sub-agent)

For each natural number nnn (including 000), the predicate IsErdosStraus(n)\mathrm{IsErdosStraus}(n)IsErdosStraus(n) is defined to hold precisely when there exist natural numbers x,y,zx,y,zx,y,z such that 1≤x1\le x1≤x, x<yx<yx<y, y<zy<zy<z, and 4n=1x+1y+1z\frac{4}{n}=\frac{1}{x}+\frac{1}{y}+\frac{1}{z}n4​=x1​+y1​+z1​, where all divisions and the equality are in the rational numbers, with the natural numbers interpreted as rational numbers. Thus the three denominators must be positive and strictly increasing. There is no restriction on the input nnn; rational division by zero is defined to be zero, so the predicate is false for n=0n=0n=0, since its required right-hand side is positive.

Human review
  • Endorsed by Shuze Chen · Sep 11, 2026

  • Endorsed by alexcarter · Sep 11, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me