balanced_multipartite_max_tripartite_info
deforiginal
For natural numbers k and s, balanced_multipartite_max_tripartite_info k s is the maximum tripartite information simple_graph_max_tripartite_info of the complete multipartite graph with k parts each of size s.
Statement
noncomputable def balanced_multipartite_max_tripartite_info (k s : ℕ) : ℤ
- Related work
- arXiv:2511.19585, 'Monogamy of Mutual Information in Graph States'
- Verified
- 08 Nov 2026
- Axioms
- none listed
- Built on 1
- 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…
- Used by 1
- balanced_multipartite_max_tripartite_info_nonnegFor any natural numbers k and s, the maximum tripartite information balanced_multipartite_max_tripartite_info k s of the complete…
Read back from the Lean
balanced_multipartite_max_tripartite_info k s is the maximum tripartite information (as defined by simple_graph_max_tripartite_info) of the complete balanced multipartite graph with k parts of size s (i.e. the complete multipartite graph on vertex set Σ (_ : Fin k), Fin s).
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
/-- Maximum tripartite information M(k, s) over all four-partitions of the complete balanced multipartite graph with k parts each of size s. -/ noncomputable def balanced_multipartite_max_tripartite_info (k s : ℕ) : ℤ := simple_graph_max_tripartite_info (SimpleGraph.completeMultipartiteGraph (fun _ : Fin k => Fin s))