is_realizable_intersection_array
An intersection array (b, c) with b, c : Fin d → ℕ of diameter d is realizable if there exists a finite nonempty vertex type V and a simple graph G on V such that is_distance_regular_with G d b c holds.
Statement
def is_realizable_intersection_array (d : ℕ) (b c : Fin d → ℕ) : Prop
- Defined in
- arXiv:2611.05762, Sec. 3.1 & Problem 9.2.1
- Verified
- 05 Nov 2026
- Axioms
- none listed
- Built on 1
- is_distance_regular_withA simple graph G on vertex type V is a distance-regular graph with diameter d : ℕ and intersection parameters b, c : Fin d → ℕ if: G is…
Read back from the Lean
A parameter triple (d, b, c), where d : ℕ and b, c : Fin d → ℕ, satisfies is_realizable_intersection_array d b c if and only if there exist:
1. a finite, nonempty type V (in Type), and
2. a simple graph G on V,
such that all of the following hold:
- G is connected;
- the diameter of G (G.diam) is equal to d;
- for every i : Fin d and for all vertices x, y : V, if the graph distance G.dist x y equals i.val, then the number of vertices z : V that are adjacent to y and have G.dist x z = i.val + 1 is equal to b i;
- for every i : Fin d and for all vertices x, y : V, if the graph distance G.dist x y equals i.val + 1, then the number of vertices z : V that are adjacent to y and have G.dist x z = i.val is equal to c i.
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
/-- An intersection array is realizable if there exists a finite nonempty distance-regular graph with that intersection array. -/ def is_realizable_intersection_array (d : ℕ) (b c : Fin d → ℕ) : Prop := ∃ (V : Type) (_ : Fintype V) (_ : Nonempty V), ∃ (G : SimpleGraph V), is_distance_regular_with G d b c