How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Van der Waerden's theorem, strengthened so the progression and its common difference have one colour
Statement
For all positive there is a natural such that every -colouring of contains positive integers for which
all have one colour. In particular, the first displayed terms form a monochromatic arithmetic progression with positive common difference. The proof uses the focusing lemma Finite colour focussing extends equally coloured progressions to a longer monochromatic arithmetic progression and natural induction The principle of mathematical induction.
Facts & Assumptions
Given: Positive natural numbers and a -colouring of a sufficiently long positive initial interval.
Under the length- induction hypothesis, finite colour focussing produces either a monochromatic -term progression or focused -term progressions of all available colours (Finite colour focussing extends equally coloured progressions to a longer monochromatic arithmetic progression).
Proof
Ordinary van der Waerden existence follows by induction on . Length is immediate. Assuming finite witnesses for length for every number of colours, apply [L1] with ; if its first alternative occurs, it gives length , while in the second alternative the focus has one of the colours and extends the focused progression of that colour to length .
We now prove the strengthened statement. If , take , so assume . Induct on . The assertion is immediate for . Assume it for colours and let be a finite witness for the same target length with colours. By step 1.1, choose an ordinary monochromatic progression in a sufficiently long -coloured interval.
If one of has the progression's colour, say does, then together with its difference has one colour. Otherwise the colouring on uses at most colours. The induction hypothesis gives of one colour there, and multiplication by gives the required progression and difference in the original colouring.
The colour induction proves the strengthened theorem for every finite , while step 1.1 supplies the ordinary finite witnesses used in its construction.
Depends on
Used by
- The van der Waerden number W(k,c) as the least interval length forcing a monochromatic k-term arithmetic progression Definition
- W(3,2)=9 by an explicit colouring of {0,…,7} and an exhaustive symmetry-reduced proof for {0,…,8} Example
- FALSE: every two-colouring of ℕ contains an infinite monochromatic arithmetic progression False statement
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 30 results over 16 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.
Sources
- I. B. Leader, Ramsey Theory, Theorems 6 and 8 (standard reference, not scraped)