OctoInformBeta

OpenAI preprint, September 2026 · §7. Vectors detected at a prescribed weight

§7 (setting): weight windows and hits: Interval estimates and vanishing reciprocal tails, with detection by original path pieces

Blocks with separated weight windows.

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

A weight window selects the original pieces of a norming path whose weights lie in a prescribed interval. The blocks considered here lie in an algebraic tail span and have successive supports in Γ=ω1\Gamma=\omega_1, the first uncountable ordinal. Their windows also separate the closure ranks of earlier supports from later weights.

Fix a bijection Γ→ℕ×Γ\Gamma\to\mathbb N\times\Gamma, and let c(α)c(\alpha) be its first coordinate. The color classes Ck={α:c(α)=k}C_k=\{\alpha:c(\alpha)=k\} form a countable partition into unbounded sets. An operation family ff is either pure of color kk, with parameter s=k+2s=k+2, or mixed, with parameter s=2s=2. Two finite supports are successive for ff when every coordinate of the first precedes every coordinate of the second; in the mixed family their colors must also increase.✦ A finitely supported rational array gg on Γ\Gamma is a function g:Γ→ℚg:\Gamma\to\mathbb Q vanishing outside a finite set.✦

The family block lengths LjL_j and normalization factors mjm_j use positive weights jj and the underlying zero-based parameter index j−1j-1; weight zero also uses index zero. The exponent is r=s/(s−1)r=s/(s-1).✦ The parameter sequences are given by 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,Lj=2s(s+1)tj−1,mj=2(s−1)(s+1)tj−1+dj−1(j≥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},\qquad t_{n+1}=t_n+(b_{n+1}+1)(d_{n+1}+1)+1+d_{n+1}+d_{n+1}^2,\\ L_j=2^{s(s+1)t_{j-1}},\qquad m_j=2^{(s-1)(s+1)t_{j-1}+d_{j-1}}\quad(j\ge1). \end{gathered}(1) Here tnt_n is the exponent scale and bnb_n is the auxiliary sequence in (1). The depth sequence (dn)n≥0(d_n)_{n\ge0} in (1) is indexed from zero.

A Type I expression of weight j≥1j\ge1 consists of nonzero rational children g0,…,gℓ−1g_0,\ldots,g_{\ell-1} with successive family supports, where 1≤ℓ≤Lj1\le\ell\le L_j; its value is mj−1∑h<ℓghm_j^{-1}\sum_{h<\ell}g_h. The pure base of color kk consists of zero and the signed coordinate arrays ±𝟏α\pm\mathbf1_\alpha for α∈Ck\alpha\in C_k.✦ Starting from a base, stage zero is that base; each succeeding stage retains the preceding stage and adds Type I values whose children belong to it, and values of path expressions whose children in every original path piece belong to it.✦ The pure norming set KkK_k is the union of the stages for pure color kk.✦ The mixed base is ⋃kKk\bigcup_kK_k; the full norming set KK is the union of its mixed stages. Write KfK_f for the norming set generated from the base of ff.✦

A norming set KK on Γ\Gamma is a set of rational arrays containing every 𝟏α\mathbf1_\alpha and having all coefficients bounded in absolute value by one.✦ Let ℓ∞(K)\ell_\infty(K) be the space of bounded real-valued functions on KK, equipped with the supremum norm. The real norming completion EE of a norming set KK on Γ\Gamma is the closed evaluation span in ℓ∞(K)\ell_\infty(K): ιx(g)=∑α∈supp⁡xx(α)g(α),E={ιx:x:Γ→ℝ has finite support}¯∥⋅∥∞.\iota x(g)=\sum_{\alpha\in\operatorname{supp}x}x(\alpha)g(\alpha), \qquad E=\overline{\{\iota x:x:\Gamma\to\mathbb R \text{ has finite support}\}}^{\|\cdot\|_\infty}.(2) The coordinate evaluation vector at α\alpha is the bounded function g↦g(α)g\mapsto g(\alpha) used in (2).✦ For g∈Kg\in K, write φg∈E*\varphi_g\in E^* for point evaluation at gg.✦ The coordinate functional is eα*=φ𝟏αe_\alpha^*=\varphi_{\mathbf1_\alpha}✦, and the coordinate predual is X0=span⁡ℝ{eα*:α∈Γ}¯X_0=\overline{\operatorname{span}_{\mathbb R}\{e_\alpha^*:\alpha\in\Gamma\}}.✦ For an arbitrary rational array gg, its rational coordinate combination is ∑αg(α)eα*∈X0\sum_\alpha g(\alpha)e_\alpha^*\in X_0✦; its value at u∈Eu\in E is denoted ⟨g,u⟩\langle g,u\rangle.✦ The finite support inclusion ι\iota maps each finitely supported real vector on Γ\Gamma to its evaluation function in EE from (2).

