Erdős 243: add Koizumi's Sylvester and Millin rigidity corollaries - #5059
Open
wcook04 wants to merge 1 commit into
Open
Erdős 243: add Koizumi's Sylvester and Millin rigidity corollaries#5059wcook04 wants to merge 1 commit into
wcook04 wants to merge 1 commit into
Conversation
Koizumi, arXiv:2504.05933, studies exactly this problem: his Question 5 is
Erdos 243 verbatim. Two of his corollaries are clean statements the file does
not have.
Corollary 2: the two-sided bound 2/3 <= a_n^2/a_{n+1} <= 4/3 together with
sum 1/a_n = 1 forces a_n to be Sylvester's sequence exactly. Erdos 243 asks
whether the Sylvester recurrence must hold eventually; this says a bound plus
an exact sum pins the sequence down from the start.
Corollary 3: the one-sided bound a_n^2/a_{n+1} <= 2/3 together with
sum 1/a_n = (5 - sqrt 5)/2 forces a_n = F_{2^n}.
Sylvester's sequence is not in Mathlib, so it goes to FormalConjecturesForMathlib
with its basic API, fully proved.
Author
|
Note for whoever merges this: #5038, #5041 and #5059 each add one |
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.
Closes #5058.
243.leancurrently holds only the open statement. Koizumi,arXiv:2504.05933 (2025), studies exactly
this problem — his Question 5 (p. 3) is Erdős 243 verbatim — and proves two
rigidity corollaries this adds.
erdos_243.variants.sylvester_of_tsum_eq_one(his Corollary 2, p. 2): ifsequence
erdos_243is the point:there the ratio tends to
conclusion is an eventual recurrence; here a two-sided bound plus an exact sum
pins the sequence down at every index.
erdos_243.variants.fib_of_tsum_eq_millin(his Corollary 3): iferdos_243.sylvester_satisfies_recurrence— a one-linetestrecordingthat Sylvester's sequence satisfies the recurrence in the conclusion of
erdos_243, so the two statements are visibly about the same recurrence.Sylvester's sequence is not in Mathlib, so
FormalConjecturesForMathlib/NumberTheory/Sylvester.leandefines it with basicAPI (
two_le_sylvester,strictMono_sylvester, and the first values). Thatfile is fully proved — no
sorry, and every declaration audits to[propext, Classical.choice, Quot.sound]or less.Checks:
main(33c6a2d): 0 errors, 0 warnings.before formalising. Sylvester gives ratios
meeting the bound exactly — and
ratios converging to
263.lean; these corollariesare not used there.
No originality is claimed — the theorems are Koizumi's. The contribution is
their formal statement plus the Sylvester definition needed to express them.
AI Usage Disclosure: this contribution was produced with AI assistance. I have$n \ge 1$ numbering, verified the witnesses numerically, and reviewed this
read the corollaries in the source paper, checked the index conventions against
his
diff, and I take responsibility for the submission.
Note
These are adjacent solved results, not special cases of
erdos_243, whichremains open and is untouched.