graph_lly_curvature_lower_bound
def
The lower Lin–Lu–Yau curvature bound at scale i: κ_LLY^(i)(G) = inf { κ_LLY(x, y) : d(x, y) = i }.
Statement
noncomputable def graph_lly_curvature_lower_bound {V : Type*} [Fintype V] [DecidableEq V] (G : SimpleGraph V) [DecidableRel G.Adj] (i : ℕ) : ℝ
- Defined in
- arXiv:2610.10559 (Edge-Connectivity versus Lin--Lu--Yau Curvature), Definition 2.4 (lower Lin–Lu–Yau curvature bound at scale i).
- Verified
- 10 Oct 2026
- Axioms
- none listed
- Built on 1
- graph_lly_curvatureThe Lin–Lu–Yau curvature κ_LLY(x, y) = lim_{α → 1⁻} κ_α(x, y)/(1 − α).
- Used by 5
- graph_lly_curvature_lower_bound_two_le_oneFor every finite connected graph G, the lower Lin–Lu–Yau curvature bound at scale 2 is at most 1: κ_LLY^(2)(G) ≤ 2/2 = 1.
- not_edge_connectivity_ge_half_scale_mul_min_degree_mul_lly_lower_boundThe inequality κ'(G) ≥ (d/2) δ(G) κ_LLY^(d)(G) asked in OP-164 fails for d = 4: take a 4-cycle 0–1–2–3–0 and a triangle 4–5–6 joined by…
- edge_connectivity_ge_min_degree_mul_lly_lower_bound_twoEvery finite connected graph of diameter 2 has κ'(G) ≥ δ(G) · κ_LLY^(2)(G).
- graph_lly_curvature_lower_bound_le_of_dist_eqThe scale-i lower curvature bound is a lower bound for κ_LLY at any pair at distance i: κ_LLY^(i)(G) ≤ κ_LLY(x,y) whenever d(x,y) = i.
- edge_connectivity_ge_half_scale_mul_min_degree_mul_lly_lower_bound_of_eq_minDegreeOP-164 holds for every finite connected graph whose edge-connectivity equals its minimum degree: then κ'(G) ≥ (d/2) δ(G) κ_LLY^(d)(G) for…
Lean source view module on GitHub
/-- `κ_LLY^(i)(G)`: the infimum of the Lin–Lu–Yau curvature over pairs of vertices at distance `i`. -/ noncomputable def graph_lly_curvature_lower_bound {V : Type*} [Fintype V] [DecidableEq V] (G : SimpleGraph V) [DecidableRel G.Adj] (i : ℕ) : ℝ := sInf {κ | ∃ x y : V, G.dist x y = i ∧ graph_lly_curvature G x y = κ}