Regular-graph self-improvement conjecture for the Bakry–Émery condition

From papers

Let G=(V,E)G=(V,E) be a dd-regular graph, meaning that every vertex has exactly dd neighbors. Assume that GG satisfies the discrete Bakry–Émery curvature-dimension condition CD(0,)\mathrm{CD}(0,\infty).

Regular-graph self-improvement conjecture. Any dd-regular graph satisfying CD(0,)\mathrm{CD}(0,\infty) satisfies CD(0,d)\mathrm{CD}(0,d).

The result is proposed as a strengthening of the proved self-improvement theorem for edge-regular graphs, where the condition CD(0,d)\mathrm{CD}(0,d) is obtained under the additional requirement that adjacent vertices have a fixed number of common neighbors. The conjecture would remove that edge-regularity assumption and would also imply the polynomial-growth conjecture through the paper's volume-doubling argument. It remains open in the source.

Progress summary

Open

The conjecture remains open: a 2026 paper proves the analogous statement for edge-regular graphs, but no verified proof or counterexample is known for all regular graphs.

Blachar, Pajot, and Salez proposed in 2026 that every dd-regular graph satisfying CD(0,)\mathrm{CD}(0,\infty) also satisfies CD(0,d)\mathrm{CD}(0,d). Removing edge-regularity is the unresolved step, and the implication would yield polynomial growth.

Known results

  • Edge-regular graphs satisfying CD(κ,)\mathrm{CD}(\kappa,\infty) satisfy a finite-dimensional condition CD(κ,n)\mathrm{CD}(\kappa,n) with an explicit optimal nn (Blachar, Pajot, and Salez, 2026).
  • In particular, an edge-regular graph satisfying CD(0,)\mathrm{CD}(0,\infty) satisfies CD(0,d)\mathrm{CD}(0,d) and has volume doubling and polynomial growth.
  • Finite-dimensional CD(0,n)\mathrm{CD}(0,n) implies volume doubling, but this does not establish the conjectured self-improvement.

June 2026 formulation and status

The 2026 paper explicitly states the regular-graph assertion as Conjecture 2 and notes that its non-edge-regular seven-vertex example does not refute it. The scan found no verified proof, counterexample, AI-generated solution, or reported error concerning this conjecture.

Current status (as of August 2026): the edge-regular case and its polynomial-growth consequence are proved, while the implication from CD(0,)\mathrm{CD}(0,\infty) to CD(0,d)\mathrm{CD}(0,d) for arbitrary dd-regular graphs remains open.

Sources
Sources & referencesView supporting material

Primary source

Guy Blachar, Hervé Pajot and Justin Salez, “Edge-regular graphs with non-negative curvature have polynomial growth”, arXiv:2606.11094 (2026).

Solutions 1

Counterexample

A 5-regular counterexample to the curvature-dimension self-improvement conjecture

Conjecture 2 of Blachar, Pajot and Salez, Edge-regular graphs with non-negative curvature have polynomial growth asserts that a dd-regular graph satisfying CD(0,)\operatorname{CD}(0,\infty) must satisfy CD(0,d)\operatorname{CD}(0,d). The following connected graph on twelve vertices is a counterexample with d=5d=5.

The verification has two parts. At every vertex, completing squares reduces nonnegative curvature to positivity of a small matrix. The exact determinants below establish that positivity, while one integer-valued function violates the stronger dimension-five inequality.

1. The graph and curvature convention

Let V={0,1,,11}V=\{0,1,\ldots,11\}. Define a simple undirected graph by the following neighborhoods:

vvN(v)N(v)
00{1,2,3,4,5}\{1,2,3,4,5\}
11{0,2,3,6,7}\{0,2,3,6,7\}
22{0,1,6,7,9}\{0,1,6,7,9\}
33{0,1,7,10,11}\{0,1,7,10,11\}
44{0,8,9,10,11}\{0,8,9,10,11\}
55{0,8,9,10,11}\{0,8,9,10,11\}
66{1,2,7,8,10}\{1,2,7,8,10\}
77{1,2,3,6,11}\{1,2,3,6,11\}
88{4,5,6,9,11}\{4,5,6,9,11\}
99{2,4,5,8,10}\{2,4,5,8,10\}
1010{3,4,5,6,9}\{3,4,5,6,9\}
1111{3,4,5,7,8}\{3,4,5,7,8\}

