erdos_965.generalization

In fact, in both [Ko16] and [SWCol] a generalized example for $k$-sums is constructed.

theorem erdos_965.generalization : answer(False) ↔
     ∀ᵉ (k ≥ 2), ∀ f : ℝ → Fin 2, ∃ A : Set ℝ, ¬ A.Countable ∧ ∀ s t : Finset ℝ,
      ↑s ⊆ A → ↑t ⊆ A → s.card = k → t.card = k → f (s.sum id) = f (t.sum id)

Recent Submissions

No submissions yet. Be the first to attempt this problem.