dephased_path_free_component
For 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 satisfies u.1 ∉ dephased_path_marked n S.
Statement
def dephased_path_free_component (n : ℕ) (S : Finset (Fin n)) (c : (dephased_path_aux_graph n S).ConnectedComponent) : Prop
- Defined in
- arXiv:2511.19585, Monogamy of Mutual Information in Graph States
- Verified
- 02 Nov 2026
- Axioms
- none listed
- Built on 2
- dephased_path_aux_graphFor 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…
- dephased_path_markedFor 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…
- Used by 1
- 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…
Read back from the Lean
For a given natural number n, a subset S ⊆ Fin n, and a connected component c of the auxiliary graph dephased_path_aux_graph n S (the graph on vertex set S where two distinct vertices are adjacent if they share a common neighbor in Fin n \ S in pathGraph n), dephased_path_free_component n S c is the proposition that every vertex u ∈ S belonging to component c is not in dephased_path_marked n S. That is, no vertex in c has an external neighbor v ∈ Fin n \ S for which it is the unique neighbor in 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 that a connected component of the auxiliary graph contains no marked vertex. -/ def dephased_path_free_component (n : ℕ) (S : Finset (Fin n)) (c : (dephased_path_aux_graph n S).ConnectedComponent) : Prop := ∀ u : S, (dephased_path_aux_graph n S).connectedComponentMk u = c → u.1 ∉ dephased_path_marked n S