AFTD Auto-Formalizing Theoretical Domains

simple_graph_max_cut_weight

def

Given a finite type V with decidable equality, a simple graph G on V with decidable adjacency, and an edge weighting w : G.edgeSet → ℝ, the maximum cut weight simple_graph_max_cut_weight G w is defined as the supremum over all vertex subsets S : Finset V of simple_graph_cut_weight G w S.

Statement

noncomputable def simple_graph_max_cut_weight {V : Type*} [Fintype V] [DecidableEq V]
    (G : SimpleGraph V) [DecidableRel G.Adj] (w : G.edgeSet → ℝ) : ℝ
Defined in
arXiv:2611.05178 Section 1
Verified
09 Nov 2026
Axioms
none listed
Built on 1
  • simple_graph_cut_weightGiven a finite type V with decidable equality, a simple graph G on V with decidable adjacency, an edge weighting w : G.edgeSet → ℝ, and a…

Read back from the Lean

Given a finite type V with decidable equality, a simple graph G on V with decidable adjacency, and a real-valued edge weight function w : G.edgeSet → ℝ, simple_graph_max_cut_weight G w is defined as the supremum (in ℝ) over all finite subsets S : Finset V of simple_graph_cut_weight G w 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

/-- The maximum weight of a cut in an edge-weighted simple graph. -/
noncomputable def simple_graph_max_cut_weight {V : Type*} [Fintype V] [DecidableEq V]
    (G : SimpleGraph V) [DecidableRel G.Adj] (w : G.edgeSet → ℝ) : ℝ := ⨆ S : Finset V, simple_graph_cut_weight G w S
See it in the graphDiscuss this resultChallenge it