Record K₂ < 0.302825279492 with an external proof archive (Markdown only) - #169
Open
Shivamshaiv wants to merge 2 commits into
Open
Record K₂ < 0.302825279492 with an external proof archive (Markdown only)#169Shivamshaiv wants to merge 2 commits into
Shivamshaiv wants to merge 2 commits into
Conversation
Author
|
The proof package is now also publicly archived on Zenodo: The archive includes the exact release ZIP, SHA-256 checksum, validation report, |
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.
Bound update
This PR updates the recorded upper bound for the bidisc Bohr radius from
$K_2<0.3174541$ to
It changes only$0.3006$ are retained; the README table and Recent$K_2$ remains open.
README.mdandconstants/59a.md. The earlier upper-boundrows and lower bound
progress entry are updated. The exact value of
External proof package
This replaces #154 and addresses the maintainer's packaging request.
All supporting code and formalization are hosted in
Shivamshaiv/bidisc-bohr-certificate,
with a versioned source release
and pinned source commit.
The Comments column records the SHA-256 of the explicitly attached
bidisc-bohr-certificate-v1.0.0.zip:The
[P2026]reference now resolves to the external package and names thefinal Lean theorem. The proof and algorithms are unchanged; LF line endings
restore the original frozen file hashes. This branch starts from current
mainat9d57db86c8564cb623ec9f9e41429a34efd819fb, including the correctedCrouzeix entry and subsequent upstream changes.
The verified v1.0.0 package, checksum, validation report, and three run logs
are now publicly archived on Zenodo under version-specific DOI
10.5281/zenodo.22341928.
The Comments column and
[P2026]citation include this permanent reference.The archived ZIP is byte-for-byte identical to the attached GitHub release
asset, so the recorded SHA-256 is unchanged.
Mathematical certificate
Set$L=2500000000$ , $T=3067398171$ , $S=10^{15}$ , and
The exact identity
has a strictly positive right-hand side on the open bidisc. It proves$\lvert f\rvert<1$ there.
denominator nonvanishing and
For the Taylor coefficients$c_{jk}$ of this explicit Schur function, two$29\times29$ rectangle establish
independent exact computations of the
Continuity makes this finite sum exceed one at a strictly smaller positive
radius. Monotonicity then gives the strict supremal bound above. No estimate
of an uncomputed Taylor tail is needed.
Verification
The externally hosted package was checked again on 5 September 2026:
certificate digests, including the 841 coefficients and integer norm floors.
lake buildpasses for both Lean files with Lean 4.19.0 and Mathlibc44e0c8ee63ca166450922a373c7409c5d26b00b.The end-to-end theorem is
Its printed axioms are
[propext, Classical.choice, Lean.ofReduceBool, Quot.sound].The finite
native_decidecomputations introduce the explicitLean.ofReduceBooltrust boundary. There are nosorry,admit, or customaxiom declarations. This formalization covers the stated bound, not an
exact value or a separate structural-dominance theorem.
Submitted by Shivam Patel. The mathematical construction, proof
presentation, verification programs, Lean formalization, and this submission
were prepared with AI assistance. The original contribution's attribution and
disclosure are retained.