pair_digraph_adj
def
Two pairs P and Q of vertices form a directed arc P → Q in the pair digraph D(G) of a 3-uniform hypergraph G if both have cardinality 2 and every vertex of Q belongs to the neighborhood of P, so P ∪ {v} is an edge of G for each v in Q.
Statement
def pair_digraph_adj {α : Type*} [DecidableEq α] (G : Finset (Finset α)) (P Q : Finset α) : Prop
- Defined in
- arXiv:2611.16654 Section 2
- Verified
- 14 Nov 2026
- Axioms
- none listed
- Used by 3
- zycle_hom_implies_closed_walkIf f : ZMod ℓ × Fin 2 → α is a hypergraph homomorphism is_hypergraph_hom from the zycle Z_ℓ to a 3-uniform hypergraph G : Finset (Finset…
- zycle_not_div_three_no_hom_tripartite_turanLet ℓ ≥ 2 be an integer with 3 ∤ ℓ. For any family of pairwise disjoint finite sets V : ZMod 3 → Finset α, there is no function f : ZMod ℓ…
- tripartite_turan_pair_digraph_no_closed_walkFor any family of pairwise disjoint finite sets V : ZMod 3 → Finset α and any integer ℓ with 3 ∤ ℓ, there is no closed walk W : ZMod ℓ →…
Read back from the Lean
Given a type α with decidable equality, a collection of finite sets G : Finset (Finset α), and two finite sets P, Q : Finset α, pair_digraph_adj G P Q asserts that:
1. P has cardinality 2,
2. Q has cardinality 2, and
3. for every element v ∈ Q, the set P ∪ {v} is an element of G.
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
/-- Directed adjacency in the pair digraph D(G) of a 3-uniform hypergraph: pair Q is contained in the common neighborhood of pair P. -/ def pair_digraph_adj {α : Type*} [DecidableEq α] (G : Finset (Finset α)) (P Q : Finset α) : Prop := P.card = 2 ∧ Q.card = 2 ∧ ∀ v ∈ Q, P ∪ {v} ∈ G