poset_ramsey_property
def
For 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 k, there exists an order embedding f : P ↪o Finset (Fin d) and a color col : Fin k such that c (f x) = col for all x : P.
Statement
def poset_ramsey_property (P : Type*) [Preorder P] (k d : ℕ) : Prop
- Defined in
- arXiv:2610.20545, The k-color poset Ramsey number of the diamond is 2k
- Verified
- 18 Oct 2026
- Axioms
- none listed
- Used by 9
- five_diamond_ramsey_property_four_mul_minus_oneFor k ≥ 1, the poset Ramsey property for the 5-diamond fails at 4k-1: the level colouring witnesses it, so R_k(D_5) ≥ 4k.
- diamond_poset_ramsey_propertyFor j ≥ 2 and k ≥ 1, every colouring of the subsets of Fin (j*k) with k colours has a monochromatic induced copy of the j-diamond…
- poset_ramsey_numberThe 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…
- five_diamond_step_of_colour_free_copyAssembly: if the induction hypothesis holds at (k, 4k) and every D5-free (k+1)-colouring of the subsets of Fin(4(k+1)) has an…
- five_diamond_poset_ramsey_number_geFor every natural number k with 1 ≤ k, the k-color poset Ramsey number of the 5-diamond DiamondPoset 5 is at least 4 * k.
- five_diamond_ramsey_property_iff_setsA k-colouring of the subsets of Fin d contains a monochromatic induced copy of the j-diamond exactly when it has, in one colour, a set B,…
- diamond_poset_ramsey_number_leFor all natural numbers j ≥ 2 and k ≥ 1, the k-color poset Ramsey number of the j-diamond DiamondPoset j is at most j * k.
- five_diamond_ramsey_property_four_mul_leIf every k-colouring (k ≥ 1) of the subsets of Fin d contains a monochromatic induced copy of the 5-diamond DiamondPoset 5, then 4 * k ≤…
- exists_poset_ramsey_property_diamondFor j ≥ 2 and k ≥ 1 the k-colour poset Ramsey property for the j-diamond is satisfied by some d: there is a d such that every colouring of…
Read back from the Lean
Given 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 k, there exists an order embedding f : P ↪o Finset (Fin d) (with respect to the subset inclusion order on Finset (Fin d)) and a color col : Fin k such that for every x : P, c (f x) = col (i.e., the embedded copy of P is monochromatic).
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
/-- Predicate that every k-coloring of the Boolean lattice on Fin d contains a monochromatic induced copy of P. -/ def poset_ramsey_property (P : Type*) [Preorder P] (k d : ℕ) : Prop := ∀ c : Finset (Fin d) → Fin k, ∃ f : P ↪o Finset (Fin d), ∃ col : Fin k, ∀ x : P, c (f x) = col