feat(ErdosProblems/90): link formal proof of unit distance disproof#4379
Open
Sanexxxx777 wants to merge 1 commit into
Open
feat(ErdosProblems/90): link formal proof of unit distance disproof#4379Sanexxxx777 wants to merge 1 commit into
Sanexxxx777 wants to merge 1 commit into
Conversation
|
👋 This is an automated welcome message. 🤖 A few friendly reminders while the review gets started:
Thanks again for helping improve Formal Conjectures. |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
erdosproblems.com/90 now marks the problem DISPROVED (LEAN) ("solved in the negative and the proof verified in Lean"). A complete, sorry-free Lean 4 formalisation of OpenAI's 2026 counterexample exists at plby/Erdos90 (Boris Alexeev); its main theorem matches
erdos_90.variants.polynomial_lower_bound, so this adds the correspondingformal_proof using lean4annotation. No statements changed.Closes #4229