AFTD Auto-Formalizing Theoretical Domains

tree_graph_state_tripartite_info

def

For a simple graph G on a finite type V with decidable equality and decidable adjacency, and four finite subsets A, B, C, D : Finset V, tree_graph_state_tripartite_info G A B C D is the integer (simple_graph_cut_rank G A : ℤ) + (simple_graph_cut_rank G B : ℤ) + (simple_graph_cut_rank G C : ℤ) + (simple_graph_cut_rank G D : ℤ) - (simple_graph_cut_rank G (A ∪ B) : ℤ) - (simple_graph_cut_rank G (A ∪ C) : ℤ) - (simple_graph_cut_rank G (B ∪ C) : ℤ).

Statement

noncomputable def tree_graph_state_tripartite_info {V : Type*} [Fintype V] [DecidableEq V]
    (G : SimpleGraph V) [DecidableRel G.Adj] (A B C D : Finset V) : ℤ
Defined in
arXiv:2511.19585 Eq. (2.5)
Verified
01 Nov 2026
Axioms
none listed
Built on 1
  • simple_graph_cut_rankFor a finite type V with decidable equality, a simple graph G on V with decidable adjacency, and a finite subset X : Finset V,…
Used by 5

Read back from the Lean

tree_graph_state_tripartite_info is a definition that takes a finite type V with decidable equality, a simple graph G on V with decidable adjacency, and four finite sets of vertices A, B, C, D : Finset V, and computes the integer: (simple_graph_cut_rank G A : ℤ) + (simple_graph_cut_rank G B : ℤ) + (simple_graph_cut_rank G C : ℤ) + (simple_graph_cut_rank G D : ℤ) - (simple_graph_cut_rank G (A ∪ B) : ℤ) - (simple_graph_cut_rank G (A ∪ C) : ℤ) - (simple_graph_cut_rank G (B ∪ C) : ℤ).

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

/-- Tripartite information I₃(A:B:C) of a 4-partition (A, B, C, D) of a graph state, defined via cut ranks over F₂. -/
noncomputable def tree_graph_state_tripartite_info {V : Type*} [Fintype V] [DecidableEq V]
    (G : SimpleGraph V) [DecidableRel G.Adj] (A B C D : Finset V) : ℤ := (simple_graph_cut_rank G A : ℤ) + (simple_graph_cut_rank G B : ℤ) +
  (simple_graph_cut_rank G C : ℤ) + (simple_graph_cut_rank G D : ℤ) -
  (simple_graph_cut_rank G (A ∪ B) : ℤ) -
  (simple_graph_cut_rank G (A ∪ C) : ℤ) -
  (simple_graph_cut_rank G (B ∪ C) : ℤ)
See it in the graphDiscuss this resultChallenge it