A supplied Egyptian-fraction representation has a least possible length
ProvedEgyptianFractions.exists_minimum_of_representationegyptian-fractionserdos-295number-theorysodelin-egyptian295well-ordering
Let . Suppose there is a list of exactly distinct positive natural numbers, each at least , whose reciprocals sum to 1. Then there exists a natural number such that
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