The Setting
The construction assigns a norm to finitely supported real functions on by a family of finitely supported rational arrays. Pure operations act within a fixed color, while mixed operations also impose succession of colors. The completed real space is ✦; the closed span of its coordinate functionals is .✦
Fix a bijection .✦ The color of is , and is an unbounded set of cardinality .✦ Write for the rational arrays, for the array equal to one at and zero elsewhere, and for the restriction of to , extended by zero.
The operation families are , for , and .✦ Their parameter indices are and ✦, and their exponent is .✦ For arrays , write when every and satisfy , with the additional condition for .✦
Parameters and Prefix Codes
The depth sequence is , with zero-based index .✦ For a natural parameter , the exponent scale is the first coordinate of a recursive state .✦ Its recursion is (1)✦ The block length and normalization factor at weight use parameter index in (1): (2)
A predecessor closure family at is a family of finite sets indexed by and .✦ A coherent predecessor closure family at is a family of finite sets , for and , whose sequences increase, contain their endpoints, exhaust the intervals up to their endpoints, and satisfy (3) A coherent endpoint extension of a family satisfying (3) is an increasing sequence of finite sets containing , contained in , and exhausting , with whenever belongs to .✦ The endpoint construction extends predecessor families; transfinite recursion gives the coherent finite closure system . Its positive-indexed closures are denoted by . For , the closure entry rank is the first positive index for which when , and is zero otherwise.
A raw infinite path is a sequence of nonzero arrays , weights , and metadata .✦ For a raw infinite path , the prefix support is a finite subset of , the endpoint is its largest element, and the prefix closure is the finite subset of given by (4) For a finite set , the position of in is .✦ For an array and a finite set , the positional array code is the finite set of pairs .✦ A finite path code is a finite list of triples consisting of a weight, metadata, and a finite set of pairs from .✦ The prefix code of is the list (5)✦ For a code , let be its largest metadata entry, with .✦ Fix an injective numbering of these codes. The coding map from finite path codes to is the map defined by , where the brackets denote the natural-number pairing function.✦ The indices in (4) and (5) begin at zero.
The Definition
Definition 1. A convex crop is a pair of order-convex sets, one in and one in : (6)✦ The support set of the crop in (6) is for a pure family and for the mixed family.✦
A Type I expression for is a positive weight and a nonempty finite sequence of nonzero arrays satisfying (7)✦ The value of a Type I expression for is the normalized rational array (8)
An admissible prefix of length of a raw path is a finite initial segment of of length that satisfies (9)✦ The support inequality in (9) means that each point of the first support precedes each point of the second.
A finite admissible path for is a raw path , a positive length , and Type I expressions with values given by (8) for its first pieces, subject to $$\begin{gathered} \ell\geq1,\qquad P\text{ satisfies }\eqref{eq:claim3},\\ V(e_i)=u_i,\quad \operatorname{weight}(e_i)=j_i\quad(i<\ell),\qquad u_i\prec_f u_h\quad(i<h<\ell). \end{gathered}$$(10)✦ The pieces in (10) are the original uncropped rational arrays. For a finite path and a crop, the active weights form the finite set (11)✦
A Type II expression for is a finite family of finite admissible paths , crops , and rational coefficients such that (12)✦ The active sets in (12) are those of (11); may be zero. Denote the Type II value by .
For a base , the construction stages are $$\begin{aligned} K_0(B,f)&=B,\\ K_{n+1}(B,f)&=K_n(B,f)\\ &\quad\cup\{V(e):e\text{ satisfies }\eqref{eq:claim2},\ v_h\in K_n(B,f)\text{ for every child }v_h\}\\ &\quad\cup\{V(\eta):\eta\text{ satisfies }\eqref{eq:claim5},\ \text{every child of every path expression belongs to }K_n(B,f)\}. \end{aligned}$$(13)✦ The stage index in (13) begins at zero. The pure norming family of color is (14)✦ The full norming family is the mixed closure of the pure families in (14): (15)✦
A norming set on is a set that contains every and satisfies for every and .✦ The norming set for the completed space is (16)✦ For this from (16), let be the real bounded functions on .✦ The coordinate evaluation vector is .✦ The finite-support inclusion is the real linear map from into .✦ The norming completion of the norming set is the closed span of the coordinate evaluation vectors in , given by (17)✦ For , the norming evaluation functional on in (17) is .✦ The coordinate functionals are .✦ The coordinate predual is (18)✦ The closure in (18) is in the dual norm.
What Is Checked
The definitions are stated over , its fixed color partition and coherent finite closure system, the parameter sequences, and the rational path coding map. Every raw prefix support in (4) is nonempty.✦