AFTD Auto-Formalizing Theoretical Domains

five_diamond_poset_ramsey_number_le

theoremverifiedformalization

For every natural number k with 1 ≤ k, the k-color poset Ramsey number of the 5-diamond DiamondPoset 5 is at most 5 * k.

Statement

theorem five_diamond_poset_ramsey_number_le (k : ℕ) (hk : 1 ≤ k) : poset_ramsey_number (DiamondPoset 5) k ≤ 5 * k
Formalizes
arXiv:2610.20545, The k-color poset Ramsey number of the diamond is 2k, Theorem 2
Verified
21 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 4
  • 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…
  • 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.

Read back from the Lean

For every natural number $k$ such that $1 \le k$, the poset Ramsey number of DiamondPoset 5 with $k$ colors is at most $5k$.

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

The theorem is proved by specializing the general upper bound diamond_poset_ramsey_number_le to the case j = 5. The hypothesis 2 ≤ 5 required by that theorem is discharged automatically by numerical evaluation.

  1. The k-color poset Ramsey number of DiamondPoset 5 is at most 5 * k.

    The general theorem diamond_poset_ramsey_number_le provides the upper bound j * k for any j-diamond poset with j ≥ 2. Specializing to j = 5 and using the assumption 1 ≤ k (hk), Lean discharges the prerequisite 2 ≤ 5 by direct computational evaluation (decide), which concludes the proof.

    line 2

    uses diamond_poset_ramsey_number_le

    theorem five_diamond_poset_ramsey_number_le (k : ℕ) (hk : 1 ≤ k) : poset_ramsey_number (DiamondPoset 5) k ≤ 5 * k := diamond_poset_ramsey_number_le 5 (by decide) k hk
diamond_poset_ramsey_number_le
For all natural numbers j ≥ 2 and k ≥ 1, the k-color poset Ramsey number of DiamondPoset j is at most j * k.

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 k >= 1, the k-color poset Ramsey number of DiamondPoset 5 is at most 5 * k. -/theorem five_diamond_poset_ramsey_number_le (k : ℕ) (hk : 1 ≤ k) : poset_ramsey_number (DiamondPoset 5) k ≤ 5 * k := diamond_poset_ramsey_number_le 5 (by decide) k hk
See it in the graphDiscuss this resultChallenge it