An ordinal and color rectangle is a pair of order-convex sets I⊆ΓI\subseteq\Gamma and D⊆ℕD\subseteq\mathbb N.✦ The crop support of an ordinal and color rectangle (I,D)(I,D) is the coordinate set II for a pure family and I∩c−1(D)I\cap c^{-1}(D) for the mixed family.✦ A coordinate set AA is crop-stable when g|A∈Kg|_A\in K for every g∈Kg\in K.✦ The cropped normer is g|Ag|_A✦, and the ambient crop operator on ℓ∞(K)\ell_\infty(K) sends uu to the function g↦u(g|A)g\mapsto u(g|_A).✦ The coordinate crop projection associated with a crop-stable coordinate set A⊆ΓA\subseteq\Gamma is the restriction to EE of the ambient crop operator on ℓ∞(K)\ell_\infty(K). For an ordinal interval II, taking all colors gives the interval projection PIP_I.✦ The rectangle projection on EE associated with an ordinal and color rectangle (I,D)(I,D) is the coordinate crop projection for I∩c−1(D)I\cap c^{-1}(D).

An admissible block sequence x=(xn)n≥0x=(x_n)_{n\ge0} for ff consists of nonzero finitely supported real vectors with successive family supports; in pure color kk, every support lies in CkC_k.✦ Write x‾n=ιxn\bar x_n=\iota x_n.✦ For a block sequence zz and a zero-based index aa, its algebraic tail span and the coefficient ℓ1\ell_1 norm are [z]≥a=span⁡ℝ{zn+a:n≥0},|x|1=∑α∈supp⁡x|x(α)|.[z]_{\ge a}=\operatorname{span}_{\mathbb R}\{z_{n+a}:n\ge0\}, \qquad |x|_1=\sum_{\alpha\in\operatorname{supp}x}|x(\alpha)|.(3) For a natural number NN and a real constant AA, a vector u∈Eu\in E satisfies the interval partition bound 𝒫(u,N,A,r)\mathcal P(u,N,A,r) when every successive family of dd ordinal intervals, with 1≤d≤N1\le d\le N, satisfies ∑h<d∥PIhu∥≤Ad1/r.\sum_{h<d}\|P_{I_h}u\|\le A d^{1/r}.(4) The intervals in (4) are order-convex, and every point of IhI_h precedes every point of IiI_i when h<ih<i.

Paths and Their Windows

The finite closures Fp(β)F_p(\beta) come from the coherent finite closure system on ω1\omega_1. Its zero-based sets at each endpoint increase, contain that endpoint, and exhaust its initial segment; coherence means that a member’s closure at the same index is the restriction to its initial segment. A predecessor closure family at β\beta is a family of finite sets indexed by the endpoints below β\beta and their natural indices.✦ A predecessor closure family at β\beta is coherent below β\beta when its sets increase with the index, contain their endpoints, exhaust their initial segments, and the closure of an included predecessor is the restriction to its initial segment. A coherent endpoint extension at β\beta of a predecessor closure family is an increasing exhaustive sequence of finite sets at β\beta, containing β\beta and lying below it, whose restrictions at included predecessors equal their assigned sets.✦ The endpoint closure construction assigns a sequence at β\beta to a predecessor family, and the full system is obtained recursively from the predecessor sequences. Positive closure index pp uses system index p−1p-1, while index zero also uses the first set.✦ The closure entry rank ρ(α,β)\rho(\alpha,\beta) is the first positive pp with α∈Fp(β)\alpha\in F_p(\beta) when α≤β\alpha\le\beta, and is zero otherwise.✦

