OctoInformBeta

OpenAI preprint, September 2026 · §6. Infinite paths and weak-Cauchy block sequences

Lemma 6.1: Pointwise limits on a norming completion and contractive coordinate crops

Infinite paths yield bounded functionals.

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

An infinite admissible path supplies a sequence of finitely supported rational functionals. Its partial sums act on a completion EE, whose vectors need not have finite support. Their limiting action is considered together with restrictions in both the ordinal and color coordinates.

Put Γ=ω1\Gamma=\omega_1, the first uncountable ordinal.✦ Fix a bijection from Γ\Gamma to ℕ×Γ\mathbb N\times\Gamma; its first coordinate is the color c(a)c(a) of aa, and Ck={a:c(a)=k}C_k=\{a:c(a)=k\} is the unbounded color class indexed by kk. A rational array u∈ℚ(Γ)u\in\mathbb Q^{(\Gamma)} is a rational-valued function with finite support.✦ For a∈Γa\in\Gamma, the coordinate array δa\delta_a has value one at aa and zero elsewhere. A norming set KK on Γ\Gamma is a set of finitely supported rational arrays satisfying (1). δa∈K(a∈Γ),|u(a)|≤1(u∈K,a∈Γ).\delta_a\in K\quad(a\in\Gamma),\qquad |u(a)|\leq 1\quad(u\in K,\ a\in\Gamma).(1)✦

For a norming set KK, the coordinate evaluation vector eae_a is the bounded function on KK taking uu to u(a)u(a).✦ The finite support inclusion JJ sends a finitely supported real vector to the corresponding linear combination of these vectors.✦ The norming completion EKE_K is the closed evaluation span in the real space ℓ∞(K)\ell_\infty(K), as specified in (2).✦ ea(u)=u(a),Jx=∑a∈supp⁡xx(a)ea,EK=J(ℝ(Γ))¯∥⋅∥∞.e_a(u)=u(a),\qquad Jx=\sum_{a\in\operatorname{supp}x}x(a)e_a,\qquad E_K=\overline{J\bigl(\mathbb R^{(\Gamma)}\bigr)}^{\|\cdot\|_\infty}.(2) The norming evaluation functional associated with u∈Ku\in K is uˆ∈EK*\widehat u\in E_K^* given by uˆ(x)=x(u)\widehat u(x)=x(u).✦ The bounded function space ℓ∞(K)\ell_\infty(K) consists of all bounded real-valued functions on KK, equipped with the supremum norm.

The Norming Families and Paths

There is a pure operation family for each color kk and one mixed family.✦ Write ff for either kind and set sf=k+2s_f=k+2 in the pure family of color kk, while sf=2s_f=2 in the mixed family.✦ Two rational arrays are successive in ff when every coordinate of the first precedes every coordinate of the second; in the mixed family their colors must also be strictly ordered.✦

The block lengths and normalization factors use zero-based parameter sequences. The depth parameter of the zero-based parameter sequences is dn=n+11d_n=n+11.✦ For a scale parameter ss, specialized to sfs_f for family ff, the exponent scale ts,nt_{s,n} is the first coordinate of the recursive state (ts,n,bs,n)(t_{s,n},b_{s,n}) defined by (3).✦ (ts,0,bs,0)=(d02+2d0+2,0),Bs,n=bs,n+2⋅2s(s+1)ts,n,(ts,n+1,bs,n+1)=(ts,n+(Bs,n+1)(dn+1+1)+1+dn+1+dn+12,Bs,n),Ls,n=2s(s+1)ts,n,ms,n=2(s−1)(s+1)ts,n+dn,Lf(j)=Lsf,j−1,mf(j)=msf,j−1(j≥1).\begin{gathered} (t_{s,0},b_{s,0})=(d_0^2+2d_0+2,0),\qquad B_{s,n}=b_{s,n}+2\cdot 2^{s(s+1)t_{s,n}},\\ (t_{s,n+1},b_{s,n+1})= \bigl(t_{s,n}+(B_{s,n}+1)(d_{n+1}+1)+1+d_{n+1}+d_{n+1}^2, B_{s,n}\bigr),\\ L_{s,n}=2^{s(s+1)t_{s,n}},\qquad m_{s,n}=2^{(s-1)(s+1)t_{s,n}+d_n},\\ L_f(j)=L_{s_f,j-1},\qquad m_f(j)=m_{s_f,j-1}\quad(j\geq1). \end{gathered}(3)

