graph_state_max_fisher_info
For natural numbers n and m, graph_state_max_fisher_info n m is the supremum of the collective-X quantum Fisher information graph_state_fisher_info G over all connected triangle-free simple graphs G on Fin n with exactly m edges.
Statement
noncomputable def graph_state_max_fisher_info (n m : ℕ) : ℕ
- Defined in
- arXiv:2611.08593
- Verified
- 13 Nov 2026
- Axioms
- none listed
- Built on 1
- graph_state_fisher_infoFor a finite simple graph G on vertex type V with decidable equality and adjacency, the collective-X quantum Fisher information…
Read back from the Lean
For natural numbers n and m, graph_state_max_fisher_info n m is defined as the maximum (supremum, defaulting to 0 if no such graph exists) over all simple graphs G on vertex set Fin n satisfying:
1. G is connected (G.Connected),
2. G is triangle-free (G.CliqueFree 3, i.e., contains no clique of size 3), and
3. G has exactly m edges (G.edgeFinset.card = m),
of graph_state_fisher_info G, which is the number of ordered pairs of vertices (u, v) : Fin n × Fin n whose open neighborhoods in G are equal (G.neighborFinset u = G.neighborFinset v).
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
/-- The maximum collective-X quantum Fisher information over all connected triangle-free simple graphs on n vertices with m edges. -/ noncomputable def graph_state_max_fisher_info (n m : ℕ) : ℕ := open scoped Classical in Finset.sup (Finset.filter (fun G : SimpleGraph (Fin n) => G.Connected ∧ G.CliqueFree 3 ∧ G.edgeFinset.card = m) Finset.univ) (fun G => graph_state_fisher_info G)