AFTD Auto-Formalizing Theoretical Domains

order_graph_edges_ge

def

Given an order graph G of dimension d and a natural number m, order_graph_edges_ge G m is the subset of edges e ∈ G.E such that m ≤ order_pos e.1 e.2.

Statement

def order_graph_edges_ge {d : ℕ} (G : OrderGraph d) (m : ℕ) : Finset (Order d × Fin d)
Defined in
arXiv:2610.39311 Theorem 6
Verified
31 Oct 2026
Axioms
none listed
Built on 3
  • OrderGraphAn order graph of dimension d is a structure consisting of a finite set V of orders of Fin d and a finite set E of edges (π, a) where π :…
  • OrderAn order of dimension d is a permutation of the attribute set {0, ..., d-1}, represented as a list without duplicates containing all…
  • order_posThe 1-based position of attribute a in order π, taking values in {1, ..., d}.
Used by 1

Read back from the Lean

Given an implicit natural number d, an OrderGraph d G, and a natural number m, order_graph_edges_ge G m is defined as the finset of edges e ∈ G.E such that m ≤ order_pos e.1 e.2.

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 set of edges (ν, a) in G with pos_ν(a) ≥ m. -/
def order_graph_edges_ge {d : ℕ} (G : OrderGraph d) (m : ℕ) : Finset (Order d × Fin d) := G.E.filter (fun e => m ≤ order_pos e.1 e.2)
See it in the graphDiscuss this resultChallenge it