The Setting
The parameter problem for coded norming functionals concerns the ratio of a block length to its normalization factor. Fix an integer and put . The conjugate exponents and of and , respectively, are given by (1). (1)
The sequences use positive indices ; weight and its parameters have underlying index . The depth sequence is the sequence of positive integers defined by (2). (2)✦
The exponent scales and cumulative length bounds are the natural number sequences defined by the recursion (3). (3)
The block lengths and normalization factors are the positive integer sequences in (4). (4) The norming weights are the real numbers defined by (5). (5)✦
The Claim
Theorem 1. Let be an integer, with the exponents and sequences defined above. For positive integers , the strict growth assertions (6) and (7) hold. (6)✦ (7)✦ The weight estimates are (8) and (9), with every positive integer permitted in the tail estimate. (8)✦ (9)✦ For the reciprocal normalization factors, (10) holds. (10)✦ The logarithmic block ratio satisfies (11). (11)✦ At every positive index , the depth estimates are (12) and (13). (12)✦ (13)✦ The ratio of block length to normalization factor has the limit (14). (14)✦
In the paper, the result reads: for each family of coded norming functionals there are strictly increasing positive integer sequences and positive integers such that, writing , and , one has , , , , and , and in particular .
What Is Checked
The assertions concern the recursive natural number sequences and their associated block lengths, normalization factors and norming weights, with the depths , an integer and the fixed exponent .