AFTD Auto-Formalizing Theoretical Domains

monochromatic_copy_def_sanity

theoremverified

Sanity checks for the copy predicates: with a single colour on the subsets of Fin 2 there is a monochromatic 2-diamond (bottom ∅, top {0,1}, middles {0} and {1}) and a monochromatic F_2, but for j = 3 there is neither a monochromatic 3-diamond nor a monochromatic F_3 on Fin 2 (an antichain in the Boolean lattice on 2 points has at most 2 elements).

Statement

theorem monochromatic_copy_def_sanity :
    (has_monochromatic_diamond_copy 2 2 (0 : Fin 1) (fun _ => 0) ∧
     ¬ has_monochromatic_diamond_copy 3 2 (0 : Fin 1) (fun _ => 0)) ∧
    (has_monochromatic_fan_copy 2 2 (0 : Fin 1) (fun _ => 0) ∧
     ¬ has_monochromatic_fan_copy 3 2 (0 : Fin 1) (fun _ => 0))
Source
step towards diamond_poset_ramsey_number_le
Verified
18 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 2
  • 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…
  • 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 1
  • 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.

The proof, explained

The theorem serves as a sanity check for the diamond and fan copy definitions in the Boolean lattice of dimension 2 with a single color. It splits the goal into four conjuncts: asserting the existence of 2-diamonds and 2-fans, alongside the non-existence of 3-diamonds and 3-fans. After unfolding the definitions, each subclaim reduces to a bounded statement over the four subsets of `Fin 2`, which Lean settles directly by exhaustive finite computation via `decide`.

  1. The goal decomposes into four independent claims: the existence of a monochromatic 2-diamond, the non-existence of a monochromatic 3-diamond, the existence of a monochromatic 2-fan, and the non-existence of a monochromatic 3-fan.

    The theorem asserts a nested conjunction $((A \wedge B) \wedge (C \wedge D))$. The constructor `refine ⟨⟨?_, ?_⟩, ⟨?_, ?_⟩⟩` splits this into four separate subgoals.

    line 7

      refine ⟨⟨?_, ?_⟩, ⟨?_, ?_⟩⟩
  2. There exists a monochromatic 2-diamond copy in the Boolean lattice on 2 elements under the trivial single-color coloring. automation

    Unfolding the definition `has_monochromatic_diamond_copy` produces an existential statement asking for subsets $bot \subsetneq top \subseteq \{0, 1\}$ and two pairwise incomparable subsets strictly between them, all colored 0. Since the power set of a 2-element set has only 4 elements, this is a decidable proposition over a finite search space, and `decide` closes the goal by exhaustive evaluation (finding, for instance, $bot = \emptyset$, $top = \{0, 1\}$, and middle sets $\{0\}$ and $\{1\}$).

    line 8

    uses has_monochromatic_diamond_copy

      · dsimp [has_monochromatic_diamond_copy]; decide
  3. There is no monochromatic 3-diamond copy in the Boolean lattice on 2 elements under the trivial single-color coloring. automation

    Unfolding `has_monochromatic_diamond_copy` gives the negation of an existential statement asserting the existence of 3 pairwise incomparable subsets strictly between some bottom and top elements in the Boolean lattice of dimension 2. Because an antichain in $\mathcal{P}(\{0, 1\})$ can have size at most 2, no such configuration exists; `decide` verifies this by checking all finitely many possibilities.

    line 9

    uses has_monochromatic_diamond_copy

      · dsimp [has_monochromatic_diamond_copy]; decide
  4. There exists a monochromatic 2-fan copy in the Boolean lattice on 2 elements under the trivial single-color coloring. automation

    Unfolding `has_monochromatic_fan_copy` produces an existential statement requiring a top set and two incomparable subsets strictly contained in it. The finite decision procedure `decide` verifies this by finding a valid configuration (e.g., $top = \{0, 1\}$ with middle sets $\{0\}$ and $\{1\}$).

    line 10

    uses has_monochromatic_fan_copy

      · dsimp [has_monochromatic_fan_copy]; decide
  5. There is no monochromatic 3-fan copy in the Boolean lattice on 2 elements under the trivial single-color coloring. automation

    Unfolding `has_monochromatic_fan_copy` yields the negation of an existential statement requiring 3 pairwise incomparable subsets strictly contained in a top element of $\mathcal{P}(\{0, 1\})$. As no antichain in $\mathcal{P}(\{0, 1\})$ has 3 elements, no such fan can exist, and `decide` confirms this by exhaustive finite check.

    line 11

    uses has_monochromatic_fan_copy

      · dsimp [has_monochromatic_fan_copy]; decide
has_monochromatic_diamond_copy
The predicate asserting the existence of a bottom set and a top set with $bot \subsetneq top$, along with $j$ pairwise incomparable middle sets strictly between them, all sharing a given color under a coloring $\chi$.
has_monochromatic_fan_copy
The predicate asserting the existence of a top set along with $j$ pairwise incomparable middle sets strictly contained in it, all sharing a given color under a coloring $\chi$.

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

/-- Non-vacuity and non-triviality of the two copy predicates: satisfiable at d = 2 with one colour, false for j = 3 at d = 2. -/theorem monochromatic_copy_def_sanity :    (has_monochromatic_diamond_copy 2 2 (0 : Fin 1) (fun _ => 0) ∧     ¬ has_monochromatic_diamond_copy 3 2 (0 : Fin 1) (fun _ => 0)) ∧    (has_monochromatic_fan_copy 2 2 (0 : Fin 1) (fun _ => 0) ∧     ¬ has_monochromatic_fan_copy 3 2 (0 : Fin 1) (fun _ => 0)) := by  refine ⟨⟨?_, ?_⟩, ⟨?_, ?_⟩⟩  · dsimp [has_monochromatic_diamond_copy]; decide  · dsimp [has_monochromatic_diamond_copy]; decide  · dsimp [has_monochromatic_fan_copy]; decide  · dsimp [has_monochromatic_fan_copy]; decide
See it in the graphDiscuss this resultChallenge it