seed_tree_1
seed_tree_1 is the simple graph on Fin 16 whose edges are (1, 0), (1, 2), (1, 7), (1, 8), (0, 9), (2, 3), (2, 6), (3, 4), (4, 5), (9, 10), (9, 14), (10, 11), (11, 12), (11, 13), and (14, 15).
Statement
def seed_tree_1 : 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_1For any k, chain_tree_1 k is the graph formed by joining k copies of seed_tree_1 in a chain at vertex 9.
Read back from the Lean
seed_tree_1 is defined as the simple graph on the vertex set Fin 16 (the vertices 0 through 15) constructed from the symmetric closure of the relation containing the 15 directed pairs: (1, 0), (1, 2), (1, 7), (1, 8), (0, 9), (2, 3), (2, 6), (3, 4), (4, 5), (9, 10), (9, 14), (10, 11), (11, 12), (11, 13), and (14, 15). Two vertices u and v in Fin 16 are adjacent if and only if u ≠ v and {u, v} is one of the 15 undirected edges: {0, 1}, {1, 2}, {1, 7}, {1, 8}, {0, 9}, {2, 3}, {2, 6}, {3, 4}, {4, 5}, {9, 10}, {9, 14}, {10, 11}, {11, 12}, {11, 13}, or {14, 15}.
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), (1, 8), (0, 9), (2, 3), (2, 6), (3, 4), (4, 5), (9, 10), (9, 14), (10, 11), (11, 12), (11, 13), (14, 15)]. -/ def seed_tree_1 : 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⟩), (⟨1, by omega⟩, ⟨8, by omega⟩), (⟨0, by omega⟩, ⟨9, 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⟩), (⟨9, by omega⟩, ⟨10, by omega⟩), (⟨9, by omega⟩, ⟨14, by omega⟩), (⟨10, by omega⟩, ⟨11, by omega⟩), (⟨11, by omega⟩, ⟨12, by omega⟩), (⟨11, by omega⟩, ⟨13, by omega⟩), (⟨14, by omega⟩, ⟨15, by omega⟩) ])