The Setting
The reduction problem for a closed infinite-dimensional subspace of the constructed space asks for an ordinal cut and a pure or mixed coordinate projection with a bounded lift into that subspace. Finite rational arrays and constructed branch paths supply the evaluations to be retained.
The coordinate set is , the first uncountable ordinal. Fix a bijection , and let be its first component at . The color classes are unbounded and have cardinality . A rational array on is a rational-valued function with finite support; write for these arrays and for the unit array at .✦ The operation families are the pure families and the mixed family .✦
Norming Arrays and Their Completion
For a natural parameter , the depth and recursive parameter state are given by (1); the first component is the exponent scale. All sequence indices start at zero. (1) Here subtraction in a natural parameter stops at zero. The exponent index of an operation family is the natural number for and for .✦ For an operation family and a positive weight , the block length and normalization are the natural numbers and : weight uses underlying parameter index . For the natural parameter , the block-length sequence is in (1), with starting at zero. The normalization factors for the natural parameter are in (1), indexed from zero.
Rational arrays have successive supports for an operation family when every coordinate in the support of precedes every coordinate in the support of and, in the mixed family, the color of every coordinate in the first support precedes the color of every coordinate in the second.✦ A Type I expression for consists of a weight and nonzero successive children , where .✦ Its value is the normalized sum in (2). (2)✦
For a base set of arrays, let be the norming construction stages, with . A successor stage retains the preceding stage and adds the values of Type I expressions whose children belong to it, together with the values of operations built from the finite paths described below, called Type II path operations, whose children in every original path piece belong to it. The pure base consists of zero and the signed coordinates of its color.✦ The pure norming sets , family norming sets , and full norming set are defined by (3). (3) The base norming arrays of the mixed family form the union of the pure norming sets over all colors.
A norming set on is a set of rational arrays containing every and having every coefficient bounded in absolute value by .✦ For a norming set on and a coordinate , the coordinate evaluation vector is the bounded function on .✦ The space consists of bounded real-valued functions on the full norming set , equipped with the supremum norm; the finite-support inclusion and its closed evaluation span give the real normed completion in (4). (4) For , the norming evaluation functional is .✦ The coordinate functional is , and the coordinate predual is the norm closure in of their real linear span. The rational coordinate combination of an arbitrary rational array is ; its evaluation on is the rational linear map (5). (5)✦
Projections and Reductions
An ordinal and color rectangle consists of order-convex sets and .✦ The support set of an ordinal and color rectangle is the coordinate set for a pure family and for the mixed family.✦ An ordinal interval crop is an ordinal and color rectangle with ; a color interval crop is such a rectangle with , and a single color crop is such a rectangle with . A coordinate set is crop-stable for when restricting each member of to again gives a member of .✦
For a norming array in and a crop-stable rectangle , the cropped normer is the rational array .✦ The ambient crop on and its restriction to are given by (6). (6) An ordinal cut is an ordinal at most , with initial segment .✦ Write for the initial ordinal projection and for the single color projection. The family projection is defined by (7). (7)✦ The initial ordinal crop at is the rectangle .✦
A bounded linear operator between normed spaces and is strictly singular when, for every closed infinite-dimensional subspace and every , some satisfies .✦ A branch reduction of a linear subspace consists of an ordinal cut , an operation family , a closed infinite-dimensional subspace , and a bounded linear map satisfying (8).✦ Denote the collection of these reductions by . (8)
Block Approximations
An approximation state for a branch reduction is a pair of thresholds with , , and .✦ At stage , a block approximation step consists of a unit vector and a nonzero finitely supported real vector satisfying (9), together with a next threshold beyond every coordinate in . (9)✦ The recursively chosen steps give a block sequence for satisfying the following admissibility conditions. An admissible block sequence for an operation family is a sequence of nonzero finitely supported real vectors on with successive ordinal supports and, in the mixed family, successive colors; in the pure family of color , every support lies in .✦ The ordinal and color block crop determined by is the rectangle with ordinal interval and color interval for , or for .✦ The geometric approximation error at stage is , with the stages indexed from zero.✦
For any admissible block sequence , its initial support and algebraic tail span are the finite union and real linear span in (10). The tail index starts at zero. (10) The vector support crop of a nonzero finite vector is the rectangle whose ordinal interval runs from the minimum to the maximum of its support and whose color interval runs from the minimum to the maximum of the colors of its support.✦
For an admissible block sequence in an operation family , an exact pair at tail index and weight consists of a nonzero vector and a Type I expression of weight satisfying (11). Every child of belongs to , its value is supported in the vector support crop for , and, when , the vector is supported on . (11) An exact-pair tree node for an admissible block sequence consists of a starting block index , a positive weight , an exact pair at tail index and weight , a finishing index with , and an auxiliary index .✦
Paths and Branch Functionals
Let be the coherent finite closure system on , indexed from zero. Its finite sets lie at or below their endpoint, contain that endpoint, increase with , and exhaust the segment at or below the endpoint. Coherence means that entails . A predecessor closure family at an ordinal assigns a finite subset of to every endpoint and every zero-based natural index ; a coherent endpoint extension is an extension to whose sets lie at or below , contain , increase with , exhaust the segment at or below , and agree with the predecessor sets at their members. The system is obtained recursively by these endpoint extensions. The positive closure convention and closure entry rank are specified in (12). (12)
A raw infinite path on is a sequence of nonzero rational pieces , with natural weights and auxiliary indices , all indexed from zero.✦ For a raw infinite path on with pieces and auxiliary indices , its prefix support is the finite coordinate set , its endpoint is the ordinal , and its closure is the finite coordinate set . For a finite coordinate set , the order position of is .✦ For a rational array on and a finite coordinate set , the positional array code of is , retaining zero coefficients.✦ A finite path code is a finite list of triples consisting of a weight, an auxiliary index, and a positional array code.✦ The prefix code of a raw infinite path is the list of triples consisting of a weight, an auxiliary index, and the positional array code of the corresponding piece for , using the common closure .✦
The coding map pairs a fixed natural numbering of a finite code with one plus the maximum of its auxiliary indices, taking that maximum to be zero for the empty code.✦ It is injective and its value exceeds every auxiliary index in the code. A raw infinite path on is admissible when its pieces have successive ordinal supports, its auxiliary indices are strictly increasing and positive, and the conditions in (13) hold. (13)✦
A finite path in an operation family is a positive-length prefix of raw path data satisfying the raw-path admissibility conditions within the prefix, with original uncropped Type I pieces having the declared values and weights and successive supports for .✦ Entries beyond the prefix are unrestricted. An infinite path in an operation family is an admissible raw infinite path with original uncropped Type I pieces at every index, having the declared values and weights and successive supports for , with every original child belonging to .✦ Its prefix through index has length , so index zero includes the first piece.✦ The finite path sum of a finite path in an operation family is the rational array obtained by summing its original rational pieces.✦ For an infinite path in an operation family , the partial functional and bounded path functional are the linear functionals given by (14). (14)
The exact pair tree on has indexed nodes . Its binary indexing has root and children and at node ; the ancestral list runs from the root to , including both endpoints. The ancestral path code of a node in an exact pair tree is the raw prefix code along the list of nodes from the root to that node, including both endpoints.✦ The requested weight of a node in an exact pair tree is the natural number for the first node and otherwise of its parent’s ancestral code.✦ For a binary sequence , let and let be the child of chosen by .✦ The branch path of a binary sequence through the exact pair tree on an admissible block sequence in an operation family is the infinite path in whose original piece, weight, and auxiliary index at position come from .✦ For a branch reduction , write .
The Claim
Theorem 1. Let be a closed infinite-dimensional real linear subspace. Then (15)✦ Let be an ordinal cut, let be an operation family, and let . Let be a rational array supported below and, if , supported on . Then (16)✦ Let be a branch reduction of , let be a binary sequence, and let . Then (17)✦
In the paper, the result reads: for a closed infinite-dimensional there are a nonzero limit ordinal , a closed infinite-dimensional , and a bounded linear map such that either lies on one color and , or and every is strictly singular; in both cases every for is strictly singular, and every actual path supported below , and on in the first case, satisfies .
What Is Checked
The statements (15), (16), and (17) concern the full norming completion , its bounded ordinal and color projections, and the branch paths built from the block approximations of a branch reduction; the existence assertion assumes that is closed and infinite-dimensional.
The full norming set contains every positive coordinate array✦, and each of its coefficients has absolute value at most .✦ Initial ordinal segments are order convex.✦ Restricting any member of to the mixed support set of any ordinal and color rectangle again gives a member of .✦ For any norming set and any coordinate set whose restrictions preserve normers, the ambient crop preserves the closed evaluation span.✦
Every allowed approximation state and stage admit a block approximation step.✦ Raw prefix supports are nonempty.✦ Every finite prefix of an infinite path has its sum in ✦, and the resulting path functional has norm at most .✦ Each coordinate functional belongs to the coordinate predual ✦, and the prescribed next weight is positive for every finite list of exact pair tree nodes.✦