Certificates, programs and Lean formalization for "A lower bound for the Bohr radius of the bidisc"
Authors/Creators
Description
Certificates, checking programs, logs, search programs and Lean proofs for the paper A lower bound for the Bohr radius of the bidisc (doi:10.5281/zenodo.23716439). It proves the lower bound K2 > 0.301665 for the Bohr radius of the bidisc. It builds on an unrefereed argument of S. Patel for K2 > 0.30158758 and improves it with the certified bounds S({0, 1, …, 5}) ≤ 2.187, S({0, 1, …, 6}) ≤ 2.363 and S({0, 1, …, 7}) ≤ 2.552 for Sidon constants. Below, the certificates for these bounds are called the S5, S6 and S7 certificates. From version 5 only the paper, the README, the citation file and this description changed; the certificates, programs and Lean files are the same.
Files.
bidisc-bohr-radius-91adab7b12af.zip: the S5 certificate (certificate/s5_certificate.json, 78,991,460 bytes, SHA-256ce3e9dd41a0dbd9c3a8ea49b04aa7aaf21f0fe557291a2084c7739461a460a14) with a description of the formats, the checksums of the 48 shards of the S6 certificate and of the 576 shards of the S7 certificate, the five checking programs with their logs, the search programs, the Lean proofs (lean/,lean_kernel/andlean_kernel_s7/), and the paper with its LaTeX source. It is identical to the GitHub repository github.com/tejasvi/bidisc-bohr-radius/tree/v6 at commit91adab7b12af09f7f301f768482e7c52a7663247.s6_certificate.tar.gz(1,192,583,616 bytes, SHA-25658291bf4f7ad03c83c8e2cc333bb8d2c615979ab803c9643eaa6d8f2aac5003c): the S6 certificate, as 48 JSON files (shards) of 3.4 GB in total.s7_certificate.tar.gz(9,086,302,570 bytes, SHA-256f4a288644a86bd33544062d77a37c80c1879376cbd6a487d4d95d7d3d7ff44df): the S7 certificate, as 576 JSON files (shards) of 26.8 GB in total.generated_k7_nonvertex.tar.zst(612,416,942 bytes, SHA-256721fff8747f7e09b98d02777f988bf71e7c3344295e7b9968808b06a65ada272): the generated Lean modules of the kernel-only proof of S({0, 1, …, 7}) ≤ 2.552 other than its 46,634 vertex modules, which are generated from the S7 certificate (seelean_kernel_s7/README.md). It also containsBohr59aK7G/Headline.lean, which was never built or checked; its theoremK2_ge_K7is not a claim of this release.SHA256SUMS: checksums of the files of this record.
Checking and Lean. The README in the zip gives the commands and the expected output. The certificate checkers use ball arithmetic with 128-bit precision through python-flint; check/check_majorant.py evaluates the final inequality in exact rational arithmetic, and check/check_patel_values.py checks the numbers displayed in Patel's computation. The directory lean/ proves K2 ≥ 0.301665 in Lean 4 with Mathlib (theorem Bohr59aN7.K2_ge_N7), assuming the inequality A3 + B22/2 ≤ 2 of Lemma 3.4 of the paper, which comes from the unitary realization of Schur functions on the bidisc; its certificate checks run as compiled code through native_decide. The directories lean_kernel/ and lean_kernel_s7/ prove the three Sidon bounds with every check run by Lean's kernel, and lean_kernel/ also proves K2 ≥ 0.301657 under the same hypothesis. The theorem Bohr59a.K2_ge_of_sidon7 of lean/, which uses only the standard axioms, derives K2 ≥ 0.301665 from the hypothesis and the three Sidon bounds, so under the hypothesis this bound also follows from four theorems in which every check is run by the kernel; they are not combined into a single Lean theorem. The Lean files generated from the certificates are not in the zip; the README files of the three directories explain how to generate and build them.
Files
bidisc-bohr-radius-91adab7b12af.zip
Files
(10.9 GB)
Additional details
Related works
- Is supplement to
- Preprint: 10.5281/zenodo.23716439 (DOI)