The Setting
A block sequence in the real norming completion over can be tested by the bounded linear functionals associated with infinite paths. The selection problem asks for one subsequence that works for all paths in a fixed operation family.
The coordinate set is , the ordinals below the initial ordinal of cardinality . Fix the countable unbounded partition given by a bijection . The color is the first component of , and is its th color class.✦ A rational array is a rational-valued function on with finite support; write .✦
An operation family is either the pure family of a color , with parameter , or the mixed family, with parameter . Two arrays have successive supports for when every and satisfy , and also when is mixed.✦
The Norming Operations
For a natural parameter , the depth , recursive state , block length and normalization factor are the sequences in (1); subtraction in their exponents is natural-number subtraction. (1) Sequence indices begin at zero. For a positive weight , the family parameters are and . The exponent scale is the first component of the recursive parameter state for parameter at index .
A Type I expression in consists of a weight and nonzero children , where and the children have successive supports for .✦ Its normalized value is given by (2). (2)✦
Raw Paths and Finite Paths
The coherent finite closure system assigns increasing finite sets to , each containing and contained in , with union . Its coherence condition is whenever . A predecessor closure family at is a family of finite subsets of indexed by endpoints and zero-based indices .✦ It is coherent below when its sets contain their endpoints, are contained in the corresponding initial segments, increase with , exhaust those initial segments, and satisfy the coherence condition for finite closures. A coherent endpoint extension of a predecessor closure family at is an increasing, exhausting finite-set sequence at , containing and lying below it, whose intersection with equals that family’s set at endpoint and the same index whenever it contains .✦ The endpoint closure construction assigns a finite-set sequence to a predecessor family, and the system is defined recursively in the endpoint using this construction.✦
The positive-indexed finite closures and their entry ranks are defined in (3). (3)
A raw infinite path consists of nonzero original rational pieces , declared weights and metadata , all indexed from zero.✦ Its prefix support, endpoint and closure are the finite sets and ordinal in (4). (4) The prefix support is nonempty.✦
For a finite coordinate set and , the order position of in is .✦ The positional rational array code of on is ; it retains zero coefficients.✦ A finite path code is a finite list of triples consisting of a natural weight, natural metadata and a finite set of position-coefficient pairs.✦ The prefix code of is the list in (5), with each piece coded on the common closure . (5)✦ The maximum metadata of a code is the largest metadata entry, with value zero for the empty list.✦ The injective coding map pairs a code’s canonical natural-number encoding with one plus its maximum metadata; its value exceeds every metadata entry in the code.✦
A raw path is admissible when its pieces have successive ordinal supports, its metadata are strictly increasing, and the conditions in (6) hold. (6)✦ A valid prefix of length of raw data is its initial segment at indices below , whose pieces have successive ordinal supports, whose metadata are strictly increasing, and which satisfies (6) at those indices, with the next-weight rule required only when .
A finite path in consists of raw infinite data and a positive length with valid prefix, together with Type I expressions for whose values and weights are and . The original pieces have successive supports for . The finite path sum of a finite path of length is , where the are its original uncropped pieces.✦
The Completion and Its Blocks
For a base and family , the norming stages start with . The next stage retains the preceding stage and adjoins Type I values whose children lie there, and norming values obtained from original paths, called Type II values, for which every child of every original uncropped piece on every original path lies there. Write for the rational array equal to one at and zero elsewhere. The signed monochromatic base, pure norming sets and full norming set are those in (7). (7) The base of a pure family of color is , and the mixed base is .✦ The norming family of is .✦
A norming set on is a subset of containing every and satisfying for and .✦ The bounded function space of a norming set on is the real space of bounded functions on with the supremum norm.✦ For a finite vector , the coordinate evaluation vectors , finite support inclusion and closed evaluation span are defined in (8). (8) The norming completion associated with a norming set on is the closed evaluation span in (8), with its inherited norm; the inclusion of finite vectors into is with this restricted target.✦ The norming evaluation functional associated with is the real linear functional on defined by for .✦ The full norming structure uses ✦, and is the constructed real Banach space.✦
An admissible block sequence in is a sequence of nonzero vectors in with supports successive for . For a pure family of color , all their support coordinates must lie in . The embedded block vectors of an admissible block sequence in are .✦
Infinite Paths and Their Functionals
An infinite path in consists of admissible raw data and Type I expressions whose values and weights agree with and . The original pieces have successive supports for , and every child of every belongs to . The finite prefix of an infinite path in is the finite path that retains its raw data and the expressions at indices zero through ; its length is .✦
The path partial sums are the bounded norming evaluation functionals on .✦ The path functional is a chosen continuous real linear functional with the properties in (9)✦; such a functional exists for every infinite path. (9)✦
The Claim
Theorem 1. Let be a pure or mixed operation family, and let be the embedded vectors of an admissible block sequence in . Suppose that a real number satisfies for every . There is a strictly increasing map such that (10) holds for every infinite path in : (10)✦
In the paper, the result reads: every bounded block sequence in a fixed family has a weak-Cauchy subsequence, meaning convergence under every member of .
What Is Checked
The claim is stated over the full real norming completion, its embedded admissible block sequences, and the infinite paths whose Type I children belong to the fixed family’s norming set. The full set contains every positive coordinate array ✦, and every coefficient of every member of has absolute value at most one.✦ For each infinite path , every finite prefix sum belongs to .✦