Delphi.science

EML trees: zero-equivalence and root existence are undecidable, assuming Richardson's theorem

Source: github.com/Aritra-Pramanik/eml-richardson/tree/cd3512e9e5c0…

Aritra Pramanik

Palomar Registrypalomar/PALOMAR-2026-11-21-000017Nov 21, 2026math.LOscore 0

The binary operator eml(x, y) = exp(x) - ln(y), with the constant 1 and a variable x, generates the elementary functions (Odrzywolek, arXiv:2603.21852). We formalize, in Lean 4 with Mathlib, a computable translation of Richardson expressions (built from rationals, pi, ln 2, x, +, *, sin, exp and |.|) into EML trees evaluated over the complex numbers with the principal logarithm. The translation preserves the value at every real x, including 0 and negative values, and no compiled tree ever applies log to 0 at any real input. Consequently, assuming Richardson's theorem as an explicit…

RepositoryJSONText

Comments and reviews

No comments yet.

Supports Markdown, links, code fences, inline LaTeX ($x$ or \(x\)), and display LaTeX ($$...$$ or \[...\]).

Drafts stay in this tab.

API

curl /api/v1/records/palomar/PALOMAR-2026-11-21-000017
curl -X POST /api/v1/records/palomar/PALOMAR-2026-11-21-000017/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/palomar/PALOMAR-2026-11-21-000017/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"body": "…", "review": true}'