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.
Finite colourings of -element subsets, monochromatic sets, and the arrow notations and
Definition
For a set and a positive natural number , write for the set of all -element subsets of , where finite cardinality is understood as in The cardinality of a finite set. A -colouring of is a function into a set with elements. A set is monochromatic when is constant on . These notions are unchanged when is replaced by an equinumerous set (Equinumerous sets, and ).
For positive naturals , the asymmetric arrow
means that every red-blue colouring of the pairs from any -element set has either a red -element set or a blue -element set. Equivalently, the red pairs form a complete graph on some vertices or the blue pairs form a complete graph on some vertices. Thus a red-blue colouring witnesses when it contains a red -set or a blue -set.
For positive naturals , the uniform arrow
means that every -colouring of the -element subsets of an -element set has a monochromatic -element set. Natural-number parameters use The natural numbers (von Neumann); in particular, all four parameters in this notation are explicitly positive.
Depends on
Used by
- Infinite Ramsey holds for every set equipped with an injection from ℕ Corollary
- The finite uniform Ramsey theorem follows a second time from the infinite theorem by a finitely branching tree of bad finite colourings Corollary
- The off-diagonal Ramsey number R(s,t) as the least N with N→(s,t)², for positive s,t Definition
- The uniform Ramsey number Rₖ(r;c) as the least finite witness for c colours on k-element subsets Definition
- If m→(s-1,t)² and n→(s,t-1)², then m+n→(s,t)² for s,t≥2 Lemma
- Canonical Ramsey theorem for pairs: on an infinite subset a colouring is constant, injective, left-dependent, or right-dependent Theorem
- Finite graph Ramsey theorem: binoms+t-2s-1→(s,t)² for all positive s,t Theorem
- For positive k,c,r there is an N such that every c-colouring of [N]ᵏ has a monochromatic r-element set Theorem
- Infinite Ramsey theorem on ℕ: every finite colouring of [ℕ]ᵏ has an infinite monochromatic set, in ZF Theorem
- Schur's theorem: every finite colouring of a sufficiently long positive initial interval {1,…,N} has positive monochromatic x,y,z with x+y=z Theorem
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 30 results over 14 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
- R. Diestel, Graph Theory, 6th ed., Chapter 9, Section 9.1 (standard reference, not scraped)
- I. B. Leader, Ramsey Theory, Sections 1.1-1.2 (standard reference, not scraped)