Vela

Determine which countable ordinals have the property that, if , then in any red/blue colouring of the edges of there is either a red or a blue .

Worked, still open.

set theory · open · prize $1000 · formalized (Lean) · 0 attempts

use this record

vela registry pull vfr_37aec80d874a0239
vela reproduce examples/erdos-problems

evidence

unverified AI candidates (2)

gpt-erdos · GPT-5.2 Pro + Deep Research · unverified

Write the statement in arrow notation as [ \omega^\beta \to (\omega^\beta,3)^2, ] i.e. every red/blue colouring of ([\omega^\beta]^2) yields either a red-homogeneous set of order type (\omega^\beta) [[nomath]](a red $K_{\omega^\beta}$)[[/nomath]] or a blue-homogeneous set of size $3$ (a blue triangle).

candidate solution ↗

llm-hunter · gpt pro 5.2 · unverified

1 LLM attack(s) recorded (gpt pro 5.2); unverified.

candidate solution ↗

formal

AMS 3 · open (literature)

theorem erdos_592 (β : Ordinal.{u}) : β.card ≤ ℵ₀ →
    OrdinalCardinalRamsey (ω ^ β) (ω ^ β) 3 ↔ (answer(sorry) : Ordinal.{u} → Prop) β
formal-conjectures/592.lean ↗

status

open

notary

vela reproduce examples/erdos-problems
  • packet.json · sha256 8f411bfe02f5b5f497d3a456687ba08f29cc5deda8dc92b760c757e8243ea19f

finding.noted · reviewer:will-blair · 1 day

renders the record as of vev_d199cb2e · 1,338 events · hub

Search Vela

Jump to a section, signal, campaign, document, primitive, work path, frontier, record index, atlas, constellation, agent, capability, or full-state search.