A raw infinite path is a sequence of nonzero original rational pieces uiu_i, declared weights wiw_i, and metadata pip_i, indexed from zero.✦ Its prefix support Sn=⋃i≤nsupp⁡uiS_n=\bigcup_{i\le n}\operatorname{supp}u_i is nonempty, its endpoint is βn=max⁡Sn\beta_n=\max S_n✦, and its prefix closure is Fpn(βn)F_{p_n}(\beta_n).✦ The order position of α\alpha in a finite set HH is |{γ∈H:γ<α}||\{\gamma\in H:\gamma<\alpha\}|.✦ The positional array code of a rational array uu on a finite set H⊆ΓH\subseteq\Gamma is the list of order positions of the elements α∈H\alpha\in H paired with their coefficients u(α)u(\alpha), including zero coefficients.✦ The prefix code cnc_n lists (wi,pi,the code of ui on Fpn(βn))(w_i,p_i,\text{the code of }u_i\text{ on }F_{p_n}(\beta_n)) for 0≤i≤n0\le i\le n.✦ The injective coding map σ\sigma assigns a natural number to each such finite code, exceeding its maximum metadata; the maximum for the empty code is zero.

A raw path is admissible when its ordinal supports are successive, its metadata are strictly increasing, and 1≤wi≤pi,ρ(α,β)≤pn(α,β∈Sn,α≤β),wn+1=σ(cn).1\le w_i\le p_i,\qquad \rho(\alpha,\beta)\le p_n \quad(\alpha,\beta\in S_n,\ \alpha\le\beta),\qquad w_{n+1}=\sigma(c_n).(5)✦ Validity of a finite prefix of length ℓ≥1\ell\ge1 requires these conditions only at indices below ℓ\ell, with the coding rule in (5) required only when n+1<ℓn+1<\ell.✦

A finite path PP of length ℓ(P)\ell(P) for ff is a valid positive-length prefix of raw data whose original pieces uiu_i are values of Type I expressions of weights wiw_i, and have successive family supports.✦ A finite path PP for ff is legal when every child of every specified expression belongs to KfK_f.✦ For natural weights J,TJ,T, the finite path sum of PP and its weight window are the rational arrays V(P)=∑i<ℓ(P)ui,WJ,T(P)=∑i<ℓ(P)J≤wi≤Tui.V(P)=\sum_{i<\ell(P)}u_i,\qquad W_{J,T}(P)=\sum_{\substack{i<\ell(P)\\J\le w_i\le T}}u_i.(6) An infinite path PP for ff is a sequence of Type I expressions with admissible raw data, matching values and weights, successive family supports, and all children in KfK_f. Its prefix P|nP|_n retains the first n+1n+1 pieces; index zero includes one piece.✦ Its path partial functional is φV(P|n)\varphi_{V(P|_n)}✦, and its associated path functional FP∈E*F_P\in E^* is determined by FP(u)=limn→∞φV(P|n)(u)(u∈E).F_P(u)=\lim_{n\to\infty}\varphi_{V(P|_n)}(u)\qquad(u\in E).(7)✦

The Claim

Definition 1. For a legal finite path PP of ff, a finitely supported real vector xx, natural weights J,TJ,T, and a real number δ\delta, the path hits xx in the window [J,T][J,T] above δ\delta when Hit⁡(P,x,J,T,δ)⇔δ<|⟨WJ,T(P),ιx⟩|.\operatorname{Hit}(P,x,J,T,\delta) \quad\Longleftrightarrow\quad \delta<\bigl|\langle W_{J,T}(P),\iota x\rangle\bigr|.(8)✦

