dephased_tree_tripartite_info
For a finite simple graph T on vertex type V, noise profile q : V → ℝ, and subsets A, B, C : Finset V, dephased_tree_tripartite_info T q A B C is H(A) + H(B) + H(C) - H(A ∪ B) - H(A ∪ C) - H(B ∪ C) + H(A ∪ B ∪ C), where H = dephased_tree_entropy T q.
Statement
noncomputable def dephased_tree_tripartite_info {V : Type*} [Fintype V] [DecidableEq V] (T : SimpleGraph V) [DecidableRel T.Adj] (q : V → ℝ) (A B C : Finset V) : ℝ
- Defined in
- Fuentes et al., arXiv:2511.19585; OP-827
- Verified
- 02 Nov 2026
- Axioms
- none listed
- Built on 1
- dephased_tree_entropyFor a finite simple graph T on vertex type V, noise profile q : V → ℝ, and subset S : Finset V, dephased_tree_entropy T q S is |S| - d_S -…
Read back from the Lean
The definition dephased_tree_tripartite_info computes the tripartite information (interaction information) of three vertex subsets A, B, C : Finset V with respect to a graph T : SimpleGraph V and a weight function q : V → ℝ, on a finite type V with decidable equality and decidable adjacency for T.
It is defined as:
dephased_tree_entropy T q A
+ dephased_tree_entropy T q B
+ dephased_tree_entropy T q C
- dephased_tree_entropy T q (A ∪ B)
- dephased_tree_entropy T q (A ∪ C)
- dephased_tree_entropy T q (B ∪ C)
+ dephased_tree_entropy T q (A ∪ 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 of three disjoint subsystems for a dephased tree graph state. -/ noncomputable def dephased_tree_tripartite_info {V : Type*} [Fintype V] [DecidableEq V] (T : SimpleGraph V) [DecidableRel T.Adj] (q : V → ℝ) (A B C : Finset V) : ℝ := dephased_tree_entropy T q A + dephased_tree_entropy T q B + dephased_tree_entropy T q C - dephased_tree_entropy T q (A ∪ B) - dephased_tree_entropy T q (A ∪ C) - dephased_tree_entropy T q (B ∪ C) + dephased_tree_entropy T q (A ∪ B ∪ C)