Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passaudited 2026-08-11
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 m,cm,c there is a natural NN such that every cc-colouring of {1,,N}\{1,\ldots,N\} contains positive integers a,da,d for which

a,a+d,,a+(m1)d,da,a+d,\ldots,a+(m-1)d,d

all have one colour. In particular, the first mm 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 m,cm,c and a cc-colouring of a sufficiently long positive initial interval.

[L1]

Under the length-(m1)(m-1) induction hypothesis, finite colour focussing produces either a monochromatic mm-term progression or focused (m1)(m-1)-term progressions of all available colours (Finite colour focussing extends equally coloured progressions to a longer monochromatic arithmetic progression).

Proof

technique · induction
1.1

Ordinary van der Waerden existence follows by induction on mm. Length 11 is immediate. Assuming finite witnesses for length m1m-1 for every number of colours, apply [L1] with r=cr=c; if its first alternative occurs, it gives length mm, while in the second alternative the focus has one of the cc colours and extends the focused progression of that colour to length mm.

baseL1
2.1

We now prove the strengthened statement. If m=1m=1, take a=d=1a=d=1, so assume m2m\ge2. Induct on cc. The assertion is immediate for c=1c=1. Assume it for c1c-1 colours and let nn be a finite witness for the same target length mm with c1c-1 colours. By step 1.1, choose an ordinary monochromatic progression a,a+d,,a+n(m1)da,a+d,\ldots,a+n(m-1)d in a sufficiently long cc-coloured interval.

ihstep 1.1
3.1

If one of d,2d,,ndd,2d,\ldots,nd has the progression's colour, say tdtd does, then a,a+td,,a+(m1)tda,a+td,\ldots,a+(m-1)td together with its difference tdtd has one colour. Otherwise the colouring tcolour(td)t\mapsto\operatorname{colour}(td) on {1,,n}\{1,\ldots,n\} uses at most c1c-1 colours. The induction hypothesis gives u,u+q,,u+(m1)q,qu,u+q,\ldots,u+(m-1)q,q of one colour there, and multiplication by dd gives the required progression and difference in the original colouring.

step 2.1ih
4.1

The colour induction proves the strengthened theorem for every finite cc, while step 1.1 supplies the ordinary finite witnesses used in its construction.

step 3.1discharge-induction

Depends on

Used by

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