AFTD Auto-Formalizing Theoretical Domains

is_locally_dense

def

A graph G is (ρ, d)-dense if every vertex subset U of size at least ρ * |V(G)| spans at least (d / 2) * |U|^2 edges.

Statement

def is_locally_dense {β : Type*} [Fintype β]
    (G : SimpleGraph β) (ρ d : ℝ) : Prop
Defined in
arXiv:2610.13820, Section 1
Verified
26 Oct 2026
Axioms
none listed
Used by 1
  • is_knrsA graph F has the KNRS property if for every d in (0, 1] and every ε > 0, there exists ρ > 0 and n₀ such that every (ρ, d)-dense graph G…

Read back from the Lean

Given a finite type β, a simple graph G on β, and real numbers ρ and d, is_locally_dense G ρ d is defined as: for all finsets U of β, if ρ * (Fintype.card β : ℝ) ≤ (U.card : ℝ), then (d / 2) * (U.card : ℝ) ^ 2 ≤ (Nat.card (G.induce (U : Set β)).edgeSet : ℝ). In words: every vertex subset U with at least ρ * |β| vertices induces a subgraph with at least (d / 2) * |U|^2 edges.

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

/-- A graph G is (ρ, d)-dense if every vertex subset U of size at least ρ * |V(G)| spans at least (d / 2) * |U|^2 edges. -/
def is_locally_dense {β : Type*} [Fintype β]
    (G : SimpleGraph β) (ρ d : ℝ) : Prop := ∀ (U : Finset β), ρ * (Fintype.card β : ℝ) ≤ (U.card : ℝ) →
    (d / 2) * (U.card : ℝ) ^ 2 ≤ (Nat.card (G.induce (U : Set β)).edgeSet : ℝ)
See it in the graphDiscuss this resultChallenge it