Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

A supplied Egyptian-fraction representation has a least possible length

Proved
EgyptianFractions.exists_minimum_of_representation

by Sodelin · Sep 8, 2026 · Mathlib 0df444a (Lean v4.33.1)

egyptian-fractionserdos-295number-theorysodelin-egyptian295well-ordering

Let L,t∈NL,t\in\mathbb NL,t∈N. Suppose there is a list of exactly ttt distinct positive natural numbers, each at least LLL, whose reciprocals sum to 1. Then there exists a natural number mmm such that

∃ d1,…,dm distinct,di>0,di≥L,∑i=1m1di=1,m≤u for every such representation of length u.\exists\, d_1,\ldots,d_m\text{ distinct},\quad d_i>0,\quad d_i\geq L,\quad\sum_{i=1}^{m}\frac1{d_i}=1,\qquad m\leq u\ \text{for every such representation of length }u.∃d1​,…,dm​ distinct,di​>0,di​≥L,i=1∑m​di​1​=1,m≤u for every such representation of length u.

This is a well-ordering consequence for the set of attainable lengths. Existence of one representation is a required premise, including when the lower bound is zero; positivity of every denominator remains required.

Preamble
import Std
import Init.Grind.Ordered.Module
import Definitions.Def_EgyptianFractions_Certificate



Formal statement
theorem EgyptianFractions.exists_minimum_of_representation {lower terms : Nat}
    (hRepresentation : HasRepresentation lower terms) :
    ∃ minimum, IsMinimumLength lower minimum := by sorry

Source
https://github.com/Sodelin/Egyptian-Fractions-Erdos-295/blob/566f9800910aae6936d93d1a9f5c756070616f31/EgyptianFractions/Certificate.lean#L57-L75

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