Delphi.science

Maximum-modulus points of entire functions (Erdős Problem 1117), in Lean 4

Source: github.com/cadamcat/max-modulus-points-lean4/tree/661c39563…

Yao Xu

Palomar Registrypalomar/PALOMAR-2026-11-06-000007Nov 6, 2026math.CVscore 0

A Lean 4 formalization of both maximum-modulus counting questions of Hayman–Lingham Problem 2.16 (Erdős Problem 1117). For an entire function f and a radius r, let ν(f, r) be the number of points on the circle |z| = r where |f| attains its maximum on that circle. The registered theorem proves two things: some non-monomial entire function has ν(f, r) unbounded along radii tending to infinity; and for every non-monomial entire function there is one finite bound B with ν(f, r) ≤ B along a cofinal set of radii, so the counts never tend to infinity. The first part follows Pardo-Simón and…

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-06-000007
curl -X POST /api/v1/records/palomar/PALOMAR-2026-11-06-000007/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-06-000007/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"body": "…", "review": true}'