has_monochromatic_diamond_copy_colour_injective
Relabelling colours by an injective map does not change the existence of a monochromatic induced j-diamond: if ψ = f ∘ χ with f injective, then χ has a mono j-diamond in colour col iff ψ has one in colour f col.
Statement
theorem has_monochromatic_diamond_copy_colour_injective {j d k k' : ℕ} (f : Fin k → Fin k')
(hf : Function.Injective f) (col : Fin k) (χ : Finset (Fin d) → Fin k)
(ψ : Finset (Fin d) → Fin k') (h : ∀ A, ψ A = f (χ A)) :
has_monochromatic_diamond_copy j d (f col) ψ ↔ has_monochromatic_diamond_copy j d col χ- Source
- step towards mixed_diamond_fan_ramsey_bound
- Verified
- 18 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 1
- 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 3
- 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…
- 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…
- 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…
The proof, explained
The theorem states that relabelling colours via an injective map f preserves the existence of a monochromatic j-diamond copy. Because the definition of a monochromatic diamond copy only references the colouring via equalities of the form colour(A) = col, substituting ψ(A) = f(χ(A)) and applying the injectivity of f (f(χ(A)) = f(col) ↔ χ(A) = col) makes the definition for ψ and f(col) logically equivalent to the definition for χ and col. A single simplification step unfolds the definition, rewrites along the colouring identity, and cancels f.
The coloring ψ has a monochromatic j-diamond in colour f col if and only if χ has one in colour col.
Unfolding the definition of has_monochromatic_diamond_copy, the condition for ψ to have a monochromatic j-diamond in colour f col is identical to that for χ in colour col, except that each colour requirement ψ(A) = f col is replaced by f(χ A) = f col via hypothesis h. By injectivity of f (hf.eq_iff), f(χ A) = f col is equivalent to χ A = col. Since the containment relations and incomparability of the subsets do not involve colours, both sides simplify to the exact same existential statement.
uses
has_monochromatic_diamond_copy,hf.eq_iffsimp only [has_monochromatic_diamond_copy, h, hf.eq_iff]
has_monochromatic_diamond_copy- The definition stating that under coloring χ, there exists a monochromatic j-diamond in colour col: a bottom element bot, a top element top with bot ⊂ top, and j pairwise incomparable intermediate elements mid i with bot ⊂ mid i ⊂ top, all assigned colour col.
hf.eq_iff- For an injective function f, f a = f b if and only if a = b.
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
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
/-- Diamond copies transfer along an injective relabelling of the colour type. -/theorem has_monochromatic_diamond_copy_colour_injective {j d k k' : ℕ} (f : Fin k → Fin k') (hf : Function.Injective f) (col : Fin k) (χ : Finset (Fin d) → Fin k) (ψ : Finset (Fin d) → Fin k') (h : ∀ A, ψ A = f (χ A)) : has_monochromatic_diamond_copy j d (f col) ψ ↔ has_monochromatic_diamond_copy j d col χ := by simp only [has_monochromatic_diamond_copy, h, hf.eq_iff]