OctoInformBeta

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

Proposition 7.1: Exact pairs for admissible pure or mixed block sequences

A prescribed weight detects a tail vector.

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

The question is whether an algebraic tail of a block sequence contains a vector seen by a functional of a prescribed weight, with the detecting support confined to the vector’s ordinal range and, in the mixed family, its color range.

The coordinate set is Γ=ω1\Gamma=\omega_1, the set of ordinals below the initial ordinal of cardinality ℵ1\aleph_1.✦ Fix a bijection π:Γ→ℕ×Γ\pi\colon\Gamma\to\mathbb N\times\Gamma, and let c(α)c(\alpha) be its first component. The color classes Ck={α:c(α)=k}C_k=\{\alpha:c(\alpha)=k\} are unbounded in Γ\Gamma and have cardinality ℵ1\aleph_1.

Write c00(Γ,ℚ)c_{00}(\Gamma,\mathbb Q) for the rational arrays with finite support, and let eαe_\alpha be the array equal to 11 at α\alpha and zero elsewhere. A norming set N⊆c00(Γ,ℚ)N\subseteq c_{00}(\Gamma,\mathbb Q) is a set satisfying (1): eα∈N,|h(α)|≤1(α∈Γ,h∈N).e_\alpha\in N,\qquad |h(\alpha)|\le1 \quad(\alpha\in\Gamma,\ h\in N).(1)✦

The Norming Families

An operation family ff is either a pure family pure(k)\mathrm{pure}(k), indexed by k∈ℕk\in\mathbb N, or the mixed family mixed\mathrm{mixed}.✦ Their parameter is s(pure(k))=k+2s(\mathrm{pure}(k))=k+2 and s(mixed)=2s(\mathrm{mixed})=2.✦

For natural numbers s,ns,n, the depth dnd_n and recursive parameter state (ts,n,bs,n)(t_{s,n},b_{s,n}) are defined by (2); the exponent scale is the first coordinate ts,nt_{s,n}. dn=n+11,(ts,0,bs,0)=(d02+2d0+2,0),bs,n+1=bs,n+2⋅2s(s+1)ts,n,ts,n+1=ts,n+(bs,n+1+1)(dn+1+1)+1+dn+1+dn+12.\begin{aligned} d_n&=n+11,\\ (t_{s,0},b_{s,0})&=(d_0^2+2d_0+2,0),\\ b_{s,n+1}&=b_{s,n}+2\cdot2^{s(s+1)t_{s,n}},\\ t_{s,n+1}&=t_{s,n}+(b_{s,n+1}+1)(d_{n+1}+1) +1+d_{n+1}+d_{n+1}^2. \end{aligned}(2) The block lengths and normalization factors are given by (3), where subtraction of natural numbers is truncated at zero. The parameter index nn starts at zero and corresponds to the paper’s positive index n+1n+1; a positive weight jj uses index j−1j-1. Ls,n=2s(s+1)ts,n,ms,n=2(s−1)(s+1)ts,n+dn,Ljf=Ls(f),j−1,mjf=ms(f),j−1.\begin{aligned} L_{s,n}&=2^{s(s+1)t_{s,n}},& m_{s,n}&=2^{(s-1)(s+1)t_{s,n}+d_n},\\ L_j^f&=L_{s(f),j-1},&m_j^f&=m_{s(f),j-1}. \end{aligned}(3)

Two finitely supported arrays have successive supports for a family ff when every coordinate of the first precedes every coordinate of the second and, if ff is mixed, every color of the first is smaller than every color of the second.✦ A Type I expression ee for ff consists of a positive weight jj, a length 1≤ℓ≤Ljf1\le\ell\le L_j^f, and nonzero rational children h0,…,hℓ−1h_0,\ldots,h_{\ell-1} with successive supports for ff.✦ Its value is the normalized sum (4). he=1mjf∑i=0ℓ−1hi.h_e=\frac1{m_j^f}\sum_{i=0}^{\ell-1}h_i.(4)✦

For a base set BB and a family ff, the construction stages Sn(B,f)S_n(B,f) start with S0(B,f)=BS_0(B,f)=B. The construction also uses Type II values associated with original paths of uncropped rational pieces. The next stage consists of the preceding stage together with all Type I values whose children belong to that stage, and all Type II values whose children in every uncropped rational piece on every original path belong to that stage. The stage index begins at zero.

The signed monochromatic coordinate set BkB_k, the pure norming set KkK_k, and the full norming set KK are defined by (5). Bk={0}∪{±eα:α∈Ck},Kk=⋃n≥0Sn(Bk,pure(k)),K=⋃n≥0Sn(⋃k≥0Kk,mixed).\begin{aligned} B_k&=\{0\}\cup\{\pm e_\alpha:\alpha\in C_k\},\\ K_k&=\bigcup_{n\ge0}S_n(B_k,\mathrm{pure}(k)),\\ K&=\bigcup_{n\ge0}S_n\left(\bigcup_{k\ge0}K_k,\mathrm{mixed}\right). \end{aligned}(5) For a pure family f=pure(k)f=\mathrm{pure}(k), its base is BkB_k and its norming family KfK_f is KkK_k; for the mixed family, its base is ⋃kKk\bigcup_kK_k and its norming family is KK. A Type I expression for ff is legal when every child belongs to KfK_f.

The Completion and Its Blocks

