OctoInformBeta

OpenAI preprint, September 2026 · §9. Changing the predual

§9 (setting): quotient, path synthesis and the perturbation: Under the continuum hypothesis, coded paths define a bounded perturbation of the coordinate quotient map

Changing the predual by path synthesis.

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

Changing the predual here means selecting a subspace of a real dual by perturbing its coordinate quotient map. The perturbation combines operators attached to pure and mixed families of coded paths.

The coordinate set is Γ=ω1\Gamma=\omega_1, the first uncountable ordinal. Fix a bijection π:Γ→ℕ×Γ\pi:\Gamma\to\mathbb N\times\Gamma.✦ The color classes CkC_k and their parametrizations ιk:Γ→Ck\iota_k:\Gamma\to C_k are defined in (1); each class has cardinality ℵ1\aleph_1 and is unbounded. c(a)=pr⁡1π(a),Ck={a∈Γ:c(a)=k},ιk(a)=π−1(k,a).c(a)=\operatorname{pr}_1\pi(a),\qquad C_k=\{a\in\Gamma:c(a)=k\},\qquad \iota_k(a)=\pi^{-1}(k,a).(1) An array uu on Γ\Gamma is a finitely supported rational-valued function on Γ\Gamma. The operation families are the pure families fkf_k, for k∈ℕk\in\mathbb N, and the mixed family f*f_*.✦ Supports are successive for a family when every coordinate of the first precedes every coordinate of the second; in the mixed family their colors must also increase.✦

For a family ff, let sfs_f be its primal exponent, ifi_f its family index, and hfh_f its source color, as specified in (2). For a family ff, the path exponent is qf=(sf+1)/sfq_f=(s_f+1)/s_f, and the source exponent is pf=sfhfp_f=s_{f_{h_f}}. fsfifhff*201fkk+2k+1k+1\begin{array}{c|ccc} f&s_f&i_f&h_f\\ \hline f_*&2&0&1\\ f_k&k+2&k+1&k+1 \end{array}(2) For a natural parameter ss, the Hölder exponent qsq_s is (s+1)/s(s+1)/s when s>0s>0, and q0=0q_0=0.

The Norming Completion

The family operations use block lengths and normalization factors at positive weights. Their underlying parameter sequences start at zero. Put dn=n+11d_n=n+11.✦ The exponent scale ts(n)t_s(n) is the first coordinate of the recursive parameter state (ts(n),bs(n))(t_s(n),b_s(n)) in (3). (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} (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}(3) The scales Ls(n)L_s(n) and ms(n)m_s(n) and their family versions are given by (4). Thus weight jj uses underlying parameter index j−1j-1; subtraction of natural numbers stops at zero. Sequence position nn corresponds to positive position n+1n+1. 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).\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_f(j)&=L_{s_f}(j-1),&m_f(j)&=m_{s_f}(j-1). \end{aligned}(4)

A Type I expression in a family ff is a finite list of nonzero successive children u0,…,uℓ−1u_0,\ldots,u_{\ell-1}, together with a positive weight jj and a length 1≤ℓ≤Lf(j)1\leq\ell\leq L_f(j).✦ The normalized value of a Type I expression in a family ff of weight jj with children u0,…,uℓ−1u_0,\ldots,u_{\ell-1} is mf(j)−1∑h<ℓuhm_f(j)^{-1}\sum_{h<\ell}u_h.✦ The pure base at color kk consists of zero and the signed singleton arrays ±δa\pm\delta_a with a∈Cka\in C_k.✦ Starting from this base, stage zero, each next stage retains the preceding stage and adjoins Type I values whose children belong to that stage. It also adjoins the values of Type II path expressions when every child of every original uncropped piece on each path belongs to that stage. The pure norming set KkK_k is the union of these stages for fkf_k.✦ The mixed family starts from ⋃kKk\bigcup_k K_k and uses the same stage rule with mixed succession. Its union is the full norming set KK.✦ Write KfK_f for the stage union belonging to a family ff.✦

A norming set KK on Γ\Gamma is a set of rational arrays containing every δa\delta_a and having all coefficients bounded in absolute value by one.✦ For the full norming set, the bounded function space is ℓ∞(K)\ell_\infty(K).✦ The coordinate evaluation vector eae_a is the bounded function ea(u)=u(a)e_a(u)=u(a) on KK.✦ The finite support inclusion JJ, its closed evaluation span EE, and the coordinate predual X0X_0 are specified in (5). Here φu\varphi_u is evaluation at u∈Ku\in K restricted to EE✦, and ea*=φδae_a^*=\varphi_{\delta_a} is the coordinate functional.✦ Jx=∑a∈Γx(a)ea(x finitely supported),E=J(ℝ(Γ))¯ℓ∞(K),X0=span¯E*{ea*:a∈Γ}.\begin{aligned} Jx&=\sum_{a\in\Gamma}x(a)e_a &&(x\text{ finitely supported}),\\ E&=\overline{J(\mathbb R^{(\Gamma)})}^{\,\ell_\infty(K)},& X_0&=\overline{\operatorname{span}}^{\,E^*} \{e_a^*:a\in\Gamma\}. \end{aligned}(5) The space EE has the inherited norm, and JJ also denotes the finite support inclusion with target restricted to EE.✦

