AFTD Auto-Formalizing Theoretical Domains

gt_graph

def

The simple graph gt_graph t on vertex type GtVertex t, defined as SimpleGraph.fromRel (gt_adj t).

Statement

def gt_graph (t : ℕ) : SimpleGraph (GtVertex t)
Defined in
arXiv:2611.11352 Definition 2
Verified
10 Nov 2026
Axioms
none listed
Built on 2
  • gt_adjThe adjacency relation gt_adj t on GtVertex t: vertices u and v are adjacent if and only if (u is in A and v is in B, or vice versa), (u…
  • GtVertexThe vertex set of the graph G_t partitioned into blocks A (size 3), B (size 2), C (size 2), D (size 3), P (size t), Q (size t), and R…
Used by 2
  • gt_total_forcing_poly_eqFor every integer t ≥ 24, the total forcing polynomial of gt_graph t is equal to the zero forcing polynomial of gt_graph t.
  • gt_connected_forcing_poly_eqFor every integer t ≥ 24, the connected forcing polynomial of gt_graph t is equal to the zero forcing polynomial of gt_graph t.

Read back from the Lean

Given a natural number $t$, gt_graph t defines the simple graph on the vertex set GtVertex t whose adjacency relation is induced by gt_adj t. The vertex set GtVertex t is the disjoint union of seven sets: - $A$ with 3 vertices (indexed by Fin 3) - $B$ with 2 vertices (indexed by Fin 2) - $C$ with 2 vertices (indexed by Fin 2) - $D$ with 3 vertices (indexed by Fin 3) - $P$ with $t$ vertices (indexed by Fin t) - $Q$ with $t$ vertices (indexed by Fin t) - $R$ with $t$ vertices (indexed by Fin t) Two vertices $u$ and $v$ are adjacent in gt_graph t if and only if: - one is in $A$ and the other is in $B$; - one is in $B$ and the other is in $C$; - one is in $C$ and the other is in $D$; - one is in $A \cup B \cup C \cup D$ and the other is in $P \cup Q \cup R$; - one is in $P$ and the other is in $Q$; - one is in $P$ and the other is in $R$; - one is in $Q$ and the other is in $R$; or - both are distinct vertices in $R$ (i.e., $R(i)$ and $R(j)$ with $i \neq j$). No other pairs of vertices are adjacent (in particular, $A, B, C, D, P, Q$ are each independent sets, and there are no edges between $A$ and $C$, $A$ and $D$, or $B$ and $D$).

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 simple graph G_t. -/
def gt_graph (t : ℕ) : SimpleGraph (GtVertex t) := SimpleGraph.fromRel (gt_adj t)
See it in the graphDiscuss this resultChallenge it