Let . We construct the extension by a deterministic recursion over the given dense list, using the one-dimensional dominated extension of a real linear functional. Neither Zorn's lemma nor any selection of a family of extensions is needed.
Suppose is already a linear functional satisfying , and . An extension to must have the formDefineFor any , the bound on and the triangle inequality giveThus every quantity in the supremum defining is at most every quantity in the infimum defining . Taking and gives finite bounds, specificallyThe completeness of the real numbers defines these endpoints uniquely. Set ; this is an explicit rule, not an arbitrary choice from a nonempty interval.
For , the upper-endpoint inequality with yields . For , write with and use the lower-endpoint inequality with to obtain the same bound. For it is the original bound. Applying the upper bound also to the negative of the vector givesThe representation is unique because , so is a well-defined bounded linear functional extending .
Start with and . At step , if leave the functional unchanged; otherwise use exactly the supremum-endpoint rule with . Put . This defines compatible functionals on with the common bound . Their union on is linear and bounded by . The subspace is dense in because it contains every .
To make the final passage to the closure equally free of the axiom of choice, for let be the least positive integer with . Density ensures that this integer exists, and leastness specifies it uniquely. DefineThe limit exists becauseAny other approximating sequence in gives the same limit, by the same norm bound. Applying this independence to sums and scalar multiples of approximating sequences proves linearity of . It also shows on and . Restriction to therefore givesThe upper bound follows from construction and the lower bound from restriction to . This also covers , when all extensions are zero. No completeness of or closedness of was assumed. The argument establishes the choice-free Hahn-Banach extension in a separable space by uniquely specified operations at every stage.
A point of a set is an extreme point if , with and , forces . For a convex set it is enough to test midpoint decompositions: a nontrivial segment containing in its interior contains a smaller segment with midpoint . The nonempty convex set has no extreme points, since every is the midpoint of and .
For the real l-infinity sequence space, a vector in the closed unit ball is extreme precisely when every coordinate is or . If for some , choose . The distinct vectors remain in the unit ball and have midpoint , so is not extreme. Conversely suppose all coordinates have modulus one and , with . In each real interval , an endpoint can be a midpoint only if both entries equal that endpoint. Thus for every and . Therefore
For the real absolutely summable sequence space, any point with is nonextreme: choose a nonzero coordinate perturbation of norm less than . If and two coordinates are nonzero, take and putBoth perturbations preserve the signs of those two coordinates. One adds to one absolute value and subtracts it from the other, so . Hence such an is not extreme. The only remaining candidates are . If with , its th coordinate forces . That consumes the entire norm allowance, forcing all other coordinates to vanish. The argument for is identical. Thus
For the real l2 sequence space, interior points of the unit ball again permit sufficiently small opposite perturbations and are not extreme. If and , write , . The parallelogram law givesThe left side is at most one, so and . ConsequentlyThese are the extreme points of real sequence-space unit balls: signs in , coordinate spikes in , and the whole sphere in . The restriction to real scalars matters for the first description; the complex supremum ball has arbitrary unit-modulus coordinates instead.
Articles by others on the same topic
There are currently no matching articles.