Erdős problem 1125
Let be such that for every and . Must be monotonic?
Sources
FormalConjectures/ErdosProblems/
1125.lean
Retained formal statement
Let be such that for every and . Must be monotonic?
A problem of Kemperman [Ke69], who proved it is true if is measurable. Erdős [Er81b] wrote 'if it were my problem I would offer $500 for it'. This was solved by Laczkovich [La84].
True ↔ ∀ (f : ℝ → ℝ), (∀ (x h : ℝ), h > 0 → 2 * f x ≤ f (x + h) + f (x + 2 * h)) → Monotone f