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 form
Define
For any , the bound on and the triangle inequality give
Thus every quantity in the supremum defining is at most every quantity in the infimum defining . Taking and gives finite bounds, specifically
The 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 gives
The 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. Define
The limit exists because
Any 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 gives
The 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.