erdős #598
Let be an infinite cardinal and be the successor cardinal of . Can one colour the countable subsets of using many colours so that every with contains subsets of all possible colours?
Worked, still open.
set theory · open · formalized (Lean) · 0 attempts
use this record
vela registry pull vfr_37aec80d874a0239vela reproduce examples/erdos-problemsevidence
unverified AI candidates (2)
gpt-erdos · GPT-5.2 Pro + Deep Research · unverified
Let (\mu:=2^{\aleph_0}) and (\kappa:=\mu^+). The question is asking for a coloring [ c:[m]^{\aleph_0}\to \kappa ] such that for every (X\subseteq m) with (|X|=\kappa), [ c\bigl[[X]^{\aleph_0}\bigr]=\kappa, ] i.e. every (\kappa)-sized $X$ is “fully polychromatic” on its countable subsets [[nomath]](in partition notation…
candidate solution ↗llm-hunter · gpt pro 5.2 · unverified
1 LLM attack(s) recorded (gpt pro 5.2); unverified.
candidate solution ↗formal
AMS 3 5 · open (literature)
theorem erdos_598 : answer(sorry) ↔
∃ c : { s : Set m // s.Countable } → κ.out,
∀ X : Set m, #X = κ →
c '' { s : { sub : Set m // sub.Countable } | s.1 ⊆ X } = Set.univformal-conjectures/598.lean ↗status
open