OctoInformBeta

OpenAI preprint, September 2026 · §3. An anchor for successive choices

§3.3 (setting): one common terminal sequence: On sets of diameter at most one, a defect bound and vanishing displacement for each fixed generated map

One anchor supplies a common terminal sequence.

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

Let XX be a real Banach space, K⊆XK\subseteq X a nonempty closed convex set, and T:K→KT:K\to K a nonexpansive map. For a selfmap FF of KK, its displacement at z∈Kz\in K is ∥F(z)−z∥\|F(z)-z\|, with the norm taken in XX.

For an anchor a∈Ka\in K and a weight 0≤t≤10\le t\le1, the anchored averaging map St,a:K→KS_{t,a}:K\to K is defined by (1): St,a(v)=ta+(1−t)T(v),v∈K.S_{t,a}(v)=ta+(1-t)T(v),\qquad v\in K.(1)✦ For 0<t≤10<t\le1, the weighted resolvent ℛt(a)∈K\mathcal R_t(a)\in K is the unique fixed point of St,aS_{t,a}, characterized by (2): ℛt(a)=ta+(1−t)T(ℛt(a)).\mathcal R_t(a)=ta+(1-t)T\bigl(\mathcal R_t(a)\bigr).(2)✦

The reciprocal weight associated with a positive integer nn satisfies 0<1/n≤10<1/n\le1. For a positive integer nn, the discrete resolvent Rn:K→KR_n:K\to K is the map sending each anchor a∈Ka\in K to its weighted resolvent at weight 1/n1/n, as in (3): Rn(a)=ℛ1/n(a),a∈K,n≥1.R_n(a)=\mathcal R_{1/n}(a),\qquad a\in K,\quad n\ge1.(3)✦

The convex mixture αf+βg:K→K\alpha f+\beta g:K\to K of selfmaps f,g:K→Kf,g:K\to K, with nonnegative coefficients α,β\alpha,\beta satisfying α+β=1\alpha+\beta=1, is the map in (4): (αf+βg)(z)=αf(z)+βg(z),z∈K.(\alpha f+\beta g)(z)=\alpha f(z)+\beta g(z),\qquad z\in K.(4) The generated family is the least family of selfmaps of KK containing the identity and every RnR_n, n≥1n\ge1, and closed under composition and the convex mixtures in (4).✦

The Claim

Definition 1. For an anchor x∈Kx\in K, the terminal sequence (xj)j≥0(x_j)_{j\ge0} is the sequence in KK defined by (5): xj=Rj+1(x),j=0,1,2,….x_j=R_{j+1}(x),\qquad j=0,1,2,\ldots.(5)✦

Theorem 1. Suppose that the diameter of KK is at most one. For every anchor x∈Kx\in K, the terminal sequence satisfies (6) at every j≥0j\ge0 and (7) for every fixed generated map G:K→KG:K\to K: ∥T(xj)−xj∥≤1j+1,j≥0,\|T(x_j)-x_j\|\le\frac{1}{j+1},\qquad j\ge0,(6)✦ limj→∞∥G(xj)−xj∥=0.\lim_{j\to\infty}\|G(x_j)-x_j\|=0.(7)✦

In the paper, the result reads: for a fixed anchor x∈Kx\in K, put bj=Rj(x)b_j=R_j(x) for j≥1j\ge1; then ∥T(bj)−bj∥≤1/j\|T(b_j)-b_j\|\le1/j, each fixed generated map GG has a constant cGc_G with ∥G(bj)−bj∥≤cG/j\|G(b_j)-b_j\|\le c_G/j, and consequently every fixed finite family of generated maps acts arbitrarily close to the identity at a common sufficiently late bjb_j.

What Is Checked

The statements concern resolvents on the complete nonempty metric space KK, with distances and displacements measured in the ambient norm of XX. For every anchor a∈Ka\in K and 0<t≤10<t\le1, the anchored averaging map St,aS_{t,a} is a strict contraction with contraction bound 1−t1-t in that norm.✦