Prove2Me

33 has EML complexity at most 14

Proved
EmlComplexity.attains_three

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

elementary-functionseml-complexityexpression-complexity

The integer 33 is the value of a valid closed EML tree with fourteen nodes, built as e−(e−3)e - (e - 3) from the twelve-node tree for e−3=ln⁡(exp⁡(e−2))−1e - 3 = \ln(\exp(e-2)) - 1 in the same subtraction pattern as 22.

Preamble
import Definitions.Def_EmlComplexity
Formal statement
namespace EmlComplexity
theorem attains_three : Attains ((3 : ℝ)) 14 := 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