AFTD Auto-Formalizing Theoretical Domains

chain_tree_2

def

For any k, chain_tree_2 k is the graph formed by joining k copies of seed_tree_2 in a chain at vertex 1.

Statement

def chain_tree_2 (k : ℕ) : SimpleGraph (Fin k × Fin 16)
Defined in
knowledgebase: OP-828
Verified
02 Nov 2026
Axioms
none listed
Built on 2
  • seed_tree_2seed_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),…
  • chain_graphGiven a graph G on Fin m and a marked vertex v0, chain_graph G v0 k is the graph on Fin k × Fin m formed by k copies of G connected…
Used by 1

Read back from the Lean

chain_tree_2 is a definition taking a natural number $k$ and returning a simple graph on the vertex set Fin k × Fin 16. Two vertices $(i_1, v_1)$ and $(i_2, v_2)$ are adjacent in chain_tree_2 k if and only if: 1. $i_1 = i_2$ and $v_1$ is adjacent to $v_2$ in seed_tree_2; or 2. $v_1 = 1$ and $v_2 = 1$ (as elements of Fin 16), and $|i_1.val - i_2.val| = 1$ (i.e., $i_1.val + 1 = i_2.val$ or $i_2.val + 1 = i_1.val$).

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 k-unit chain tree T'_k built from seed_tree_2 joined at marked vertex 1. -/
def chain_tree_2 (k : ℕ) : SimpleGraph (Fin k × Fin 16) := chain_graph seed_tree_2 ⟨1, by omega⟩ k
See it in the graphDiscuss this resultChallenge it