Skip to content

Add Erdős Problem 601 (infinite path or large independent set, $500 prize)#3788

Open
henrykmichalewski wants to merge 5 commits into
google-deepmind:mainfrom
henrykmichalewski:add-problem-601
Open

Add Erdős Problem 601 (infinite path or large independent set, $500 prize)#3788
henrykmichalewski wants to merge 5 commits into
google-deepmind:mainfrom
henrykmichalewski:add-problem-601

Conversation

@henrykmichalewski
Copy link
Copy Markdown
Member

Problem

Erdős Problem 601: https://www.erdosproblems.com/601 ($500 prize)

For which limit ordinals α is it true that if G is a graph with vertex set α, then G must have either an infinite path or an independent set on a set of vertices with order type α?

Contents

  • Main open theorem erdos_601 ($500 prize note)
  • New HasPathOrIndepSetOfType α definition
  • Variants covering:
    • Erdős-Hajnal-Milner [EHM70]: TRUE for α < ω₁^(ω+2)
    • The specific $250 sub-case at α = ω₁^(ω+2)
    • Larson [La90] result under Martin's Axiom
    • Base case α = ω

Closes #820

Assisted by Claude (Anthropic).

@github-actions github-actions Bot added the erdos-problems Erdős Problems label Apr 17, 2026
Mirrors the Round C docstring pass from the private repo's
phase1-infrastructure branch. Each Lean file now carries the
canonical source statement and upstream URL inline so reviewers
can verify formalization against the source without navigating
away from the diff.
@@ -0,0 +1,201 @@
/-
Copyright 2025 The Formal Conjectures Authors.
Copy link
Copy Markdown
Collaborator

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

nit: Could you update the copyright year to 2026 for this new file?

**Status**: OPEN.
-/
@[category research open, AMS 5]
theorem erdos_601 :
Copy link
Copy Markdown
Collaborator

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Does the source ask for a characterization of which limit ordinals have the property? This states that every limit ordinal has it, which is a much stronger concrete assertion. Could you put the class or criterion behind answer(sorry), or otherwise phrase erdos_601 as a characterization problem, with the all-ordinals statement as a named conjectural variant only if intended?

@Paul-Lez Paul-Lez added the awaiting-author The author should answer a question or perform changes. Reply when done. label May 7, 2026
…ok] + copyright 2026

Per Paul-Lez review on PR google-deepmind#3788. Mechanical nits applied on top of an
upstream/main merge to pick up the new attribute infrastructure (google-deepmind#3900).
@henrykmichalewski
Copy link
Copy Markdown
Member Author

@Paul-Lez — applied the mechanical nits in 69e9408, on top of an upstream/main merge: @[category undergraduate]@[category textbook] (and copyright 2026 where applicable). The substantive content comments on this PR (open characterization vs. existence/universal phrasing, etc.) are tracked separately and will be addressed in follow-up commits per PR.

…ul-Lez review)

The headline previously asserted the property for every limit ordinal,
which is much stronger than the source's actual question — namely, to
characterize which limit ordinals have it. Per Paul-Lez's review, the
headline now asserts pointwise equivalence between
`HasPathOrIndepSetOfType α` and a conjectural predicate behind
`answer(sorry)`. The universal "for every limit ordinal" form is moved
to a named variant.
@henrykmichalewski
Copy link
Copy Markdown
Member Author

Thanks for the review @PaulLez. Pushed d11479d on add-problem-601: the headline now asserts pointwise equivalence between HasPathOrIndepSetOfType α and a conjectural predicate behind answer(sorry) for every limit ordinal α (capturing the source's characterization question); the previous universal "holds for every limit ordinal" form is moved to a named variant erdos_601.variants.universal.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

awaiting-author The author should answer a question or perform changes. Reply when done. erdos-problems Erdős Problems

Projects

None yet

Development

Successfully merging this pull request may close these issues.

Erdős Problem 601

2 participants