The Setting
Infinite path functionals determine cosets modulo the closed span of coordinate functionals. The synthesis problem asks which coefficient sequences can be assigned linear combinations of these cosets in the dual quotient.
Let , the first uncountable ordinal.✦ Fix a bijection , and let be its first coordinate at . The color classes are unbounded and have cardinality . A rational array on is a finitely supported function .✦
There is a pure operation family for each color , and a mixed family .✦ Their parameters are and .✦ The exponent of a family is ; its path sequence space uses this finite positive exponent.✦
Parameters and Norming Arrays
The depth sequence is , with indices starting at zero.✦ For a natural parameter , the recursive parameter state is the pair defined by (1). The exponent scale for a natural parameter and a zero-based index is the first coordinate of the recursive parameter state. (1)✦ The block lengths and normalization factors are given by (2). A positive weight uses the underlying parameter index ; weight zero also uses index zero. The general exponent function is for , and .✦ (2) Here subtraction in is truncated at zero when .
Two arrays are successive for when every precedes every . For the mixed family this also requires for every such pair. A Type I expression in a family is a tuple consisting of a positive weight and nonzero successive children , where .✦ Its value is the normalized sum in (3). (3)✦
For a set of rational arrays on and an operation family , the norming construction stages are sets of rational arrays defined recursively as follows. Stage zero is . The pure base of color is , where is the unit rational array at .✦ The pure and full norming sets in (4) distinguish the pure constructions from the mixed one. (4)
A norming set on is a set of rational arrays containing every and satisfying for every member and coordinate .✦ The full set has these properties. Its bounded function space is with the supremum norm.✦ The coordinate evaluation vector is the function .✦ Let denote the real finitely supported functions on ; the finite-support inclusion and the real norming completion are defined in (5), for finitely supported . (5) For , the norming evaluation functional on is point evaluation, .✦ In particular, the coordinate functional at is .✦ The coordinate predual and the dual quotient are the spaces in (6), with norm closure in the continuous real dual and the quotient norm on . (6)
Paths and Their Functionals
A predecessor closure family at is a family of finite sets , one for each and .✦ A predecessor closure family at is coherent when, for each , the sets form an increasing sequence of finite subsets of containing and exhausting , and whenever .✦ A coherent endpoint extension of a predecessor closure family at is an increasing sequence of finite sets containing and exhausting , with whenever belongs to .✦ The endpoint closure construction assigns a finite-set sequence to a predecessor family. Applied recursively to the already constructed families below each endpoint, it defines the coherent finite closure system .✦
The positive-indexed finite closure is , so that closure index zero also selects the first system entry.✦ For , the closure entry rank is the first positive for which ; it is zero when .✦
A raw infinite path consists of nonzero rational arrays , declared natural weights , and natural metadata , all indexed from zero.✦ Its prefix support , endpoint , and prefix closure are specified in (7). (7) For a finite set , the order position of in is .✦ The positional rational array code of a rational array on relative to a finite set is the finite set given by , including zero coefficients.✦ A finite path code is a finite list of triples recording a weight, metadata, and a positional rational array code.✦ The prefix code is the list , using the common closure .✦ For a finite code , let be its largest metadata entry, with .✦ The coding map pairs the canonical natural-number code of with ; it is injective and exceeds every metadata entry of .✦
The raw path is admissible when its pieces have successive ordinal supports, its metadata are strictly increasing and positive, and the conditions in (8) hold at every index . (8)✦ A valid prefix of length of a raw infinite path is its initial segment of length , with successive ordinal supports, strictly increasing positive metadata, and the conditions in (8) at indices below , with the coding rule required only when ; entries beyond the prefix are unrestricted.✦
A finite path in a family consists of raw data with pieces and weights , a positive length with valid prefix, and Type I expressions at positions whose values are and whose weights are . Their values are successive for . The finite path sum of a finite path in a family , with length and pieces , is .✦ An infinite path in a family consists of admissible raw data with pieces and weights , and a Type I expression at every index whose value is and whose weight is . Its values are successive for , and every child of every expression belongs to . The finite prefix retains the raw data and the first original expressions.✦
The next norming construction stage retains the preceding stage and adds Type I values whose children lie there, together with finite path sums whose every child of every original uncropped piece lies there.✦
The path index set consists of all raw infinite paths occurring in infinite paths of .✦ For each , choose an infinite path with exactly those raw data, retaining the original rational pieces as well as their weights and metadata.✦ For an infinite path , let be norming evaluation at its finite prefix sum.✦ The bounded path functional of an infinite path is the chosen pointwise limit in (9). (9)✦ The path coset indexed by is given by .✦
For a finite exponent , the real sequence space consists of families with , with its usual norm. The finitely supported sequence embedding sends each member of , the real vector space of finitely supported families on , to the same coordinate family in this space.✦ Finite path synthesis is the real-linear map defined by (10). (10)✦
The Claim
Theorem 1. Let be a pure or mixed operation family. Finite path synthesis extends along the finitely supported sequence embedding to a continuous real-linear map .✦ It satisfies (11) and (12), where , , and is the unit coordinate vector of . (11)✦ (12)✦
What Is Checked
The statement is over the concrete norming completion , its coordinate predual , and the path indices of each pure or mixed family. Every raw prefix support is nonempty.✦ For an infinite path, each finite prefix sum belongs to ✦, and the associated path functional has norm at most one. The quotient is complete.✦