AFTD Auto-Formalizing Theoretical Domains

core_constant_b

deforiginal

For natural numbers d and c, let k = sparse_graph_state_fisher_core_k d c. The core constant B(d, c) is the supremum of Q(J) - 1 over all pairs (J, s) of a graph J on Fin (k + 1) and a vertex s satisfying is_marked_core_graph k d c J s.

Statement

noncomputable def core_constant_b (d c : ℕ) : ℕ
Related work
arXiv:2611.08593
Verified
13 Nov 2026
Axioms
none listed
Built on 3
  • sparse_graph_state_fisher_core_kFor integers d >= 2 and c >= 0, k(d, c) is the least positive integer k such that floor(k^2 / 4) >= d*k + c.
  • is_marked_core_graphFor natural numbers k, d, c, a simple graph J on Fin (k + 1), and a marked vertex s : Fin (k + 1), is_marked_core_graph k d c J s asserts…
  • 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

core_constant_b d c defines a natural number as the supremum (in ℕ, yielding 0 if the set is empty) of all b : ℕ for which there exists a simple graph J on the vertex set Fin (k + 1) and a vertex s : Fin (k + 1)—where k is the smallest positive integer such that d * k + c ≤ k^2 / 4 (using integer division)—satisfying: 1. J is connected; 2. J is triangle-free (J.CliqueFree 3); 3. the number of edges of J is d * (k + 1) + c; 4. the degree of s in J is d; 5. no other vertex in J has the same open neighborhood as s (i.e., ∀ v, J.neighborSet v = J.neighborSet s → v = s); and b equals (∑ u : Fin (k + 1), ∑ v : Fin (k + 1), if J.neighborSet u = J.neighborSet v then 1 else 0) - 1 (the number of ordered pairs of vertices with identical open neighborhoods, minus 1).

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 core constant B(d, c), defined as the supremum of Q(J) - 1 over all marked core graphs (J, s) on k(d, c)+1 vertices. -/
noncomputable def core_constant_b (d c : ℕ) : ℕ :=
  let k := sparse_graph_state_fisher_core_k d c
  sSup { b | ∃ (J : SimpleGraph (Fin (k + 1))) (s : Fin (k + 1)),
    is_marked_core_graph k d c J s ∧ b = graph_state_fisher_q J - 1 }
See it in the graphDiscuss this resultChallenge it