The Setting
A finite path tests a block vector through the pieces whose weights lie in a chosen window. Different blocks have different windows, while the testing path stays fixed. The issue is simultaneous detection when the block vectors tend to zero under every infinite path functional.
The coordinate set is , where is the first uncountable ordinal.✦ Fix a bijection , and let be the first coordinate of . The color classes are unbounded and have cardinality . An operation family is either the pure family of a color or the mixed family.✦ Its parameter is in the former case and in the latter.✦ Supports are successive for when every coordinate of the first precedes every coordinate of the second, with strictly increasing colors also required in the mixed family.✦
Weights and Norming
The zero-based parameter sequences consist of a depth , an exponent scale , and an auxiliary sequence , with recursion (1). The corresponding positive sequence index is . (1) The block lengths, normalization factors, and norming weights at parameter index are defined by (2), where . (2) For the family , write and use the weight parameters in (3). Weight uses the underlying index ; weight zero also uses index zero. (3)
A rational array on is a rational-valued function with finite support.✦ A type I expression of weight for consists of nonzero rational arrays , , with successive supports for and .✦ Its value is the normalized sum in (4). (4)✦
The pure norming set is generated from zero and the signed coordinate arrays of color . The mixed norming set is generated from . In either construction, stage zero is the indicated base; stage retains stage and adjoins values of type I expressions whose children lie in stage , and values of path expressions formed from original path pieces whose children all lie in stage .✦ Each norming set is the union of its zero-based stages.✦ Write for the pure family of color , and for the mixed family.✦
A norming set on is a set of rational arrays containing every positive coordinate array and having all coefficients bounded in absolute value by one.✦ The bounded function space of a norming set is the space of bounded real-valued functions on , with the supremum norm.✦ The finite support inclusion and the real normed completion are given by (5); the coordinate evaluation vector at is . (5)
The norming evaluation functional associated with is point evaluation at on .✦ The coordinate functional is the evaluation associated with the positive coordinate array at .✦ The coordinate predual and the rational coordinate combination are defined in (6); the pairing there is rational array evaluation on . (6)
An ordinal and color rectangle is a pair of order-convex subsets of and .✦ Its support set for a pure family is ; for the mixed family it is .✦ A coordinate set is crop-stable for when for every .✦ For a coordinate set crop-stable for , the ambient crop operator on sends to the function , and the coordinate crop projection on is the restriction of this operator to . Rectangle projections use the mixed support set. For an ordinal interval , the interval projection uses the rectangle .✦ For a crop-stable coordinate set and , the cropped norming functional is the coordinate restriction .
Paths and Windows
The finite closure system has sets , indexed from zero at each , constructed recursively from the closure families at smaller endpoints. A predecessor closure family assigns finite sets for .✦ A predecessor closure family assigning finite sets for is coherent when these sets contain their endpoints, lie below them, increase to their initial segments, and satisfy whenever .✦ A coherent endpoint extension of a predecessor closure family at is an increasing sequence of finite subsets of , containing and exhausting that interval, whose restrictions at its members below agree with .✦ The endpoint construction supplies the sequence used in the recursion. Write , so a positive closure index selects underlying index , and index zero also selects the first entry.✦ The closure entry rank is the first positive with when , and is zero otherwise.✦
A raw infinite path is a sequence of nonzero rational pieces, declared natural weights, and natural metadata.✦ Its prefix support , endpoint , and prefix closure are given by (7). (7) The order position of in a finite set is .✦ The positional array code of a rational array on a finite set is the collection of pairs for every , including zero coefficients.✦ A finite path code is a finite list of triples consisting of a weight, metadata, and a positional array code.✦ The prefix code is the list in (8), using one common closure for all its pieces. (8)✦ The maximum metadata of a code is the largest of its metadata entries, with value zero for the empty list.✦ The coding map pairs the canonical natural number code of a finite path code with one plus its maximum metadata.✦ It is injective, and its value exceeds every metadata entry of its code.
A raw path is admissible when its pieces have successive ordinal supports, its metadata are positive and strictly increasing, and it satisfies (9).✦ An admissible prefix of length of raw path data is the restriction to positions below of data with successive ordinal supports and positive, strictly increasing metadata, satisfying (9) at those positions, with the coding rule imposed when . (9)✦
A finite path for is a positive-length admissible prefix of raw infinite data, together with type I expressions having values and weights at every position , whose original pieces are successive for .✦ A finite path for , with type I expressions , is legal when every child of every belongs to .✦ An infinite path for consists of admissible raw data and type I expressions for of values and weights at every position, whose original pieces are successive for and whose children belong to .✦ Its finite prefix retains the raw data and the first expressions, so index zero includes one piece.✦
For a finite path and a weight window , the finite path sum and the weight window array are defined in (10); both use original uncropped rational pieces. (10) The path partial sum at is the norming evaluation functional associated with .✦ The bounded path functional is chosen with the pointwise limit property (11). (11)✦
For a legal finite path , a finitely supported real vector , and a weight window , a hit at threshold is the condition in (12). (12)✦ For a finitely supported real vector , a real sequence , and a natural number , the coefficient norm and the series tail notation are defined by (13). (13)
Coherent Window Blocks
An admissible block sequence for consists of nonzero, finitely supported real vectors with successive supports for ; in the pure family of color , all support coordinates belong to .✦ Its embedded vectors are , and its algebraic tail span at is .
The interval partition bound for , cutoff , constant , and exponent is the condition in (14), for every and every family of ordinal intervals with every point of below every point of whenever . (14)✦
Fix a block sequence , an initial weight , a real number , and a tail index . Coherent window blocks for a block sequence , an initial weight , a real number , and a tail index consist of an admissible block sequence in the algebraic tail span of at , and natural window endpoints satisfying (15). Here the closure-rank condition ranges over and whenever . (15) In addition, each satisfies the interval partition bound (14) with cutoff and constant .
The Claim
Theorem 1. Fix a pure or mixed family .
For coherent window blocks , every and every infinite admit the thinning in (16), where ranges over legal finite paths for . (16)✦
More generally, let be finitely supported real vectors with successive ordinal supports. Let be natural window endpoints with when . Suppose there are real constants and such that (17) holds. The first condition ranges over and ; the third ranges over all type I expressions for whose children belong to , with weight . (17) For every and infinite , there is a thinning as in (18), with again ranging over legal finite paths for . (18)✦
In the paper, the result reads: for the block sequence and weight windows just constructed, every and every infinite set of indices admit an infinite subset on which no finite uncropped path has four hits at threshold .
What Is Checked
The claims are stated over the full norming completion , with legal finite paths for a fixed family , the reciprocal-normalization tails in (13), and scalar nullity under every infinite path functional.
The full norming set contains every positive coordinate array✦ and has coefficients of absolute value at most one. Raw prefix supports are nonempty✦, and the sum of every finite prefix of an infinite path belongs to .✦ Each infinite path admits the functional in (11) with norm at most one.✦ Rectangle crops preserve the full norming set✦; their ambient crop operators are contractive and preserve the closed evaluation span .
Every coordinate functional belongs to the coordinate predual .✦