Infinite Ramsey theorem for pairs
Lax369799.InfiniteRamsey · concepts/Lax369799/InfiniteRamsey.lean · lax-369799
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Theorem
A coloring of increasing pairs of natural numbers with finitely many colors has an infinite homogeneous subsequence. This supplies the factorization argument for infinite branch words in Section 6.3.
Concept map
Lean source view on GitHub
| 1 | import Mathlib.Order.Monotone.Basic |
| 2 | import Mathlib.Data.Finite.Defs |
| 3 | |
| 4 | /-! |
| 5 | --- |
| 6 | title: Infinite Ramsey theorem for pairs |
| 7 | type: theorem |
| 8 | --- |
| 9 | A coloring of increasing pairs of natural numbers with finitely many |
| 10 | colors has an infinite homogeneous subsequence. This supplies the |
| 11 | factorization argument for infinite branch words in Section 6.3. |
| 12 | -/ |
| 13 | namespace Lax369799.InfiniteRamsey |
| 14 | |
| 15 | axiom pairs {C : Type} [Finite C] (color : ℕ → ℕ → C) : |
| 16 | ∃ (f : ℕ → ℕ) (c : C), StrictMono f ∧ ∀ i j, i < j → color (f i) (f j) = c |
| 17 | |
| 18 | end Lax369799.InfiniteRamsey |
| 19 |
Builds on
none
Used by
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments