AFTD Auto-Formalizing Theoretical Domains

is_digraphon

def

A function W : ℝ → ℝ → ℝ is a digraphon if for all x, y ∈ [0, 1] we have 0 ≤ W x y ∧ W x y ≤ 1, and the uncurried function Function.uncurry W is measurable on ℝ × ℝ.

Statement

def is_digraphon (W : ℝ → ℝ → ℝ) : Prop
Defined in
arXiv:2611.15027 Section 2
Verified
15 Nov 2026
Axioms
none listed
Used by 3
  • is_os_oriented_starAn oriented star with center c is oriented Sidorenko (OS) if for every digraphon W, its density in W is at least its density in (W + W^T)…
  • oriented_star_one_edge_os_and_oasIf an oriented star D has one edge (two vertices), then D is both OS and OAS.
  • is_oas_oriented_starAn oriented star with center c is oriented anti-Sidorenko (OAS) if for every digraphon W, its density in W is at most its density in (W +…

Read back from the Lean

A function W : ℝ → ℝ → ℝ satisfies is_digraphon W if and only if both of the following hold: 1. For all real numbers x and y, if x ∈ [0, 1] and y ∈ [0, 1], then 0 ≤ W x y and W x y ≤ 1. 2. The uncurried function (x, y) ↦ W x y is Borel measurable as a map from ℝ × ℝ to ℝ.

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

/-- Predicate for a function W : ℝ → ℝ → ℝ to be a digraphon on [0,1]². -/
def is_digraphon (W : ℝ → ℝ → ℝ) : Prop := (∀ x y, x ∈ Set.Icc (0 : ℝ) 1 → y ∈ Set.Icc (0 : ℝ) 1 → 0 ≤ W x y ∧ W x y ≤ 1) ∧
  Measurable (Function.uncurry W)
See it in the graphDiscuss this resultChallenge it