The Setting
The lemma concerns a perturbation of the quotient of a dual by the closed span of its coordinate functionals. The relevant vectors in this quotient are cosets of bounded functionals obtained from infinite paths.
Let , the first uncountable ordinal.✦ Fix a bijection .✦ Its fibers form the countable unbounded partition into colors; write for the first coordinate of and for the embedding into . A rational array on is a rational-valued function of finite support.✦ Write for the array with coefficient one at and zero elsewhere.
The operation families are the pure families , for , and one mixed family .✦ Their parameters, family indices and source colors are specified in (1). (1) The primal exponent is , the path exponent is , and the source exponent is . Two arrays have successive supports for when every coordinate in the first support precedes every coordinate in the second; for the mixed family, the corresponding colors must also strictly increase.✦ For a natural parameter , the Hölder exponent is when , and .
For a natural parameter , the depth sequence is , with indices starting at zero.✦ Define the exponent scale and the auxiliary sequence by the recursion in (2); the pair is the recursive parameter state. (2) Here is truncated at zero. At positive weight , the family block length and normalization factor are and . For a natural parameter and a zero-based index , the block length is given by (2). For a natural parameter and a zero-based index , the normalization factor is given by (2).
A Type I expression for has positive weight and nonzero, successive rational children , where .✦ Its value is the normalized sum in (3). (3)✦ For the pure family , stage zero consists of zero and the arrays with .✦ Each succeeding norming stage retains the previous stage and adjoins admitted Type I values and admitted values formed from finite paths, called Type II values: all children of a Type I expression, and all children of every original path piece in a Type II expression, must belong to the previous stage.✦ The pure norming set is the union of these stages.✦ The mixed family starts from ; its stage union is the full norming set .✦ For each family , write for its corresponding stage union.✦
The bounded function space carries the supremum norm. For , the coordinate evaluation vector in is given by , for . The finite evaluation map sends a finitely supported real vector to the linear combination of these vectors in (4); its range closure is the real norming completion . (4) The finite support inclusion into is the same map with its target restricted to .✦ For , the norming evaluation functional is on ✦; the coordinate functional at is .✦ The coordinate predual and dual quotient are defined in (5), with the quotient map and carrying the quotient norm. (5)
Paths and Their Functionals
A predecessor closure family at is a family of finite sets indexed by and zero-based indices .✦ A predecessor closure family at is coherent when its finite sets at each contain , lie in , increase with the zero-based index and exhaust , and restriction to any member gives the set at at the same index.✦ A coherent endpoint extension of a predecessor closure family at is a family of finite sets at that contain , lie in , increase with the zero-based index , exhaust and restrict to the predecessor family at every member below .✦ The endpoint construction extends the families recursively along to the coherent finite closure system .
The positive-indexed finite closures and their entry rank are defined by (6). Positive closure index uses underlying index ; index zero also uses . (6)
Raw infinite path data consist of nonzero rational arrays , declared weights and metadata , indexed from zero.✦ Their prefix support , endpoint and prefix closure are given by (7). (7) For a finite coordinate set , the order position of is the number of members of below . The positional rational array code of a rational array on relative to a finite coordinate set is the set of pairs for , retaining zero coefficients.✦ A finite path code is a finite list of triples consisting of a weight, metadata and such a finite set of pairs.✦ The prefix code lists these triples for , coding every relative to the common closure .✦ The coding map pairs the natural-number code of a finite path code with one plus its maximum metadata, taken as zero for the empty code.✦ It is injective, and its value exceeds every metadata entry.
Raw infinite path data are admissible when the supports of are successive in ordinal order, the positive metadata strictly increase, and the requirements in (8) hold. (8) A valid prefix of raw infinite path data is a prefix of positive length satisfying the admissibility conditions in (8), ordinal succession of supports and strict increase of positive metadata only at indices below , with the coding rule required when . A finite path for is a valid prefix of raw infinite path data together with Type I expressions whose values and weights are its original uncropped arrays and declared weights; these arrays must also be successive for .✦ Its finite path sum is .✦
An infinite path for consists of admissible raw data and Type I expressions at every index whose values and weights are the original uncropped arrays and declared weights, whose arrays are successive for and whose children all belong to .✦ Its finite prefix through retains the raw data and the first expressions, so index zero includes one piece.✦ Write for the set of raw data occurring in such infinite paths, and choose an infinite representative for every .
For an infinite path , the path partial sum at is the norming evaluation functional associated with the finite sum of its pieces through .✦ The bounded path functional is the chosen functional whose value at each is the limit of these partial sums evaluated at .✦ The path coset associated with a raw path index is defined in (9). (9)✦
The Perturbation Operator
Assume the continuum hypothesis (CH), . For each , choose the base path labelling .✦ The colored path labelling is defined by (10), using the embeddings into the family index color and then into the source color. (10)✦
Finite color synthesis and finite path synthesis send finitely supported real coefficients on to the sums in (11). Their continuous linear extensions are respectively and . (11) These extensions use the finitely supported sequence embedding, which takes each coefficient family to the same coordinate function in its space.✦ For conjugate exponents and a continuous linear map , let be the coordinate unit vectors in ; for a functional , the dual analysis operator is , and the dual coefficients of a continuous real linear functional on form the vector . The color analysis operator is ✦, and the family perturbation operator is .✦
The enumeration , lists the mixed family followed by the pure family of each color .✦ With this enumeration, the perturbation weights and the norm-convergent operator sum defining are (12). (12) The canonical embedding is given by , and for .
The Claim
Theorem 1. Assume CH. For every pure or mixed family and every , (13)✦ Let be a closed real linear subspace of containing every with . For every , (14)✦ The range of satisfies (15)✦ For every , there is such that (16)✦ The operator norm satisfies (17)✦
In the paper, with denoting the closed linear span of all path cosets, the result reads: , and .
What Is Checked
The assertions (13), (14), (15), (16) and (17) are stated over the real norming completion, its coordinate predual and dual quotient, with the CH labellings of all pure and mixed path families; (14) allows any closed linear subspace with the stated family of path cosets.
The full norming set contains every ✦, and every coefficient of every array in has absolute value at most one.✦ Every raw prefix support is nonempty.✦ The finite sum of each infinite path prefix belongs to ✦, and the pointwise limit defining its path functional exists with norm at most one.✦ For every family, the source and path exponents in (1) are Hölder conjugates.✦ The general dual analysis operator satisfies , and the quotient is complete.✦