AFTD Auto-Formalizing Theoretical Domains

multipartite_upper_bound_split_parts

def

The parts of the multipartite graph whose colour set meets X but is not contained in X — i.e. the parts split by the cut at the colour class of X.

Statement

noncomputable def multipartite_upper_bound_split_parts {ι : Type*} [Fintype ι]
    (T : ι → Finset (Fin 4)) (X : Finset (Fin 4)) : Finset ι
Source
step towards multipartite_graph_state_tripartite_info_upper_bound
Verified
08 Nov 2026
Axioms
none listed
Used by 1
  • multipartite_upper_bound_color_cutThe exact value of the cut rank of the complete multipartite graph at the colour class indexed by X, expressed purely in terms of the part…

Lean source view module on GitHub

/-- The parts whose colour set meets `X` but is not contained in `X`. -/
noncomputable def multipartite_upper_bound_split_parts {ι : Type*} [Fintype ι]
    (T : ι → Finset (Fin 4)) (X : Finset (Fin 4)) : Finset ι := Finset.univ.filter (fun i => (T i ∩ X).Nonempty ∧ ¬ (T i ⊆ X))
See it in the graphDiscuss this resultChallenge it