OctoInformBeta

OpenAI preprint, September 2026 · §5. A dual space with coded norming functionals

Lemma 5.1: A recursive choice for integers s≥2s\ge2 and the exponent q=(s+1)/sq=(s+1)/s

Explicit parameters satisfy the norming estimates.

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 parameter problem for coded norming functionals concerns the ratio of a block length to its normalization factor. Fix an integer s≥2s\ge2 and put q=(s+1)/sq=(s+1)/s. The conjugate exponents r=s′r=s' and q′q' of ss and qq, respectively, are given by (1). r=ss−1,q′=s+1.r=\frac{s}{s-1},\qquad q'=s+1.(1)

The sequences use positive indices j≥1j\ge1; weight jj and its parameters have underlying index j−1j-1. The depth sequence (dj)j≥1(d_j)_{j\ge1} is the sequence of positive integers defined by (2). dj=j+10(j≥1).d_j=j+10\qquad(j\ge1).(2)✦

The exponent scales tjt_j and cumulative length bounds BjB_j are the natural number sequences defined by the recursion (3). t1=(d1+1)+1+d1+d12,B1=0,Bj+1=Bj+2⋅2s(s+1)tj,tj+1=tj+(Bj+1+1)(dj+1+1)+1+dj+1+dj+12(j≥1).\begin{aligned} t_1&=(d_1+1)+1+d_1+d_1^2,& B_1&=0,\\ B_{j+1}&=B_j+2\cdot2^{s(s+1)t_j},\\ t_{j+1}&=t_j+(B_{j+1}+1)(d_{j+1}+1)+1+d_{j+1}+d_{j+1}^2 &&(j\ge1). \end{aligned}(3)

The block lengths LjL_j and normalization factors mjm_j are the positive integer sequences in (4). Lj=2s(s+1)tj,mj=2(s−1)(s+1)tj+dj(j≥1).L_j=2^{s(s+1)t_j},\qquad m_j=2^{(s-1)(s+1)t_j+d_j}\qquad(j\ge1).(4) The norming weights θj\theta_j are the real numbers defined by (5). θj=Lj1/rmj(j≥1).\theta_j=\frac{L_j^{1/r}}{m_j}\qquad(j\ge1).(5)✦

The Claim

Theorem 1. Let s≥2s\ge2 be an integer, with the exponents and sequences defined above. For positive integers j<kj<k, the strict growth assertions (6) and (7) hold. Lj<Lk.L_j<L_k.(6)✦ mj<mk.m_j<m_k.(7)✦ The weight estimates are (8) and (9), with every positive integer JJ permitted in the tail estimate. ∑j=1∞θj<18.\sum_{j=1}^{\infty}\theta_j<\frac18.(8)✦ ∑j=J∞θj≤4θJ.\sum_{j=J}^{\infty}\theta_j\le4\theta_J.(9)✦ For the reciprocal normalization factors, (10) holds. ∑j=1∞1mj<18.\sum_{j=1}^{\infty}\frac1{m_j}<\frac18.(10)✦ The logarithmic block ratio satisfies (11). limj→∞log⁡(Lj/mj)log⁡Lj=1s.\lim_{j\to\infty}\frac{\log(L_j/m_j)}{\log L_j}=\frac1s.(11)✦ At every positive index jj, the depth estimates are (12) and (13). (18)dj≤θj.\left(\frac18\right)^{d_j}\le\theta_j.(12)✦ (1+Bj)dj(1+Bj+Lj1/q′)≤Ljmj.(1+B_j)^{d_j}\bigl(1+B_j+L_j^{1/q'}\bigr)\le\frac{L_j}{m_j}.(13)✦ The ratio of block length to normalization factor has the limit (14). limj→∞Ljmj=+∞.\lim_{j\to\infty}\frac{L_j}{m_j}=+\infty.(14)✦

In the paper, the result reads: for each family of coded norming functionals there are strictly increasing positive integer sequences Lj,mjL_j,m_j and positive integers djd_j such that, writing θj=Lj1/r/mj\theta_j=L_j^{1/r}/m_j, c0=∑j≥1θjc_0=\sum_{j\ge1}\theta_j and Bj=2∑h<jLhB_j=2\sum_{h<j}L_h, one has c0<1/8c_0<1/8, ∑j≥Jθj≤4θJ\sum_{j\ge J}\theta_j\le4\theta_J, ∑j≥11/mj<1/8\sum_{j\ge1}1/m_j<1/8, log⁡(Lj/mj)/log⁡Lj→1/s\log(L_j/m_j)/\log L_j\to1/s, (1/8)dj≤θj(1/8)^{d_j}\le\theta_j and (1+Bj)dj(1+Bj+Lj1/q′)≤Lj/mj(1+B_j)^{d_j}(1+B_j+L_j^{1/q'})\le L_j/m_j, and in particular Lj/mj→∞L_j/m_j\to\infty.

What Is Checked

The assertions concern the recursive natural number sequences (tj,Bj)(t_j,B_j) and their associated block lengths, normalization factors and norming weights, with the depths dj=j+10d_j=j+10, an integer s≥2s\ge2 and the fixed exponent q=(s+1)/sq=(s+1)/s.