OctoInformBeta

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

Lemma 6.2: The associated bounded functionals satisfy a real upper estimate after deleting initial pieces

Infinite paths admit disjoint weight tails.

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 path has original rational pieces and a sequence of weights, as well as an associated bounded functional on a real Banach space. Lemma 6.2 concerns finite families of paths and the dual norm of their tails.

The coordinate set is Γ=ω1\Gamma=\omega_1.✦ Fix a bijection from Γ\Gamma onto ℕ×ω1\mathbb N\times\omega_1, and let c(a)c(a) be the first component of the image of aa. The sets Ck={a∈Γ:c(a)=k}C_k=\{a\in\Gamma:c(a)=k\} form the countable unbounded partition into colors. A rational array uu on Γ\Gamma is a function on Γ\Gamma with finite support.✦

Families and Norming Arrays

An operation family ff is either the pure family of a color kk or the mixed family.✦ Its parameter sfs_f and exponent qfq_f are given by (1). spurek=k+2,smixed=2,qf=sf+1sf.s_{\mathrm{pure}\,k}=k+2,\qquad s_{\mathrm{mixed}}=2, \qquad q_f=\frac{s_f+1}{s_f}.(1) For rational arrays u,vu,v, family succession means that every a∈supp⁡ua\in\operatorname{supp}u precedes every b∈supp⁡vb\in\operatorname{supp}v; in the mixed family it also requires c(a)<c(b)c(a)<c(b) for every such pair.✦

The block lengths and normalization factors at weight j≥1j\geq1 use underlying parameter index j−1j-1. With zero-based indices nn, their parameter sequences are specified by (2). Here (tn,Bn)(t_n,B_n) is the recursive parameter state for the fixed value s=sfs=s_f, and dnd_n is its depth. dn=n+11,(t0,B0)=(d02+2d0+2,0),Bn+1=Bn+2⋅2s(s+1)tn,tn+1=tn+(Bn+1+1)(dn+1+1)+1+dn+1+dn+12,Ljf=2s(s+1)tj−1,mjf=2(s−1)(s+1)tj−1+dj−1.\begin{gathered} d_n=n+11,\qquad (t_0,B_0)=(d_0^2+2d_0+2,0),\\ B_{n+1}=B_n+2\cdot2^{s(s+1)t_n},\\ t_{n+1}=t_n+(B_{n+1}+1)(d_{n+1}+1)+1+d_{n+1}+d_{n+1}^{\,2},\\ L_j^f=2^{s(s+1)t_{j-1}},\qquad m_j^f=2^{(s-1)(s+1)t_{j-1}+d_{j-1}}. \end{gathered}(2) A Type I expression ee in an operation family ff of weight jj is a finite list of nonzero rational children u0,…,uℓ−1u_0,\ldots,u_{\ell-1} with family successive supports and 1≤ℓ≤Ljf1\leq\ell\leq L_j^f.✦ Its value is the normalized sum in (3). val⁡(u0,…,uℓ−1;j)=1mjf∑h<ℓuh.\operatorname{val}(u_0,\ldots,u_{\ell-1};j) =\frac{1}{m_j^f}\sum_{h<\ell}u_h.(3)✦

The signed monochromatic coordinate set BB of color kk is the set consisting of zero and the arrays ±δa\pm\delta_a with a∈Cka\in C_k, where δa\delta_a is the rational array equal to one at aa and zero elsewhere.✦ For a base set BB and family ff, the norming construction starts at stage zero with BB. Each succeeding stage retains the preceding stage and adjoins Type I and Type II values whose children belong to that preceding stage. For the path expressions called Type II expressions, this condition concerns every child of every original uncropped piece on every path. For a base set BB of rational arrays and an operation family ff, the norming family KfK_f is the set of rational arrays belonging to a stage of the norming construction starting from BB.✦ The pure norming set KkK_k is the norming family constructed in the pure family of color kk from the signed monochromatic coordinate set of that color.✦ The mixed base is ⋃kKk\bigcup_k K_k, and its norming family is the full norming set KK.

Raw Data and Infinite Paths

A raw infinite path PP consists of nonzero rational arrays unPu_n^P, weights wnP∈ℕw_n^P\in\mathbb N, and metadata pnP∈ℕp_n^P\in\mathbb N, indexed from zero.✦ A coherent finite closure system on ω1\omega_1 assigns to each ordinal β<ω1\beta<\omega_1 an increasing sequence of finite subsets of [0,β][0,\beta] containing β\beta and exhausting that interval, such that restriction to [0,a][0,a] gives the set at aa at the same index whenever aa belongs to the set at β\beta.✦ Write Fp(β)F_p(\beta) for the finite closure at index pp in this system; a positive index pp selects underlying index p−1p-1, and index zero also selects the zeroth set.✦ The prefix support SnPS_n^P, endpoint bnPb_n^P, and prefix closure HnPH_n^P of a raw infinite path PP are the finite sets and ordinal specified in (4). Prefix supports are nonempty.✦ SnP=⋃i=0nsupp⁡uiP,bnP=max⁡SnP,HnP=FpnP(bnP).S_n^P=\bigcup_{i=0}^n\operatorname{supp}u_i^P,\qquad b_n^P=\max S_n^P,\qquad H_n^P=F_{p_n^P}(b_n^P).(4)

