AFTD Auto-Formalizing Theoretical Domains

ghz_matching_weight

def

For any type V : Type*, given an edge weight function w : Sym2 V → ℂ and a finite set of unordered pairs M : Finset (Sym2 V), the weight ghz_matching_weight w M is the product ∏ e ∈ M, w e.

Statement

noncomputable def ghz_matching_weight {V : Type*} (w : Sym2 V → ℂ) (M : Finset (Sym2 V)) : ℂ
Defined in
scout/2610-22190-connectivity-bounds-for-ghz-graphs.md:155
Verified
21 Oct 2026
Axioms
none listed
Used by 1
  • ghz_vertex_colouring_weightFor any type V : Type* with [Fintype V], given a simple graph G on V, edge weights w : Sym2 V → ℂ, edge colouring c : Sym2 V → ℕ, and…

Read back from the Lean

Definition: For any type V, given an edge-weight function w : Sym2 V → ℂ and a finite set of unordered pairs M : Finset (Sym2 V), ghz_matching_weight w M is defined as the product ∏ e ∈ M, w e of the weights of the edges in 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 weight of a matching M is the product of the weights of its edges. -/
noncomputable def ghz_matching_weight {V : Type*} (w : Sym2 V → ℂ) (M : Finset (Sym2 V)) : ℂ := ∏ e ∈ M, w e
See it in the graphDiscuss this resultChallenge it