OctoInformBeta

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

§3.1 (setting): generated maps and resolvent tails: Composition and convex averaging preserve nonexpansiveness, with uniform tail defects for a closed convex set KK when diam⁡K≤1\operatorname{diam}K\le1

Resolvents generate maps with controlled displacement.

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, let K⊆XK\subseteq X be closed and convex, and let T:K→KT:K\to K be nonexpansive. The quantities under consideration are the displacement of a selfmap of KK and the defect of its values as approximate fixed points of TT. All norms below are those of XX.

The anchored averaging map St,a:K→KS_{t,a}:K\to K, for 0≤t≤10\le t\le1 and a∈Ka\in K, is defined by (1): St,a(v)=ta+(1−t)T(v),v∈K.S_{t,a}(v)=t a+(1-t)T(v),\qquad v\in K.(1)✦ For 0<t≤10<t\le1, the weighted resolvent Qt:K→KQ_t:K\to K assigns to each a∈Ka\in K the fixed point of St,aS_{t,a}, characterized by (2): Qt(a)=ta+(1−t)T(Qt(a)).Q_t(a)=t a+(1-t)T\bigl(Q_t(a)\bigr).(2)✦ The discrete resolvent Rn:K→KR_n:K\to K, for a positive integer nn, is defined by (3): Rn=Q1/n,n≥1.R_n=Q_{1/n},\qquad n\ge1.(3)✦

A pointwise convex combination αf+βg\alpha f+\beta g of selfmaps f,g:K→Kf,g:K\to K, with coefficients α,β≥0\alpha,\beta\ge0 satisfying α+β=1\alpha+\beta=1, is the selfmap of KK defined by (4): (αf+βg)(a)=αf(a)+βg(a),a∈K.(\alpha f+\beta g)(a)=\alpha f(a)+\beta g(a),\qquad a\in K.(4)✦

Generated Families

Definition 1. The family 𝒢\mathcal G of generated maps is the smallest family of selfmaps of KK containing the identity and every RnR_n, n≥1n\ge1, and closed under composition and pointwise convex combinations of two maps.✦

For a nonnegative integer mm, the resolvent tail family ℋm\mathcal H_m is the set of selfmaps of KK defined by (5): ℋm={Rn∘g:g∈𝒢,n∈{1,2,…},n≥m}.\mathcal H_m =\bigl\{R_n\circ g:g\in\mathcal G,\ n\in\{1,2,\ldots\},\ n\ge m\bigr\}.(5)✦

The Claim

Theorem 1. Let g∈𝒢g\in\mathcal G. Its nonexpansiveness estimate is (6): ∥g(a)−g(b)∥≤∥a−b∥,a,b∈K.\|g(a)-g(b)\|\le\|a-b\|,\qquad a,b\in K.(6)✦ There is a real constant cg≥0c_g\ge0 satisfying (7): ∥g(a)−a∥≤cg∥T(a)−a∥,a∈K.\|g(a)-a\|\le c_g\|T(a)-a\|,\qquad a\in K.(7)✦ Suppose also that ∥a−b∥≤1\|a-b\|\le1 for all a,b∈Ka,b\in K. For every positive integer mm and every h∈ℋmh\in\mathcal H_m, the defect estimate is (8): ∥T(h(a))−h(a)∥≤1m,a∈K.\|T(h(a))-h(a)\|\le\frac1m,\qquad a\in K.(8)✦

In the paper, the result reads: 𝒢\mathcal G is generated by the identity and all RnR_n under finite composition and pointwise finite convex combination; every g∈𝒢g\in\mathcal G is nonexpansive and has a finite constant cg≥0c_g\ge0 such that ∥g(a)−a∥≤cg∥T(a)−a∥\|g(a)-a\|\le c_g\|T(a)-a\| for all a∈Ka\in K; the decreasing tail ℋm\mathcal H_m consists of Rn∘gR_n\circ g for n≥mn\ge m and g∈𝒢g\in\mathcal G, and its maps have defect at most 1/m1/m everywhere on KK.

What Is Checked

The statements concern generated selfmaps and resolvent tail families on a closed convex subset of a real Banach space, with a nonexpansive selfmap TT and the diameter bound imposed for (8).

For every positive integer nn, the reciprocal weight 1/n1/n lies in (0,1](0,1]. For fixed a∈Ka\in K and 0<t≤10<t\le1, the anchored averaging map in (1) is contracting with constant 1−t1-t.✦