sparse_graph_state_fisher_q_max
deforiginal
For positive integers n, d, c, Q_max(n, d, c) is the maximum of Q(G) over all connected triangle-free graphs G on n vertices with d*n + c edges.
Statement
noncomputable def sparse_graph_state_fisher_q_max (n d c : ℕ) : ℕ
- Related work
- arXiv:2611.08593
- Verified
- 13 Nov 2026
- Axioms
- none listed
- Built on 1
- graph_state_fisher_qFor any finite simple graph G on vertex set V, the collective-X quantum Fisher information Q(G) is the sum over all ordered pairs (u, v)…
Read back from the Lean
sparse_graph_state_fisher_q_max n d c is defined as the supremum (sSup in ℕ) of the set of all $q : ℕ$ such that there exists a simple graph $G$ on the vertex type Fin n satisfying:
1. $G$ is connected (G.Connected),
2. $G$ has no 3-cliques / is triangle-free (G.CliqueFree 3),
3. the number of edges of $G$ is $d \cdot n + c$ (Nat.card G.edgeSet = d * n + c), and
4. $q = \text{graph\_state\_fisher\_q } G$.
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 Q(G) over connected triangle-free n-vertex graphs with d*n+c edges. -/ noncomputable def sparse_graph_state_fisher_q_max (n d c : ℕ) : ℕ := sSup { q | ∃ (G : SimpleGraph (Fin n)), G.Connected ∧ G.CliqueFree 3 ∧ Nat.card G.edgeSet = d * n + c ∧ q = graph_state_fisher_q G }