AFTD Auto-Formalizing Theoretical Domains

graph_lly_curvature_tendsto

theoremverifiedformalization

In a finite connected graph, for x ≠ y, κ_α(x, y)/(1 − α) converges as α → 1⁻, to κ_LLY(x, y): the limit in the definition of the Lin–Lu–Yau curvature exists.

Statement

theorem graph_lly_curvature_tendsto {V : Type*} [Fintype V] [DecidableEq V]
    (G : SimpleGraph V) [DecidableRel G.Adj] (hG : G.Connected) (x y : V) (hxy : x ≠ y) :
    Filter.Tendsto (fun α => graph_ollivier_curvature G α x y / (1 - α))
      (nhdsWithin 1 (Set.Iio 1)) (nhds (graph_lly_curvature G x y))
Formalizes
arXiv:2610.10559 (Edge-Connectivity versus Lin--Lu--Yau Curvature), Sec. 2.2: existence of the limit in Definition 2.3 (quoted there from its reference [15]); finite connected graphs.
Verified
10 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 4
Used by 3

The proof, explained

The Lin–Lu–Yau curvature is defined as the limit of the rescaled Ollivier curvature κ_α(x, y) / (1 - α) as α → 1⁻. The rescaled curvature is monotone increasing on (0, 1) and bounded from above by 2 / d(x, y), so by the monotone convergence theorem for left limits (`MonotoneOn.tendsto_nhdsWithin_Ioo_left`), it converges as α → 1⁻ to its supremum. Unfolding the definition of `graph_lly_curvature` and applying `h.limUnder_eq` equates the definition with this limit.

  1. The rescaled curvature α ↦ κ_α(x, y) / (1 - α) converges as α → 1⁻ to the supremum of its values on (0, 1).

    We apply the monotone convergence theorem for left limits on an open interval (`MonotoneOn.tendsto_nhdsWithin_Ioo_left` with lower endpoint 0 and upper endpoint 1). The interval (0, 1) is non-empty because it contains 1/2 (checked by `norm_num`). Monotonicity of the quotient on (0, 1) is provided by `graph_ollivier_curvature_div_monotoneOn`. Finally, 2 / d(x, y) is an upper bound on (0, 1) by `graph_ollivier_curvature_div_le_two_div_dist`.

    lines 5–9

    uses MonotoneOn.tendsto_nhdsWithin_Ioo_left, graph_ollivier_curvature_div_monotoneOn, graph_ollivier_curvature_div_le_two_div_dist

      have h := MonotoneOn.tendsto_nhdsWithin_Ioo_left (y := (0 : ℝ)) (x := 1)
        ⟨1 / 2, by norm_num, by norm_num⟩ (graph_ollivier_curvature_div_monotoneOn G hG x y hxy)
        ⟨2 / (G.dist x y : ℝ), by
          rintro _ ⟨α, hα, rfl⟩
          exact graph_ollivier_curvature_div_le_two_div_dist G hG x y hxy α hα.1.le hα.2⟩
  2. The rescaled curvature converges to the Lin–Lu–Yau curvature κ_LLY(x, y) as α → 1⁻.

    We unfold the definition of `graph_lly_curvature`, which is defined as the filter limit (`limUnder`) of the rescaled curvature as α → 1⁻. Since convergence to the supremum was established in the hypothesis h, `h.limUnder_eq` identifies this `limUnder` with that supremum limit, which closes the goal with h.

    lines 10–12

    uses h.limUnder_eq

      unfold graph_lly_curvature
      rw [h.limUnder_eq]
      exact h
MonotoneOn.tendsto_nhdsWithin_Ioo_left
A function that is monotone on a non-empty open interval (y, x) and bounded above on that interval converges as its argument approaches x from the left to the supremum of its values on (y, x).
graph_ollivier_curvature_div_monotoneOn
In a connected graph, for any two distinct vertices x and y, the rescaled Ollivier curvature α ↦ κ_α(x, y)/(1 - α) is monotone increasing on the interval (0, 1).
graph_ollivier_curvature_div_le_two_div_dist
In a connected graph, for any two distinct vertices x and y and any α ∈ [0, 1), the rescaled Ollivier curvature κ_α(x, y)/(1 - α) is bounded above by 2/d(x, y).
h.limUnder_eq
If a function converges to a point along a filter in a Hausdorff space, its `limUnder` along that filter equals that limit point.

Written by a model (gemini-3.8-flash) from the Lean proof and the goal states Lean reported at each step. Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.

Lean source view module on GitHub

theorem graph_lly_curvature_tendsto {V : Type*} [Fintype V] [DecidableEq V]    (G : SimpleGraph V) [DecidableRel G.Adj] (hG : G.Connected) (x y : V) (hxy : x ≠ y) :    Filter.Tendsto (fun α => graph_ollivier_curvature G α x y / (1 - α))      (nhdsWithin 1 (Set.Iio 1)) (nhds (graph_lly_curvature G x y)) := by  have h := MonotoneOn.tendsto_nhdsWithin_Ioo_left (y := (0 : ℝ)) (x := 1)    ⟨1 / 2, by norm_num, by norm_num⟩ (graph_ollivier_curvature_div_monotoneOn G hG x y hxy)    ⟨2 / (G.dist x y : ℝ), by      rintro _ ⟨α, hα, rfl⟩      exact graph_ollivier_curvature_div_le_two_div_dist G hG x y hxy α hα.1.le hα.2⟩  unfold graph_lly_curvature  rw [h.limUnder_eq]  exact h
See it in the graphDiscuss this resultChallenge it