The Setting
For a closed infinite-dimensional subspace of the constructed real Banach space , consider the restrictions to of its bounded path functionals.
Let .✦ Fix a bijection from to , and let be its first coordinate. Each color class has cardinality and is unbounded in . A rational array on is a rational-valued function with finite support.✦ The construction uses pure operation families , one for each color, and a mixed family .
A norming set on is a set of rational arrays containing every positive coordinate array , with for every and .✦ Here is the space of finitely supported real-valued functions on , and is the space of bounded real-valued functions on , equipped with the supremum norm. Its coordinate evaluation vectors and finite evaluation map are given by (1) The finite support inclusion in (1) is also regarded as a map into , with its inherited norm. For , the norming evaluation functional is on ; the coordinate functional is . The coordinate predual and rational array evaluation are (2) The rational combination in (2) takes values in . The set is the full norming set of the pure and mixed construction, and is its real normed completion.
Norming Families and Paths
The exponent parameter of is , and that of is .✦ The parameter sequences are indexed from zero. With recursive parameter state , their definitions are (3) A positive weight uses the underlying parameter index : and in (3). The sequence in (3) is the depth sequence. The exponent scale is the first coordinate of the recursive parameter state in (3).✦ For a parameter and a zero-based index , in (3) is the block length. The normalization factor in (3) is for a parameter and a zero-based index . For a family and a positive weight , its family block length is . A family has normalization factor at each positive weight .
Arrays have successive supports in a family when every precedes every ; for the mixed family one also requires .✦ A Type I expression in of weight consists of nonzero successive rational children , where .✦ Its value is (4)✦ The pure base at color is .✦ Starting with a base , the zero stage is ; each subsequent stage retains the preceding stage and admits Type I values (4) whose children lie in the preceding stage, together with Type II rational arrays formed from original path pieces whose children all lie in the preceding stage.✦ The pure norming set is the union of these stages for and its pure base.✦ The mixed base is , and the full set is the union of its stages for . Write for the norming set belonging to either family.
A coherent predecessor closure family at an ordinal is a family of finite sets that contain , increase with , exhaust , and satisfy whenever .✦ An endpoint extension of a coherent predecessor closure family is a sequence of finite sets that contain , increase with , exhaust , and satisfy whenever . Ordinal recursion using the endpoint closure construction gives the finite closure system . The positive-indexed closures and closure entry ranks are defined by (5), with closure index zero also selecting the first system entry: (5)
For a finite coordinate set , the order position of a coordinate is the number of members of below .✦ The positional code of a rational array on a finite coordinate set is the finite set of pairs for , including zero coefficients.✦ A finite path code is a finite list of triples consisting of a weight, metadata, and a positional array code.✦ The metadata bound of a finite path code is the maximum of the metadata entries in that code, or zero when the code is the empty list.✦ The injective coding map maps finite path codes to natural numbers, assigning to each code a number greater than its metadata bound.
A raw infinite path is a sequence of triples consisting of nonzero rational pieces , declared weights , and metadata , indexed from zero.✦ Its cumulative support, endpoint, closure, and prefix code are (6) A raw path is admissible when its piece supports are successive in ordinal order, the metadata are strictly increasing and positive, and (7)✦
A finite path in a family is a raw path with a positive length and original uncropped Type I expressions at its first positions, whose values and weights agree with the raw data, whose first pieces satisfy (7) and support and metadata succession, and whose pieces are successive in .✦ Entries beyond the prefix are unrestricted. Its finite path sum is .✦ An infinite path in a family is a raw path with an original uncropped Type I expression at every position, whose values and weights agree with the raw data, whose pieces satisfy (7) and support and metadata succession and are successive in , and whose original Type I pieces have all their children in .✦ Its prefix has length and retains the raw data and original pieces through index .✦ The path partial sums and the associated bounded path functional are specified by (8)
Reductions and the Binary Tree
An ordinal cut for is a countable ordinal or the top cut above all of .✦ For a cut , put .✦ An ordinal and color rectangle consists of order-convex sets and .✦ The support set of an ordinal and color rectangle , where and are order-convex, is in a pure family and in the mixed family.✦ Ordinal interval crops have ; color interval crops have . A single color crop has .
A coordinate set is crop stable for when for every .✦ For a coordinate set that is crop-stable for and a normer , the cropped normer is the rational array ; the ambient crop operator of on is the map sending to the function . For a coordinate set that is crop-stable for , the crop operator on is the restriction of the ambient crop operator of to .✦ The initial ordinal projection uses the initial ordinal crop , and the single color projection uses . The family projection is (9)✦
A bounded linear operator between normed spaces is strictly singular when, for every closed infinite-dimensional subspace of its domain and every , some vector in that subspace satisfies .✦ A branch reduction of a real subspace consists of a cut with no last coordinate, a family , a closed infinite-dimensional subspace , and a bounded linear map . Every with is strictly singular; in the mixed case every is strictly singular as well. The lifting condition, using (9), is (10) Write for the family of reductions satisfying (10) and these conditions.
An admissible block sequence in consists of nonzero finitely supported real vectors with successive ordinal supports. In the mixed family their colors are also successive; in the pure family every support coordinate has color . For an admissible block sequence and natural numbers , the initial support of length is , and the algebraic tail span at is .
For a branch reduction , a threshold state is a pair consisting of an ordinal and a natural color threshold .✦ The block window of a threshold state for a branch reduction is the set of coordinates in of color when , and of colors at least when is the mixed family.✦ A block approximation step at stage consists of a unit vector , a nonzero finitely supported real vector in this window, and a next ordinal threshold strictly beyond its support, subject to (11)✦ Starting with a chosen ordinal below and color threshold zero, successive chosen approximation steps and their threshold updates define the approximating block sequence . Its th vector is the finite vector selected at the th threshold state in (11). The geometric approximation error at stage is the quantity in (11), with indices starting at zero.
The vector support crop of a nonzero finitely supported real vector on is the rectangle whose ordinal interval joins the minimum and maximum of the support of and whose color interval joins its minimum and maximum support colors.✦ An exact pair for an admissible block sequence in a family , tail index , and weight consists of a nonzero vector in the algebraic tail span of at and an original Type I expression in of weight . Every child of belongs to ; in a pure family has that family’s color. Writing for the value of , its remaining conditions are (12) The pairing in (12) is (2).
An exact pair tree node for an admissible block sequence is a tuple consisting of a starting index , a positive weight , an exact pair as in (12), a finishing index , and positive metadata . Its vector is supported on the first blocks. For a finite list of such nodes, the accumulated functional support is the union of the supports of their Type I values, and the next starting index is the maximum of their finishing indices, with value zero for the empty list. The node recursion starts with the empty list and appends a chosen next exact pair node at every stage.✦ Denote its indexed nodes by .
Binary nodes are indexed from zero, with root and parent for . The ancestor list of a binary node is the list of its ancestors in order from the root to , including both the root and .✦ For a node assignment and a selector , the raw path along the selected nodes has pieces equal to their Type I values and weights and metadata equal to the corresponding node entries.✦ The ancestral path code at is the prefix code along its ancestor list.✦ The requested weight for the next node is for the empty list; for a list of length it is of the ancestral code at .✦
For , let be the infinite binary branch starting at the root and following the child selected by at depth .✦ The admissible branch path has the original uncropped Type I expressions from these nodes; its raw entries are (13)✦ The node assignment in (13) is the one constructed on .
The Claim
Theorem 1. Let be a closed infinite-dimensional real linear subspace of . There is a branch reduction (14)✦ For every infinite path in either a pure or the mixed family, the path functional of (8) satisfies (15)✦ For any reduction as in (14), let be its approximating block sequence and use its branch paths (13). For distinct , their restrictions satisfy (16)✦
What Is Checked
The claim is stated over closed infinite-dimensional real subspaces of , their branch reductions and approximating block sequences , and infinite paths in the pure and mixed families.
Each coordinate functional belongs to the coordinate predual (2).✦
Rectangle crops preserve ✦, and their ambient crop operators preserve the closed evaluation span.✦ Every initial ordinal segment is order convex.✦
Every raw prefix support in (6) is nonempty.✦ Finite prefix sums of infinite paths belong to .✦
Block approximation steps exist for every threshold state and stage in (11).✦ Every requested tree weight is positive.✦