The Setting
The separable quotient problem concerns bounded linear surjections from an infinite-dimensional Banach space onto an infinite-dimensional norm-separable Banach space. Changing the predual modifies a closed subspace of a dual space by perturbing the quotient map that defines it.
The continuum hypothesis, abbreviated CH, is the equality .✦ Let be the fixed ambient class of infinite-dimensional real Banach spaces. A real normed space has a separable quotient when there are an infinite-dimensional norm-separable real Banach space and a bounded linear surjection , with the same ambient size convention for and .✦ Write for the collection of such pairs . The assertion says that is nonempty for every .✦
The Norming Families
The coordinate set is , the set of countable ordinals. Fix a bijection .✦ The color of is , and is its th color class.✦ Each is unbounded and has cardinality . The color embedding is given by .✦
A rational array on is a rational-valued function with finite support.✦ The operation families are the pure families , one for each , and the mixed family .✦ Their parameter , family index , and source color are specified by (1). (1) Two arrays have successive supports for a family if every coordinate in the first support precedes every coordinate in the second. For , every color in the first support must also be smaller than every color in the second.
For a natural parameter , the depth , exponent scale , and accumulated length are the sequences in (2). The associated block lengths and normalization factors are and in the same display. (2) All sequence indices start at zero; the corresponding positive index is . Subtraction in natural-number parameters stops at zero. A family uses and at weight . The primal exponent is , the path exponent is , and the source exponent is , the primal exponent of . The underlying function for positive has value zero at .✦
A type I expression for is a weight and a list of nonzero rational children with and pairwise successive supports for .✦ Its normalized value is the array in (3). (3)✦
The coherent finite closure system assigns to each an increasing sequence of finite subsets of , each containing , whose union is . Its coherence condition is (4). (4) A predecessor closure family below is a family assigning a finite set to each and . A predecessor closure family below is coherent when the endpoint, monotonicity, exhaustion, and restriction conditions above hold below .✦ A coherent endpoint extension of a predecessor closure family below is an increasing sequence of finite sets containing and exhausting , such that whenever belongs to .✦ The chosen endpoint construction assigns a sequence of finite sets to a predecessor family. The system is defined by recursion along , applying that construction to the families already assigned to the predecessors.✦
The positive-indexed finite closure below is the finite set given by for ; as well.✦ The closure entry rank is the first positive for which when , and is zero when .✦
A finite path code is a finite list of triples consisting of a natural weight, natural metadata, and a finite set of pairs in .✦ For a finite coordinate set , the order position of is .✦ The positional code of an array relative to a finite coordinate set is the set given by , retaining zero coefficients.✦ Let be the largest metadata entry of a code , with .✦ The coding map sends to the natural-number pairing of its canonical natural-number code and .✦ It is injective, and exceeds every metadata entry of .
A raw infinite path is a sequence of nonzero rational arrays, declared weights, and metadata.✦ Its prefix support , endpoint , closure , and code are defined by (5). (5) The raw path is admissible when its supports are successive in the ordinal order, its metadata are strictly increasing and positive, and the conditions in (6) hold. (6)✦ Prefix validity of length means these conditions restricted to the entries , with the coding rule required only when ; entries beyond this prefix are unrestricted.✦
A finite path for is a raw infinite path with a positive length and a valid prefix of that length, together with type I expressions for the first original pieces. Their values and weights agree with and , and the original pieces are successive for . Its value is the finite sum of the original uncropped rational pieces.✦
For a base set and a family , the norming construction starts with . Each next stage retains the previous one and adds values of type I expressions whose children belong to the previous stage, and values of path operations whose children of every original uncropped piece on every path belong to that stage. The signed monochromatic base, pure norming sets, and full norming set are those in (7); denotes the rational unit array at . (7) An infinite path for is an admissible raw infinite path with a type I expression at each position, having the same value and weight as its raw piece, with the raw pieces successive for and every child in .✦ Its prefix through index is the finite path of length with the same raw data and the same original expressions at those positions.✦ The path index set consists of the raw infinite paths arising from infinite paths for .✦ For each , choose a representative with exactly those raw data.✦
The Norming Completion
A norming set on is a set of rational arrays containing every and satisfying for and .✦ Its bounded function space is with the supremum norm.✦ The coordinate evaluation vector is the function in this space.✦ The finite-support evaluation map sends to .✦ The norming completion is the closed linear span of these vectors, with the inherited norm; the finite-support inclusion is the same evaluation map with range in .
For , the norming evaluation functional is point evaluation at .✦ The coordinate functional on is the norming evaluation functional given by .✦ For the full norming set , set . The coordinate predual, dual quotient, and quotient map are defined in (8), with norm closure taken in the usual real continuous dual . (8)
The Perturbation
For an infinite path with raw pieces , its path partial sum is the functional on .✦ The path functional of an infinite path is chosen as the pointwise limit on of its path partial sums .✦ The path coset of is .✦
Assume CH. For each family , choose an injection . The colored path labelling associated with the injection is the map on given by .✦ Finite color synthesis and finite path synthesis are the linear maps in (9). (9) For an index set and an exponent , the finitely supported sequence embedding sends each coefficient family to the same coordinate function.✦ Color synthesis and path synthesis are the continuous linear extensions of and along these embeddings.
For conjugate exponents and , the dual coefficient sequence of has coordinate at , where is the unit sequence.✦ It belongs to . For conjugate exponents and and a bounded linear map , the dual analysis operator of is the bounded linear map from to that sends to the coefficient sequence of .✦ The color analysis operator is the dual analysis operator of .✦ The family perturbation operator , perturbation weights , and total perturbation are given in (10). (10) The sum defining converges in operator norm. The changed predual is the real linear subspace of defined in (11), with the inherited norm. (11)✦
The Claim
Theorem 1. Assume the continuum hypothesis. The changed predual in (11) is complete and has the properties (12) and (13). (12)✦ (13)✦ For the fixed ambient class, (14) holds. (14)✦
What Is Checked
The assertions concern the explicit kernel of the quotient map minus the path perturbation under CH, and the universal real assertion over the fixed ambient class of spaces and quotient targets. The dual uses its usual operator norm, and is complete.✦
For the full norming set, every belongs to ✦, and every coefficient of every has absolute value at most one.✦ Every raw prefix support is nonempty.✦ For each infinite path, its finite prefix sum belongs to ✦, and has norm at most one. The source and path exponents and are Hölder conjugates.✦ For a general dual analysis operator associated with , its operator norm is at most .