AFTD Auto-Formalizing Theoretical Domains

is_balanced_five_coloring

def

For an arbitrary type V, an edge coloring c : Sym2 V → Fin 5 is balanced if for every 6-element subset S : Finset V with S.card = 6 and every color k : Fin 5, there exist distinct vertices v, w ∈ S such that c(s(v, w)) = k.

Statement

def is_balanced_five_coloring {V : Type*} (c : Sym2 V → Fin 5) : Prop
Defined in
scout/2610-24484-erd-h-o-s-gy-arf-as-balanced-five-colorings.md:1263
Verified
20 Oct 2026
Axioms
none listed
Used by 2

Read back from the Lean

For a type V and a function c : Sym2 V → Fin 5 (a 5-coloring of unordered pairs of elements of V), is_balanced_five_coloring c asserts that for every finite subset S of V, if the cardinality of S is 6, then for every color k : Fin 5, there exist distinct elements v, w ∈ S such that c s(v, w) = k (i.e., every color in Fin 5 appears at least once among the unordered pairs of distinct elements in S).

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

/-- A 5-coloring of the edges of a complete graph is balanced if every 6 vertices span all 5 colors. -/
def is_balanced_five_coloring {V : Type*} (c : Sym2 V → Fin 5) : Prop :=
  ∀ S : Finset V, S.card = 6 → ∀ k : Fin 5, ∃ v ∈ S, ∃ w ∈ S, v ≠ w ∧ c s(v, w) = k
See it in the graphDiscuss this resultChallenge it