A predecessor closure family GG at an ordinal β\beta assigns a finite subset of ω1\omega_1 to each ordinal a<βa<\beta and each zero-based natural index.✦ Such a family is a coherent predecessor closure family if its sets at each aa form an increasing sequence of finite subsets of [0,a][0,a] containing aa and exhausting [0,a][0,a], and restriction to [0,b][0,b] gives the set at bb at the same index whenever bb belongs to the set at aa.✦ An endpoint extension GG of a predecessor closure family FF at an ordinal β\beta is coherent if it extends FF to β\beta by an increasing sequence of finite subsets of [0,β][0,\beta] containing β\beta and exhausting that interval, with coherence preserved.✦ The closure system is obtained recursively by the endpoint closure construction.✦ The closure entry rank ρ(a,b)\rho(a,b) is the first positive index with a∈Fp(b)a\in F_p(b) when a≤ba\leq b, and is zero otherwise.✦

For a finite coordinate set HH, the order position of aa is the number of members of HH below aa.✦ For a rational array uu and a finite coordinate set HH, the positional rational array code of uu on HH is the finite set of pairs consisting of the number of members of HH below each coordinate in HH and the corresponding coefficient of uu, including zero coefficients.✦ A finite path code CC is a finite list of triples consisting of a weight, metadata, and a positional rational array code.✦ The prefix code 𝒞n(P)\mathcal C_n(P) of a raw infinite path PP is the finite list of triples consisting of the weight, metadata, and positional rational array code for i=0,…,ni=0,\ldots,n, using the common closure HnPH_n^P for each original array uiPu_i^P.✦ The maximum code metadata of a finite path code is the largest metadata entry in that code, with value zero for the empty list.✦ Fix the injective coding map σ\sigma from finite path codes to ℕ\mathbb N whose value exceeds every metadata entry of its code.

A raw path PP is admissible if its array supports are successive in ordinal order, its metadata are strictly increasing and positive, and the conditions in (5) hold.✦ The rank condition there concerns the whole prefix support. 1≤wnP≤pnP,ρ(a,b)≤pnP(a,b∈SnP,a≤b),wn+1P=σ(𝒞n(P))(n≥0).\begin{gathered} 1\leq w_n^P\leq p_n^P,\qquad \rho(a,b)\leq p_n^P\quad(a,b\in S_n^P,\ a\leq b),\\ w_{n+1}^P=\sigma\bigl(\mathcal C_n(P)\bigr)\qquad(n\geq0). \end{gathered}(5) A raw prefix PP of length ℓ\ell is valid if its array supports are successive in ordinal order, its metadata are strictly increasing and positive, and the conditions in (5) hold on indices below ℓ\ell, with the coding rule required only when n+1<ℓn+1<\ell.✦

An infinite path in ff is an admissible raw path PP together with a Type I expression for each nn, of value unPu_n^P and weight wnPw_n^P, whose children belong to KfK_f. Its original uncropped pieces have family successive supports. A finite path PP in an operation family ff is a valid raw prefix of positive length ℓ\ell together with matching Type I pieces with family successive supports.✦ The finite path sum of a finite path PP of length ℓ\ell is ∑i<ℓuiP\sum_{i<\ell}u_i^P.✦ The prefix of an infinite path through nn retains the first n+1n+1 original pieces, so index zero includes one piece.✦

The Completion and Path Functionals

The bounded function space ℓ∞(K)\ell_\infty(K) consists of all bounded real-valued functions on KK, equipped with the supremum norm.✦ For a∈Γa\in\Gamma, the coordinate evaluation vector ea∈ℓ∞(K)e_a\in\ell_\infty(K) is the function ea(v)=v(a)e_a(v)=v(a).✦ The finite support inclusion sends a finitely supported real vector xx to ∑ax(a)ea\sum_a x(a)e_a.✦ The real norming completion EE is the closed evaluation span in (6). The norming evaluation functional φv\varphi_v is evaluation at v∈Kv\in K restricted to EE✦, and the coordinate functional is ea*=φδae_a^*=\varphi_{\delta_a}.✦ The coordinate predual X0X_0 is the subspace of E*E^* also defined in (6), with closure in the dual norm. E=span⁡ℝ{ea:a∈Γ}¯ℓ∞(K),X0=span⁡ℝ{ea*:a∈Γ}¯E*.E=\overline{\operatorname{span}_{\mathbb R}\{e_a:a\in\Gamma\}} ^{\,\ell_\infty(K)},\qquad X_0=\overline{\operatorname{span}_{\mathbb R}\{e_a^*:a\in\Gamma\}} ^{\,E^*}.(6)

