AFTD Auto-Formalizing Theoretical Domains

dephased_path_tripartite_info

def

For n : ℕ, q : Fin n → ℝ, and finsets A, B, C : Finset (Fin n), the tripartite information dephased_path_tripartite_info n q A B C is dephased_path_entropy n q A + dephased_path_entropy n q B + dephased_path_entropy n q C - dephased_path_entropy n q (A ∪ B) - dephased_path_entropy n q (A ∪ C) - dephased_path_entropy n q (B ∪ C) + dephased_path_entropy n q (A ∪ B ∪ C).

Statement

noncomputable def dephased_path_tripartite_info (n : ℕ) (q : Fin n → ℝ) (A B C : Finset (Fin n)) : ℝ
Defined in
arXiv:2511.19585, Monogamy of Mutual Information in Graph States
Verified
02 Nov 2026
Axioms
none listed
Built on 1
  • dephased_path_entropyFor n : ℕ, q : Fin n → ℝ, and S : Finset (Fin n), dephased_path_entropy n q S is defined as (S.card : ℝ) - (free.card : ℝ) plus the sum…

Read back from the Lean

The declaration dephased_path_tripartite_info defines the tripartite information of three subsets A, B, and C of vertices of a path graph of length n, with respect to a parameter vector q : Fin n → ℝ. Given: - a natural number n : ℕ, - a function q : Fin n → ℝ, - three finite subsets A, B, C : Finset (Fin n), it evaluates to the real number: dephased_path_entropy n q A + dephased_path_entropy n q B + dephased_path_entropy n q C - dephased_path_entropy n q (A ∪ B) - dephased_path_entropy n q (A ∪ C) - dephased_path_entropy n q (B ∪ C) + dephased_path_entropy n 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 I_3(A:B:C) defined by the dephased path entropy function. -/
noncomputable def dephased_path_tripartite_info (n : ℕ) (q : Fin n → ℝ) (A B C : Finset (Fin n)) : ℝ := dephased_path_entropy n q A + dephased_path_entropy n q B + dephased_path_entropy n q C -
  dephased_path_entropy n q (A ∪ B) - dephased_path_entropy n q (A ∪ C) - dephased_path_entropy n q (B ∪ C) +
  dephased_path_entropy n q (A ∪ B ∪ C)
See it in the graphDiscuss this resultChallenge it