Definition 2. Let zz be an admissible block sequence for ff, let J,a∈ℕJ,a\in\mathbb N, and let ε∈ℝ\varepsilon\in\mathbb R. A family of weight window blocks for these data is an admissible block sequence xx with natural sequences (Jn)(J_n) and (Tn)(T_n) satisfying (9) for every zero-based block index nn.✦ Write S<n=⋃h<nsupp⁡xhS_{<n}=\bigcup_{h<n}\operatorname{supp}x_h. The set 𝒲(z,J,ε,a)\mathcal W(z,J,\varepsilon,a) consists of the families of weight window blocks for z,J,ε,az,J,\varepsilon,a: xn∈[z]≥a,1≤∥x‾n∥≤2,J<Jn≤Tn,Ti<Jj(i<j),ρ(min⁡{α,β},max⁡{α,β})<Jn(α,β∈S<n),𝒫(x‾n,LJn,16,r),τn:=|xn|1∑j>Tn1mj≤ε,limn→∞τn=0,limn→∞FP(x‾n)=0for every infinite path P of f.\begin{gathered} x_n\in[z]_{\ge a},\qquad 1\le\|\bar x_n\|\le2,\qquad J<J_n\le T_n,\\ T_i<J_j\quad(i<j),\qquad \rho(\min\{\alpha,\beta\},\max\{\alpha,\beta\})<J_n \quad(\alpha,\beta\in S_{<n}),\\ \mathcal P(\bar x_n,L_{J_n},16,r),\qquad \tau_n:=|x_n|_1\sum_{j>T_n}\frac1{m_j}\le\varepsilon, \qquad \lim_{n\to\infty}\tau_n=0,\\ \lim_{n\to\infty}F_P(\bar x_n)=0 \quad\text{for every infinite path }P\text{ of }f. \end{gathered}(9) The reciprocal tail in (9) is the series tail beginning at Tn+1T_n+1, with the convention tail⁡(b,N)=∑k≥0bk+N\operatorname{tail}(b,N)=\sum_{k\ge0}b_{k+N}.✦

Theorem 1. Let ff be a pure or mixed operation family, let zz be an admissible block sequence for ff, and let J,a∈ℕJ,a\in\mathbb N. For every ε>0\varepsilon>0, there is a family of weight window blocks: 𝒲(z,J,ε,a)≠⌀.\mathcal W(z,J,\varepsilon,a)\ne\varnothing.(10)✦

In the paper, the result reads: fixing JJ and ε>0\varepsilon>0 with εLJ1/r\varepsilon L_J^{1/r} at most its parameter θJ\theta_J, the constructed admissible blocks xix_i have 1≤∥x‾i∥≤21\le\|\bar x_i\|\le2 and windows [Ji,Ti][J_i,T_i] with Ji>JJ_i>J, Ji≤TiJ_i\le T_i, Ti<Ji+1T_i<J_{i+1}, and JiJ_i larger than every ρ\rho-value among preceding supports, satisfy the interval partition estimate with constant 1616 for d≤LJid\le L_{J_i} and the bounds |xi|1∑j>Ti1/mj≤ε|x_i|_1\sum_{j>T_i}1/m_j\le\varepsilon with these tail quantities tending to zero, have weakly null images x‾i\bar x_i, and a finite uncropped path hits ii at threshold δ>0\delta>0 when the absolute evaluation on x‾i\bar x_i of its original pieces with weights in [Ji,Ti][J_i,T_i] exceeds δ\delta.

What Is Checked

The definition (8) is stated over legal finite paths and rational coordinate evaluation on the completion, while (10) is stated over admissible block sequences in either operation family and every algebraic tail span (3).

Every infinite-path prefix sum belongs to KK✦, and the functional of (7) satisfies ∥FP∥≤1\|F_P\|\le1. Mixed rectangle crops preserve the full norming set✦, and their ambient crop operators preserve the closed evaluation span in (2).✦