AFTD Auto-Formalizing Theoretical Domains

GtVertex

inductive

The 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 (size t).

Statement

inductive GtVertex (t : ℕ) : Type
Defined in
arXiv:2611.11352 Definition 2
Verified
10 Nov 2026
Axioms
none listed
Used by 4
  • 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.
  • gt_graphThe simple graph gt_graph t on vertex type GtVertex t, defined as SimpleGraph.fromRel (gt_adj t).
  • 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…

Read back from the Lean

For any natural number t, GtVertex t is an inductive type whose terms are formed by seven constructors: - A i where i : Fin 3 (3 elements) - B i where i : Fin 2 (2 elements) - C i where i : Fin 2 (2 elements) - D i where i : Fin 3 (3 elements) - P i where i : Fin t (t elements) - Q i where i : Fin t (t elements) - R i where i : Fin t (t elements) It derives instances for DecidableEq (GtVertex t) and Fintype (GtVertex t) (with total cardinality 10 + 3t).

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

/-- Vertex set of the graph G_t. -/
inductive GtVertex (t : ℕ) : Type | A (i : Fin 3)
  | B (i : Fin 2)
  | C (i : Fin 2)
  | D (i : Fin 3)
  | P (i : Fin t)
  | Q (i : Fin t)
  | R (i : Fin t)
deriving DecidableEq, Fintype
See it in the graphDiscuss this resultChallenge it