AFTD Auto-Formalizing Theoretical Domains

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

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
See it in the graphDiscuss this resultChallenge it