seed_tree_2
seed_tree_2 is the simple graph on Fin 16 whose edges are (1, 0), (1, 2), (1, 7), (0, 8), (2, 3), (2, 6), (3, 4), (4, 5), (8, 9), (8, 13), (8, 15), (9, 10), (10, 11), (10, 12), and (13, 14).
Statement
def seed_tree_2 : SimpleGraph (Fin 16)- Defined in
- knowledgebase: OP-828; arXiv:2511.19585; arXiv:2610.26814
- Verified
- 02 Nov 2026
- Axioms
- none listed
- Used by 1
- chain_tree_2For any k, chain_tree_2 k is the graph formed by joining k copies of seed_tree_2 in a chain at vertex 1.
Read back from the Lean
seed_tree_2 is defined as the simple graph on the vertex type Fin 16 obtained via SimpleGraph.fromRel from the relation specifying directed edges given by the 15 pairs:
- (1, 0)
- (1, 2)
- (1, 7)
- (0, 8)
- (2, 3)
- (2, 6)
- (3, 4)
- (4, 5)
- (8, 9)
- (8, 13)
- (8, 15)
- (9, 10)
- (10, 11)
- (10, 12)
- (13, 14)
That is, two vertices u, v : Fin 16 are adjacent in seed_tree_2 if and only if u ≠ v and either (u, v) or (v, u) belongs to that list of pairs.
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 16-vertex seed tree T' with edges [(1, 0), (1, 2), (1, 7), (0, 8), (2, 3), (2, 6), (3, 4), (4, 5), (8, 9), (8, 13), (8, 15), (9, 10), (10, 11), (10, 12), (13, 14)]. -/ def seed_tree_2 : SimpleGraph (Fin 16) := SimpleGraph.fromRel (fun u v => (u, v) ∈ [ (⟨1, by omega⟩, ⟨0, by omega⟩), (⟨1, by omega⟩, ⟨2, by omega⟩), (⟨1, by omega⟩, ⟨7, by omega⟩), (⟨0, by omega⟩, ⟨8, by omega⟩), (⟨2, by omega⟩, ⟨3, by omega⟩), (⟨2, by omega⟩, ⟨6, by omega⟩), (⟨3, by omega⟩, ⟨4, by omega⟩), (⟨4, by omega⟩, ⟨5, by omega⟩), (⟨8, by omega⟩, ⟨9, by omega⟩), (⟨8, by omega⟩, ⟨13, by omega⟩), (⟨8, by omega⟩, ⟨15, by omega⟩), (⟨9, by omega⟩, ⟨10, by omega⟩), (⟨10, by omega⟩, ⟨11, by omega⟩), (⟨10, by omega⟩, ⟨12, by omega⟩), (⟨13, by omega⟩, ⟨14, by omega⟩) ])