27
$\begingroup$

With axiom of choice it is possible to construct an inner product on $C(\mathbb R)$.

My question is, is it possible to explicitly construct an inner product on $C(\mathbb R)$? I.e. to give a closed formula to calculate the inner product? I know it is straight-forward to write down a scalar product using a Hamel basis. This is not the answer I am looking for.

This question came to me, when a student asked me in the lecture today 'whether there are vector spaces without inner products'. So I tried to find scalar produces for function spaces. I think I managed to write one down for $L^1((0,1))$. But I failed to construct one for $C(\mathbb R)$.

$\endgroup$
8
  • 1
    $\begingroup$ Also if you found an inner product for $L^1((0,1))$ then we would have $L^1((0,1))$ a hilbert space and the riesz representation theorem would tell us that the dual can be identified with the space itself, but we know the dual of $L^1$ is identified with $L^\infty$ not $L^1$ itself. $\endgroup$
    – DanZimm
    Commented May 30, 2014 at 12:19
  • 8
    $\begingroup$ @DanZimm He wanted an inner product, but not necessarily completeness with respect to the inner product, nor that the inner product generates the given topology. So $\langle x,y \rangle = \sum_{n=1}^\infty 2^{-n} x_n y_n$ is an inner product on $l^1$. $\endgroup$ Commented May 30, 2014 at 12:22
  • 3
    $\begingroup$ I don't think the first statement is true. Assuming AC, $C(\mathbb{R})$ has cardinality $\mathfrak{c}$, hence Hamel dimension $\mathfrak{c}$, hence is isomorphic as a vector space to $\ell^2(\mathbb{N})$, hence admits a complete inner product. Or have I made a mistake? $\endgroup$ Commented Nov 12, 2014 at 4:22
  • 2
    $\begingroup$ I suspect that the case is analogous to the existence of discontinuous linear maps in infinite-dimensional Banach spaces, where AC is required: .en.wikipedia.org/wiki/Discontinuous_linear_map#Axiom_of_choice. $\endgroup$ Commented Nov 12, 2014 at 7:58
  • 1
    $\begingroup$ "There are vector spaces without inner products" could refer to vector spaces over fields which are not ${\bf R}$ or ${\bf C}$, or topological vector spaces which do not admit a norm compatible with the topology (like $C^\infty([0,1])$). Using axiom of choice, one can just take any basis and declare it to be the orthonormal basis. The resulting inner product will be incomplete, but otherwise fine. And for spaces of dimension outside $[\aleph_0,\mathfrak c)$, we can find (using choice) a linear isomorphism with a Hilbert space. $\endgroup$
    – tomasz
    Commented Nov 13, 2014 at 16:54

1 Answer 1

37
+500
$\begingroup$

(Update. Added a self-contained proof that under $\mathsf{ZF}+\mathsf{DC}+\mathsf{BP}$ there is no norm.)

Martín-Blas Pérez Pinilla is on the right track. You can't even put a norm on $C(\mathbb{R})$ without using the axiom of choice in an essential way. Dependent choice is not enough.

Claim. It is consistent with $\mathsf{ZF}+\mathsf{DC}$ that there does not exist any norm on $C(\mathbb{R})$.

Recall that a subset $E$ of a topological space is said to have the Baire property if it can be written as a symmetric difference $E = U \triangle M$ where $U$ is open and $M$ is meager (a countable union of nowhere dense sets).

A celebrated theorem of Shelah says that consistent with $\mathsf{ZF}+\mathsf{DC}$ is the statement $\mathsf{BP}$: "Every subset of $\mathbb{R}$ has the Baire property." From $\mathsf{BP}$ it follows that in fact every subset of any Polish space has the Baire property.

Let $\tau$ be the usual topology on $C(\mathbb{R})$ (uniform convergence on compact sets). It is induced by a translation-invariant metric:

$$d(f,g) := \sum_{n=1}^\infty 2^{-n} \min\left(1, \sup_{[-n,n]} |f-g|\right) $$

The metric $d$ is complete (this comes from the fact that a uniform limit of continuous functions is continuous). And it's not hard to see that $\tau$ is separable (the polynomials with rational coefficients are $\tau$-dense, by the Weierstrass approximation theorem). So $(C(\mathbb{R}),\tau)$ is a Polish space.

Suppose now that $\|\cdot\|$ is a norm on $C(\mathbb{R})$. Let $B$ be the closed unit $\|\cdot\|$-ball. We will show that $B$ does not have the Baire property with respect to $\tau$. Specifically, let $U$ be any $\tau$-open set; we will show that $B \triangle U$ is $\tau$-nonmeager.