For an infinite path PP, its partial functional FP,nF_{P,n} is the norming evaluation at its finite prefix sum.✦ The bounded path functional FP∈E*F_P\in E^* of an infinite path PP is determined by (7). FP,n=φ∑i=0nuiP,FP(x)=limn→∞FP,n(x)(x∈E),∥FP∥≤1.F_{P,n}=\varphi_{\sum_{i=0}^n u_i^P},\qquad F_P(x)=\lim_{n\to\infty}F_{P,n}(x)\quad(x\in E),\qquad \|F_P\|\leq1.(7)

An ordinal and color rectangle A=(I,J)A=(I,J) consists of order convex sets I⊆ΓI\subseteq\Gamma and J⊆ℕJ\subseteq\mathbb N.✦ The crop support DD of an ordinal and color rectangle A=(I,J)A=(I,J) in an operation family ff is the coordinate set equal to II in a pure family and I∩c−1(J)I\cap c^{-1}(J) in the mixed family.✦ The full norming set KK is stable under a crop support DD if v𝟏D∈Kv\mathbf1_D\in K for every v∈Kv\in K.✦ The cropped normer associated with v∈Kv\in K and crop support DD is the restricted array v𝟏Dv\mathbf1_D.✦ On ℓ∞(K)\ell_\infty(K) the ambient crop sends zz to the function v↦z(v𝟏D)v\mapsto z(v\mathbf1_D).✦ The coordinate crop projection ΠD\Pi_D on EE is the restriction to EE of the ambient crop for the crop support DD.✦

For an infinite path PP and an index N∈ℕN\in\mathbb N, the tail crop of PP at NN is the rectangle with ordinal interval (bNP,ω1)(b_N^P,\omega_1) and all colors.✦ The path tail functional TP,N∈E*T_{P,N}\in E^* of an infinite path PP at N∈ℕN\in\mathbb N is defined by (8); the endpoint uses the prefix through NN. TP,N=FP∘Π(bNP,ω1).T_{P,N}=F_P\circ\Pi_{(b_N^P,\omega_1)}.(8)✦ For a raw infinite path PP and N∈ℕN\in\mathbb N, the raw weight tail WN(P)W_N(P) is the set in (9). WN(P)={wn+NP:n∈ℕ}.W_N(P)=\{w_{n+N}^P:n\in\mathbb N\}.(9)

The Claim

Theorem 1 (Lemma 6.2). Let P,QP,Q be distinct admissible raw infinite paths. Their weight sets satisfy (10). W0(P)∩W0(Q) is finite.W_0(P)\cap W_0(Q)\text{ is finite}.(10)✦ Let (Pi)i∈I(P_i)_{i\in I} be a finite family of pairwise distinct admissible raw paths. There is N∈ℕN\in\mathbb N such that (11) holds. WN(Pi)∩WN(Pj)=⌀(i,j∈I,i≠j).W_N(P_i)\cap W_N(P_j)=\varnothing\qquad(i,j\in I,\ i\ne j).(11)✦ Fix an operation family ff and a finite family (Pi)i<h(P_i)_{i<h} of infinite paths in ff whose raw paths are pairwise distinct. There is N∈ℕN\in\mathbb N for which (12) holds for every real family (ci)i<h(c_i)_{i<h}. ∥∑i<hciTPi,N∥E*≤(∑i<h|ci|qf)1/qf.\left\|\sum_{i<h}c_i T_{P_i,N}\right\|_{E^*} \leq\left(\sum_{i<h}|c_i|^{q_f}\right)^{1/q_f}.(12)✦ For every infinite path PP in ff and every N∈ℕN\in\mathbb N, the removed part satisfies (13). FP−TP,N∈X0.F_P-T_{P,N}\in X_0.(13)✦

What Is Checked

The weight statements concern equality and distinctness of the complete raw data, including their original rational pieces and metadata. The functional statements concern paths in a fixed pure or mixed family, real coefficients, and the dual norm of the constructed completion EE.

The full norming structure contains every positive coordinate array δa\delta_a✦, and every coefficient of every member of KK has absolute value at most one.✦ Finite prefixes of infinite paths have their sums in KK.✦ Ordinal and color rectangle crops preserve KK✦; their ambient crop operators are contractive and preserve the closed evaluation span EE.