The table is symmetric and each row contains five distinct vertices other than its row label. Thus the graph is simple, undirected and 5-regular. Every vertex is at distance at most two from 00, so it is connected.

We use the unnormalized Laplacian and the curvature conventions of the conjecture:

Δf(x)=yx(f(y)f(x)),\Delta f(x)=\sum_{y\sim x}\bigl(f(y)-f(x)\bigr), Γ1(f,g)(x)=12yx(f(y)f(x))(g(y)g(x)),\begin{gathered} \Gamma_1(f,g)(x)\\ =\frac12\sum_{y\sim x} \bigl(f(y)-f(x)\bigr)\bigl(g(y)-g(x)\bigr), \end{gathered} Γ2(f,f)=12ΔΓ1(f,f)Γ1(f,Δf).\begin{aligned} \Gamma_2(f,f) ={}&\frac12\Delta\Gamma_1(f,f)\\ &-\Gamma_1(f,\Delta f). \end{aligned}

For N(0,]N\in(0,\infty], the condition CD(0,N)\operatorname{CD}(0,N) means that, for every function f:VRf:V\to\mathbb R and every vertex xVx\in V,

Γ2(f,f)(x)(Δf(x))2N.\Gamma_2(f,f)(x)\ge\frac{(\Delta f(x))^2}{N}.

Here 1/=01/\infty=0, so CD(0,)\operatorname{CD}(0,\infty) is the nonnegativity of every local quadratic form Γ2(f,f)(x)\Gamma_2(f,f)(x).

2. A local certificate for nonnegative curvature

Curvature-matrix reductions through Schur complements are standard; see Cushing, Kamtue, Liu and Peyerimhoff, Theorem 1.2. We include the needed identity directly.

Fix a vertex xx, and list its neighbors increasingly as y1,,y5y_1,\ldots,y_5. Let AxA_x be the adjacency matrix induced on these five neighbors, and put

ti=j=15(Ax)ij.t_i=\sum_{j=1}^5(A_x)_{ij}.

Write t=(t1,,t5)t=(t_1,\ldots,t_5). Let S2(x)S_2(x) be the set of vertices at distance exactly two from xx. For each zS2(x)z\in S_2(x), define

(bz)i=1{yiz},mz=i=15(bz)i.\begin{aligned} (b_z)_i&=\mathbf 1_{\{y_i\sim z\}},\\ m_z&=\sum_{i=1}^5(b_z)_i. \end{aligned}

In particular, mz>0m_z>0. With II the 5×55\times5 identity matrix and JJ the 5×55\times5 all-ones matrix, set

Rx=52I+14diag(t)+12JAxzS2(x)bzbzTmz.\begin{aligned} R_x={}&\frac52 I+\frac14\operatorname{diag}(t)\\ &+\frac12J-A_x\\ &-\sum_{z\in S_2(x)}\frac{b_zb_z^{T}}{m_z}. \end{aligned}

Subtracting a constant from ff does not change either Γ2(f,f)\Gamma_2(f,f) or Δf\Delta f, so assume f(x)=0f(x)=0, and write ui=f(yi)u_i=f(y_i). Expanding the definitions and completing the square separately in each f(z)f(z) gives

Γ2(f,f)(x)=uTRxu+14zS2(x)mz(f(z)2bzTumz)2.\begin{aligned} &\Gamma_2(f,f)(x)=u^{T}R_xu\\ &\quad+\frac14\sum_{z\in S_2(x)} m_z\left(f(z)-\frac{2b_z^{T}u}{m_z}\right)^2. \end{aligned}

For clarity, the terms before completing the squares are

Γ2(f,f)(x)=uT ⁣(52I+14diag(t)+12JAx)u+zS2(x)(mz4f(z)2f(z)bzTu).\begin{aligned} &\Gamma_2(f,f)(x)\\ &\quad=u^{T}\!\left( \frac52I+\frac14\operatorname{diag}(t)+\frac12J-A_x \right)u\\ &\qquad+\sum_{z\in S_2(x)} \left(\frac{m_z}{4}f(z)^2-f(z)b_z^{T}u\right). \end{aligned}

