AFTD Auto-Formalizing Theoretical Domains

diamond_poset_ramsey_number_le

theoremverifiedformalization

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

Statement

theorem diamond_poset_ramsey_number_le (j : ℕ) (hj : 2 ≤ j) (k : ℕ) (hk : 1 ≤ k) : poset_ramsey_number (DiamondPoset j) k ≤ j * k
Formalizes
arXiv:2610.20545, The k-color poset Ramsey number of the diamond is 2k, Theorem 2
Verified
19 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 13
  • 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…
  • 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…
  • 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…
  • 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…
  • 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…
  • exists_hitting_set_of_no_large_antichainLet G be a finite family of nonempty subsets of a finite set α, w a natural number, and suppose every subfamily H ⊆ G that is an antichain…
  • fan_ramsey_boundFor j ≥ 2 and k ≥ 1, every colouring of the subsets of Fin d with k colours, where d ≥ k(j-1)+1, contains a monochromatic induced copy of…
  • 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…
  • 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_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 1

Read back from the Lean

For all natural numbers $j$ such that $2 \le j$ and all natural numbers $k$ such that $1 \le k$, the poset Ramsey number of DiamondPoset j with $k$ colors is less than or equal to $j \cdot k$.

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

The proof, explained

By definition, the poset Ramsey number is the infimum of the set of dimensions d that satisfy the Ramsey property for the diamond poset with k colors. A companion theorem establishes that d = j * k satisfies this property. Thus j * k belongs to the set, and the infimum is at most j * k.

  1. The poset Ramsey number of DiamondPoset j for k colors is at most j * k.

    By definition, the poset Ramsey number is the infimum of all dimensions d satisfying the Ramsey property for DiamondPoset j with k colors. Lemma diamond_poset_ramsey_property establishes that d = j * k satisfies this property, placing j * k in the defining set. Applying Nat.sInf_le shows that the infimum is at most j * k.

    line 3

    uses Nat.sInf_le, diamond_poset_ramsey_property

      exact Nat.sInf_le (diamond_poset_ramsey_property j k hj hk)
Nat.sInf_le
Any element of a set of natural numbers is an upper bound on the infimum (minimum) of that set.
diamond_poset_ramsey_property
For j ≥ 2 and k ≥ 1, the boolean lattice of dimension j * k satisfies the k-color poset Ramsey property for the j-diamond poset.

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

/-- For any j >= 2 and k >= 1, the k-color poset Ramsey number of DiamondPoset j is at most j * k. -/theorem diamond_poset_ramsey_number_le (j : ℕ) (hj : 2 ≤ j) (k : ℕ) (hk : 1 ≤ k) : poset_ramsey_number (DiamondPoset j) k ≤ j * k := by  exact Nat.sInf_le (diamond_poset_ramsey_property j k hj hk)
See it in the graphDiscuss this resultChallenge it