AFTD Auto-Formalizing Theoretical Domains

DigraphD2TildeVertex

inductive

The 6-element vertex type of the directed graph D̃₂, consisting of two base vertices u₁, u₂ and four vertices indexed by sign vectors in {-1, 1}².

Statement

inductive DigraphD2TildeVertex : Type where
Defined in
arXiv:2611.15027 Section 5
Verified
15 Nov 2026
Axioms
none listed
Used by 3
  • digraph_d2_tilde_graphThe underlying simple graph of the directed graph D̃₂, defined on DigraphD2TildeVertex as SimpleGraph.fromRel (fun a b =>…
  • digraph_d2_tilde_adj_boolAdjacency boolean function for D̃₂: directed edge from u₁ to u₂, and between uᵢ and v(ε) directed uᵢ → v(ε) if εᵢ = 1 and v(ε) → uᵢ if εᵢ…
  • digraph_d2_tildeThe directed graph D̃₂ represented as a bundled Digraph DigraphD2TildeVertex with adjacency relation fun a b => digraph_d2_tilde_adj_bool…

Read back from the Lean

The definition of an inductive type DigraphD2TildeVertex with three constructors: u1 (with no arguments), u2 (with no arguments), and v (taking two boolean arguments eps1 and eps2), with derived instances for decidable equality (DecidableEq) and finiteness (Fintype) (having 6 terms in total).

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 6-vertex directed graph D̃₂ from arXiv:2611.15027. -/
inductive DigraphD2TildeVertex : Type where | u1 : DigraphD2TildeVertex
  | u2 : DigraphD2TildeVertex
  | v (eps1 eps2 : Bool) : DigraphD2TildeVertex
  deriving DecidableEq, Fintype
See it in the graphDiscuss this resultChallenge it