Thus positive semidefiniteness of RxR_x implies nonnegative curvature at xx.

For 1k51\le k\le5, let Dx,kD_{x,k} be the determinant of the leading k×kk\times k principal submatrix of RxR_x, using the increasing neighbor order above. Substitution of the adjacency table into the definition of RxR_x gives the following exact values. The equal rows for vertices 44 and 55 are combined.

xxDx,1D_{x,1}Dx,2D_{x,2}Dx,3D_{x,3}
008/38/334/934/93175/4323175/432
113/23/231/831/871/871/8
2223/1223/12281/48281/48439/32439/32
339/49/4409/72409/72239/18239/18
4,54,529/3029/30157/60157/60273/40273/40
668/38/355/955/9233/18233/18
7741/1241/12161/24161/24793/48793/48
8811/411/415/215/221/421/4
991/31/311/1211/125/25/2
10104/34/337/1237/1255/855/8
111125/1225/12671/144671/1445687/5765687/576
xxDx,4D_{x,4}Dx,5D_{x,5}
0016277/172816277/1728335/288335/288
11503/32503/325107/1285107/128
22791/32791/323041/1923041/192
331379/1081379/1081969/1081969/108
4,54,51301/961301/9639869/192039869/1920
66457/36457/36163/36163/36
771175/321175/325599/3845599/384
881212339/16339/16
99187/36187/3682/982/9
1010451/64451/645555/3845555/384
111112859/230412859/23044807/7684807/768

Every entry is positive. By Sylvester's criterion, each RxR_x is positive definite. The square decomposition therefore proves that, for every function f:VRf:V\to\mathbb R and every vertex xVx\in V,

Γ2(f,f)(x)0.\Gamma_2(f,f)(x)\ge0.

Consequently, this graph satisfies CD(0,)\operatorname{CD}(0,\infty).

3. Failure of the dimension-five bound

Define the integer-valued function ff by the following values:

vvf(v)f(v)vvf(v)f(v)
0000662-2
111-17700
221-1881010
33229966
4455101088
5555111188

At vertex 00, the neighborhood table gives

Δf(0)=11+2+5+5=10.\begin{aligned} \Delta f(0)&=-1-1+2+5+5\\ &=10. \end{aligned}

The remaining quantities needed in the definition of Γ2\Gamma_2 are

Γ1(f,f)(0)=28,y0Γ1(f,f)(y)=2912,ΔΓ1(f,f)(0)=112.\begin{aligned} \Gamma_1(f,f)(0)&=28,\\ \sum_{y\sim0}\Gamma_1(f,f)(y)&=\frac{291}{2},\\ \Delta\Gamma_1(f,f)(0)&=\frac{11}{2}. \end{aligned}

Moreover,

(Δf(1),,Δf(5))=(4,8,5,7,7),\begin{gathered} \bigl(\Delta f(1),\ldots,\Delta f(5)\bigr)\\ =(4,8,5,7,7), \end{gathered}

and hence

2Γ1(f,Δf)(0)=(1)(410)+(1)(810)+2(510)+5(710)+5(710)=32.\begin{aligned} &2\Gamma_1(f,\Delta f)(0)\\ &=(-1)(4-10)+(-1)(8-10)\\ &\quad+2(5-10)+5(7-10)\\ &\quad+5(7-10)\\ &=-32. \end{aligned}

It follows that

Γ2(f,f)(0)=12112(16)=754.\begin{aligned} \Gamma_2(f,f)(0)&=\frac12\cdot\frac{11}{2}-(-16)\\ &=\frac{75}{4}. \end{aligned}

But CD(0,5)\operatorname{CD}(0,5) would require

Γ2(f,f)(0)(Δf(0))25=20,\Gamma_2(f,f)(0)\ge\frac{(\Delta f(0))^2}{5}=20,

whereas 75/4<2075/4<20. The graph therefore satisfies CD(0,)\operatorname{CD}(0,\infty) but not CD(0,5)\operatorname{CD}(0,5), disproving Conjecture 2.

0 endorsements
Shivam Patel ·