The Setting
An infinite admissible path supplies a sequence of finitely supported rational functionals. Its partial sums act on a completion , whose vectors need not have finite support. Their limiting action is considered together with restrictions in both the ordinal and color coordinates.
Put , the first uncountable ordinal.✦ Fix a bijection from to ; its first coordinate is the color of , and is the unbounded color class indexed by . A rational array is a rational-valued function with finite support.✦ For , the coordinate array has value one at and zero elsewhere. A norming set on is a set of finitely supported rational arrays satisfying (1). (1)✦
For a norming set , the coordinate evaluation vector is the bounded function on taking to .✦ The finite support inclusion sends a finitely supported real vector to the corresponding linear combination of these vectors.✦ The norming completion is the closed evaluation span in the real space , as specified in (2).✦ (2) The norming evaluation functional associated with is given by .✦ The bounded function space consists of all bounded real-valued functions on , equipped with the supremum norm.
The Norming Families and Paths
There is a pure operation family for each color and one mixed family.✦ Write for either kind and set in the pure family of color , while in the mixed family.✦ Two rational arrays are successive in when every coordinate of the first precedes every coordinate of the second; in the mixed family their colors must also be strictly ordered.✦
The block lengths and normalization factors use zero-based parameter sequences. The depth parameter of the zero-based parameter sequences is .✦ For a scale parameter , specialized to for family , the exponent scale is the first coordinate of the recursive state defined by (3).✦ (3)
A Type I expression of family and weight is a list of nonzero, successive rational children with .✦ Its value is the normalized sum in (4). (4)✦ The pure norming set is the union of the finite construction stages for its pure family, starting from .✦ The mixed base is , and the full norming set is the union of the mixed construction stages.✦ At stage zero one takes the base; the next stage retains the preceding stage and adds Type I and Type II values whose original children all lie in that preceding stage.✦ Write for the norming set of a family . The space in this lemma is for the full set .✦ The signed monochromatic coordinate set of color is the pure base.
For an endpoint and a closure index , the finite set is the corresponding entry of the coherent finite closure system on . At each endpoint the system is an increasing sequence of finite subsets of containing and exhausting . Coherence means that a member of an endpoint’s set has, at the same index, the closure obtained by cutting that set at . The system is obtained by extending the predecessor families at each endpoint.✦ Positive closure index uses zero-based system index ; index zero also uses the first system entry.✦ For , the closure entry rank is the first positive with , and for .✦
A raw infinite path is a sequence of nonzero rational pieces , declared weights and metadata , indexed by .✦ Its prefix support, endpoint and closure are the finite sets and ordinal in (5). (5) For a finite coordinate set , the position of is .✦ The positional code of a rational array on relative to a finite coordinate set is the finite set , including zero coefficients.✦ The prefix code is the ordered list of triples consisting of , and the positional code of relative to the common set , for .✦ A finite path code is any finite list of such triples.✦ Its maximum metadata is zero for the empty list and the maximum of its metadata entries otherwise.✦ The injective coding map assigns to a code the natural-number pairing of its canonical natural-number code and one plus this maximum metadata.✦
An admissible raw path is a raw infinite path with pieces , declared weights and metadata whose pieces have successive ordinal supports, whose metadata are positive and strictly increasing, and which satisfies (6).✦ (6)✦ An infinite path in family is an admissible raw path whose original, uncropped piece is the value of a Type I expression of weight , all of whose children belong to ; the pieces must also be successive in . A finite path of length in family is a raw path whose entries through position satisfy the conditions for an infinite path in , with the coding rule required only when the next position is below and no restrictions on later raw entries.
The prefix of an infinite path is the finite path containing positions zero through .✦ The value of a finite path of length is the finitely supported rational array obtained by summing its original pieces at positions zero through . For the prefix , this value and its associated partial functional are given in (7). (7)
The Claim
An ordinal and color rectangle consists of order convex sets and .✦ Its crop support set is for a pure family and for the mixed family.✦ For a functional on , its rectangle crop is , where is the coordinate projection below.
Theorem 1. Let be a pure or mixed family and let be an infinite path in . There is a bounded real linear path functional satisfying (8) and (9): (8)✦ (9)✦ For every ordinal and color rectangle , the coordinate projection is the bounded real linear map defined by (10): (10)✦
What Is Checked
The statements concern the real norming completion of the full norming set and infinite paths in either operation family, with original rational pieces and norming children. The full set satisfies the coordinate inclusion and coefficient bound in (1). Every prefix support in (5) is nonempty✦, and every finite prefix value in (7) belongs to .✦
A coordinate set is crop stable for a norming set when belongs to that set for every one of its arrays .✦ Rectangle crops are stable for the full norming set.✦ The cropped normer is ✦, and the ambient crop operator on sends to the function .✦ This operator is contractive and preserves the closed evaluation span; its restriction to that span is the coordinate crop projection used in (10).✦