is_graphon
def
A function W : ℝ → ℝ → ℝ is a graphon if it is a digraphon and is symmetric, meaning W x y = W y x for all x, y.
Statement
def is_graphon (W : ℝ → ℝ → ℝ) : Prop
- Defined in
- arXiv:2611.17885 Section 1
- Verified
- 16 Nov 2026
- Axioms
- none listed
- Built on 1
- is_digraphonA 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…
Read back from the Lean
A function W : ℝ → ℝ → ℝ satisfies is_graphon if and only if it satisfies is_digraphon and is symmetric (for all x, y : ℝ, W x y = W y x).
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 graphon is a symmetric measurable [0, 1]-valued function on the unit square. -/ def is_graphon (W : ℝ → ℝ → ℝ) : Prop := is_digraphon W ∧ (∀ x y, W x y = W y x)