AFTD Auto-Formalizing Theoretical Domains

poset_ramsey_number

def

The k-color poset Ramsey number of a preordered type P is the infimum of the set of natural numbers d such that every k-coloring of the Boolean lattice Finset (Fin d) contains a monochromatic induced copy of P.

Statement

noncomputable def poset_ramsey_number (P : Type*) [Preorder P] (k : ℕ) : ℕ
Defined in
arXiv:2610.20545, The k-color poset Ramsey number of the diamond is 2k
Verified
18 Oct 2026
Axioms
none listed
Built on 1
  • poset_ramsey_propertyFor a preordered type P and natural numbers k and d, poset_ramsey_property P k d asserts that for every coloring c : Finset (Fin d) → Fin…
Used by 3

Read back from the Lean

Given a type P with a preorder and a natural number k, poset_ramsey_number P k is defined as the infimum (sInf) in ℕ (the least natural number, or 0 if empty) of the set of all dimensions d : ℕ satisfying poset_ramsey_property P k d.

Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.

Lean source view module on GitHub

/-- The poset Ramsey number R_k(P): the minimum dimension d such that the Boolean lattice on Fin d has the k-color Ramsey property for P. -/
noncomputable def poset_ramsey_number (P : Type*) [Preorder P] (k : ℕ) : ℕ :=
  sInf {d : ℕ | poset_ramsey_property P k d}
See it in the graphDiscuss this resultChallenge it