Suppose first that $U = \emptyset$ so that $B \triangle U = B$. Since $\bigcup_{n=1}^\infty nB = C(\mathbb{R})$, by the Baire category theorem $B$ is $\tau$-nonmeager.

Now suppose that $U$ is nonempty. We will show $U \setminus B$ is $\tau$-nonmeager. Let us begin by showing $U \setminus B$ is nonempty. Let $f \in U$ and let $g \in C(\mathbb{R})$ be your favorite nonzero continuous function which is supported in $[0,1]$. Let $g_n(x) = g(x-n)$ be translates of $g$. For each $n$, let $a_n$ be a real number sufficiently large that $\|f + a_n g_n\| > 1$, so that $f + a_n g_n \notin B$. Then $a_n g_n \to 0$ uniformly on compact sets (i.e. in the $\tau$ topology), so for some $N$ we have $h := f + a_N g_N \in U$. Thus $h \in U \setminus B$. (To say this another way, every nonempty $\tau$-open set is unbounded, but $B$ is bounded, so $U$ cannot be a subset of $B$.)

Now for any $u \in C(\mathbb{R})$, we have $h + \frac{1}{n} u \to h$ in both the $\tau$ and $\|\cdot\|$ topologies. So for sufficiently large $n$, we have $h + \frac{1}{n} u \in U$ and $h + \frac{1}{n} u \in B^c$ (since $B$ is $\|\cdot\|$-closed). That is, $u \in n((U \setminus B)-h)$. Since $u$ was arbitrary we have shown $\bigcup_{n=1}^\infty n((U \setminus B)-h) = C(\mathbb{R})$. By the Baire category theorem, $U \setminus B$ is $\tau$-nonmeager, hence so is $B \triangle U$.

So we have shown that if $C(\mathbb{R})$ has a norm, then it has a set that lacks the Baire property with respect to $\tau$. Under $\mathsf{ZF}+\mathsf{DC}+\mathsf{BP}$ there is no such set and hence no norm.

(Credit where credit is due: This proof is loosely based on the idea of the proof of the Garnir-Wright closed graph theorem from Theorem 27.45 of Eric Schechter's Handbook of Analysis and its Foundations.)

Incidentally, the only property of the vector space $C(\mathbb{R})$ we used is that it admits a Polish topology in which every nonempty open set is unbounded. So the same argument would apply to other vector spaces with this property, such as $\mathbb{R}^{\mathbb{N}}$, $C^\infty(\mathbb{R}^d)$, etc.

$\endgroup$
5
  • $\begingroup$ Maybe this is an answer to this question as well? $\endgroup$
    – Asaf Karagila
    Commented Nov 13, 2014 at 15:43
  • $\begingroup$ @AsafKaragila: Yes, I think it is indeed. I will post an answer there with a link to this question. If I had known about the other question, I probably should have answered it and closed this one as duplicate. Not sure of the best way to arrange things now. $\endgroup$ Commented Nov 13, 2014 at 16:42
  • $\begingroup$ Well, both are somewhat old, and you couldn't have closed an active bounty question anyway. I think the right thing to do is to post a short answer outlining the argument and a link here. $\endgroup$
    – Asaf Karagila
    Commented Nov 13, 2014 at 16:51
  • $\begingroup$ Superb answer! Small technical question: do you really need DC to do your construction? (I know ZF + DC + BP and ZF + BP are equiconsistent so it's not really an issue, but I'd like to be sure I've understood your construction). Unless I'm mistaken, the Baire category theorem for Polish space is a ZF theorem, so DC is at least not needed here: is it needed elsewhere? $\endgroup$
    – PseudoNeo
    Commented Nov 14, 2019 at 19:12
  • 1
    $\begingroup$ @PseudoNeo: I think you may be right that you can prove in ZF that a Polish space is not meager. However, without DC that is not so satisfying, because it's consistent with ZF that a countable union of meager sets is nonmeager! (Indeed, there's a famous model of ZF in which $\mathbb{R}$ is a countable union of countable sets.) So in ZF, showing that $\bigcup_n nB = C(\mathbb{R})$ would not be sufficient to conclude that $B$ is nonmeager. Thus I at least used DC there. $\endgroup$ Commented Nov 14, 2019 at 21:00

You must log in to answer this question.

Not the answer you're looking for? Browse other questions tagged .