AFTD Auto-Formalizing Theoretical Domains

is_marked_core_graph

deforiginal

For 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 that J is connected and triangle-free, J has d * (k + 1) + c edges, the marked vertex s has degree d, and the open-neighborhood equivalence class of s is the singleton {s} (that is, any vertex with the same neighbor set as s is equal to s).

Statement

def is_marked_core_graph (k d c : ℕ)
    (J : SimpleGraph (Fin (k + 1)))
    (s : Fin (k + 1)) : Prop
Related work
arXiv:2611.08593
Verified
13 Nov 2026
Axioms
none listed
Used by 1
  • core_constant_bFor 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…

Read back from the Lean

A definition stating that for natural numbers $k, d, c$, a simple graph $J$ on the vertex type $\mathrm{Fin}(k + 1)$, and a vertex $s : \mathrm{Fin}(k + 1)$, the property is_marked_core_graph k d c J s holds if and only if all of the following conditions are satisfied: 1. $J$ is connected (J.Connected). 2. $J$ is triangle-free, i.e., contains no clique of size 3 (J.CliqueFree 3). 3. The number of edges of $J$ (the cardinality of J.edgeSet) equals $d(k + 1) + c$. 4. The degree of $s$ (the cardinality of J.neighborSet s) equals $d$. 5. For all vertices $v : \mathrm{Fin}(k + 1)$, if the neighbor set of $v$ equals the neighbor set of $s$, then $v = s$ (i.e., no other vertex has the same open neighborhood as $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

/-- Predicate asserting that a pair (J, s) of a simple graph J on Fin (k+1) and a vertex s is a marked core graph with parameters k, d, c. -/
def is_marked_core_graph (k d c : ℕ)
    (J : SimpleGraph (Fin (k + 1)))
    (s : Fin (k + 1)) : Prop :=
  J.Connected ∧
  J.CliqueFree 3 ∧
  Nat.card J.edgeSet = d * (k + 1) + c ∧
  Nat.card (J.neighborSet s) = d ∧
  (∀ v : Fin (k + 1), J.neighborSet v = J.neighborSet s → v = s)
See it in the graphDiscuss this resultChallenge it