van der Waerden 数 W(2;3,21)=416 获 Lean 4 内核验证证明
W(2;3,21) = 416 - a van der Waerden number conjectured by Kullmann in 2010, now proved with a Lean 4 kernel-checked proof [R]
Kullmann 于 2010 年猜想的 van der Waerden 数 W(2;3,21)=416 现已用 Lean 4 内核验证证明，即 {1,...,416} 的任意红蓝着色都含红色 3 项或蓝色 21 项等差数列，而 {1,...,415} 存在两者皆无的着色。
w(2;3,21) = 416 - today proved with a Lean 4 kernel-
checked proof (preprint + 13.6 GB evidence package).
Every red-blue colouring of {1, ..., 416} contains a red 3-term or a blue 21-term arithmetic progression, and some colouring of {1, ..., 415} contains neither.
Kullmann conjectured the value in 2010; DeepMind's Formal Conjectures list still carried it as open this year.
The proof is a Lean 4 theorem over 209 cases and 38,661,140 leaf formulas, each refutation checked by cake_pr (the LRAT checker verified in CakeML) and bound by digest to its Lean term.
It was produced with LPM (Large Proof Model), a neuro-symbolic system from Hupyy; nothing counted unless the Lean kernel or cake_pr accepted it.
Paper: https://doi.org/10.5281/zenodo.23776306
Evidence package (Lean sources, checker records, replay kit): https://doi.org/10.5281/zenodo.23749222
To check: download it and run 'shasum -a 256 -c
SHA256SUMS'
submitted by /u/Rodriguez909
[link] [留言]
来源：r/MachineLearning · reddit.com