The Setting
An infinite path has original rational pieces and a sequence of weights, as well as an associated bounded functional on a real Banach space. Lemma 6.2 concerns finite families of paths and the dual norm of their tails.
The coordinate set is .✦ Fix a bijection from onto , and let be the first component of the image of . The sets form the countable unbounded partition into colors. A rational array on is a function on with finite support.✦
Families and Norming Arrays
An operation family is either the pure family of a color or the mixed family.✦ Its parameter and exponent are given by (1). (1) For rational arrays , family succession means that every precedes every ; in the mixed family it also requires for every such pair.✦
The block lengths and normalization factors at weight use underlying parameter index . With zero-based indices , their parameter sequences are specified by (2). Here is the recursive parameter state for the fixed value , and is its depth. (2) A Type I expression in an operation family of weight is a finite list of nonzero rational children with family successive supports and .✦ Its value is the normalized sum in (3). (3)✦
The signed monochromatic coordinate set of color is the set consisting of zero and the arrays with , where is the rational array equal to one at and zero elsewhere.✦ For a base set and family , the norming construction starts at stage zero with . Each succeeding stage retains the preceding stage and adjoins Type I and Type II values whose children belong to that preceding stage. For the path expressions called Type II expressions, this condition concerns every child of every original uncropped piece on every path. For a base set of rational arrays and an operation family , the norming family is the set of rational arrays belonging to a stage of the norming construction starting from .✦ The pure norming set is the norming family constructed in the pure family of color from the signed monochromatic coordinate set of that color.✦ The mixed base is , and its norming family is the full norming set .
Raw Data and Infinite Paths
A raw infinite path consists of nonzero rational arrays , weights , and metadata , indexed from zero.✦ A coherent finite closure system on assigns to each ordinal an increasing sequence of finite subsets of containing and exhausting that interval, such that restriction to gives the set at at the same index whenever belongs to the set at .✦ Write for the finite closure at index in this system; a positive index selects underlying index , and index zero also selects the zeroth set.✦ The prefix support , endpoint , and prefix closure of a raw infinite path are the finite sets and ordinal specified in (4). Prefix supports are nonempty.✦ (4)
A predecessor closure family at an ordinal assigns a finite subset of to each ordinal and each zero-based natural index.✦ Such a family is a coherent predecessor closure family if its sets at each form an increasing sequence of finite subsets of containing and exhausting , and restriction to gives the set at at the same index whenever belongs to the set at .✦ An endpoint extension of a predecessor closure family at an ordinal is coherent if it extends to by an increasing sequence of finite subsets of containing and exhausting that interval, with coherence preserved.✦ The closure system is obtained recursively by the endpoint closure construction.✦ The closure entry rank is the first positive index with when , and is zero otherwise.✦
For a finite coordinate set , the order position of is the number of members of below .✦ For a rational array and a finite coordinate set , the positional rational array code of on is the finite set of pairs consisting of the number of members of below each coordinate in and the corresponding coefficient of , including zero coefficients.✦ A finite path code is a finite list of triples consisting of a weight, metadata, and a positional rational array code.✦ The prefix code of a raw infinite path is the finite list of triples consisting of the weight, metadata, and positional rational array code for , using the common closure for each original array .✦ The maximum code metadata of a finite path code is the largest metadata entry in that code, with value zero for the empty list.✦ Fix the injective coding map from finite path codes to whose value exceeds every metadata entry of its code.
A raw path is admissible if its array supports are successive in ordinal order, its metadata are strictly increasing and positive, and the conditions in (5) hold.✦ The rank condition there concerns the whole prefix support. (5) A raw prefix of length is valid if its array supports are successive in ordinal order, its metadata are strictly increasing and positive, and the conditions in (5) hold on indices below , with the coding rule required only when .✦
An infinite path in is an admissible raw path together with a Type I expression for each , of value and weight , whose children belong to . Its original uncropped pieces have family successive supports. A finite path in an operation family is a valid raw prefix of positive length together with matching Type I pieces with family successive supports.✦ The finite path sum of a finite path of length is .✦ The prefix of an infinite path through retains the first original pieces, so index zero includes one piece.✦
The Completion and Path Functionals
The bounded function space consists of all bounded real-valued functions on , equipped with the supremum norm.✦ For , the coordinate evaluation vector is the function .✦ The finite support inclusion sends a finitely supported real vector to .✦ The real norming completion is the closed evaluation span in (6). The norming evaluation functional is evaluation at restricted to ✦, and the coordinate functional is .✦ The coordinate predual is the subspace of also defined in (6), with closure in the dual norm. (6)
For an infinite path , its partial functional is the norming evaluation at its finite prefix sum.✦ The bounded path functional of an infinite path is determined by (7). (7)
An ordinal and color rectangle consists of order convex sets and .✦ The crop support of an ordinal and color rectangle in an operation family is the coordinate set equal to in a pure family and in the mixed family.✦ The full norming set is stable under a crop support if for every .✦ The cropped normer associated with and crop support is the restricted array .✦ On the ambient crop sends to the function .✦ The coordinate crop projection on is the restriction to of the ambient crop for the crop support .✦
For an infinite path and an index , the tail crop of at is the rectangle with ordinal interval and all colors.✦ The path tail functional of an infinite path at is defined by (8); the endpoint uses the prefix through . (8)✦ For a raw infinite path and , the raw weight tail is the set in (9). (9)
The Claim
Theorem 1 (Lemma 6.2). Let be distinct admissible raw infinite paths. Their weight sets satisfy (10). (10)✦ Let be a finite family of pairwise distinct admissible raw paths. There is such that (11) holds. (11)✦ Fix an operation family and a finite family of infinite paths in whose raw paths are pairwise distinct. There is for which (12) holds for every real family . (12)✦ For every infinite path in and every , the removed part satisfies (13). (13)✦
What Is Checked
The weight statements concern equality and distinctness of the complete raw data, including their original rational pieces and metadata. The functional statements concern paths in a fixed pure or mixed family, real coefficients, and the dual norm of the constructed completion .
The full norming structure contains every positive coordinate array ✦, and every coefficient of every member of has absolute value at most one.✦ Finite prefixes of infinite paths have their sums in .✦ Ordinal and color rectangle crops preserve ✦; their ambient crop operators are contractive and preserve the closed evaluation span .