AFTD Auto-Formalizing Theoretical Domains

diamond_poset_ramsey_property

theoremverified

For 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 DiamondPoset j.

Statement

theorem diamond_poset_ramsey_property (j k : ℕ) (hj : 2 ≤ j) (hk : 1 ≤ k) :
    poset_ramsey_property (DiamondPoset j) k (j * k)
Source
step towards diamond_poset_ramsey_number_le
Verified
19 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 8
  • 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…
  • 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…
  • 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…
  • DiamondPosetFor a natural number j, DiamondPoset j is the type consisting of a bottom element bot, a top element top, and j middle elements indexed by…
  • inst_partial_order_diamond_posetThe partial order on DiamondPoset j where bot is less than or equal to every element, every element is less than or equal to top, and two…
  • has_monochromatic_fan_copyFor a colouring χ of the subsets of Fin d with k colours, has_monochromatic_fan_copy j d col χ holds if there is a set top of colour col…
  • 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…
  • has_monochromatic_diamond_copyFor 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…
Used by 2
  • 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.
  • 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…

The proof, explained

The theorem establishes the poset Ramsey property for the j-diamond poset DiamondPoset j at dimension j * k: every k-colouring of the Boolean lattice of subsets of Fin (j * k) contains a monochromatic induced copy of DiamondPoset j. The proof specialises a general mixed Ramsey theorem (`mixed_diamond_fan_ramsey_bound`) that guarantees either a diamond in one of a colours or a fan in one of b colours. Setting a = k and b = 0, the dimension requirement simplifies to j * k ≤ j * k, and the fan branch is immediately ruled out because Fin 0 has no elements, leaving the monochromatic diamond embedding as the only possibility.

  1. For any k-colouring c of the subsets of Fin (j * k), the mixed diamond-fan Ramsey bound applies with k diamond colours and 0 fan colours.

    We introduce an arbitrary colouring c : Finset (Fin (j * k)) → Fin k. We invoke `mixed_diamond_fan_ramsey_bound` with a = k diamond colours and b = 0 fan colours. The theorem requires the dimension to satisfy (if 0 = 0 then j * k else ...) ≤ j * k, which simplifies via `simp` to j * k ≤ j * k and holds reflexively.

    lines 4–5

    uses mixed_diamond_fan_ramsey_bound

      intro c
      have h := mixed_diamond_fan_ramsey_bound j k 0 hj (j * k) (by simp)
  2. The colouring c yields either a monochromatic j-diamond in one of the k colours or a monochromatic fan in one of 0 colours.

    Applying the mixed Ramsey property h to c gives a disjunction via `rcases`: either there is a colour col ∈ Fin k with a monochromatic j-diamond copy, or a colour col ∈ Fin 0 with a monochromatic fan copy.

    line 6

      rcases h c with ⟨col, hcol⟩ | ⟨col, _⟩
  3. In the first case, there exists a monochromatic induced copy of DiamondPoset j.

    From the diamond copy witness hcol, `orderEmbedding_of_diamond_copy` constructs an order embedding e : DiamondPoset j ↪o Finset (Fin (j * k)) on which every element has colour col. The witness triple ⟨e, col, he⟩ satisfies the existential goal.

    lines 7–8

    uses orderEmbedding_of_diamond_copy

      · obtain ⟨e, he⟩ := orderEmbedding_of_diamond_copy j (j * k) col c hcol
        exact ⟨e, col, he⟩
  4. The fan case is impossible.

    In the second alternative, the fan colour col belongs to Fin 0. Because Fin 0 is empty, `col.elim0` eliminates this branch.

    line 9

      · exact col.elim0
mixed_diamond_fan_ramsey_bound
For j ≥ 2, any (a + b)-colouring of the subsets of Fin d contains either a monochromatic j-diamond in one of the first a colours or a monochromatic j-fan in one of the remaining b colours, provided the dimension d is at least j * a (when b = 0) or j * a + (j - 1) * b + 1 (when b > 0).
orderEmbedding_of_diamond_copy
A monochromatic copy of the j-diamond in a coloured Boolean lattice can be lifted to an induced order embedding of DiamondPoset j into the subset poset preserving that colour.

Written by a model (gemini-3.8-flash) from the Lean proof and the goal states Lean reported at each step. Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.

Lean source view module on GitHub

/-- The Ramsey property for the j-diamond holds at dimension j*k: every k-colouring of the subsets of Fin (j*k) has a monochromatic induced copy of DiamondPoset j. This is the exact member of the set whose infimum is poset_ramsey_number, so the target follows from it by Nat.sInf_le. -/theorem diamond_poset_ramsey_property (j k : ℕ) (hj : 2 ≤ j) (hk : 1 ≤ k) :    poset_ramsey_property (DiamondPoset j) k (j * k) := by  intro c  have h := mixed_diamond_fan_ramsey_bound j k 0 hj (j * k) (by simp)  rcases h c with ⟨col, hcol⟩ | ⟨col, _⟩  · obtain ⟨e, he⟩ := orderEmbedding_of_diamond_copy j (j * k) col c hcol    exact ⟨e, col, he⟩  · exact col.elim0
See it in the graphDiscuss this resultChallenge it