Coded Paths and Their Functionals

The coherent finite closure system assigns to each β∈Γ\beta\in\Gamma a sequence Hn(β)H_n(\beta) of finite subsets of [0,β][0,\beta]. Each sequence contains its endpoint, increases under inclusion, and exhausts [0,β][0,\beta]; coherence means Hn(α)=Hn(β)∩[0,α]H_n(\alpha)=H_n(\beta)\cap[0,\alpha] when α∈Hn(β)\alpha\in H_n(\beta). A predecessor closure family at β∈Γ\beta\in\Gamma assigns a finite subset Hn(α)H_n(\alpha) of Γ\Gamma to each α<β\alpha<\beta and each natural index nn.✦ A predecessor closure family (Hn(α))n∈ℕ,α<β(H_n(\alpha))_{n\in\mathbb N,\,\alpha<\beta} at β\beta is coherent when these sets lie in [0,α][0,\alpha], each sequence contains its endpoint, increases under inclusion, exhausts [0,α][0,\alpha], and satisfies the coherence condition below β\beta. A coherent endpoint extension (Hn(β))n∈ℕ(H_n(\beta))_{n\in\mathbb N} of a predecessor closure family at β\beta is an increasing, exhaustive sequence of finite subsets of [0,β][0,\beta] containing β\beta, whose restrictions at predecessor points agree with the predecessor closure family whenever those points occur.✦ The endpoint construction assigns a sequence of finite sets to a predecessor family, and the closure system is obtained by recursion over the endpoints. The positive-indexed closure is Fp(β)=Hp−1(β)F_p(\beta)=H_{p-1}(\beta), with index zero also selecting H0(β)H_0(\beta).✦ The closure entry rank ρ(α,β)\rho(\alpha,\beta) is the first positive pp for which α∈Fp(β)\alpha\in F_p(\beta) when α≤β\alpha\leq\beta, and is zero otherwise.✦

A raw infinite path rr consists of nonzero rational arrays uiu_i, declared weights jij_i, and metadata viv_i, indexed from zero.✦ Its prefix support SnS_n, endpoint βn\beta_n, and prefix closure DnD_n are given by (6). Sn=⋃i=0nsupp⁡ui,βn=max⁡Sn,Dn=Fvn(βn).S_n=\bigcup_{i=0}^n\operatorname{supp}u_i,\qquad \beta_n=\max S_n,\qquad D_n=F_{v_n}(\beta_n).(6) For a finite set D⊂ΓD\subset\Gamma, the order position of aa is the number of points of DD strictly below aa.✦ The positional array code of a rational array uu on Γ\Gamma relative to a finite set D⊂ΓD\subset\Gamma is the finite set of pairs consisting of the number of points of DD strictly below aa and u(a)u(a), for a∈Da\in D; zero coefficients are retained.✦ A finite path code is a list of triples recording weight, metadata, and a positional array code.✦ The code cn(r)c_n(r) is the list of these triples for i=0,…,ni=0,\ldots,n, all using the common closure DnD_n.✦ The maximum metadata of a finite path code is the maximum of its metadata entries, with value zero for an empty list.✦ The coding map σ\sigma pairs the canonical natural-number code of its argument with one plus its maximum metadata.✦ It is injective, and its value exceeds every metadata entry of its argument.

A raw infinite path rr is admissible when its supports are successive in the ordinal order and its metadata are positive and strictly increasing, with the remaining conditions in (7). 1≤jn≤vn,ρ(a,b)≤vn(a,b∈Sn,a≤b),jn+1=σ(cn(r)).\begin{gathered} 1\leq j_n\leq v_n,\qquad \rho(a,b)\leq v_n\quad(a,b\in S_n,\ a\leq b),\\ j_{n+1}=\sigma(c_n(r)). \end{gathered}(7) An admissible prefix of length ℓ\ell of a raw infinite path rr consists of its first ℓ\ell entries, with successive supports in the ordinal order, positive and strictly increasing metadata, and the conditions in (7) at indices below ℓ\ell, with the coding rule required only when the next index is also below ℓ\ell.

A finite path PP in a family ff consists of a positive length ℓ\ell, raw infinite data with an admissible prefix of that length, and original uncropped Type I expressions at indices below ℓ\ell. Their values and weights are uiu_i and jij_i, and the original rational pieces are successive for ff. The finite path sum of a finite path PP of length ℓ\ell with rational pieces uiu_i is ∑i<ℓui\sum_{i<\ell}u_i.✦ An infinite path PP in a family ff consists of admissible raw data (ui,ji,vi)(u_i,j_i,v_i) and original uncropped Type I expressions at every index ii, whose values are uiu_i and whose weights are jij_i, with family succession and every child in KfK_f.✦ The prefix through nn of an infinite path PP is the finite path retaining the raw data of PP and its first n+1n+1 expressions; the zeroth prefix contains one piece.✦

