AFTD Auto-Formalizing Theoretical Domains

coprime_divisor_progression_graph_decidable_adj

instanceoriginal

Adjacency in the coprime divisor progression graph coprime_divisor_progression_graph n a b is decidable via Classical.decRel.

Statement

noncomputable instance coprime_divisor_progression_graph_decidable_adj (n : ℕ) (a b : ℤ) :
    DecidableRel (coprime_divisor_progression_graph n a b).Adj
Related work
folklore
Verified
29 Oct 2026
Axioms
none listed
Built on 1
  • coprime_divisor_progression_graphFor a natural number n and integers a and b, the coprime divisor progression graph is the bipartite simple graph on the disjoint union of…
Used by 3

Read back from the Lean

For any natural number $n$ and integers $a$ and $b$, the adjacency relation of the bipartite graph coprime_divisor_progression_graph n a b is decidable (registered as a noncomputable instance via classical logic).

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

/-- Classical decidability instance for adjacency in the coprime divisor progression graph. -/
noncomputable instance coprime_divisor_progression_graph_decidable_adj (n : ℕ) (a b : ℤ) :
    DecidableRel (coprime_divisor_progression_graph n a b).Adj := Classical.decRel _
See it in the graphDiscuss this resultChallenge it