AFTD Auto-Formalizing Theoretical Domains

simple_graph_or_power

def

The n-th OR-power (co-normal power) G^{∨n} of a simple graph G has vertex set Fin n → V, with an edge between two functions if they are adjacent in at least one coordinate.

Statement

def simple_graph_or_power {V : Type*} (G : SimpleGraph V) (n : ℕ) : SimpleGraph (Fin n → V)
Defined in
arXiv:2610.41977 eq. (1.1)
Verified
03 Nov 2026
Axioms
none listed
Used by 6

Read back from the Lean

Given a type V, a simple graph G with vertices in V, and a natural number n, simple_graph_or_power G n is the simple graph on the vertex type Fin n → V where two vertices (functions) x, y : Fin n → V are adjacent if and only if there exists some index i : Fin n such that x i and y i are adjacent in G.

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 n-th OR-power (co-normal power) of a simple graph. -/
def simple_graph_or_power {V : Type*} (G : SimpleGraph V) (n : ℕ) : SimpleGraph (Fin n → V) := {
  Adj := fun x y => ∃ i : Fin n, G.Adj (x i) (y i)
  symm.symm := fun x y => by simp [SimpleGraph.adj_comm]
}
See it in the graphDiscuss this resultChallenge it