modified_block_clique_graph
The modified block-clique graph K_v^*(D) of a block design with blocks indexed by B and points in X has vertex set X ⊕ (B × Fin k), with clique edges between local vertices of the same block and matching edges between local vertices and their corresponding points.
Statement
def modified_block_clique_graph {X B : Type*} {k : ℕ} (block_pts : B → Fin k → X) : SimpleGraph (X ⊕ (B × Fin k))
- Defined in
- arXiv:2611.05762 Sec 6.9
- Verified
- 08 Nov 2026
- Axioms
- none listed
Read back from the Lean
Given types X and B, a natural number k, and a function block_pts : B → Fin k → X, modified_block_clique_graph is the simple graph with vertex set X ⊕ (B × Fin k) whose adjacency relation is defined as:
- no two vertices in X (Sum.inl) are adjacent;
- a vertex Sum.inl x and a vertex Sum.inr (b, j) are adjacent if and only if block_pts b j = x;
- two vertices Sum.inr (b1, j1) and Sum.inr (b2, j2) are adjacent if and only if b1 = b2 and j1 ≠ j2.
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
/-- The modified block-clique graph K_v^*(D) of a block design on vertex set X ⊕ (B × Fin k). -/ def modified_block_clique_graph {X B : Type*} {k : ℕ} (block_pts : B → Fin k → X) : SimpleGraph (X ⊕ (B × Fin k)) where Adj | Sum.inl _, Sum.inl _ => False | Sum.inl x, Sum.inr ⟨b, j⟩ => block_pts b j = x | Sum.inr ⟨b, j⟩, Sum.inl x => block_pts b j = x | Sum.inr ⟨b1, j1⟩, Sum.inr ⟨b2, j2⟩ => b1 = b2 ∧ j1 ≠ j2 symm := ⟨by intro u v h rcases u with x | ⟨b1, j1⟩ <;> rcases v with y | ⟨b2, j2⟩ · exact False.elim h · exact h · exact h · exact ⟨h.1.symm, h.2.symm⟩⟩ loopless := ⟨by intro u h rcases u with x | ⟨b, j⟩ · exact h · exact h.2 rfl⟩