The Setting
Paths and block sequences have coordinates in the first uncountable ordinal . Fix a bijection .✦ The color of is the first component of , and .✦ Each color class has cardinality and is unbounded in .
For or , the space consists of the -valued functions on with finite support. Write for the rational arrays.✦ The operation families are the pure families , , and the mixed family .✦ For finitely supported arrays , succession for a family is the relation defined by (1). (1)✦
Parameters and Type I Expressions
For a natural parameter , the depth sequence and the parameter state are defined by (2); is the exponent scale. (2) All sequence indices begin at zero. The underlying block lengths and normalization factors, and their family versions, are given by (3). Here and ; weight uses underlying parameter index .✦ (3) The subtraction in the exponent is natural-number subtraction.
A Type I expression for consists of a weight and nonzero children , where and whenever .✦ Its value is the normalized rational sum in (4). (4)✦
The Norming Families
For a base set and an operation family , the norming construction stages start with . At each subsequent stage, retain the preceding stage and adjoin the values of all Type I expressions whose children lie in that stage and all Type II expressions for which every child of every original uncropped piece on every original path lies in that stage.
The signed monochromatic coordinate base , the pure norming set , and the norming set for a family are defined by (5); denotes the coordinate array at . (5) The base norming set of a family consists of the signed monochromatic coordinates, including zero, when , and is the union of the pure norming sets over all colors when .
Finite Closures and Raw Codes
A predecessor closure family at is a family of finite subsets of .✦ A predecessor closure family at is coherent when , the sets at each increase to , and whenever .✦ A coherent endpoint extension of a predecessor closure family at is a sequence of finite subsets of containing , increasing to , and satisfying whenever belongs to .✦
Write for the endpoint construction, which assigns a sequence of finite subsets of to a predecessor closure family at . The coherent finite closure system is defined by ordinal recursion in (6). The sets use positive closure indices, and is the closure entry rank. (6)
A raw infinite path consists of nonzero rational arrays , declared weights , and metadata .✦ Its prefix support , endpoint , and prefix closure are the finite-coordinate constructions in (7). (7)
A finite path code is a finite list of triples , with and a finite subset of .✦ For a finite coordinate set , the coordinate order position and the positional rational array code are defined by (8), retaining zero coefficients. (8) The prefix code records the original pieces relative to the common prefix closure, as in (9). (9)✦
For a finite code , let be its maximum metadata, with .✦ The fixed injective coding map pairs the canonical natural-number code of with .✦ Its value exceeds every metadata entry of .
An admissible raw infinite path is a raw path with successive supports in ordinal order and positive, strictly increasing metadata, subject to (10). (10)✦
The Definition
Definition 1. Fix a pure or mixed family . An infinite path is a pair , where is a raw infinite path and are Type I expressions for satisfying (11). (11)✦
The set of raw path indices for is the set of raw infinite paths that occur in infinite paths, as specified by (12). (12)✦
An admissible block sequence for is a sequence in satisfying (13). (13)✦
What Is Checked
The definitions concern the pure and mixed norming families on , with rational Type I pieces and finitely supported real block vectors. Every raw infinite path has nonempty prefix support at each index.✦