Separability of for finite , and the failure at
Statement
Let be a -finite measure space whose -algebra is countably generated modulo null sets, for instance with Lebesgue measure.
Separability for finite . For the space is separable: it has a countable dense subset. On one may take finite rational linear combinations of indicators of boxes with rational vertices, or the continuous functions of compact support with rational data.
Failure at . is not separable. The family is uncountable and satisfies for , so the open balls of radius around its members are pairwise disjoint and any dense set must meet each of them. The same argument shows is not separable.
Remarks
Not proved in this library. It is recorded with citations and used in no proof here.
What would prove it. For the positive half: approximation of an function by simple functions, then of a measurable set by a finite union of boxes up to small measure, then of the coefficients by rationals, with the three errors summed by Minkowski's inequality (Holder and Minkowski inequalities in integral form ‡). For the negative half: nothing beyond the displayed computation, once and the notion of a countable set (Finite, countably infinite, countable, uncountable ↗) are available.
Which page it serves. Separability is defined later in Separability: the existence of an at most countable dense subset ↗. The pair of statements above is the standard first example of a natural Banach space that is not separable, and it is also why behaves differently from every with finite. It is not separable, so it has no countable dense subset to run approximation arguments on, and the duality stops at it. For -finite the space is itself the dual of ; what has no counterpart is the return trip, since the dual of is not but a space of bounded finitely additive set functions. So the identification that holds for stops here.
Hypotheses worth stating carefully. Separability of is a property of the measure space and not of alone: for the counting measure on an uncountable set is not separable for any , since the indicators of singletons are pairwise at distance . The clean statement is the one above, with -finiteness and a countably generated -algebra as hypotheses.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 5 results over 4 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.
Sources
- Lp space (Wikipedia) (standard reference, not scraped)
- Separable space (Wikipedia) (standard reference, not scraped)