AFTD Auto-Formalizing Theoretical Domains

graph_lly_curvature_eq_of_ollivier_eq

theoremverified

If κ_α(x, y) = (1 − α)c for all α in an interval (a, 1), then κ_LLY(x, y) = c.

Statement

theorem graph_lly_curvature_eq_of_ollivier_eq {V : Type*} [Fintype V] [DecidableEq V]
    (G : SimpleGraph V) [DecidableRel G.Adj] (x y : V) (c a : ℝ) (ha : a < 1)
    (h : ∀ α, a < α → α < 1 → graph_ollivier_curvature G α x y = (1 - α) * c) :
    graph_lly_curvature G x y = c
Source
Helper for the refutation of OP-165 (arXiv:2610.10559, after Theorem 1.4).
Verified
10 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 2
Used by 4

The proof, explained

The Lin-Lu-Yau curvature κ_LLY(x, y) is defined as the left limit of κ_α(x, y) / (1 − α) as α approaches 1. Because the open interval (a, 1) is a left-neighborhood of 1, it suffices to show that this quotient is constantly c for all α ∈ (a, 1). Substituting the given Ollivier curvature hypothesis κ_α(x, y) = (1 − α)c, the non-zero factor 1 − α cancels out, leaving c identically on the interval.

  1. To show κ_LLY(x, y) = c, it suffices to show that the quotient κ_α(x, y) / (1 − α) is eventually equal to c as α → 1⁻.

    By definition, the Lin-Lu-Yau curvature κ_LLY(x, y) is the limit of κ_α(x, y) / (1 − α) along the left-neighborhood filter of 1. By Filter.Tendsto.limUnder_eq, this limit equals c if the quotient converges to c. Since the constant function c converges to c, tendsto_const_nhds.congr' reduces convergence to showing that the quotient is eventually equal to c along that filter.

    lines 5–7

    uses Filter.Tendsto.limUnder_eq, tendsto_const_nhds.congr'

      unfold graph_lly_curvature
      apply Filter.Tendsto.limUnder_eq
      apply tendsto_const_nhds.congr'
  2. It suffices to show that κ_α(x, y) / (1 − α) = c for all α ∈ (a, 1).

    Since a < 1, the open interval (a, 1) is a neighborhood of 1 from the left by Ioo_mem_nhdsLT. Therefore, the eventual equality holds if the quotient equals c everywhere on (a, 1).

    line 8

    uses Ioo_mem_nhdsLT

      filter_upwards [Ioo_mem_nhdsLT ha] with α hα
  3. For every α ∈ (a, 1), the quotient κ_α(x, y) / (1 − α) equals c.

    For α ∈ (a, 1), the hypothesis h substitutes (1 − α)c for κ_α(x, y). Since α < 1, the difference 1 − α is nonzero by sub_ne_zero.mpr. Finally, field_simp cancels the factor 1 − α from the numerator and denominator, reducing the expression to c.

    lines 9–11

    uses sub_ne_zero.mpr

      rw [h α hα.1 hα.2]
      have : (1 - α) ≠ 0 := sub_ne_zero.mpr hα.2.ne'
      field_simp
Filter.Tendsto.limUnder_eq
If g converges to x along a filter f (with f ≠ ⊥ in a Hausdorff space), then the limit limUnder of g along f is equal to x.
tendsto_const_nhds.congr'
If a function is eventually equal to the constant c along a filter, then it converges to c along that filter.
Ioo_mem_nhdsLT
For a < b, the open interval (a, b) belongs to the punctured left-neighborhood filter of b.
sub_ne_zero.mpr
If a ≠ b, then a - b ≠ 0.

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_eq_of_ollivier_eq {V : Type*} [Fintype V] [DecidableEq V]    (G : SimpleGraph V) [DecidableRel G.Adj] (x y : V) (c a : ℝ) (ha : a < 1)    (h : ∀ α, a < α → α < 1 → graph_ollivier_curvature G α x y = (1 - α) * c) :    graph_lly_curvature G x y = c := by  unfold graph_lly_curvature  apply Filter.Tendsto.limUnder_eq  apply tendsto_const_nhds.congr'  filter_upwards [Ioo_mem_nhdsLT ha] with α hα  rw [h α hα.1 hα.2]  have : (1 - α) ≠ 0 := sub_ne_zero.mpr hα.2.ne'  field_simp
See it in the graphDiscuss this resultChallenge it