tree_graph_state_tripartite_info
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
- square_grid_max_tripartite_info_nonnegFor every natural number n, the maximum tripartite information square_grid_graph_max_tripartite_info n of the n-by-n square grid graph…
- simple_graph_max_tripartite_infoFor any finite simple graph G with decidable equality and decidable adjacency, simple_graph_max_tripartite_info G is the maximum of…
- square_grid_graph_tripartite_infoFor any natural number n and four-coloring c : Fin n × Fin n → Fin 4 of the vertices of the n-by-n square grid graph,…
- tree_graph_state_tripartite_info_trivial_zeroFor any finite graph G on type V with decidable equality and decidable adjacency, tree_graph_state_tripartite_info G Finset.univ ∅ ∅ ∅…
- simple_graph_max_tripartite_info_nonnegFor every finite simple graph G, the maximum tripartite information simple_graph_max_tripartite_info G is at least 0, witnessed by the…
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) : ℤ)