The space ℓ∞(K)\ell_\infty(K) consists of bounded real functions on KK, with the supremum norm.✦ For α∈Γ\alpha\in\Gamma, the coordinate evaluation vector uα∈ℓ∞(K)u_\alpha\in\ell_\infty(K) is defined by (6); the same display defines the inclusion ι\iota from c00(Γ,ℝ)c_{00}(\Gamma,\mathbb R) into ℓ∞(K)\ell_\infty(K) and the real normed completion EE as the closed evaluation span, with its inherited norm. The same inclusion ι\iota is regarded as taking values in EE. uα(h)=h(α),ιx=∑α∈supp⁡xx(α)uα,E=ι(c00(Γ,ℝ))¯∥⋅∥.u_\alpha(h)=h(\alpha),\qquad \iota x=\sum_{\alpha\in\operatorname{supp}x}x(\alpha)u_\alpha,\qquad E=\overline{\iota\bigl(c_{00}(\Gamma,\mathbb R)\bigr)}^{\|\cdot\|}.(6)

For h∈Kh\in K, the norming evaluation functional on EE is φh(v)=v(h)\varphi_h(v)=v(h).✦ The coordinate functional at α\alpha is eα*=φeαe_\alpha^*=\varphi_{e_\alpha}.✦ The coordinate predual X0X_0 of EE is the closed real linear subspace of the continuous real dual E*E^* generated by the coordinate functionals eα*e_\alpha^*, with the usual dual norm.✦ For a rational array h∈c00(Γ,ℚ)h\in c_{00}(\Gamma,\mathbb Q), its rational coordinate combination h*∈X0h^*\in X_0 and its evaluation h[v]h[v] at v∈Ev\in E are defined by (7). X0=span⁡ℝ{eα*:α∈Γ}¯∥⋅∥,h*=∑α∈supp⁡hh(α)eα*∈X0,h[v]=h*(v)(h∈c00(Γ,ℚ),v∈E).\begin{aligned} X_0&=\overline{\operatorname{span}_{\mathbb R} \{e_\alpha^*:\alpha\in\Gamma\}}^{\|\cdot\|},\\ h^*&=\sum_{\alpha\in\operatorname{supp}h}h(\alpha)e_\alpha^*\in X_0, & h[v]&=h^*(v) \quad(h\in c_{00}(\Gamma,\mathbb Q),\ v\in E). \end{aligned}(7)

An admissible block sequence z=(zn)n≥0z=(z_n)_{n\ge0} for ff is a sequence of nonzero vectors in c00(Γ,ℝ)c_{00}(\Gamma,\mathbb R) with successive supports for ff. In the pure family pure(k)\mathrm{pure}(k), every support is contained in CkC_k. The sequence index starts at zero. For an admissible block sequence zz for a family ff and a∈ℕa\in\mathbb N, the algebraic tail span Ta(z)T_a(z) is the real linear subspace of c00(Γ,ℝ)c_{00}(\Gamma,\mathbb R) given by (8). Ta(z)=span⁡ℝ{za+n:n≥0}.T_a(z)=\operatorname{span}_{\mathbb R}\{z_{a+n}:n\ge0\}.(8)✦

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.✦ The support set A(f)A(f) of an ordinal and color rectangle A=(I,D)A=(I,D) for a family ff is A(pure(k))=IA(\mathrm{pure}(k))=I and A(mixed)=I∩c−1(D)A(\mathrm{mixed})=I\cap c^{-1}(D).✦ For a nonempty finite set S⊆ΓS\subseteq\Gamma, its ordinal interval hull is [min⁡S,max⁡S][\min S,\max S].✦ The vector support crop of a nonzero finitely supported real vector xx is the rectangle AxA_x in (9). Ax=([minsuppx,maxsuppx],[minc(suppx),maxc(suppx)]).A_x=\left( [\min\operatorname{supp}x,\max\operatorname{supp}x], [\min c(\operatorname{supp}x),\max c(\operatorname{supp}x)] \right).(9)✦

For an admissible block sequence zz for a family ff, a tail index a∈ℕa\in\mathbb N, and a weight J≥1J\ge1, an exact pair (x,e)(x,e) for (z,a,J)(z,a,J) is an ordered pair consisting of a nonzero vector xx of Ta(z)T_a(z) and a legal Type I expression ee for ff of weight JJ, satisfying (10).✦ In a pure family pure(k)\mathrm{pure}(k), every coordinate of supp⁡x\operatorname{supp}x must also belong to CkC_k. Write EP⁡(z,a,J)\operatorname{EP}(z,a,J) for the set of these pairs. ∥ιx∥≤500,he[ιx]≥12,supp⁡he⊆Ax(f).\|\iota x\|\le500,\qquad h_e[\iota x]\ge\frac12,\qquad \operatorname{supp}h_e\subseteq A_x(f).(10)

The Claim

Theorem 1. Let zz be an admissible block sequence for a pure or mixed family ff, let a∈ℕa\in\mathbb N, and let J≥1J\ge1 be a weight. There is an exact pair (x,e)∈EP⁡(z,a,J).(x,e)\in\operatorname{EP}(z,a,J).(11)✦

What Is Checked

The assertion (11) is stated over finitely supported real block vectors and their algebraic tail spans, with the norm taken in EE and the detecting array evaluated through its rational coordinate combination in X0X_0. For the full norming family and its coordinate predual, the coordinate and coefficient assertions are (12). eα∈K,|h(α)|≤1,eα*∈X0(α∈Γ,h∈K).e_\alpha\in K,\qquad |h(\alpha)|\le1,\qquad e_\alpha^*\in X_0 \quad(\alpha\in\Gamma,\ h\in K).(12)