AFTD Auto-Formalizing Theoretical Domains

dephased_path_aux_graph

def

For n : ℕ and a finset S : Finset (Fin n), the auxiliary graph dephased_path_aux_graph n S is the SimpleGraph on the subtype S in which two distinct vertices u, w : S are adjacent if and only if there exists a vertex v : Fin n outside S that is adjacent in SimpleGraph.pathGraph n to both u.1 and w.1.

Statement

def dephased_path_aux_graph (n : ℕ) (S : Finset (Fin n)) : SimpleGraph S
Defined in
arXiv:2511.19585, Monogamy of Mutual Information in Graph States
Verified
02 Nov 2026
Axioms
none listed
Used by 2
  • dephased_path_entropyFor n : ℕ, q : Fin n → ℝ, and S : Finset (Fin n), dephased_path_entropy n q S is defined as (S.card : ℝ) - (free.card : ℝ) plus the sum…
  • 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

Given a natural number n and a finset S of Fin n, dephased_path_aux_graph n S is the simple graph with vertex type S (the subtype {x : Fin n // x ∈ S}) whose adjacency relation is defined by: two vertices u, w : S are adjacent if and only if u ≠ w and there exists some vertex v : Fin n such that v ∉ S, v is adjacent to u.1 in SimpleGraph.pathGraph n, and v is adjacent to w.1 in SimpleGraph.pathGraph n.

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

/-- Auxiliary graph on a subset S of a path graph, joining neighbors in S of outside vertices with two neighbors in S. -/
def dephased_path_aux_graph (n : ℕ) (S : Finset (Fin n)) : SimpleGraph S := SimpleGraph.mk (fun u w => u ≠ w ∧ ∃ v : Fin n, v ∉ S ∧ (SimpleGraph.pathGraph n).Adj v u.1 ∧ (SimpleGraph.pathGraph n).Adj v w.1)
See it in the graphDiscuss this resultChallenge it