AFTD Auto-Formalizing Theoretical Domains

zero_sum_ramsey_property

def

For a finite graph H and integers m and N, the zero-sum Ramsey property holds if every edge labeling of the complete graph on N vertices with weights in ZMod m contains an injective copy of H whose edge labels sum to zero in ZMod m.

Statement

def zero_sum_ramsey_property {V : Type*} [Fintype V]
    (H : SimpleGraph V) [Fintype H.edgeSet] (m N : ℕ) : Prop
Defined in
arXiv:2611.14160 Section 1
Verified
12 Nov 2026
Axioms
none listed
Used by 1
  • zero_sum_ramsey_numberThe zero-sum Ramsey number R(H, Z_m) of a simple graph H over Z_m is the infimum of the natural numbers N such that every ZMod m edge…

Read back from the Lean

Given a finite type V, a simple graph H on V with a finite edge set, and natural numbers m and N, zero_sum_ramsey_property H m N asserts that for every weight function w assigning an element of ZMod m to each edge of the complete graph on Fin N, there exists an injective map f : V ↪ Fin N such that the sum over all edges e of H of the weights w ⟨Sym2.map f e.1, _⟩ of the corresponding edges under f equals 0 in ZMod m.

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 zero-sum Ramsey property for a graph H modulo m in a complete host graph K_N. -/
def zero_sum_ramsey_property {V : Type*} [Fintype V]
    (H : SimpleGraph V) [Fintype H.edgeSet] (m N : ℕ) : Prop :=
  ∀ w : (SimpleGraph.completeGraph (Fin N)).edgeSet → ZMod m,
    ∃ f : V ↪ Fin N,
      ∑ e : H.edgeSet, w ⟨Sym2.map f e.1, by
        rcases e with ⟨⟨u, v⟩, hadj⟩
        simpa using hadj.ne ∘ (fun h => f.injective h)⟩ = 0
See it in the graphDiscuss this resultChallenge it