AFTD Auto-Formalizing Theoretical Domains

digraph_d2_tilde_graph

def

The underlying simple graph of the directed graph D̃₂, defined on DigraphD2TildeVertex as SimpleGraph.fromRel (fun a b => digraph_d2_tilde_adj_bool a b = true).

Statement

def digraph_d2_tilde_graph : SimpleGraph DigraphD2TildeVertex
Defined in
arXiv:2611.15027 Section 5
Verified
15 Nov 2026
Axioms
none listed
Built on 2
  • DigraphD2TildeVertexThe 6-element vertex type of the directed graph D̃₂, consisting of two base vertices u₁, u₂ and four vertices indexed by sign vectors in…
  • 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 εᵢ…

Read back from the Lean

The definition digraph_d2_tilde_graph defines an undirected simple graph on the 6-element type DigraphD2TildeVertex whose adjacency relation is the symmetrized relation obtained from digraph_d2_tilde_adj_bool via SimpleGraph.fromRel: two vertices a and b are adjacent if and only if a ≠ b and (digraph_d2_tilde_adj_bool a b = true or digraph_d2_tilde_adj_bool b a = true).

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 underlying simple graph of the directed graph D̃₂. -/
def digraph_d2_tilde_graph : SimpleGraph DigraphD2TildeVertex := SimpleGraph.fromRel (fun a b => digraph_d2_tilde_adj_bool a b = true)
See it in the graphDiscuss this resultChallenge it