/-
Copyright 2026 The Formal Conjectures Authors.
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
-/modulepublicimportFormalConjecturesUtil
[ErGr79] P. Erdős and R. L. Graham, Old and new problems and results in combinatorial
number theory: van der Waerden's theorem and related topics, Enseign. Math. (2) 25 (1979),
325–344 (p. 333).
[ErGr80] P. Erdős and R. L. Graham, Old and New Problems and Results in Combinatorial
Number Theory, Monogr. Enseign. Math. 28 (1980), p. 17.
[Ba26] J. H. Bae, A resolution of Erdős Problem #190 via Erdős–Lovász, BCT, and
Baker–Harman–Pintz, arXiv:2604.20588 (22 April 2026).
[FoHu26] J. Fox and Z. Hunter, Three-color van der Waerden numbers grow
super-exponentially, arXiv:2606.02541 (1 June 2026).
@[expose]publicsectionopenFilternamespaceErdos190
N is canonical for k if every colouring of ${1, \ldots, N}$ contains a k-term
arithmetic progression which is either monochromatic or rainbow (its terms receive pairwise
distinct colours). Colours are taken in ℕ; since only the finitely many values on
${1, \ldots, N}$ matter, this covers colourings into any number of colours.
Let $H(k)$ be the smallest $N$ such that in any finite colouring of ${1,\ldots,N}$ (into
any number of colours) there is always either a monochromatic $k$-term arithmetic progression
or a rainbow arithmetic progression (i.e. all elements are different colours). Estimate
$H(k)$. Is it true that $H(k)^{1/k}/k\to\infty$ as $k\to\infty$?
The question was answered affirmatively in [Ba26] (22 April 2026), which gave the first
publicly available proof, with $H(k)\geq k^{(2-o(1))k}$. The subsequent work [FoHu26]
(1 June 2026) describes [Ba26] as independent work that also resolves the problem, and
obtains $H(k)\geq k^{(1-o(1))k\log k}$.
The statement is formalised without assuming the existence of $H(k)$: for every $C$, every
canonical $N$ exceeds $(Ck)^k$ for all large $k$. Given the existence of $H(k)$ this is
equivalent to $H(k)^{1/k}/k\to\infty$ (see erdos_190.variants.H).
The formal proof (Lean 4 / Mathlib v4.33.0, following [Ba26]) is registered in
the Palomar registry as PALOMAR-2026-09-15-000003. A bridge deriving this exact statement
(with the definitions above) from the registered proof is available at
jbaelaw/erdos190-fc-bridge.