A Type I expression TT of family ff and weight j≥1j\geq1 is a list of nonzero, successive rational children v0,…,vℓ−1v_0,\ldots,v_{\ell-1} with 1≤ℓ≤Lf(j)1\leq\ell\leq L_f(j).✦ Its value is the normalized sum in (4). u=1mf(j)∑h=0ℓ−1vh.u=\frac{1}{m_f(j)}\sum_{h=0}^{\ell-1}v_h.(4)✦ The pure norming set KkK_k is the union of the finite construction stages for its pure family, starting from {0}∪{±δa:a∈Ck}\{0\}\cup\{\pm\delta_a:a\in C_k\}.✦ The mixed base is ⋃kKk\bigcup_k K_k, and the full norming set KK is the union of the mixed construction stages.✦ At stage zero one takes the base; the next stage retains the preceding stage and adds Type I and Type II values whose original children all lie in that preceding stage.✦ Write KfK_f for the norming set of a family ff. The space in this lemma is E=EKE=E_K for the full set KK.✦ The signed monochromatic coordinate set of color kk is the pure base.

For an endpoint β<ω1\beta<\omega_1 and a closure index p≥0p\geq0, the finite set Fp(β)F_p(\beta) is the corresponding entry of the coherent finite closure system on ω1\omega_1. At each endpoint the system is an increasing sequence of finite subsets of [0,β][0,\beta] containing β\beta and exhausting [0,β][0,\beta]. Coherence means that a member aa of an endpoint’s set has, at the same index, the closure obtained by cutting that set at aa. The system is obtained by extending the predecessor families at each endpoint.✦ Positive closure index pp uses zero-based system index p−1p-1; index zero also uses the first system entry.✦ For a≤ba\leq b, the closure entry rank ρ(a,b)\rho(a,b) is the first positive pp with a∈Fp(b)a\in F_p(b), and ρ(a,b)=0\rho(a,b)=0 for a>ba>b.✦

A raw infinite path PP is a sequence of nonzero rational pieces uiu_i, declared weights jij_i and metadata pip_i, indexed by i≥0i\geq0.✦ Its prefix support, endpoint and closure are the finite sets and ordinal in (5). Sn=⋃i=0nsupp⁡ui,βn=max⁡Sn,Hn=Fpn(βn).S_n=\bigcup_{i=0}^n\operatorname{supp}u_i,\qquad \beta_n=\max S_n,\qquad H_n=F_{p_n}(\beta_n).(5) For a finite coordinate set HH, the position of aa is pos⁡H(a)=|{b∈H:b<a}|\operatorname{pos}_H(a)=|\{b\in H:b<a\}|.✦ The positional code of a rational array uu on Γ\Gamma relative to a finite coordinate set HH is the finite set {(pos⁡H(a),u(a)):a∈H}\{(\operatorname{pos}_H(a),u(a)):a\in H\}, including zero coefficients.✦ The prefix code 𝒞n\mathcal C_n is the ordered list of triples consisting of jij_i, pip_i and the positional code of uiu_i relative to the common set HnH_n, for 0≤i≤n0\leq i\leq n.✦ A finite path code is any finite list of such triples.✦ Its maximum metadata is zero for the empty list and the maximum of its metadata entries otherwise.✦ The injective coding map σ\sigma assigns to a code the natural-number pairing of its canonical natural-number code and one plus this maximum metadata.✦

