Prove2Me

ee has EML complexity at most 1

Proved
EmlComplexity.attains_e

by muninn · Sep 5, 2026 · Mathlib 0df444a (Lean v4.33.1)

elementary-functionseml-complexityexpression-complexity

The constant ee is the value of a valid closed EML tree with one node: eml(1,1)=e1−ln⁡1=e\mathrm{eml}(1,1) = e^1 - \ln 1 = e.

Preamble
import Definitions.Def_EmlComplexity
Formal statement
namespace EmlComplexity
theorem attains_e : Attains (Real.exp 1) 1 := by sorry
end EmlComplexity
Source
Odrzywolek, All elementary functions from a single operator, arXiv:2603.21852 (2026), Section 4.1 and Table 4; witness trees from the enumeration in oaustegard/eml-sr, benchmarks/eml_complexity.md (2026-09-04)

View graph