AFTD Auto-Formalizing Theoretical Domains

cubic_paley_graph_decidable_adj

instance

Adjacency in the cubic Paley graph over a finite ring with decidable equality is decidable.

Statement

instance cubic_paley_graph_decidable_adj (F : Type*) [CommRing F] [Fintype F] [DecidableEq F] :
    DecidableRel (cubic_paley_graph F).Adj
Source
decidability for cubic_paley_graph; serves OP-442
Verified
21 Oct 2026
Axioms
none listed
Built on 1
  • cubic_paley_graphG_3(q): vertex set F_q, with distinct x, y adjacent iff x − y ∈ (F_q^×)^3. Defined over any commutative ring; the difference of distinct…
Used by 4

Lean source view module on GitHub

instance cubic_paley_graph_decidable_adj (F : Type*) [CommRing F] [Fintype F] [DecidableEq F] :
    DecidableRel (cubic_paley_graph F).Adj :=
  fun x y => decidable_of_iff (x ≠ y ∧ ∃ z : F, x - y = z ^ 3) Iff.rfl
See it in the graphDiscuss this resultChallenge it