has_monochromatic_diamond_copy
def
For a colouring χ of the subsets of Fin d with k colours, has_monochromatic_diamond_copy j d col χ holds if there are sets bot ⊂ top of colour col and j sets mid i, strictly between bot and top, pairwise incomparable, all of colour col — i.e. a monochromatic induced copy of the j-diamond D_j (bottom, j incomparable middles, top) in the colouring χ.
Statement
def has_monochromatic_diamond_copy (j d : ℕ) {k : ℕ} (col : Fin k) (χ : Finset (Fin d) → Fin k) : Prop
- Source
- step towards diamond_poset_ramsey_number_le
- Verified
- 18 Oct 2026
- Axioms
- none listed
- Used by 15
- mixed_diamond_fan_ramsey_boundFor j ≥ 2, a colouring of the subsets of Fin d with a + b colours contains a monochromatic induced j-diamond in one of the first a…
- monochromatic_copy_def_sanitySanity checks for the copy predicates: with a single colour on the subsets of Fin 2 there is a monochromatic 2-diamond (bottom ∅, top…
- mixed_diamond_fan_ramsey_bound_last_colour_stepCase b = 0, a ≥ 1: if d ≥ j*a and the statement holds at (a-1, 1) in the same dimension, then every colouring with a colours has a…
- 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…
- has_monochromatic_diamond_copy_colour_injective_nonemptyIf ψ = f ∘ χ on nonempty sets (f injective) and ψ ∅ ≠ f col, then a monochromatic induced j-diamond in ψ of colour f col yields one in χ…
- has_monochromatic_diamond_copy_colour_injectiveRelabelling colours by an injective map does not change the existence of a monochromatic induced j-diamond: if ψ = f ∘ χ with f injective,…
- mixed_diamond_fan_ramsey_bound_singleton_diamond_stepCase b ≥ 1 with a singleton {x} whose colour is the diamond colour c: if d ≥ j*a + (j-1)*b + 1 and the statement holds at (a-1, b+1) in…
- mdfrbf_diamond_transferPush-forward of a monochromatic diamond along an order embedding of set systems: if T is injective, monotone and reflects inclusions on…
- mixed_diamond_fan_ramsey_bound_all_singletons_one_fan_colourCase b = 1 with every singleton of the unique fan colour: if d ≥ j*a + j and the statement holds at (a, 0) in dimension d-j, then χ has a…
- mixed_ramsey_propertymixed_ramsey_property j a b d asserts that every colouring of the subsets of Fin d with a + b colours has a monochromatic induced copy of…
- orderEmbedding_of_diamond_copyIf the colouring χ of the subsets of Fin d has a monochromatic combinatorial j-diamond copy in colour col, then there is an order…
- 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.
- mixed_diamond_fan_ramsey_bound_base_zero_diamond_coloursBase case a = 0 (b ≥ 1): if d ≥ (j-1)*b + 1 then every colouring of the subsets of Fin d with 0 + b colours has a monochromatic induced…
- five_diamond_copy_of_mono_levels_spanGeneralised level-copy lemma: if col-coloured sets B ⊆ T straddle a completely col-monochromatic level m (|B| < m < |T|), and the middle…
- mixed_diamond_fan_ramsey_bound_all_singletons_fan_coloursCase b ≥ 2 with every singleton fan-coloured: if d ≥ j*a + (j-1)*b + 1 and the statement holds at (a, b-1) in dimension d-(j-1), then χ…
Lean source view module on GitHub
/-- A monochromatic induced copy of the j-diamond, stated directly as bot ⊂ j pairwise incomparable middles ⊂ top, all of one colour. -/ def has_monochromatic_diamond_copy (j d : ℕ) {k : ℕ} (col : Fin k) (χ : Finset (Fin d) → Fin k) : Prop := ∃ bot top : Finset (Fin d), bot ⊂ top ∧ χ bot = col ∧ χ top = col ∧ ∃ mid : Fin j → Finset (Fin d), (∀ i, bot ⊂ mid i ∧ mid i ⊂ top ∧ χ (mid i) = col) ∧ (∀ i i', i ≠ i' → ¬ mid i ⊆ mid i')