Erdős problem 1119
Let be an infinite cardinal with . Let be a family of entire functions such that, for every , there are at most distinct values of . Must have cardinality at most ?
Sources
FormalConjectures/ErdosProblems/
1119.lean
Retained formal statement
The 'easy' case of Erdős Problem 1119: if moreover , then any family of entire functions taking at most distinct values at each point has cardinality at most . In [Ha74] it is written that this is 'easy to see'.
∀ (m : Cardinal.{0}), Cardinal.aleph0 < m → Order.succ m < Cardinal.continuum → ∀ (F : Set (ℂ → ℂ)), (∀ f ∈ F, Differentiable ℂ f) → (∀ (z₀ : ℂ), Cardinal.mk ↑{y | ∃ f ∈ F, f z₀ = y} ≤ m) → Cardinal.mk ↑F ≤ mSolvedStatement only, no proof