AFTD Auto-Formalizing Theoretical Domains

digraph_d2_tilde_adj_bool

def

Adjacency boolean function for D̃₂: directed edge from u₁ to u₂, and between uᵢ and v(ε) directed uᵢ → v(ε) if εᵢ = 1 and v(ε) → uᵢ if εᵢ = -1.

Statement

def digraph_d2_tilde_adj_bool : DigraphD2TildeVertex → DigraphD2TildeVertex → Bool
Defined in
arXiv:2611.15027 Section 5
Verified
15 Nov 2026
Axioms
none listed
Built on 1
  • 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…
Used by 2
  • digraph_d2_tilde_graphThe underlying simple graph of the directed graph D̃₂, defined on DigraphD2TildeVertex as SimpleGraph.fromRel (fun a b =>…
  • 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

Definition of a function digraph_d2_tilde_adj_bool : DigraphD2TildeVertex → DigraphD2TildeVertex → Bool that assigns a boolean adjacency value to pairs of vertices (a, b). It returns true if and only if: - a = .u1 and b = .u2, - a = .u1 and b = .v true eps2 for some eps2 : Bool, - a = .v false eps2 for some eps2 : Bool and b = .u1, - a = .u2 and b = .v eps1 true for some eps1 : Bool, or - a = .v eps1 false for some eps1 : Bool and b = .u2; and returns false for all other pairs (a, b).

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

/-- Boolean adjacency relation for the directed graph D̃₂. -/
def digraph_d2_tilde_adj_bool : DigraphD2TildeVertex → DigraphD2TildeVertex → Bool := fun a b =>
  match a, b with
  | .u1, .u2 => true
  | .u1, .v true _ => true
  | .v false _, .u1 => true
  | .u2, .v _ true => true
  | .v _ false, .u2 => true
  | _, _ => false
See it in the graphDiscuss this resultChallenge it