OctoInformBeta

OpenAI preprint, September 2026 · Reciprocal Green functions and a squared-distance kernel

Lemma 5.4: A nonnegative update formed from one column preserves the one-positive-square condition for a positive-entry symmetric matrix

Reciprocal stability under a rank-one update.

Hover over a blue or green term in the text, or a node in the graph, to find it in the other. Select it to read its declaration both in Lean and in words.

The Setting

The algebraic question for reciprocal kernels concerns perturbing a symmetric matrix with strictly positive entries by an outer product formed from one of its columns. Reciprocals are taken entry by entry.

Let II be a finite index set. For a real matrix A=(Aij)i,j∈IA=(A_{ij})_{i,j\in I}, its entrywise reciprocal A[−1]A^{[-1]} is the matrix defined by Aij[−1]=Aij−1,i,j∈I.A^{[-1]}_{ij}=A_{ij}^{-1},\qquad i,j\in I.(1) The bilinear form associated with a real matrix AA on II is the map BA:ℝI×ℝI→ℝB_A:\mathbb R^I\times\mathbb R^I\to\mathbb R given by BA(x,y)=x𝖳Ay=∑i,j∈IxiAijyj.B_A(x,y)=x^{\mathsf T}Ay =\sum_{i,j\in I}x_iA_{ij}y_j.(2)✦ A real matrix AA on II has property (P)(P), the one-positive-square condition, if it is symmetric and the form in (2) satisfies BA(x,x)>0 and BA(x,y)=0⇒BA(y,y)≤0,x,y∈ℝI.B_A(x,x)>0\ \text{ and }\ B_A(x,y)=0 \quad\Longrightarrow\quad B_A(y,y)\leq 0, \qquad x,y\in\mathbb R^I.(3)✦

The Claim

Theorem 1. Let MM be a symmetric real matrix on a finite index set II, with strictly positive entries. Suppose its entrywise reciprocal M[−1]M^{[-1]}, defined by (1), has property (P)(P). For any z∈Iz\in I and any real c≥0c\geq 0, the updated reciprocal satisfies (1Mij+cMizMzj)i,j∈I has property (P).\left(\frac{1}{M_{ij}+cM_{iz}M_{zj}}\right)_{i,j\in I} \text{ has property }(P).(4)✦

What Is Checked

The rank-one stability statement (4) is stated over finite real symmetric matrices with strictly positive entries, an entrywise reciprocal satisfying (3), a selected index zz, and a nonnegative real coefficient cc.