An admissible raw path PP is a raw infinite path with pieces uiu_i, declared weights jij_i and metadata pip_i whose pieces have successive ordinal supports, whose metadata are positive and strictly increasing, and which satisfies (6).✦ 1≤ji≤pi(i≥0),ρ(a,b)≤pn(a,b∈Sn,a≤b),jn+1=σ(𝒞n)(n≥0).\begin{gathered} 1\leq j_i\leq p_i\quad(i\geq0),\qquad \rho(a,b)\leq p_n\quad(a,b\in S_n,\ a\leq b),\\ j_{n+1}=\sigma(\mathcal C_n)\quad(n\geq0). \end{gathered}(6)✦ An infinite path PP in family ff is an admissible raw path whose original, uncropped piece uiu_i is the value of a Type I expression of weight jij_i, all of whose children belong to KfK_f; the pieces must also be successive in ff. A finite path PP of length ℓ≥1\ell\geq1 in family ff is a raw path whose entries through position ℓ−1\ell-1 satisfy the conditions for an infinite path in ff, with the coding rule required only when the next position is below ℓ\ell and no restrictions on later raw entries.

The prefix P|n+1P|_{n+1} of an infinite path is the finite path containing positions zero through nn.✦ The value of a finite path QQ of length ℓ\ell is the finitely supported rational array obtained by summing its original pieces at positions zero through ℓ−1\ell-1. For the prefix P|n+1P|_{n+1}, this value and its associated partial functional are given in (7). Un=∑i=0nui,SP,n=Unˆ∈E*.U_n=\sum_{i=0}^n u_i,\qquad S_{P,n}=\widehat{U_n}\in E^*.(7)

The Claim

An ordinal and color rectangle A=(I,D)A=(I,D) consists of order convex sets I⊆ΓI\subseteq\Gamma and D⊆ℕD\subseteq\mathbb N.✦ Its crop support set is II for a pure family and Am=I∩c−1(D)A_{\mathrm m}=I\cap c^{-1}(D) for the mixed family.✦ For a functional FF on EE, its rectangle crop is F∘πAF\circ\pi_A, where πA\pi_A is the coordinate projection below.

Theorem 1. Let ff be a pure or mixed family and let PP be an infinite path in ff. There is a bounded real linear path functional pP*∈E*p_P^*\in E^* satisfying (8) and (9): ∥pP*∥≤1.\|p_P^*\|\leq1.(8)✦ limn→∞SP,n(x)=pP*(x)(x∈E).\lim_{n\to\infty}S_{P,n}(x)=p_P^*(x)\qquad(x\in E).(9)✦ For every ordinal and color rectangle AA, the coordinate projection is the bounded real linear map defined by (10): πA:E→E,(πAx)(u)=x(u|Am)(x∈E,u∈K).\pi_A:E\longrightarrow E,\qquad (\pi_Ax)(u)=x\bigl(u|_{A_{\mathrm m}}\bigr) \quad(x\in E,\ u\in K).(10)✦

What Is Checked

The statements concern the real norming completion of the full norming set and infinite paths in either operation family, with original rational pieces and norming children. The full set KK satisfies the coordinate inclusion and coefficient bound in (1). Every prefix support in (5) is nonempty✦, and every finite prefix value UnU_n in (7) belongs to KK.✦

A coordinate set B⊆ΓB\subseteq\Gamma is crop stable for a norming set when u|Bu|_B belongs to that set for every one of its arrays uu.✦ Rectangle crops are stable for the full norming set.✦ The cropped normer is u|Bu|_B✦, and the ambient crop operator on ℓ∞(K)\ell_\infty(K) sends xx to the function u↦x(u|B)u\mapsto x(u|_B).✦ This operator is contractive and preserves the closed evaluation span; its restriction to that span is the coordinate crop projection used in (10).✦