AFTD Auto-Formalizing Theoretical Domains

set_coloring_ramsey_property

def

Given a type V, a simple graph G on V, and natural numbers r, s, t, N, set_coloring_ramsey_property G r s t N asserts that for every edge-coloring ϕ : (⊤ : SimpleGraph (Fin N)).edgeSet → Finset (Fin r) assigning an s-element finite subset of Fin r to each edge of the complete graph on Fin N, there exists a t-element finite subset T : Finset (Fin r) such that the support graph support_graph ϕ T contains a copy of G.

Statement

def set_coloring_ramsey_property {V : Type*} (G : SimpleGraph V) (r s t N : ℕ) : Prop
Defined in
scout/2611-15376-set-coloring-ramsey-numbers-with-multiple-intersections.md:147
Verified
13 Nov 2026
Axioms
none listed
Built on 1
  • support_graphGiven a type V, a natural number r, an edge-labeling function ϕ : (⊤ : SimpleGraph V).edgeSet → Finset (Fin r) assigning a finite subset…
Used by 14

Read back from the Lean

set_coloring_ramsey_property is a predicate on a simple graph G with vertex type V and four natural numbers r, s, t, N. It asserts that: For every function ϕ assigning each edge of the complete graph on Fin N a finite subset of Fin r, if every edge e has (ϕ e).card = s (every edge is assigned exactly s colors), then there exists a subset of colors T : Finset (Fin r) such that: 1. T.card = t (T contains exactly t colors), and 2. G is contained (in the sense of SimpleGraph.IsContained) in support_graph ϕ T, which is the subgraph of the complete graph on Fin N consisting of those edges whose color sets contain T.

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

Lean source view module on GitHub

/-- The generalized set-coloring Ramsey property at N. -/
def set_coloring_ramsey_property {V : Type*} (G : SimpleGraph V) (r s t N : ℕ) : Prop :=
  ∀ ϕ : (⊤ : SimpleGraph (Fin N)).edgeSet → Finset (Fin r),
    (∀ e, (ϕ e).card = s) →
    ∃ T : Finset (Fin r), T.card = t ∧ SimpleGraph.IsContained G (support_graph ϕ T)
See it in the graphDiscuss this resultChallenge it