The Setting
A weight window selects the original pieces of a norming path whose weights lie in a prescribed interval. The blocks considered here lie in an algebraic tail span and have successive supports in , the first uncountable ordinal. Their windows also separate the closure ranks of earlier supports from later weights.
Fix a bijection , and let be its first coordinate. The color classes form a countable partition into unbounded sets. An operation family is either pure of color , with parameter , or mixed, with parameter . Two finite supports are successive for when every coordinate of the first precedes every coordinate of the second; in the mixed family their colors must also increase.✦ A finitely supported rational array on is a function vanishing outside a finite set.✦
The family block lengths and normalization factors use positive weights and the underlying zero-based parameter index ; weight zero also uses index zero. The exponent is .✦ The parameter sequences are given by (1) Here is the exponent scale and is the auxiliary sequence in (1). The depth sequence in (1) is indexed from zero.
A Type I expression of weight consists of nonzero rational children with successive family supports, where ; its value is . The pure base of color consists of zero and the signed coordinate arrays for .✦ Starting from a base, stage zero is that base; each succeeding stage retains the preceding stage and adds Type I values whose children belong to it, and values of path expressions whose children in every original path piece belong to it.✦ The pure norming set is the union of the stages for pure color .✦ The mixed base is ; the full norming set is the union of its mixed stages. Write for the norming set generated from the base of .✦
A norming set on is a set of rational arrays containing every and having all coefficients bounded in absolute value by one.✦ Let be the space of bounded real-valued functions on , equipped with the supremum norm. The real norming completion of a norming set on is the closed evaluation span in : (2) The coordinate evaluation vector at is the bounded function used in (2).✦ For , write for point evaluation at .✦ The coordinate functional is ✦, and the coordinate predual is .✦ For an arbitrary rational array , its rational coordinate combination is ✦; its value at is denoted .✦ The finite support inclusion maps each finitely supported real vector on to its evaluation function in from (2).
An ordinal and color rectangle is a pair of order-convex sets and .✦ The crop support of an ordinal and color rectangle is the coordinate set for a pure family and for the mixed family.✦ A coordinate set is crop-stable when for every .✦ The cropped normer is ✦, and the ambient crop operator on sends to the function .✦ The coordinate crop projection associated with a crop-stable coordinate set is the restriction to of the ambient crop operator on . For an ordinal interval , taking all colors gives the interval projection .✦ The rectangle projection on associated with an ordinal and color rectangle is the coordinate crop projection for .
An admissible block sequence for consists of nonzero finitely supported real vectors with successive family supports; in pure color , every support lies in .✦ Write .✦ For a block sequence and a zero-based index , its algebraic tail span and the coefficient norm are (3) For a natural number and a real constant , a vector satisfies the interval partition bound when every successive family of ordinal intervals, with , satisfies (4) The intervals in (4) are order-convex, and every point of precedes every point of when .
Paths and Their Windows
The finite closures come from the coherent finite closure system on . Its zero-based sets at each endpoint increase, contain that endpoint, and exhaust its initial segment; coherence means that a member’s closure at the same index is the restriction to its initial segment. A predecessor closure family at is a family of finite sets indexed by the endpoints below and their natural indices.✦ A predecessor closure family at is coherent below when its sets increase with the index, contain their endpoints, exhaust their initial segments, and the closure of an included predecessor is the restriction to its initial segment. A coherent endpoint extension at of a predecessor closure family is an increasing exhaustive sequence of finite sets at , containing and lying below it, whose restrictions at included predecessors equal their assigned sets.✦ The endpoint closure construction assigns a sequence at to a predecessor family, and the full system is obtained recursively from the predecessor sequences. Positive closure index uses system index , while index zero also uses the first set.✦ The closure entry rank is the first positive with when , and is zero otherwise.✦
A raw infinite path is a sequence of nonzero original rational pieces , declared weights , and metadata , indexed from zero.✦ Its prefix support is nonempty, its endpoint is ✦, and its prefix closure is .✦ The order position of in a finite set is .✦ The positional array code of a rational array on a finite set is the list of order positions of the elements paired with their coefficients , including zero coefficients.✦ The prefix code lists for .✦ The injective coding map assigns a natural number to each such finite code, exceeding its maximum metadata; the maximum for the empty code is zero.
A raw path is admissible when its ordinal supports are successive, its metadata are strictly increasing, and (5)✦ Validity of a finite prefix of length requires these conditions only at indices below , with the coding rule in (5) required only when .✦
A finite path of length for is a valid positive-length prefix of raw data whose original pieces are values of Type I expressions of weights , and have successive family supports.✦ A finite path for is legal when every child of every specified expression belongs to .✦ For natural weights , the finite path sum of and its weight window are the rational arrays (6) An infinite path for is a sequence of Type I expressions with admissible raw data, matching values and weights, successive family supports, and all children in . Its prefix retains the first pieces; index zero includes one piece.✦ Its path partial functional is ✦, and its associated path functional is determined by (7)✦
The Claim
Definition 1. For a legal finite path of , a finitely supported real vector , natural weights , and a real number , the path hits in the window above when (8)✦
Definition 2. Let be an admissible block sequence for , let , and let . A family of weight window blocks for these data is an admissible block sequence with natural sequences and satisfying (9) for every zero-based block index .✦ Write . The set consists of the families of weight window blocks for : (9) The reciprocal tail in (9) is the series tail beginning at , with the convention .✦
Theorem 1. Let be a pure or mixed operation family, let be an admissible block sequence for , and let . For every , there is a family of weight window blocks: (10)✦
In the paper, the result reads: fixing and with at most its parameter , the constructed admissible blocks have and windows with , , , and larger than every -value among preceding supports, satisfy the interval partition estimate with constant for and the bounds with these tail quantities tending to zero, have weakly null images , and a finite uncropped path hits at threshold when the absolute evaluation on of its original pieces with weights in exceeds .
What Is Checked
The definition (8) is stated over legal finite paths and rational coordinate evaluation on the completion, while (10) is stated over admissible block sequences in either operation family and every algebraic tail span (3).
Every infinite-path prefix sum belongs to ✦, and the functional of (7) satisfies . Mixed rectangle crops preserve the full norming set✦, and their ambient crop operators preserve the closed evaluation span in (2).✦