While this submission is a draft, it cannot be used by other submissions.

Infinite Ramsey theorem for pairs

Lax369799.InfiniteRamsey · concepts/Lax369799/InfiniteRamsey.lean · lax-369799

proven

Loading review…

Sign in with ORCID

Community review

Flags

Each flag is tied to a public ORCID identity and explains why this concept may be incorrect.

No flags have been submitted.

    Community review

    Flag this concept

    State precisely what appears incorrect. This explanation will be public under your ORCID name.

    No source line selected.

    Natural 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
    1 concept
    100%
    Proven claimThis conceptDescendants are omitted for concepts with more than 10 descendants.
    Evidence

    Each proof establishes this claim relative to its assumptions.

    Lean source view on GitHub

    1import Mathlib.Order.Monotone.Basic
    2import Mathlib.Data.Finite.Defs
    3
    4/-!
    5---
    6title: Infinite Ramsey theorem for pairs
    7type: theorem
    8---
    9A coloring of increasing pairs of natural numbers with finitely many
    10colors has an infinite homogeneous subsequence. This supplies the
    11factorization argument for infinite branch words in Section 6.3.
    12-/
    13namespace Lax369799.InfiniteRamsey
    14
    15axiom pairs {C : Type} [Finite C] (color : ℕ → ℕ → C) :
    16 ∃ (f : ℕ → ℕ) (c : C), StrictMono f ∧ ∀ i j, i < j → color (f i) (f j) = c
    17
    18end Lax369799.InfiniteRamsey
    19
    Show Proof

    Discussion

    Ask a question or add context. Endorsements and structured flags are kept in the review panel above.

    Loading discussion…