Erdős·erdos:173
Erdős Problem 173
Machine-checked by Palomar.
Fidelity F2: The correspondence is declared through a Comparator challenge, an alignment table and written divergences.
geometry, ramsey theory·Source
AI activity
How grades workNo AI contribution recorded against this statement.
Fidelity
How fidelity is gradedF2 declared. The correspondence is declared through a Comparator challenge, an alignment table and written divergences.
Checks
1-
verified·Palomar
Registered by Palomar at 4a368a65: Comparator confirmed 5 theorems prove the recorded statement within Palomar's axiom policy, replayed through Lean's kernel and the independent nanoda kernel
Declared by the projects
1As each project's formalization.yaml states it.
Erdős Problem 173: monochromatic triangles in two-colorings of the plane
- authors
- Jacob Parish
- method
- agent — claude-opus-5-5, gpt-6-astra
- review
- self-assessed
- axioms
- Classical.choice, Quot.sound, propext
- sorry
- 0 unproved goals declared
- sources
- Every two-coloring of the plane misses at most one triangle, which is equilateral — other; Erdős Problem #173 — background; Old and new problems and results in combinatorial number theory: van der Waerden's theorem and related topics — background; Euclidean Ramsey theorems. I — other
- related
- google-deepmind/formal-conjectures/blob/7db2ea3b91bfbd0ab620215163e6c488bbb916d5/FormalConjectures/ErdosProblems/173.lean — builds-on; openai/math/tree/adc7f1241b42e322a6451854ab7e4b4c146bf78a/lean — adapts
- divergences
- The compared statements are formal-conjectures' Erdős Problem 173, copied verbatim apart from the category attributes, together with non_equilateral and three_distinct_points, which state Conjecture 3 of Euclidean Ramsey theorems, III. The formal-conjectures statements and non_equilateral use Mathlib's Affine.Triangle, whose vertices are affinely independent; three_distinct_points is stated for any three distinct points, so the collinear triples that the conjecture of Erdős, Graham, Montgomery, Rothschild, Spencer and Straus counts as triangles are compared too. Copies may be reflected and relabelled, as in that conjecture. The single-class form of Erdős and Graham (1979) is not addressed. The Lean proof follows the route of the blueprint, which records where it departs from the original argument.
- checked by
- Palomar
Follow and discuss
All discussionFollow this problem
An email when it has a new claim, check, bounty or discussion. You confirm once and can stop with one click.
Discussion and bounties for this problem load here.
Seen recently
What the monitors picked up in the last thirty days, not yet graded.
Something wrong or missing here? Request a correction or add a claim, with its sources.
Claims and corrections from readers
All of themFormal material
Formal statements · 1
Cited proofs · 0
No proof artifact cited by the formal record.
Also known as · 3
- https://www.erdosproblems.com/173
- https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/ErdosProblems/173.lean
- FormalConjectures/ErdosProblems/173.lean
Cite this record
qed.bot, “Erdős Problem 173”, https://qed.bot/s/erdos-173, as of 20 Nov 2026.