AFTD Auto-Formalizing Theoretical Domains

digraph_d2_tilde

def

The directed graph D̃₂ represented as a bundled Digraph DigraphD2TildeVertex with adjacency relation fun a b => digraph_d2_tilde_adj_bool a b = true.

Statement

def digraph_d2_tilde : Digraph 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 is a directed graph on the vertex type DigraphD2TildeVertex whose adjacency relation Adj a b holds if and only if digraph_d2_tilde_adj_bool a b = 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 directed graph D̃₂ obtained from D₂ by adding edge u₁ → u₂. -/
def digraph_d2_tilde : Digraph DigraphD2TildeVertex where Adj a b := digraph_d2_tilde_adj_bool a b = true
See it in the graphDiscuss this resultChallenge it