For an infinite path PP, the partial functional SP,nS_{P,n} is the norming evaluation functional associated with the sum of its prefix through nn.✦ The chosen path functional FP∈E*F_P\in E^* is its pointwise limit, as in (8).✦ The raw path index set 𝒫f\mathcal P_f consists of the raw data admitting an infinite path in ff✦; for each a∈𝒫fa\in\mathcal P_f, choose one such representative ã\widetilde a.✦ SP,n=φ∑i=0nui,FP(x)=limn→∞SP,n(x)(x∈E).S_{P,n}=\varphi_{\sum_{i=0}^n u_i},\qquad F_P(x)=\lim_{n\to\infty}S_{P,n}(x)\quad(x\in E).(8)

The Definition

Definition 1. The dual quotient WW is defined by (9). W=E*/X0.W=E^*/X_0.(9)✦ Write Q:E*→WQ:E^*\to W for the canonical bounded quotient map. For a family ff and a∈𝒫fa\in\mathcal P_f, the path coset ξa∈W\xi_a\in W is given by (10). ξa=Q(Fã).\xi_a=Q(F_{\widetilde a}).(10)✦ For a family ff, finite path synthesis Af0A_f^0 is the linear map from finitely supported real families cc on 𝒫f\mathcal P_f to WW given by Af0c=∑ac(a)ξaA_f^0c=\sum_a c(a)\xi_a. Identify these coefficients with their natural images in the real sequence spaces ℓp(𝒫f)\ell_p(\mathcal P_f).✦ The path synthesis operator in (11) is the continuous extension of finite path synthesis. Af:ℓqf(𝒫f)→W,Afc=Af0c(c finitely supported).A_f:\ell_{q_f}(\mathcal P_f)\longrightarrow W,\qquad A_f c=A_f^0c\quad(c\text{ finitely supported}).(11)✦ For an exponent p∈[0,∞]p\in[0,\infty] and an index set II, the finitely supported sequence embedding is the linear inclusion of finitely supported real families cc on II into ℓp(I)\ell_p(I) that preserves every coordinate c(a)c(a).

Assume the continuum hypothesis, |ℝ|=ℵ1|\mathbb R|=\aleph_1. Choose a base path labelling injection bf:𝒫f↪Γb_f:\mathcal P_f\hookrightarrow\Gamma.✦ The colored path labelling λf\lambda_f is defined in (12). λf(a)=ιhf(ιif(bf(a))).\lambda_f(a)=\iota_{h_f}\bigl(\iota_{i_f}(b_f(a))\bigr).(12)✦ For a family ff, finite color synthesis is the linear map from finitely supported real families cc on 𝒫f\mathcal P_f to EE that sends cc to ∑ac(a)eλf(a)\sum_a c(a)e_{\lambda_f(a)}. Its continuous extension is Tf:ℓpf(𝒫f)→ET_f:\ell_{p_f}(\mathcal P_f)\to E.✦ For an index set II and conjugate exponents p,qp,q, the dual coefficient sequence of a functional g∈ℓp(I)*g\in\ell_p(I)^* is (g(εa))a∈I∈ℓq(I)(g(\varepsilon_a))_{a\in I}\in\ell_q(I), where εa\varepsilon_a is the unit sequence.✦ For a bounded linear map T:ℓp(I)→ET:\ell_p(I)\to E, the dual analysis operator of TT is the map that sends g∈E*g\in E^* to the dual coefficient sequence of g∘Tg\circ T.✦ The color analysis operator LfL_f and the family perturbation operator UfU_f are specified in (13). Lf:E*→ℓqf(𝒫f),(Lfg)(a)=g(Tfεa),Uf=Af∘Lf.L_f:E^*\longrightarrow\ell_{q_f}(\mathcal P_f),\qquad (L_fg)(a)=g(T_f\varepsilon_a),\qquad U_f=A_f\circ L_f.(13) Enumerate the families by g0=f*g_0=f_* and gk+1=fkg_{k+1}=f_k✦, and put τn=132(12)n\tau_n=\frac1{32}(\frac12)^n.✦ The bounded perturbation operator BB is defined by (14). B:E*→W,B=∑n=0∞τnUgn.B:E^*\longrightarrow W,\qquad B=\sum_{n=0}^{\infty}\tau_n U_{g_n}.(14)✦ The changed predual X⊂E*X\subset E^* is the kernel in (15). X=ker⁡(Q−B).X=\ker(Q-B).(15)✦

What Is Checked

The definitions concern the real norming completion of the full pure and mixed norming set on Γ=ω1\Gamma=\omega_1; colored labelling and the perturbation use the continuum hypothesis. Every finite prefix of an infinite path has its sum in KK✦, and every raw prefix support is nonempty.✦ Every path functional has norm at most one. The source and path exponents pf,qfp_f,q_f are Hölder conjugate.✦ The quotient WW is complete.✦