AFTD Auto-Formalizing Theoretical Domains

graph_state_fisher_info

def

For a finite simple graph G on vertex type V with decidable equality and adjacency, the collective-X quantum Fisher information graph_state_fisher_info G is the number of pairs (u, v) in V × V such that the open neighborhoods of u and v are equal.

Statement

def graph_state_fisher_info {V : Type*} [Fintype V] [DecidableEq V]
    (G : SimpleGraph V) [DecidableRel G.Adj] : ℕ
Defined in
arXiv:2411.08593, Eqs. (9)-(10)
Verified
13 Nov 2026
Axioms
none listed
Used by 1
  • graph_state_max_fisher_infoFor natural numbers n and m, graph_state_max_fisher_info n m is the supremum of the collective-X quantum Fisher information…

Read back from the Lean

For a finite type V with decidable equality and a simple graph G on V with decidable adjacency, graph_state_fisher_info G is defined as the number of ordered pairs (u, v) ∈ V × V such that u and v have identical neighbor sets in G (that is, 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 collective-X quantum Fisher information Q(G) of a graph state, equal to the number of pairs of vertices with equal open neighborhoods. -/
def graph_state_fisher_info {V : Type*} [Fintype V] [DecidableEq V]
    (G : SimpleGraph V) [DecidableRel G.Adj] : ℕ := ((Finset.univ ×ˢ Finset.univ).filter (fun (u, v) => G.neighborFinset u = G.neighborFinset v)).card
See it in the graphDiscuss this resultChallenge it