AFTD Auto-Formalizing Theoretical Domains

dephased_path_marked

def

For n : ℕ and S : Finset (Fin n), dephased_path_marked n S is the Finset (Fin n) of vertices u ∈ S for which there exists a vertex v : Fin n not in S whose neighbor finset in SimpleGraph.pathGraph n intersected with S equals {u}.

Statement

def dephased_path_marked (n : ℕ) (S : Finset (Fin n)) : Finset (Fin n)
Defined in
arXiv:2511.19585, Monogamy of Mutual Information in Graph States
Verified
02 Nov 2026
Axioms
none listed
Built on 1
Used by 1
  • dephased_path_free_componentFor n : ℕ and S : Finset (Fin n), a connected component c of dephased_path_aux_graph n S is free if every vertex u : S in the component…

Read back from the Lean

The function dephased_path_marked takes a natural number $n$ and a finite subset $S \subseteq \mathrm{Fin}(n)$, and returns the sub-finset of all vertices $u \in S$ such that there exists a vertex $v \in \mathrm{Fin}(n)$ not in $S$ whose only neighbor in $S$ (with respect to the path graph on $n$ vertices, SimpleGraph.pathGraph n) is $u$.

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

/-- Marked vertices in S, which are the unique S-neighbors of vertices outside S. -/
def dephased_path_marked (n : ℕ) (S : Finset (Fin n)) : Finset (Fin n) := S.filter fun u => ∃ v : Fin n, v ∉ S ∧ ((SimpleGraph.pathGraph n).neighborFinset v ∩ S = {u})
See it in the graphDiscuss this resultChallenge it