How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced — the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted — a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated — a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
The Cantor Set, Baire Category, and Measure Zero in
1 · Prerequisites
- Compactness in Metric Spaces
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Countability and Uncountability
- Foundations of the Real Numbers for Analysis
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Relations, Functions, and Quotients
- Roots, Rational Powers, and Classical Inequalities
- Sequences and Limits
- Series: Convergence and the Nonnegative Tests
- Set Theory Beyond Choice: Recorded, Not Proved Here
- Suprema and Infima
- The ZFC Axioms and the Basic Set Constructions
- Topology of ℝ
2 · Summary
Objective. There are two ways for a subset of to be small, and they are unrelated. A set is small in category when it is a countable union of sets whose closures contain no interval; it is small in measure when it can be covered by intervals of total length below every positive bound. This page defines both, proves the one theorem that makes the first notion non-trivial (Baire), proves the one lemma that makes the second notion non-trivial (no interval of positive length is null), and then builds the two sets that separate them: the Cantor middle-thirds set, which is small in both senses and yet uncountable, and the Smith-Volterra-Cantor set, which is small in category and not in measure. It also builds the Cantor function, which climbs from to while doing all of its climbing on a set of measure zero, and it closes with a remark on the choice cost of Baire and with five false statements.
Category. Nowhere dense, meager (first category), residual, and second category subsets of fixes nowhere dense as "the interior of the closure is empty", records the working equivalent that the complement of the closure is dense, and builds meager, residual and second category on top of it; and subsets of adds the two countable classes and , which are exchanged by complementation. Baire category in , by nested intervals with canonically chosen rational endpoints: a countable intersection of dense open sets is dense, so is not a countable union of nowhere dense sets is the theorem of the page: a countable intersection of dense open subsets of is dense, so is not a countable union of nowhere dense sets. is , meager and not , while the irrationals are , residual and not then settles the status of the rationals and the irrationals completely: is and meager and is not , and dually for the irrationals. That last failure is the first genuinely hard fact on the page and is exactly where Baire is spent.
The proof of Baire spends no choice, and the page says so precisely. The textbook argument picks a nested interval at each stage in terms of the previous one, which is dependent choice. The proof here fixes one enumeration of and, at every stage, takes the interval whose two rational endpoints have least index among those meeting the requirements, exactly the canonical selection of Every nonempty perfect subset of is uncountable; the recursion is then a single application of The recursion theorem to a total map. Why the nested-interval proof of Baire category in needs no choice, while the general complete-metric statement does states what that does and does not establish, and it is careful about the difference: nothing here bears on the Baire theorem for general complete metric spaces, whose strength over ZF is a quoted external result recorded in The Baire category theorem is four inequivalent statements over ZF ‡ and not proved in this library. That remark is the one item on the page resting on unproved material, and it is marked accordingly.
Measure. Measure zero (a countable cover by intervals of total length below every ) and content zero (a finite such cover) defines both notions by covers of intervals, countable for measure zero and finite for content zero, and records the working form in which only the partial sums of the lengths have to be checked. Two lemmas carry the whole quantitative content. If finitely many intervals cover a closed bounded interval , the sum of their lengths is at least says that finitely many intervals covering have total length at least , by induction on their number; A sequence of intervals covering has total length at least , so no interval of positive length has measure zero upgrades this to countable covers, using an enlargement to open intervals and the compactness of , and it is what forbids a null set from containing an interval of positive length. Without those two nothing on the measure side means anything: on this page The Cantor set is compact, perfect, uncountable, nowhere dense and of measure zero, and it contains no interval of positive length, so its only nonempty connected subsets are single points, The Smith-Volterra-Cantor set is compact, perfect and nowhere dense, and does not have measure zero and FALSE: every set of measure zero has content zero all rest on one or the other, and none of them is provable without them.
What is null and what is not. Every at most countable subset of has measure zero covers the -th point of a listing by an interval of length and uses no choice at all. A countable union of measure-zero sets has measure zero, by countable choice does use countable choice, at exactly one step, to pick one cover for each of the given sets, and the item marks the step. A set of content zero has measure zero is the trivial direction between the two notions, and For a compact subset of , measure zero and content zero coincide shows they agree on compact sets, which is the only case in which content zero is used on this pair of pages.
The Cantor set. The Cantor middle-thirds set as the intersection of the sets obtained by removing open middle thirds builds from the self-similar recursion , which is one application of the recursion theorem and needs no bookkeeping of the intervals at stage . The Cantor set is exactly the set of with every , and this gives a bijection with identifies with the set of sums with every , exhibits the bijection with , and extracts digits from a point of by a canonical recursion rather than by choosing them. The Cantor set is compact, perfect, uncountable, nowhere dense and of measure zero, and it contains no interval of positive length, so its only nonempty connected subsets are single points then collects what is: compact, of content zero and hence null, perfect, uncountable, nowhere dense, containing no interval with two distinct endpoints, and therefore having only single points as nonempty connected subsets. The phrase totally disconnected appears in no statement or title on this pair, since nothing in the reading order defines it; it survives only in the identifier of the companion item that works the property out, where it is a gloss; what is proved is the statement about connected subsets, via A subset of is connected if and only if it is order-convex, that is, an interval.
The Smith-Volterra-Cantor set. The Smith-Volterra-Cantor set: the same construction removing, at stage , an open middle interval of length from each of the remaining intervals runs the same shape of construction while removing, at stage , an interval of fixed length from each remaining piece, so that the total removed length is only . The Smith-Volterra-Cantor set is compact, perfect and nowhere dense, and does not have measure zero proves it compact, perfect and nowhere dense, and proves that no cover of it by intervals has total length below . That is the quantitative statement this library can make: no outer measure is defined anywhere here, so nothing is said to have measure , and every assertion is about covers and their total lengths.
The Cantor function. The Cantor function on , defined on the Cantor set through ternary digits and extended constantly across each removed interval halves the ternary digits of a point of , reads them in base two, and extends the result to by ; the supremum exists because the values lie in . The Cantor function is well defined, satisfies whenever , is surjective onto , and is constant on every interval removed from the Cantor set proves that extends , that whenever , that is onto , and that is constant on the closure of every gap of , every point outside lying in such a gap. Nothing is claimed about continuity: no definition of continuity for a real function is available at this point in the reading order, so no statement about it, in either direction, appears anywhere on this page.
Five false statements close the page, each with a witness on the companion page: that nowhere dense implies measure zero, refuted by the Smith-Volterra-Cantor set; that measure zero implies nowhere dense, refuted by ; that measure zero implies content zero, refuted by ; that is ; and that the Cantor set is countable because only countably many intervals were removed. Read together they say that the two smallness notions of this page are independent in every direction, and that neither is a statement about cardinality.
3 · Logical flowchart
4 · Definitions, theorems and proofs
Nowhere dense, meager (first category), residual, and second category subsets of
Definition
Let , with interior and closure as in Interior, closure, boundary and exterior of a subset of .
- is nowhere dense when the interior of its closure is empty:
- is meager, or of the first category, when there is a sequence of nowhere dense subsets of with
- is of the second category when it is not meager.
- is residual (also comeager) when is meager.
Why a sequence, and why that is the same as "an at most countable union". Sequences here are indexed by , which contains . A finite family of nowhere dense sets is turned into a sequence by setting for , and is nowhere dense because has empty interior; the empty family is handled the same way and gives . So "a union of an at most countable family of nowhere dense sets" (Finite, countably infinite, countable, uncountable) and the displayed condition define the same class, and the sequence form is used below because it carries an explicit index and needs no case split.
Nowhere dense means exactly that the complement of the closure is dense. For ,
Indeed, by the pointwise description of the interior (Interior, closure, boundary and exterior of a subset of ), says that no admits a real with (The -neighbourhood and the punctured -neighbourhood of a point of ), that is, that every meets . By claim 1 of The closure equals the set together with its limit points, equals the set of points every neighbourhood of which meets it, and is the smallest closed superset; a set is closed iff it contains its limit points that says precisely that every is adherent to , that is, , which is density (Limit point, isolated point, adherent point, derived set, and dense subset of ).
A closed set is nowhere dense exactly when its interior is empty, since a closed set equals its own closure (claim 4 of The closure equals the set together with its limit points, equals the set of points every neighbourhood of which meets it, and is the smallest closed superset; a set is closed iff it contains its limit points, Open subset of (every point has a neighbourhood inside it), closed subset (complement open), and clopen). This is the form in which nowhere density is verified nearly every time below. (The phrase almost everywhere is avoided throughout this pair: it is a measure-theoretic term, and the only measure notion defined here is measure zero.)
Both classes are closed downwards. If then and hence (Interior, closure, boundary and exterior of a subset of ), so a subset of a nowhere dense set is nowhere dense. If with each nowhere dense, then and each is nowhere dense by the previous sentence, so a subset of a meager set is meager.
A union of two meager sets is meager. Let and with all and all nowhere dense; fixing one witnessing sequence for and one for is two instantiations of an existential statement, not a choice principle. Let be a bijection () and define a sequence by
This is a total definition because is a bijection, every is nowhere dense, and , since and and every is one of the or one of the .
Remarks
-
The countably infinite version of the last observation is a different statement. To show that is meager for a sequence of meager sets one must select a witnessing sequence of nowhere dense sets for every at once, which is an application of countable choice (The Axiom of Countable Choice ()); the two-set case above avoids it because two selections are two instantiations. Nothing on this page uses the countably infinite version, and every meager set met below is presented together with an explicit witnessing sequence.
-
Nowhere dense is strictly stronger than having empty interior. has empty interior, since no neighbourhood consists of rationals alone, yet has interior , so is not nowhere dense. It is nevertheless meager, being a union of singletons; that computation is is , meager and not , while the irrationals are , residual and not .
-
First category, second category and residual are not a trichotomy. A set is meager or of the second category, and those two are exhaustive and exclusive by definition. Residual is a separate condition on the complement: a residual set is of the second category once is known not to be meager in itself (Baire category in , by nested intervals with canonically chosen rational endpoints: a countable intersection of dense open sets is dense, so is not a countable union of nowhere dense sets), but before that theorem nothing rules out a set that is both meager and residual.
-
Category is a notion of topological smallness, and it is independent of smallness in the sense of measure. Neither of the two implications between "nowhere dense" and "measure zero" (Measure zero (a countable cover by intervals of total length below every ) and content zero (a finite such cover)) holds, and itself splits into a meager set and a set of measure zero; the three items settling this are FALSE: every nowhere dense subset of has measure zero, FALSE: every subset of of measure zero is nowhere dense and is the union of a meager set and a set of measure zero, so smallness of category and smallness of measure are independent notions ↗.
and subsets of
Definition
Let , with open and closed sets as in Open subset of (every point has a neighbourhood inside it), closed subset (complement open), and clopen.
- is an set when there is a sequence of closed subsets of with
- is a set when there is a sequence of open subsets of with
The letters are the traditional ones: for fermé with for somme, for Gebiet with for Durchschnitt.
The two classes are exchanged by complementation. is if and only if is . If with each closed, then by De Morgan, and each is open by the definition of closedness (Open subset of (every point has a neighbourhood inside it), closed subset (complement open), and clopen); the converse is the same computation read backwards, using that the complement of an open set is closed, which is again Open subset of (every point has a neighbourhood inside it), closed subset (complement open), and clopen.
Every closed set is and every open set is , by the constant sequence , respectively . As with Nowhere dense, meager (first category), residual, and second category subsets of , an at most countable family (Finite, countably infinite, countable, uncountable) may always be presented as a sequence: a finite list of closed sets is extended by for , and a finite list of open sets likewise, so nothing is lost by indexing over .
Remarks
-
The classes are genuinely larger than the closed and the open sets. is and is neither open nor closed, and the irrationals are and neither open nor closed; both computations are in is , meager and not , while the irrationals are , residual and not . That is not also is the first genuinely hard fact about these classes and needs the Baire category theorem (Baire category in , by nested intervals with canonically chosen rational endpoints: a countable intersection of dense open sets is dense, so is not a countable union of nowhere dense sets).
-
Why the algebra of open sets is not enough. Arbitrary unions and finite intersections of open subsets of are open, and dually for closed sets gives that a finite intersection of open sets is open and a finite union of closed sets is closed. The definitions above are exactly what one gets by relaxing "finite" to "countable" once, and the point of the whole notion is that the relaxation is proper: a countable intersection of open sets need not be open, which is is not open.
-
Nothing here is a measure-theoretic notion. and are defined from the topology of alone and are used on this page to say precisely how far and its complement sit from being closed or open. They cut across Measure zero (a countable cover by intervals of total length below every ) and content zero (a finite such cover) completely: is and has measure zero (Every at most countable subset of has measure zero), while the Smith-Volterra-Cantor set is closed, hence , and does not (The Smith-Volterra-Cantor set is compact, perfect and nowhere dense, and does not have measure zero).
Baire category in , by nested intervals with canonically chosen rational endpoints: a countable intersection of dense open sets is dense, so is not a countable union of nowhere dense sets
Statement
Let be a sequence of subsets of , each open (Open subset of (every point has a neighbourhood inside it), closed subset (complement open), and clopen) and dense (Limit point, isolated point, adherent point, derived set, and dense subset of ). Then
Consequently, if is a sequence of nowhere dense subsets of (Nowhere dense, meager (first category), residual, and second category subsets of ), then : no meager subset of exhausts , so is of the second category in itself.
The selection is canonical, and the proof spends no choice principle. The textbook argument picks a nested interval at every stage in terms of the one before it, which is the axiom of dependent choice (The axiom of dependent choice: a relation in which every element is related to something admits an -indexed chain). The construction below instead fixes one enumeration of the rationals ( is countably infinite, The rationals embed densely in the reals) and, at every stage, takes the interval whose two rational endpoints have least index among those meeting the requirements. The requirements are met by some rational-endpoint interval, which is what the refinement claim of the proof establishes, and the least such index is determined by The well-ordering principle; so the whole recursion is a single application of The recursion theorem to one total map. This is the device of Every nonempty perfect subset of is uncountable, transplanted from perfect sets to dense open sets. What it does not settle is the strength of the theorem for general complete metric spaces, which is recorded separately in Why the nested-interval proof of Baire category in needs no choice, while the general complete-metric statement does.
Facts & Assumptions
Given: A sequence of dense open subsets of . Write for the image of in under . A pair is called good when , and denotes the set of good pairs.
Each is open and dense in .
is dense when , and is exactly the set of points every neighbourhood of which meets ; so is dense if and only if for every and every real (Limit point, isolated point, adherent point, derived set, and dense subset of , The closure equals the set together with its limit points, equals the set of points every neighbourhood of which meets it, and is the smallest closed superset; a set is closed iff it contains its limit points, The -neighbourhood and the punctured -neighbourhood of a point of ).
is open when every admits a real with ; ; every open interval is an open set, and is a closed bounded interval, nonempty when (Open subset of (every point has a neighbourhood inside it), closed subset (complement open), and clopen, The -neighbourhood and the punctured -neighbourhood of a point of , Intervals of : the nine order-convex forms, nondegeneracy, and length).
The intersection of two open subsets of is open, and the complement of a closed set is open (Arbitrary unions and finite intersections of open subsets of are open, and dually for closed sets, Open subset of (every point has a neighbourhood inside it), closed subset (complement open), and clopen).
( is countably infinite, Equinumerous sets, and ); is injective with image , and strictly between any two reals lies an element of (The rationals embed densely in the reals); a composition of bijections is a bijection (Injection, surjection, bijection).
Every nonempty subset of has a least element (The well-ordering principle).
Recursion: for a set , an element and a function there is with and (The recursion theorem).
Nested interval property: for nonempty closed bounded intervals with , the intersection is nonempty (A nested sequence of nonempty closed bounded intervals has nonempty intersection, and the intersection is a single point exactly when the lengths tend to ).
is nowhere dense exactly when is dense; is a closed set containing (Nowhere dense, meager (first category), residual, and second category subsets of , Interior, closure, boundary and exterior of a subset of , The closure equals the set together with its limit points, equals the set of points every neighbourhood of which meets it, and is the smallest closed superset; a set is closed iff it contains its limit points).
An at most countable family may always be presented as a sequence indexed by (Finite, countably infinite, countable, uncountable, Nowhere dense, meager (first category), residual, and second category subsets of ).
Proof
Fix and a real ; by [L1] it suffices to produce a point of lying in , since and are then arbitrary.
By [L4] fix a bijection and put , where , so that is a bijection from onto .
Recall the terminology of the Given: a pair of elements of is good when , and is the set of good pairs.
Refinement claim. For every good and every there is a good with . To see it, note first that is nonempty, since [L4] supplies an element of strictly between and , and that is open by [L2]; fix and, by [L2], a real with . Since is dense, [A1] and [L1] give , so , and that set is open by [A1], [L2] and [L3], so there is a real with . By [L4] fix with . Then , so is good, and every satisfies , whence and ; thus .
Successor rule. For let be the least natural for which some natural makes good with , and let be the least natural with that property for that ; put . The set of eligible is nonempty by step 2.1 applied with , since is onto by step 1.2, so both minima exist by [L5] and is a total function defined without any selection.
The recursion. By [L4] fix with ; then is good and, as in step 2.1, by [L2]. Apply [L6] with , seed and map to get with and ; an induction on shows that the first coordinate of is , so write , every being good.
Write , a nonempty closed bounded interval by [L2]. The rule of step 3.1 gives, for every , that ; in particular the family is nested and .
By [L7] applied to the nested family of nonempty closed bounded intervals, ; fix in it.
For every one has by steps 5.1 and 6.1, so ; and by steps 4.1 and 6.1. So meets .
Since and the real were arbitrary, every neighbourhood of every point of meets , so that set is dense by [L1].
For the consequence, let be a sequence of nowhere dense sets and put , which is open by [L3] and [L8] and dense by [L8]; by step 8.1 the set is dense, hence nonempty, and any in it lies outside every and so outside every , giving and therefore . By [L9] the same conclusion covers a union of an at most countable family of nowhere dense sets, so no meager set is all of .
Remarks
-
What "dense" is doing at each end. Density of the is used exactly once, in the refinement claim, to find a point of inside a given open interval; openness is used exactly once, immediately after, to fit a whole closed interval with rational endpoints around that point. Neither hypothesis can be dropped. Without openness the conclusion fails: the family consisting of together with all the sets for is an at most countable family of dense sets, all but the first of them open, and its intersection is empty. Without density it fails too, for the constant sequence has intersection , which is not dense in .
-
Only nonemptiness of the nested intersection is used. The construction does not force the interval lengths to and does not need to: claim 1 of A nested sequence of nonempty closed bounded intervals has nonempty intersection, and the intersection is a single point exactly when the lengths tend to already produces a point, and one point is all the argument wants. That is why no Archimedean step appears anywhere above.
-
The consequence is the form used downstream. Applying it to the sequence of singletons of a supposed enumeration of reproves that is uncountable (Baire category gives a third proof that is uncountable ↗); applying it to a supposed presentation of as a set is what shows that no such presentation exists ( is , meager and not , while the irrationals are , residual and not ).
-
Category is not measure. The intersection produced above is dense but may be very small in the sense of Measure zero (a countable cover by intervals of total length below every ) and content zero (a finite such cover); indeed decomposes as a meager set together with a set of measure zero ( is the union of a meager set and a set of measure zero, so smallness of category and smallness of measure are independent notions ↗), so this theorem says nothing whatever about size in measure.
is , meager and not , while the irrationals are , residual and not
Statement
Write for the image of in under the canonical embedding (The rationals embed densely in the reals), the set usually written once the identification is made, and put for the irrationals. Then:
- is an set ( and subsets of ) and is meager (Nowhere dense, meager (first category), residual, and second category subsets of );
- is a set and is residual;
- is not a set, and is not an set.
Claims 1 and 2 are bookkeeping. Claim 3 is the substance and is exactly where Baire category in , by nested intervals with canonically chosen rational endpoints: a countable intersection of dense open sets is dense, so is not a countable union of nowhere dense sets is spent: no argument from the algebra of open and closed sets alone can reach it, since and are interchanged by complementation while and are, so any such argument would prove the same thing about both sets and about neither.
Facts & Assumptions
Given: The complete ordered field , the set of rationals and its complement .
( is countably infinite, Equinumerous sets, and ), is injective with image (The rationals embed densely in the reals), and a composition of bijections is a bijection (Injection, surjection, bijection).
is dense in (Both and are dense in , and every nonempty open subset of is uncountable); a set is dense when its closure is , equivalently when every meets it (Limit point, isolated point, adherent point, derived set, and dense subset of , The closure equals the set together with its limit points, equals the set of points every neighbourhood of which meets it, and is the smallest closed superset; a set is closed iff it contains its limit points, The -neighbourhood and the punctured -neighbourhood of a point of ); the closure operator is monotone, so a superset of a dense set is dense (Interior, closure, boundary and exterior of a subset of ).
is open when every point of it has a neighbourhood inside it, and is closed when is open; and (Open subset of (every point has a neighbourhood inside it), closed subset (complement open), and clopen, The -neighbourhood and the punctured -neighbourhood of a point of ).
A closed set is nowhere dense exactly when its interior is empty; a meager set is a union of a sequence of nowhere dense sets; residual means the complement is meager (Nowhere dense, meager (first category), residual, and second category subsets of , Interior, closure, boundary and exterior of a subset of , The closure equals the set together with its limit points, equals the set of points every neighbourhood of which meets it, and is the smallest closed superset; a set is closed iff it contains its limit points).
is when it is the union of a sequence of closed sets and when it is the intersection of a sequence of open sets; is if and only if is ( and subsets of ).
A countable intersection of dense open subsets of is dense (Baire category in , by nested intervals with canonically chosen rational endpoints: a countable intersection of dense open sets is dense, so is not a countable union of nowhere dense sets).
Proof
For the singleton is closed and nowhere dense: its complement is open, since gives by [L3]; and its interior is empty, since for every real the point lies in and differs from , so no neighbourhood is contained in , whence is a closed set with empty interior and [L4] applies.
By [L1] fix a bijection and put with , a bijection from onto .
, since is onto ; the sets are closed and nowhere dense by step 1.1, so is by [L5] and meager by [L4]. This is claim 1.
Put , an open set by step 1.1 and [L3]. A real lies in exactly when for every , that is, exactly when , so and is by [L5]; and is meager by step 2.1, so is residual by [L4]. This is claim 2. Each is also dense, since every contains two distinct points and so meets , by [L2] and [L3].
Suppose, for contradiction, that is , and by [L5] fix a sequence of open sets with . Each contains , which is dense by [L2], so each is dense by [L2]; and each of step 3.1 is open and dense.
By [L7] fix a bijection and define a sequence by when and when ; this is total because is a bijection, and every is open and dense by step 4.1. Moreover , since every and every occurs among the and every is one of them.
By [L6] the set is dense, hence nonempty by [L2] and [L3], contradicting step 5.1. The assumption of step 4.1 is therefore untenable: is not ; and is not , since would then be by [L5]. This is claim 3.
Remarks
-
Where the two halves of the argument part company. Claim 1 is a listing argument: step 1.2 lists , and step 1.1 shows that each real singleton is nowhere dense; claim 3 uses the completeness of through A nested sequence of nonempty closed bounded intervals has nonempty intersection, and the intersection is a single point exactly when the lengths tend to , inside Baire category in , by nested intervals with canonically chosen rational endpoints: a countable intersection of dense open sets is dense, so is not a countable union of nowhere dense sets. Indeed is a subset of itself, being the whole space, so no argument that ignores the ambient completeness can possibly give claim 3.
-
The irrationals are also uncountable (The irrationals are uncountable), by a different and much cheaper argument that needs only the countability of and the uncountability of . Uncountability and being residual are independent properties: is meager and countable, the Cantor set is meager and uncountable (The Cantor set is compact, perfect, uncountable, nowhere dense and of measure zero, and it contains no interval of positive length, so its only nonempty connected subsets are single points), and is residual and uncountable.
-
The named witness for claim 3 is The irrationals form a residual set that is not ↗, and the false statement it refutes is FALSE: is a subset of ; the refutation is carried out here.
-
Meagre and measure zero are not the same smallness. is both, but the two notions diverge as soon as one leaves the countable case: is the union of a meager set and a set of measure zero, so smallness of category and smallness of measure are independent notions ↗ writes as a meager set together with a set of measure zero, and the set of measure zero there is residual. So being residual, which is what claim 2 gives for , carries no information at all about size in measure.
Measure zero (a countable cover by intervals of total length below every ) and content zero (a finite such cover)
Definition
Throughout, is the complete ordered field (Complete ordered field (least-upper-bound property)), intervals and their lengths are as in Intervals of : the nine order-convex forms, nondegeneracy, and length, and a sequence is a function on , which contains . Let .
- has measure zero, equivalently is null, when for every real there are sequences and of reals with for every , such that
- has content zero when for every real there are and reals with
The number is the length of (Intervals of : the nine order-convex forms, nondegeneracy, and length), and the sums are the series and the finite sums of Series, partial sums, convergence and the sum, divergence, and the tail series and Finite sums and finite products, by recursion.
Working form: only the partial sums have to be checked. All the terms are , so by claim 2 of A series of nonnegative terms converges iff its partial sums are bounded, and then the sum is their supremum the series converges exactly when its partial sums are bounded above, and its sum is then their supremum. Consequently, for a fixed ,
since a supremum is exactly when is an upper bound of the set it is the supremum of (Complete ordered field (least-upper-bound property)). Every verification of nullity below checks the right-hand condition.
Closed intervals lose nothing. A bounded interval with endpoints is contained in and has the same length (Intervals of : the nine order-convex forms, nondegeneracy, and length), so a cover by intervals of any of the four bounded forms yields a cover by closed intervals with the same lengths. The definition is therefore stated with closed intervals once and for all. Covers by open intervals are a genuinely different demand, and passing to one costs a little extra length: the enlargement is carried out where it is needed, in A sequence of intervals covering has total length at least , so no interval of positive length has measure zero and in For a compact subset of , measure zero and content zero coincide.
Both notions are inherited by subsets. If and is null, then any cover of covers , so is null; the same sentence with finite covers shows a subset of a set of content zero has content zero.
A finite cover is a countable cover, so content zero implies measure zero. Padding the list with the degenerate intervals for leaves the total length unchanged, by the splitting law for finite sums (Laws of finite sums and finite products). This is recorded as a lemma with its proof, A set of content zero has measure zero, because it is cited on its own.
Remarks
-
The two notions genuinely differ. is null and does not have content zero ( has measure zero and not content zero, although it is bounded ↗), so the two quantifier patterns, "a sequence of intervals" and "a finite list of intervals", are not interchangeable. They do agree for compact sets (For a compact subset of , measure zero and content zero coincide), and the compact case is the only one in which content zero is used anywhere on this pair of pages. Nothing is claimed about what later pages will do with it.
-
Why "content" and not "measure" for the finite version. The finite-cover notion is the vanishing of the Jordan outer content, and the countable-cover notion is the vanishing of the Lebesgue outer measure. Neither outer quantity is available at this point in the reading order. Jordan outer content is defined later in Jordan inner and outer content and Jordan measurable bounded sets in ↗; Lebesgue outer measure is still not defined. No item on this page assigns a nonzero size to any set. Every statement is of the shape "can, or cannot, be covered by intervals of total length below such and such a bound". That is a deliberate restriction of scope at this point in the reading order, not a claim that the general notions are unavailable in mathematics.
-
Measure zero is not vacuous and not universal. No interval with two distinct endpoints is null (A sequence of intervals covering has total length at least , so no interval of positive length has measure zero), while every at most countable set is (Every at most countable subset of has measure zero) and so is the uncountable Cantor set (The Cantor set is compact, perfect, uncountable, nowhere dense and of measure zero, and it contains no interval of positive length, so its only nonempty connected subsets are single points). The three facts together are what make the notion worth having.
If finitely many intervals cover a closed bounded interval , the sum of their lengths is at least
Statement
Let with , let , and let be reals such that
the intervals being those of Intervals of : the nine order-convex forms, nondegeneracy, and length. Then
The same bound holds for a cover by bounded intervals of any of the four bounded forms, since an interval with endpoints is contained in and has the same length (Intervals of : the nine order-convex forms, nondegeneracy, and length); replacing each covering interval by the closed interval on its endpoints changes no length and only enlarges the union. In particular a finite family of intervals of total length strictly below cannot cover , which is the form in which this lemma is used throughout the page.
This is the one quantitative fact underlying everything about measure zero here. Without it nothing forbids a set of measure zero from being all of . Four items on this page rest on it: A sequence of intervals covering has total length at least , so no interval of positive length has measure zero directly, and through that lemma The Cantor set is compact, perfect, uncountable, nowhere dense and of measure zero, and it contains no interval of positive length, so its only nonempty connected subsets are single points, The Smith-Volterra-Cantor set is compact, perfect and nowhere dense, and does not have measure zero and FALSE: every set of measure zero has content zero. Two of the worked items on the companion page rest on it as well.
Facts & Assumptions
Given: For let be the assertion: for all reals and all reals with , one has . The lemma is that holds for every .
, its length is when , and is nonempty exactly when (Intervals of : the nine order-convex forms, nondegeneracy, and length).
Finite sums: with and ; sums split as for , where ; a sum of nonnegative terms is nonnegative, and each single term is at most the whole sum (Finite sums and finite products, by recursion, Laws of finite sums and finite products).
Induction on (The principle of mathematical induction).
Ordered-field arithmetic: , so and for ; adding a constant and multiplying by a positive preserve an inequality; the order is total and transitive (The multiplicative identity is positive, Order is preserved by adding a constant and by adding inequalities, Sign rules for products and monotonicity of multiplication, Ordered field, Complete ordered field (least-upper-bound property)). These order-arithmetic facts are stated by their sources for the strict order only; the nonstrict forms used below follow by adjoining the equality case, in which the two sides coincide.
Proof
The assertion to be proved is for every , with as in the Given, and the argument is an induction on using [L3].
Base, . Let and with . Then and by [L1], so and , whence by [L4]; and by [L2]. So holds.
Induction hypothesis. Fix and assume .
The induction step: the two easy cases. Let and let satisfy ; write , a sum of nonnegative terms by [L1]. If then by [L2]. Otherwise ; then by [L1], so there is with , that is , and we fix one such . If then by [L4], and by [L2], so . There remains the case and .
The induction step: the remaining case, where the -th interval is deleted. Assume and , and define pairs by for and for ; by the splitting law and the index-shift convention of [L2], . Let be any real with and put , so . Every satisfies , hence by [L1], and satisfies , hence ; so lies in some with , that is in some . Thus with , and step 1.3 gives .
Passing to the limiting value of , and the conclusion. In the case of step 3.1 one has : were , the real would satisfy by [L4], so step 3.1 would give , which is impossible. Hence by [L4], using from step 2.1. Together with the cases settled in step 2.1 this proves , so by [L3] holds for every .
Remarks
-
Why the argument does not simply take . The point itself may be covered by the deleted interval and by nothing else, so the remaining intervals need not cover . They do cover for every positive , and that is enough: the bound holds for all such , and step 4.1 removes the . Every attempt to shortcut this step by taking a closed left endpoint at is false as stated.
-
Degenerate covering intervals are allowed and cost nothing. A pair with contributes the single point and the length , so a list may always be padded to a longer one, which is what A set of content zero has measure zero does.
-
The bound is sharp. The single interval covers with total length exactly , and no cover does better.
-
This is not the Heine-Borel theorem, and it does not use it. The lemma is a statement about finitely many intervals and is proved by counting alone; compactness enters only when a countable cover has to be reduced to a finite one, which is what A sequence of intervals covering has total length at least , so no interval of positive length has measure zero does with it.
A sequence of intervals covering has total length at least , so no interval of positive length has measure zero
Statement
Let with , let and be sequences of reals with for every , and suppose
If satisfies for every , then
Consequently, if then no subset of containing has measure zero (Measure zero (a countable cover by intervals of total length below every ) and content zero (a finite such cover)); in particular none of the four bounded intervals , , , with has measure zero, so measure zero is not a vacuous notion.
This is the countable strengthening of If finitely many intervals cover a closed bounded interval , the sum of their lengths is at least , and it is what compactness is spent on: the countable cover is enlarged to an open one at an arbitrarily small cost in total length, and A subset of is compact if and only if it is closed and bounded reduces it to a finite cover, where the finite lemma applies.
Facts & Assumptions
Given: Reals , sequences and with for every and , and a real with for every . Throughout, .
Measure zero: is null when for every real there is a sequence of closed intervals covering all of whose partial total lengths are ; a subset of a null set is null (Measure zero (a countable cover by intervals of total length below every ) and content zero (a finite such cover)).
has length when ; is the open interval; a closed bounded interval is bounded (Intervals of : the nine order-convex forms, nondegeneracy, and length, Lower bound, bounded below, bounded set).
Every open interval is an open set and every interval is a closed set (Open subset of (every point has a neighbourhood inside it), closed subset (complement open), and clopen, Intervals of : the nine order-convex forms, nondegeneracy, and length).
A subset of is compact exactly when it is closed and bounded (A subset of is compact if and only if it is closed and bounded); from every family of open sets whose union contains a compact set, either the set is empty and the empty subfamily covers it, or one can extract and members of the family whose union already contains it (Open cover, subcover, compact subset of (every open cover has a finite subcover), and sequentially compact subset).
If with and , then ; the same holds for covering intervals of any bounded form with those endpoints (If finitely many intervals cover a closed bounded interval , the sum of their lengths is at least ).
Powers and the geometric series: and , all for , and for ; a series of nonnegative terms has all its partial sums at most its sum (Integer powers , For , , and for the series diverges, Series, partial sums, convergence and the sum, divergence, and the tail series, A series of nonnegative terms converges iff its partial sums are bounded, and then the sum is their supremum).
Finite sums: additivity, scaling by a constant, splitting, and monotonicity in the terms (Finite sums and finite products, by recursion, Laws of finite sums and finite products).
Every finite list of naturals has an upper bound : by induction on , taking for the empty case and replacing by whichever of and is the larger, the order of being total (The principle of mathematical induction, Trichotomy of the order on , Order on the natural numbers).
Ordered-field arithmetic: , so and for ; adding a constant and multiplying by a positive preserve an inequality; the order is total and transitive (The multiplicative identity is positive, Order is preserved by adding a constant and by adding inequalities, Sign rules for products and monotonicity of multiplication, Ordered field, Complete ordered field (least-upper-bound property)). These order-arithmetic facts are stated by their sources for the strict order only; the nonstrict forms used below follow by adjoining the equality case, in which the two sides coincide.
Proof
Suppose, for contradiction, that . Since by [L7], we have , so and . Put , a positive real by [L9].
For put , a positive real by [L6] and [L9], and . Each is an open set by [L3], and because for , by [L2] and [L9]. Hence , so is a family of open sets whose union contains . The length of the interval with endpoints and is , by [L2] and [L9].
is closed and bounded by [L2] and [L3], hence compact by [L4]; so there are and members of the family with . By [L8] fix with for every ; then every occurs among , so .
By [L5], applied to the intervals with endpoints , one gets .
The left-hand side is at most : by [L7] it splits as , the first sum is by hypothesis, and the second is by [L6]. So by [L9], which is impossible; the assumption of step 1.1 is untenable and . For the consequence, let and let be null; taking in [L1] gives a sequence of closed intervals covering , hence covering , with every partial total length , so what has just been proved gives and hence by [L9], contradicting . Finally each of , , and with contains for and , which satisfy by [L9], so none of them is null.
Remarks
-
What the hypothesis says. It is the working form of "the total length is at most " recorded in Measure zero (a countable cover by intervals of total length below every ) and content zero (a finite such cover): for nonnegative terms, having all partial sums below is the same as convergence with sum below . Stating the lemma with partial sums avoids assuming convergence, and the conclusion is therefore also the statement that a cover of whose total length diverges is no counterexample.
-
The is spent on making the cover open, not on the estimate. Enlarging to adds to the -th length, and the geometric choice makes the whole added amount at most , however many intervals are used. This is the standard device and it recurs in For a compact subset of , measure zero and content zero coincide.
-
Compactness is not optional here. Without it the finite lemma cannot be reached, and the countable statement is genuinely stronger than the finite one: is covered by countably many intervals of total length below any , and by no finite family of total length below ( has measure zero and not content zero, although it is bounded ↗).
Every at most countable subset of has measure zero
Statement
Every at most countable set (Finite, countably infinite, countable, uncountable) has measure zero (Measure zero (a countable cover by intervals of total length below every ) and content zero (a finite such cover)).
The cover is explicit: the -th point of a listing of is put inside an interval of length , and the lengths sum to by For , , and for the series diverges. No choice principle is used: a listing of is a single object, fixed once (A nonempty set is at most countable iff it is a surjective image of ), and everything after that is a formula in .
Facts & Assumptions
Given: An at most countable set and a real . Throughout, .
is null when for every real there are sequences , with , , and for every (Measure zero (a countable cover by intervals of total length below every ) and content zero (a finite such cover)).
has length when , and has length (Intervals of : the nine order-convex forms, nondegeneracy, and length).
A nonempty at most countable set admits a surjection (A nonempty set is at most countable iff it is a surjective image of , Finite, countably infinite, countable, uncountable).
Powers and the geometric series: , , , and for ; a series of nonnegative terms has all its partial sums at most its sum (Integer powers , For , , and for the series diverges, Series, partial sums, convergence and the sum, divergence, and the tail series, A series of nonnegative terms converges iff its partial sums are bounded, and then the sum is their supremum).
Finite sums: scaling by a constant, and (Finite sums and finite products, by recursion, Laws of finite sums and finite products).
Ordered-field arithmetic: , so , and for ; adding a constant and multiplying by a positive preserve an inequality (The multiplicative identity is positive, Order is preserved by adding a constant and by adding inequalities, Sign rules for products and monotonicity of multiplication, Ordered field, Complete ordered field (least-upper-bound property)). These order-arithmetic facts are stated by their sources for the strict order only; the nonstrict forms used below follow by adjoining the equality case, in which the two sides coincide.
Proof
Let the real be given. If , the constant sequences and satisfy vacuously and for every by [L5], so the condition of [L1] holds at this . Assume from now on that and, by [L3], fix a surjection .
Put , a positive real by [L4] and [L6], and , ; then and by [L6], so by step 1.1. The length of is by [L2] and [L6].
For every , , using scaling from [L5] and the bound on the partial sums of the geometric series from [L4].
So for every real the sequences of step 2.1 cover with all partial total lengths at most , which by [L1] is exactly the statement that has measure zero; the empty case was settled in step 1.1.
Remarks
-
Indexing. Sequences here start at , and the first interval has length , not . The total is exactly, so the cover is as tight as the definition allows and nothing is wasted at the first index.
-
Repetitions are harmless. A surjection may repeat values, and a finite set is covered by infinitely many intervals, most of them redundant. This is why the listing form of countability (A nonempty set is at most countable iff it is a surjective image of ) is the convenient one: no injectivity and no case split between the finite and the countably infinite case is needed.
-
The converse fails badly. The Cantor set is uncountable and null (The Cantor set is compact, perfect, uncountable, nowhere dense and of measure zero, and it contains no interval of positive length, so its only nonempty connected subsets are single points), so "null" is very far from "countable"; and the Smith-Volterra-Cantor set is uncountable and not null (The Smith-Volterra-Cantor set is compact, perfect and nowhere dense, and does not have measure zero), so cardinality decides nothing either way.
-
Density decides nothing either. is countable, hence null, and is dense in ( is dense in and has measure zero ↗); a null set may therefore meet every interval.
A countable union of measure-zero sets has measure zero, by countable choice
Statement
Assume the Axiom of Countable Choice (The Axiom of Countable Choice ()). Let be a sequence of subsets of , each of measure zero (Measure zero (a countable cover by intervals of total length below every ) and content zero (a finite such cover)). Then
By the padding convention of Measure zero (a countable cover by intervals of total length below every ) and content zero (a finite such cover) and Finite, countably infinite, countable, uncountable the same conclusion covers the union of an at most countable family of null sets, a finite family being extended by copies of .
The hypothesis is spent at exactly one step, step 2.1 below, where one covering sequence is selected for every at once. Each has many such covers and nullity provides no rule for singling one out. Nothing else in the proof selects anything: the diagonal enumeration and the estimate are formulas.
Facts & Assumptions
Given: A sequence of null subsets of and a real . Throughout, .
The Axiom of Countable Choice: every family of nonempty sets has a function on with for every (The Axiom of Countable Choice ()).
is null when for every real there are sequences , with , and for every (Measure zero (a countable cover by intervals of total length below every ) and content zero (a finite such cover)).
There is a bijection , with inverse (, Injection, surjection, bijection).
Powers and the geometric series: , , , and for ; a series of nonnegative terms has all its partial sums at most its sum (Integer powers , For , , and for the series diverges, Series, partial sums, convergence and the sum, divergence, and the tail series, A series of nonnegative terms converges iff its partial sums are bounded, and then the sum is their supremum).
Finite sums: additivity, scaling, splitting and monotonicity in the terms; a sum of nonnegative terms is nonnegative and does not decrease when further nonnegative terms are adjoined, so a sum of finitely many nonnegative terms indexed injectively inside a finite rectangle is at most the sum over the whole rectangle (Finite sums and finite products, by recursion, Laws of finite sums and finite products).
Every finite list of naturals has an upper bound in , by induction on its length and the totality of the order of (The principle of mathematical induction, Trichotomy of the order on , Order on the natural numbers).
Ordered-field arithmetic: , so and for ; adding a constant and multiplying by a positive preserve an inequality (The multiplicative identity is positive, Order is preserved by adding a constant and by adding inequalities, Sign rules for products and monotonicity of multiplication, Ordered field, Complete ordered field (least-upper-bound property)). These order-arithmetic facts are stated by their sources for the strict order only; the nonstrict forms used below follow by adjoining the equality case, in which the two sides coincide.
Proof
Let the real be given and put for , a positive real by [L3] and [L6]. Let be the set of all pairs of sequences with for every , and for every . Each is null, so each is nonempty by [L1].
By [A1] fix with for every , and write . This is the one and only application of countable choice in the proof.
By [L2] fix a bijection and define sequences and by and , which is a total definition because is a bijection; then for every . Every lies in some , hence in some by step 2.1, so .
Fix . The pairs for are finitely many and pairwise distinct, so by [L5] there is with both coordinates of each of them at most ; since all the terms are nonnegative, [L4] gives . For each the inner sum is by step 2.1, so the whole is at most , by [L3], [L4] and [L6].
Steps 3.1 and 4.1 exhibit, for the given , sequences of closed intervals covering with every partial total length at most ; since was arbitrary, [L1] gives that has measure zero.
Remarks
-
Why the slack is geometric. The -th set is covered to within and the budgets sum to , exactly as in Every at most countable subset of has measure zero, of which this theorem is the abstract form: applying it to the singletons of a listing recovers that lemma, at the cost of an appeal to that the direct proof avoids. The expenditure is the same one, and made for the same reason, as in Countable unions of at most countable sets, assuming .
-
No rearrangement theorem is used, and none is available here. The estimate is made on finite partial sums only, and every finite partial sum of the doubly-indexed family is compared with a sum over a finite rectangle, which is a finite rearrangement. The theory of rearranging infinite series is not in the reading order at this point, and the proof is arranged so as not to need it.
-
The bound is on the total length, not on the number of intervals. The combined cover is countable even when each is covered by infinitely many intervals, which is exactly what supplies. Nothing analogous holds for content zero: a countable union of sets of content zero need not have content zero, since is such a union ( has measure zero and not content zero, although it is bounded ↗).
-
This is where the two smallness notions of the page separate cleanly. A countable union of null sets is null, whereas a countable union of nowhere dense sets is meager and, by Baire category in , by nested intervals with canonically chosen rational endpoints: a countable intersection of dense open sets is dense, so is not a countable union of nowhere dense sets, never all of ; and yet is the union of a meager set and a null set ( is the union of a meager set and a set of measure zero, so smallness of category and smallness of measure are independent notions ↗).
A set of content zero has measure zero
Statement
If has content zero (Measure zero (a countable cover by intervals of total length below every ) and content zero (a finite such cover)) then has measure zero.
The converse is false in general, and true for compact sets (For a compact subset of , measure zero and content zero coincide); the witness for its failure is named in the remarks below.
Facts & Assumptions
Given: A set of content zero and a real .
has content zero when for every real there are and reals with and ; is null when for every real there are sequences with the analogous properties and for every (Measure zero (a countable cover by intervals of total length below every ) and content zero (a finite such cover)).
is an interval of length , and has length for (Intervals of : the nine order-convex forms, nondegeneracy, and length).
Finite sums: for , a sum of nonnegative terms is nonnegative and is monotone in the number of nonnegative terms adjoined, and whenever and the terms are nonnegative (Finite sums and finite products, by recursion, Laws of finite sums and finite products, Series, partial sums, convergence and the sum, divergence, and the tail series).
Ordered-field arithmetic: adding a nonnegative quantity does not decrease a value, and the order is transitive (Order is preserved by adding a constant and by adding inequalities, Ordered field, Complete ordered field (least-upper-bound property)). These order-arithmetic facts are stated by their sources for the strict order only; the nonstrict forms used below follow by adjoining the equality case, in which the two sides coincide.
Proof
Let the real be given; since has content zero, [L1] supplies and reals with and .
Extend the finite list to sequences by putting and for ; then for every , the added intervals have length by [L2], and .
For every one has : all the terms are nonnegative by [L2], so for the sum is at most by [L3] and step 1.1, and for the sum equals plus a sum of terms all equal to , hence is again at most , by [L3] and [L4].
So for every real there is a sequence of closed intervals covering with every partial total length at most , which by [L1] is exactly the statement that has measure zero.
Remarks
-
All that is used is that a finite list can be padded. The definition of measure zero asks for a sequence, and a finite family becomes one at the cost of degenerate intervals, which are intervals of length (Intervals of : the nine order-convex forms, nondegeneracy, and length). No estimate is involved and no completeness of is used.
-
The implication is strict. is null and bounded and does not have content zero (FALSE: every set of measure zero has content zero, has measure zero and not content zero, although it is bounded ↗), so the two notions are genuinely different even for bounded sets. What closes the gap is compactness, not boundedness (For a compact subset of , measure zero and content zero coincide).
For a compact subset of , measure zero and content zero coincide
Statement
Let be compact (Open cover, subcover, compact subset of (every open cover has a finite subcover), and sequentially compact subset), equivalently closed and bounded (A subset of is compact if and only if it is closed and bounded). Then
The implication from content zero to measure zero is A set of content zero has measure zero and needs no hypothesis on . The other direction is the one that uses compactness, and it uses it exactly as A sequence of intervals covering has total length at least , so no interval of positive length has measure zero does: a countable cover is enlarged to an open cover at an arbitrarily small cost in total length, and compactness reduces the open cover to a finite one.
Facts & Assumptions
Given: A compact set and a real . Throughout, .
is null when for every real there are sequences , with , and for every ; has content zero when the same holds with a finite list (Measure zero (a countable cover by intervals of total length below every ) and content zero (a finite such cover)).
A set of content zero is null (A set of content zero has measure zero).
has length for ; is the open interval with the same endpoints and is contained in (Intervals of : the nine order-convex forms, nondegeneracy, and length).
is compact: from every family of open sets whose union contains , either and the empty subfamily covers it, or there are and members of the family whose union contains ; compactness is equivalent to being closed and bounded (Open cover, subcover, compact subset of (every open cover has a finite subcover), and sequentially compact subset, A subset of is compact if and only if it is closed and bounded).
Powers and the geometric series: , , , and for ; a series of nonnegative terms has all its partial sums at most its sum (Integer powers , For , , and for the series diverges, Series, partial sums, convergence and the sum, divergence, and the tail series, A series of nonnegative terms converges iff its partial sums are bounded, and then the sum is their supremum).
Finite sums: additivity, scaling, splitting and monotonicity in the terms (Finite sums and finite products, by recursion, Laws of finite sums and finite products).
Every finite list of naturals has an upper bound in , by induction on its length and the totality of the order of (The principle of mathematical induction, Trichotomy of the order on , Order on the natural numbers).
Ordered-field arithmetic: , so , , and for ; adding a constant and multiplying by a positive preserve an inequality (The multiplicative identity is positive, Order is preserved by adding a constant and by adding inequalities, Sign rules for products and monotonicity of multiplication, Ordered field, Complete ordered field (least-upper-bound property)). These order-arithmetic facts are stated by their sources for the strict order only; the nonstrict forms used below follow by adjoining the equality case, in which the two sides coincide.
Proof
One direction is immediate: if has content zero then is null by [L2], with no hypothesis on used. It remains to prove the converse for compact .
If , then for every real the single interval covers and has total length , so has content zero by [L1]. Hence suppose for the rest of the proof.
Assume is null and let the real be given. By [L1] applied with fix sequences , with , and for every .
Put , a positive real by [L6] and [L9], and , an open set by [L4] containing by [L3] and [L9]. Hence is a family of open sets whose union contains , and the closed interval has length by [L3] and [L9].
By [L5] there are and members of that family covering , and by [L8] there is with for every ; then by [L3].
The total length of that finite list is , by [L7], step 2.1, [L6] and [L9].
So for every real the finite list of step 4.1 covers with total length at most , which by [L1] is exactly the statement that has content zero; together with step 1.1 the two notions coincide on compact sets.
Remarks
-
Compactness, not boundedness, is what does the work. is bounded and null and does not have content zero ( has measure zero and not content zero, although it is bounded ↗); it fails to be closed, and the finite subcover step is exactly what it cannot supply.
-
The theorem is what makes content zero usable at all. Every set to which content zero is applied on this page is compact: the Cantor set (The Cantor set is compact, perfect, uncountable, nowhere dense and of measure zero, and it contains no interval of positive length, so its only nonempty connected subsets are single points) and the Smith-Volterra-Cantor set (The Smith-Volterra-Cantor set: the same construction removing, at stage , an open middle interval of length from each of the remaining intervals) are both closed and bounded, so for them the two notions may be used interchangeably, and the finite form is the one that combines with If finitely many intervals cover a closed bounded interval , the sum of their lengths is at least .
-
The cost of opening up the cover is , chosen in advance. Splitting the budget in half before the enlargement, rather than after, is what keeps the final total at exactly; the same bookkeeping appears in A sequence of intervals covering has total length at least , so no interval of positive length has measure zero and in A countable union of measure-zero sets has measure zero, by countable choice.
The Cantor middle-thirds set as the intersection of the sets obtained by removing open middle thirds
Definition
For write
and let be
By the recursion theorem (The recursion theorem), applied to the set , the starting element (Intervals of : the nine order-convex forms, nondegeneracy, and length) and the function , there is a unique family of subsets of with
The Cantor middle-thirds set is
The first step really is the removal of the open middle third. Directly from the clauses,
the middle equality because is an order isomorphism of onto itself with inverse (Ordered field, Sign rules for products and monotonicity of multiplication), and the last because splits, by totality of the order, into , and . The recursion then performs the same operation inside each of the two scaled copies, which is what "removing the open middle thirds" names.
Every lies in , by induction on (The principle of mathematical induction): ; and if then and , so (Order is preserved by adding a constant and by adding inequalities, Sign rules for products and monotonicity of multiplication). The same computation shows that the two halves of are disjoint, the first lying in and the second in , and (The multiplicative identity is positive).
The family is nested, for every , again by induction. For this is . And is monotone, in the sense that implies , directly from the displayed description of ; so gives . Consequently for every , and .
Powers. Here means , the integer power of Integer powers , so that , and for every (Laws of integer exponents, Complete ordered field (least-upper-bound property)).
Remarks
-
Why the self-similar recursion rather than a description by digits. The clause is a single application of The recursion theorem to one explicitly given function on , so nothing is selected at any stage and no listing of the intervals making up has to be constructed. Every structural property below is then proved by induction on through . The description by ternary digits is a theorem about , not its definition, and it is The Cantor set is exactly the set of with every , and this gives a bijection with .
-
is not empty. for every , by induction: , and gives . Likewise , since gives . So contains at least the two endpoints; that it is in fact uncountable is The Cantor set is compact, perfect, uncountable, nowhere dense and of measure zero, and it contains no interval of positive length, so its only nonempty connected subsets are single points.
-
The construction with a different proportion. Replacing "middle third" by an interval of length removed at stage produces a set that is closed, has empty interior and is not of measure zero (The Smith-Volterra-Cantor set: the same construction removing, at stage , an open middle interval of length from each of the remaining intervals). So none of the qualitative properties of proved on this page is a consequence of its being nowhere dense, and the two constructions are kept apart deliberately.
The Cantor set is exactly the set of with every , and this gives a bijection with
Statement
Let be the set of sequences (Sequences of reals: bounded, eventually, frequently, tails, subsequences), the two values being the real numbers and . For the series converges (Series, partial sums, convergence and the sum, divergence, and the tail series); write
Then, with and as in The Cantor middle-thirds set as the intersection of the sets obtained by removing open middle thirds:
- for every , and ;
- is injective, so is a bijection from onto (Injection, surjection, bijection);
- consequently is a bijection from , the set of sequences with values in , onto ;
- , and the two sets on the right are disjoint.
On the indexing. The digit carries the weight , so the series starts at with the term ; written with the classical -based index it reads , which is the form in the title. Sequences in this library are functions on and contains (Sequences of reals: bounded, eventually, frequently, tails, subsequences), so the -based form is the one used throughout the proof.
Facts & Assumptions
Given: The sets and of The Cantor middle-thirds set as the intersection of the sets obtained by removing open middle thirds, the set of sequences with values in , and for the shifted sequence defined by , which again lies in .
The Cantor set: , , , every , the two halves of lie in and in respectively and are disjoint, and denotes (The Cantor middle-thirds set as the intersection of the sets obtained by removing open middle thirds, Intervals of : the nine order-convex forms, nondegeneracy, and length).
Series: partial sums , convergence of , the sum as its limit, the tail clause and the identity (Series, partial sums, convergence and the sum, divergence, and the tail series, Sequences of reals: bounded, eventually, frequently, tails, subsequences).
A series of nonnegative terms converges exactly when its partial sums are bounded above, its sum is then their supremum, every partial sum is at most the sum, and a convergent series of nonnegative terms has sum (A series of nonnegative terms converges iff its partial sums are bounded, and then the sum is their supremum).
Convergent series add and scale termwise (Convergent series add and scale termwise).
Recursion and induction on (The recursion theorem, The principle of mathematical induction).
Every nonempty subset of has a least element (The well-ordering principle).
(For the sequence is null, and for the sequence diverges to ); convergence is tested against rational and a convergent sequence has exactly one limit (Limits and Cauchy sequences of reals, A sequence has at most one limit); and for (Basic properties of the absolute value).
Ordered-field arithmetic: , so and and , and ; adding a constant and multiplying by a positive preserve an inequality; the order is total and transitive (The multiplicative identity is positive, Order is preserved by adding a constant and by adding inequalities, Sign rules for products and monotonicity of multiplication, Ordered field, Complete ordered field (least-upper-bound property)). These order-arithmetic facts are stated by their sources for the strict order only; the nonstrict forms used below follow by adjoining the equality case, in which the two sides coincide.
Proof
is well defined and takes values in . For every term is by [L1] and [L9], and for every the partial sum satisfies , by [L3], [L4] and [L9]. So by [L3] the series converges, its sum satisfies , and by [L1].
Shift identity: for every . Indeed by [L2] the partial sums satisfy , using from [L1] and [L9]; letting grow and using [L5] and [L2] gives the identity.
Self-similarity of , claim 4. If then for every , so and for every , whence both lie in by [L1]; this gives the inclusion . Conversely let , so for every . By [L1] the first half of lies in and the second in , and by [L9]. If then , so for every one has , that is ; hence and . If then , so for every one has , that is ; hence and . Disjointness is [L1] and [L9], since and .
for every . By induction on ([L6]) the statement "for every , " holds for every : at it is step 1.1 and [L1]; and if it holds at , then for the value is or , so step 1.2 gives in the first case and in the second, so by [L1]. Hence .
The digit recursion. Fix and let be for and for , a definition by cases on the total order ([L9]) and so a genuine function. By [L6] there is with and ; put when and otherwise, so that and for every . Every lies in , by induction on : ; and if then, by step 1.3, either or , and these two cases are exactly and by [L9]; in the first with and , in the second with and .
is injective. Let with ; the set of with is a nonempty subset of , so by [L7] it has a least element , and by symmetry we may take and . By [L5], , and the terms with vanish, so by [L2] this equals with . Every is at least , so the series has nonnegative terms and hence nonnegative sum by [L3], giving by [L2], [L4], [L5] and [L9]. Therefore and .
The value is recovered from the digits. With , and as in step 2.2, put . Then for every , by induction on ([L6]): at both sides are , since by [L2] and ; and if then , using [L1], [L2] and [L9].
Hence , so . Every lies in by step 2.2 and [L1], so by step 3.1 and [L9]. Given a rational , [L8] supplies with for all , and then by [L8]; so . But by [L2], since is the sequence of partial sums of the series defining , and limits are unique by [L8]; therefore with .
By steps 2.1 and 4.1 the image of under is exactly , which with step 1.1 is claim 1; step 2.3 is claim 2, so is a surjection from onto that is injective, that is, a bijection (Injection, surjection, bijection); the map is a bijection from onto , with inverse by [L9], and a composition of bijections is a bijection, which is claim 3; and step 1.3 is claim 4.
Remarks
-
The endpoints are the digit sequences that are eventually constant. For instance , , and , the first two by For , , and for the series diverges and the last two by the shift identity of step 1.2. That the eventually constant sequences do not exhaust is the content of lies in the Cantor set and is the endpoint of no removed interval, so the endpoints do not exhaust it ↗, where is computed to be .
-
No digit is ever , and that is the whole point. A real of with a ternary expansion using the digit at some place and not representable without it lies in one of the removed middle thirds. The theorem does not assert that every real has a ternary expansion, and it does not need to: the map is constructed from the digits, and the converse direction extracts digits from a point of by the canonical recursion of step 2.2, never by invoking a general expansion theorem.
-
Where the choice-freeness lies. The digit extraction is a definition by cases on a total order fed to The recursion theorem, so the whole passage from a point of to its digit sequence is a single function, not a sequence of selections. The same discipline governs Every nonempty perfect subset of is uncountable and Baire category in , by nested intervals with canonically chosen rational endpoints: a countable intersection of dense open sets is dense, so is not a countable union of nowhere dense sets.
-
Claim 3 is what makes uncountable. is in bijection with the power set of , which is uncountable by Cantor's theorem: ; that route and the perfect-set route are both recorded in The Cantor set is compact, perfect, uncountable, nowhere dense and of measure zero, and it contains no interval of positive length, so its only nonempty connected subsets are single points.
The Cantor set is compact, perfect, uncountable, nowhere dense and of measure zero, and it contains no interval of positive length, so its only nonempty connected subsets are single points
Statement
Let be the Cantor set (The Cantor middle-thirds set as the intersection of the sets obtained by removing open middle thirds). Then:
- is closed and bounded, hence compact (A subset of is compact if and only if it is closed and bounded, Open cover, subcover, compact subset of (every open cover has a finite subcover), and sequentially compact subset);
- has content zero, and therefore measure zero (Measure zero (a countable cover by intervals of total length below every ) and content zero (a finite such cover));
- is perfect (Perfect subset of : closed with no isolated points);
- is uncountable (Finite, countably infinite, countable, uncountable);
- contains no interval with two distinct endpoints, and is nowhere dense (Nowhere dense, meager (first category), residual, and second category subsets of );
- every nonempty connected subset of (Separated sets, disconnection, and connected subset of ) is a single point.
Claim 6 is what the phrase "totally disconnected" names elsewhere; that phrase is not used here, because no definition of total disconnectedness exists at this point in the reading order. What is proved is exactly the displayed statement, and it is obtained from claim 5 through A subset of is connected if and only if it is order-convex, that is, an interval.
Facts & Assumptions
Given: The sets and of The Cantor middle-thirds set as the intersection of the sets obtained by removing open middle thirds, and the map and the set of -valued sequences of The Cantor set is exactly the set of with every , and this gives a bijection with .
is a bijection from onto , , and convergent series add and scale termwise (The Cantor set is exactly the set of with every , and this gives a bijection with , Convergent series add and scale termwise, Series, partial sums, convergence and the sum, divergence, and the tail series).
is a closed set and a bounded interval, is open, , and every open set contains a neighbourhood of each of its points (Intervals of : the nine order-convex forms, nondegeneracy, and length, Open subset of (every point has a neighbourhood inside it), closed subset (complement open), and clopen, The -neighbourhood and the punctured -neighbourhood of a point of ).
Finite unions of closed sets are closed, and an intersection of a nonempty family of closed sets is closed (Arbitrary unions and finite intersections of open subsets of are open, and dually for closed sets).
A subset of is compact exactly when it is closed and bounded (A subset of is compact if and only if it is closed and bounded, Open cover, subcover, compact subset of (every open cover has a finite subcover), and sequentially compact subset).
Content zero and measure zero as in Measure zero (a countable cover by intervals of total length below every ) and content zero (a finite such cover); a set of content zero is null (A set of content zero has measure zero); no null set contains an interval with (A sequence of intervals covering has total length at least , so no interval of positive length has measure zero).
is perfect when it is closed and no point of it is isolated in it (Perfect subset of : closed with no isolated points, Limit point, isolated point, adherent point, derived set, and dense subset of ); every nonempty perfect subset of is uncountable (Every nonempty perfect subset of is uncountable, Finite, countably infinite, countable, uncountable).
A set is nowhere dense exactly when the interior of its closure is empty, and a closed set equals its closure (Nowhere dense, meager (first category), residual, and second category subsets of , Interior, closure, boundary and exterior of a subset of , The closure equals the set together with its limit points, equals the set of points every neighbourhood of which meets it, and is the smallest closed superset; a set is closed iff it contains its limit points).
A subset of is connected exactly when it is order-convex (A subset of is connected if and only if it is order-convex, that is, an interval, Separated sets, disconnection, and connected subset of , Intervals of : the nine order-convex forms, nondegeneracy, and length).
for (For the sequence is null, and for the sequence diverges to ); convergence to is tested against rational (Limits and Cauchy sequences of reals); , for , and (Basic properties of the absolute value).
Induction on (The principle of mathematical induction); finite sums split, scale and are monotone in their terms (Finite sums and finite products, by recursion, Laws of finite sums and finite products).
Ordered-field arithmetic: , so , , and ; adding a constant and multiplying by a positive preserve an inequality; the order is total and transitive (The multiplicative identity is positive, Order is preserved by adding a constant and by adding inequalities, Sign rules for products and monotonicity of multiplication, Ordered field, Complete ordered field (least-upper-bound property)). These order-arithmetic facts are stated by their sources for the strict order only; the nonstrict forms used below follow by adjoining the equality case, in which the two sides coincide.
Proof
is compact, claim 1. First, for and the set is closed whenever is: if then , so by [L3] there is a real with , and every with satisfies by [L10] and [L12], hence and . Now every is closed, by induction on ([L11]): is closed by [L3], and is the union of the two closed sets and , hence closed by [L4]. So is closed by [L4], and is bounded by [L1] and [L3]; by [L5] it is compact.
has content zero and measure zero, claim 2. By induction on ([L11]) the following holds for every : there are and reals with and . At take the single interval , of total length by [L1]. Given such a list at , define intervals by for and for ; they cover and respectively, hence cover , and their total length is by [L11] and [L12]. Since by [L12], [L10] gives, for every real , an with ; as by [L1], the corresponding finite list covers with total length at most . So has content zero by [L6], and hence measure zero by [L6].
is perfect, claim 3. is closed by step 1.1. Let and let the real be given. By [L2] write with . By [L10] and [L12] fix with , and define by for and , so and . Then and by [L2], while by [L2], all other terms being , so by [L10]. Thus contains a point of other than , for every , so is not isolated in ; by [L7] is perfect.
contains no nondegenerate interval and is nowhere dense, claim 5. By step 1.2 the set is null, so by [L6] it contains no with ; in particular it contains no interval of any of the four bounded forms with distinct endpoints, since such an interval contains a closed one with distinct endpoints by [L6] and [L12]. Its interior is therefore empty: if for some real , then by [L3] and [L12], an interval with distinct endpoints. Since is closed by step 1.1, it equals its closure, so [L8] gives that is nowhere dense.
is uncountable, claim 4. is nonempty, since by [L1], and perfect by step 2.1, so [L7] applies.
Connected subsets, claim 6. Let be connected and nonempty. By [L9] is order-convex, so if with then , contradicting step 2.2. Hence no two distinct elements of exist, and , being nonempty, is a single point.
Claims 1 to 6 are steps 1.1, 1.2, 2.1, 3.1, 2.2 and 3.2 respectively, so all six hold.
Remarks
-
Two independent proofs of uncountability. The route above is Every nonempty perfect subset of is uncountable applied to a nonempty perfect set. The other is claim 3 of The Cantor set is exactly the set of with every , and this gives a bijection with : is in bijection with , which is in bijection with the power set of , uncountable by Cantor's theorem: . The two arguments share nothing, and the second is the one that makes the size of evident: is in bijection with the power set of , while having content zero. It is deliberately not said here that has as many points as . That would require a bijection between and the power set of , and no such bijection is constructed anywhere at this point in the reading order; the two uncountability results available here are separate facts, one proved by the diagonal argument on power sets and one by nested intervals.
-
Claim 2 and claim 4 together are the point of the whole construction. A set of measure zero may be uncountable, so nullity is not a cardinality condition; and a nowhere dense set need not be null, so it is not a category condition either (FALSE: every nowhere dense subset of has measure zero, The Smith-Volterra-Cantor set is compact, perfect and nowhere dense, and does not have measure zero).
-
Why claim 5 is proved through measure and not by inspection. The intervals making up have length , and one can see directly that a long interval cannot fit inside . Doing that rigorously means keeping track of the component intervals of and their gaps; going through A sequence of intervals covering has total length at least , so no interval of positive length has measure zero uses the estimate already made in step 1.2 and needs no such bookkeeping.
-
Every point of is a limit of other points of , and the witnesses are explicit: change one ternary digit far out, as step 2.1 does. This is also what shows has no isolated points without any appeal to the structure of its complement.
The Smith-Volterra-Cantor set: the same construction removing, at stage , an open middle interval of length from each of the remaining intervals
Definition
The lengths. By the recursion theorem in the index-carrying form used by Finite sums and finite products, by recursion (The recursion theorem, applied to with starting element and the map ) there is a unique sequence of reals with
powers being those of Integer powers . Put .
The left endpoints. Let be the set of pairs with , , and a function from to ; such a pair is a finite list of reals of length . Applying The recursion theorem to , the starting element with , and the map that sends to where
gives a unique family of finite lists, with , , and the concatenation of with its translate by . Write .
The sets. For put
the intervals being those of Intervals of : the nine order-convex forms, nondegeneracy, and length. is the Smith-Volterra-Cantor set, also called the fat Cantor set.
Counting. For every and every real one has , by induction on (The principle of mathematical induction): at both sides are ; and , by the splitting law (Laws of finite sums and finite products, Finite sums and finite products, by recursion) and (Integer powers , Ordered field). So stage has " intervals" in exactly this sense, and no separate arithmetic of natural-number exponents is needed.
The lengths are positive and shrink. By induction on : and . Indeed by Laws of integer exponents, so by induction , using (For , , and for the series diverges, A series of nonnegative terms converges iff its partial sums are bounded, and then the sum is their supremum, Series, partial sums, convergence and the sum, divergence, and the tail series). Hence ; and gives by a second induction, so the lengths tend to .
Each stage removes an open middle interval of length . From the recursion, the two sub-intervals of retained at stage are and , so what is dropped from that piece is the open interval
In particular , so is nonempty, and , so . Counting from as in the title: at stage an open interval of length is removed from each of the intervals then present.
The family is nested and lies in . Each retained sub-interval is contained in the piece it came from, by the previous paragraph, so ; and since , and . Hence for every .
Remarks
-
What is different from The Cantor middle-thirds set as the intersection of the sets obtained by removing open middle thirds. There the removed middle is a fixed proportion of each piece, so the construction is self-similar and the total removed length is . Here the removed middle has a fixed length , chosen to shrink faster than the pieces multiply, and the total removed length is only . Everything topological survives the change: the set is still compact, perfect and nowhere dense (The Smith-Volterra-Cantor set is compact, perfect and nowhere dense, and does not have measure zero). Everything metric fails: is not of measure zero.
-
Why the construction is written with explicit lists. The set is a union of intervals, and both the estimate of the removed length and the finite covers used later need those intervals as a list, indexed by naturals below . Building the list by recursion, rather than asserting its existence at each stage, is also what keeps the construction free of any choice: is a single function of .
-
The name. The set was described by Smith in 1875, by Volterra in 1881 and by Cantor in 1883; "fat Cantor set" is the informal name, and the two names are used interchangeably below.
-
and belong to . Both are instances of the general fact that every and every lies in , proved where it is used, in The Smith-Volterra-Cantor set is compact, perfect and nowhere dense, and does not have measure zero: take and , where and .
The Smith-Volterra-Cantor set is compact, perfect and nowhere dense, and does not have measure zero
Statement
Let be the Smith-Volterra-Cantor set (The Smith-Volterra-Cantor set: the same construction removing, at stage , an open middle interval of length from each of the remaining intervals). Then:
- is closed and bounded, hence compact (A subset of is compact if and only if it is closed and bounded);
- is perfect (Perfect subset of : closed with no isolated points);
- is nowhere dense (Nowhere dense, meager (first category), residual, and second category subsets of );
- if and are sequences of reals with , and for every , then .
In particular does not have measure zero (Measure zero (a countable cover by intervals of total length below every ) and content zero (a finite such cover)): no cover of by intervals has total length below , let alone below every positive .
Claim 4 is the quantitative form, and it is what claim 4 of the title asserts in the only vocabulary available here. This library defines no outer measure, so "the measure of is " is not a statement it can make; what it can state, and what is proved below, is that is a lower bound for the total length of every interval cover of .
Facts & Assumptions
Given: The lengths , the gaps , the finite lists with entries , and the sets , of The Smith-Volterra-Cantor set: the same construction removing, at stage , an open middle interval of length from each of the remaining intervals. For and write for the open interval removed from the -th piece at stage .
The negation of claim 4: sequences , with , , all partial sums , and .
The construction: , , , , for and for ; ; ; ; ; ; and for every real (The Smith-Volterra-Cantor set: the same construction removing, at stage , an open middle interval of length from each of the remaining intervals, Intervals of : the nine order-convex forms, nondegeneracy, and length, Integer powers , Laws of integer exponents).
is a closed set, is open, , a closed bounded interval is bounded, finite unions of closed sets are closed and an intersection of a nonempty family of closed sets is closed (Intervals of : the nine order-convex forms, nondegeneracy, and length, Open subset of (every point has a neighbourhood inside it), closed subset (complement open), and clopen, The -neighbourhood and the punctured -neighbourhood of a point of , Lower bound, bounded below, bounded set, Arbitrary unions and finite intersections of open subsets of are open, and dually for closed sets).
A subset of is compact exactly when it is closed and bounded (A subset of is compact if and only if it is closed and bounded, Open cover, subcover, compact subset of (every open cover has a finite subcover), and sequentially compact subset).
Perfect means closed with no isolated point; nowhere dense means the interior of the closure is empty, and a closed set equals its closure (Perfect subset of : closed with no isolated points, Limit point, isolated point, adherent point, derived set, and dense subset of , Nowhere dense, meager (first category), residual, and second category subsets of , Interior, closure, boundary and exterior of a subset of , The closure equals the set together with its limit points, equals the set of points every neighbourhood of which meets it, and is the smallest closed superset; a set is closed iff it contains its limit points).
If with , and for every , then (A sequence of intervals covering has total length at least , so no interval of positive length has measure zero).
There is a bijection (, Injection, surjection, bijection).
Finite sums: splitting, scaling, monotonicity in the terms; a finite sum of nonnegative terms indexed injectively inside a finite rectangle is at most the sum over the rectangle (Finite sums and finite products, by recursion, Laws of finite sums and finite products).
, every partial sum of a nonnegative series is at most its sum, and (For , , and for the series diverges, A series of nonnegative terms converges iff its partial sums are bounded, and then the sum is their supremum, Series, partial sums, convergence and the sum, divergence, and the tail series, For the sequence is null, and for the sequence diverges to , Limits and Cauchy sequences of reals).
Induction on ; every nonempty subset of has a least element; every finite list of naturals has an upper bound in , the order of being total (The principle of mathematical induction, The well-ordering principle, Trichotomy of the order on , Order on the natural numbers).
Ordered-field arithmetic: , so and and ; adding a constant and multiplying by a positive preserve an inequality; the order is total and transitive (The multiplicative identity is positive, Order is preserved by adding a constant and by adding inequalities, Sign rules for products and monotonicity of multiplication, Ordered field, Complete ordered field (least-upper-bound property)). These order-arithmetic facts are stated by their sources for the strict order only; the nonstrict forms used below follow by adjoining the equality case, in which the two sides coincide.
Proof
Suppose, for contradiction, that claim 4 fails, and fix , and as in [A1], so that .
is compact, claim 1. Each is the union of the finite list of closed sets , , hence closed by [L2]; so is closed by [L2], and is bounded by [L1] and [L2]; by [L3] it is compact.
Separation. For every and all below one has , by induction on ([L9]). At there is nothing to prove, since . Assume it at and let below . If both indices are , or both are , the two entries are and with , possibly both shifted by the same , so the difference has absolute value by [L1]. Otherwise the entries are and ; if the difference is by [L1]; if then , and if then , in each case by [L1] and [L10]. Consequently the pieces , , are pairwise disjoint.
Every endpoint lies in . Fix and . For one has and in by [L1]. For , an induction on ([L9]) gives indices with and : at take ; and if they exist at , then works for the left endpoint, while works for the right one, by [L1]. So both points lie in every , hence in .
The complement decomposes over the stages. . The inclusion holds because and by [L1]. For , let ; then and, being , the set of with is nonempty, so by [L9] it has a least element , and since . Put ; then by minimality and .
The removed pieces. Fix and . By [L1] the pieces and both occur among the pieces of , so a point of outside satisfies , that is ; hence . Conversely : a piece of coming from lies in , which is disjoint from by step 1.3, while the two pieces coming from itself are disjoint from the open interval by [L10]. Finally each has length , so by [L1].
is perfect, claim 2. is closed by step 1.2. Let and let the real be given; by [L1] and [L8] fix with . Since there is with ; the two endpoints of that piece lie in by step 1.4, are distinct because , and each is within of by [L10]. So at least one of them is a point of different from , and is not isolated in ; by [L4], is perfect.
is nowhere dense, claim 3. is closed by step 1.2, so it equals its closure, and by [L4] it suffices that its interior be empty. Suppose for some and some real ; fix with by [L1] and [L8], and with . The point lies in , since , and hence in , so and ; but by step 2.1, which is impossible. So no neighbourhood is contained in and is nowhere dense.
A cover of built from [A1] and the removed pieces. By [L6] fix a bijection and define sequences , as follows: for write ; if put ; if and put ; and otherwise put . Then for every by [L1], and contains by [A1] and contains by steps 1.5 and 2.1, hence contains . For a partial sum, fix ; the pairs with are distinct, so by [L9] there is bounding both of their coordinates, and since all the terms are nonnegative [L7] gives , using [A1], step 2.1, [L7] and [L8].
By [L5] applied to and the cover of step 3.2, , so , contradicting step 1.1. Claim 4 therefore holds; and is not null, since nullity would give, at , a cover of with all partial total lengths , which claim 4 forbids. With steps 1.2, 2.2 and 3.1 all four claims are proved.
Remarks
-
Nowhere dense and null are independent. is nowhere dense and not null; is null and not nowhere dense (Every at most countable subset of has measure zero, Both and are dense in , and every nonempty open subset of is uncountable). The two false statements recording this are FALSE: every nowhere dense subset of has measure zero and FALSE: every subset of of measure zero is nowhere dense, with witnesses The Smith-Volterra-Cantor set is nowhere dense and does not have measure zero ↗ and is dense in and has measure zero ↗.
-
Where the construction differs from the Cantor set, and where it does not. Steps 1.2, 1.3, 1.4, 2.2 and 3.1 use only that the pieces shrink to in length, double in number and stay separated, which the middle-thirds construction also satisfies; so and are indistinguishable at that level. The difference is entirely in step 2.1: the removed length at stage is here and there, and only the first is summable to less than . The removed lengths are added up in The intervals removed from the Smith-Volterra-Cantor set have total length , so the set cannot be covered by intervals of total length less than ↗, where they total exactly .
-
Compactness is not what is used against nullity. The proof of claim 4 never extracts a finite subcover: it combines the given countable cover of with the countably many removed pieces and appeals to A sequence of intervals covering has total length at least , so no interval of positive length has measure zero, whose own proof is where the compactness of is spent. Passing through For a compact subset of , measure zero and content zero coincide would work too and would be longer.
The Cantor function on , defined on the Cantor set through ternary digits and extended constantly across each removed interval
Definition
Let be the Cantor set, the set of sequences with values in and the bijection of The Cantor set is exactly the set of with every , and this gives a bijection with . Since is a bijection it has a two-sided inverse , and that inverse is a single function, determined and not selected (Injection, surjection, bijection).
On the Cantor set. For write and put
Each coefficient is or , so all the terms are nonnegative and every partial sum is at most (For , , and for the series diverges, Integer powers , Laws of integer exponents); hence the series converges and (A series of nonnegative terms converges iff its partial sums are bounded, and then the sum is their supremum, Series, partial sums, convergence and the sum, divergence, and the tail series, Intervals of : the nine order-convex forms, nondegeneracy, and length). In words: halves each ternary digit of and reads the result as a binary expansion.
On all of . The Cantor function is ,
The supremum exists and is a single real number. The set on the right is nonempty, because (The Cantor middle-thirds set as the intersection of the sets obtained by removing open middle thirds) and , and it is bounded above by , because takes values in ; so it has a least upper bound by completeness (Complete ordered field (least-upper-bound property), Lower bound, bounded below, bounded set), and that bound is unique (Suprema and infima are unique). Since , the values of lie in .
That really extends , that is, for every
, is not an observation but a small theorem: it needs to be
nondecreasing along . It is claim 1 of The Cantor function is well defined, satisfies whenever , is surjective onto , and is constant on every interval removed from the Cantor set ↗,
recorded in this item's justified_by, and until it is proved the two symbols
are kept apart.
Remarks
-
Why the extension is a supremum and not a case distinction. Writing " is constant across each interval removed in the construction of " presupposes a description of those intervals; the supremum formula presupposes nothing, is defined at every point of at once, and yields the constancy as a theorem (claim 4 of The Cantor function is well defined, satisfies whenever , is surjective onto , and is constant on every interval removed from the Cantor set ↗). It also makes the monotonicity of immediate, since the set whose supremum is taken grows with .
-
Nothing is claimed here about continuity. No definition of continuity for a real function of a real variable is available at this point in the reading order, so no statement about it is made, in either direction; the properties proved on this page are well-definedness, monotonicity in the sense for , surjectivity onto and constancy across the gaps of .
-
The name. The function is also called the devil's staircase, because it climbs from to while being constant across every gap of , and the gaps fill up all of except a set of measure zero (The Cantor set is compact, perfect, uncountable, nowhere dense and of measure zero, and it contains no interval of positive length, so its only nonempty connected subsets are single points).
-
The digits are halved, not truncated. sends the ternary digit sequence with values in to the binary sequence with values in , which is the bijection of claim 3 of The Cantor set is exactly the set of with every , and this gives a bijection with read backwards. So is the composition of with that bijection and with the binary summation, and its surjectivity onto is exactly the statement that every real of has a binary expansion, proved where it is used.
The Cantor function is well defined, satisfies whenever , is surjective onto , and is constant on every interval removed from the Cantor set
Statement
Let be the Cantor set, and as in The Cantor function on , defined on the Cantor set through ternary digits and extended constantly across each removed interval. Then:
- is well defined with values in , and for every , so extends ;
- whenever ;
- is surjective onto (Injection, surjection, bijection), and , ;
- is constant on whenever , and ; and every lies in the open interval of such a pair, so is constant on a whole neighbourhood of every point of outside .
Claim 2 is what "monotone" names for a function; that word is not used here, because Nondecreasing, increasing, nonincreasing, decreasing, monotone, and eventually monotone sequences is about sequences and no definition of a monotone function is available at this point in the reading order. Claim 4 is what "constant on every interval removed in the construction" means: the removed intervals are gaps of in the sense of claim 4, as illustrates. No claim whatever is made here about continuity, for which no definition is available at this point in the reading order.
Facts & Assumptions
Given: The Cantor set , the set of -valued sequences, the bijection , and the functions and of The Cantor function on , defined on the Cantor set through ternary digits and extended constantly across each removed interval. For write for its digit sequence.
is a bijection from onto , with two-sided inverse ; for , with values in ; , the supremum of a nonempty set bounded above by and containing (The Cantor set is exactly the set of with every , and this gives a bijection with , The Cantor function on , defined on the Cantor set through ternary digits and extended constantly across each removed interval, Injection, surjection, bijection, Complete ordered field (least-upper-bound property), Lower bound, bounded below, bounded set, Suprema and infima are unique).
for , so and ; convergent series add and scale termwise; a series of nonnegative terms has nonnegative sum and all partial sums at most the sum (For , , and for the series diverges, Convergent series add and scale termwise, A series of nonnegative terms converges iff its partial sums are bounded, and then the sum is their supremum, Series, partial sums, convergence and the sum, divergence, and the tail series, Integer powers , Laws of integer exponents).
is closed and ; is the set of points every neighbourhood of which meets , and a closed set equals its closure (The Cantor set is compact, perfect, uncountable, nowhere dense and of measure zero, and it contains no interval of positive length, so its only nonempty connected subsets are single points, The Cantor middle-thirds set as the intersection of the sets obtained by removing open middle thirds, Open subset of (every point has a neighbourhood inside it), closed subset (complement open), and clopen, The closure equals the set together with its limit points, equals the set of points every neighbourhood of which meets it, and is the smallest closed superset; a set is closed iff it contains its limit points, Interior, closure, boundary and exterior of a subset of , The -neighbourhood and the punctured -neighbourhood of a point of ).
Suprema: exactly when is an upper bound and for every some has ; infima exist for nonempty sets bounded below, and exactly when is a lower bound and for every some has ; both are unique; a supremum is monotone in the set, since an upper bound of a larger set bounds a smaller one (Epsilon characterisation of the supremum, Epsilon characterisation of the infimum, Every nonempty set bounded below has an infimum, Greatest lower bound (infimum), Suprema and infima are unique, Complete ordered field (least-upper-bound property), Lower bound, bounded below, bounded set).
Recursion and induction on ; every nonempty subset of has a least element (The recursion theorem, The principle of mathematical induction, The well-ordering principle).
; convergence is tested against rational ; a convergent sequence has exactly one limit; and for (For the sequence is null, and for the sequence diverges to , Limits and Cauchy sequences of reals, A sequence has at most one limit, Sequences of reals: bounded, eventually, frequently, tails, subsequences, Basic properties of the absolute value).
Every nonempty finite set of reals has a minimum (Every nonempty finite set of reals has a maximum and a minimum, Maximum and minimum of a set).
and are the intervals of Intervals of : the nine order-convex forms, nondegeneracy, and length, and (The -neighbourhood and the punctured -neighbourhood of a point of ).
Ordered-field arithmetic: , so , and ; adding a constant and multiplying by a positive preserve an inequality; the order is total and transitive (The multiplicative identity is positive, Order is preserved by adding a constant and by adding inequalities, Sign rules for products and monotonicity of multiplication, Ordered field, Complete ordered field (least-upper-bound property)). These order-arithmetic facts are stated by their sources for the strict order only; the nonstrict forms used below follow by adjoining the equality case, in which the two sides coincide.
Proof
Comparison of two digit sequences. Let in and let be the least index with , which exists by [L5]; suppose and . Then by [L2], the terms with vanish, and the tail satisfies by [L2], since ; hence . The same computation with the halved digits gives with , so . Consequently, for with one has : this is trivial if , and otherwise the least index at which the digit sequences differ must have the digit of equal to , by the first computation applied both ways.
Values at the endpoints. The constant sequence has and ; the constant sequence has and , by [L2]. Both and lie in by [L3].
Claims 1 and 2. For the set is nonempty and bounded above by by [L1], so exists, is unique and lies in by [L1] and [L4]; that is claim 1 apart from the extension property. If then , so by [L4], which is claim 2. And for : , while is an upper bound of by step 1.1, so by [L4].
The two endpoints of a gap carry the same value of . Let with and , and put , , with the least index where they differ; by step 1.1 and we have and . If some had , let agree with except that ; then , by step 1.1, and still differs from first at with , so by step 1.1, putting in , which is empty. Hence for every . Symmetrically, if some had , replacing it by gives with and , again impossible; hence for every . Writing , [L2] now gives and , so .
Claim 4, first half. Let with and , and let . Every with satisfies or : indeed if then and force . In the first case by step 1.1, and in the second by step 2.2. So is an upper bound of and belongs to it, whence by [L4]: is constant on , with the value given by step 2.1.
Claim 3. Let . Let be for and for , a definition by cases on the total order, and by [L5] let satisfy and ; put when and otherwise, so . An induction ([L5]) gives for every , since gives and gives by [L9]; a second induction gives for every , the step being . Hence , so by [L6] the partial sums converge to and . Now lies in , the point lies in by [L1], and ; by step 2.1, . With step 1.2 and step 2.1 this also gives and .
Claim 4, second half. Let . The set is nonempty by [L3] and bounded above by , so exists by [L4]; by [L4] every meets , so by [L3], and with , so . The set is nonempty by [L3], since and , and is bounded below by , so exists by [L4]; likewise and . If satisfied , then would put and force , while would put and force , and one of the two holds by totality of the order ([L9]); so . By step 3.1 the function is constant on , and for by [L7], [L8] and [L9].
Claims 1 and 2 are step 2.1, claim 3 is step 3.2, and claim 4 is steps 3.1 and 4.1 together; so all four hold.
Remarks
-
The gap worked out. and , both in , and (The Cantor middle-thirds set as the intersection of the sets obtained by removing open middle thirds) shows . Step 2.2 gives , so on ; this and three further values are computed in The Cantor function takes the value on all of , and its values at , and ↗.
-
Where each hypothesis is used. Step 1.1 is the only place the ternary comparison is made, and everything else rests on it: monotonicity of comes from monotonicity of the set , and the constancy across gaps comes from step 2.2, which is a statement about digit sequences and not about the topology of .
-
What is deliberately absent. Continuity, differentiability and any statement about the derivative of are outside the vocabulary available at this point in the reading order and none of them is asserted anywhere above. What is proved is that climbs from to , never decreases, misses no value of , and is locally constant off a set of measure zero (The Cantor set is compact, perfect, uncountable, nowhere dense and of measure zero, and it contains no interval of positive length, so its only nonempty connected subsets are single points). That combination is already the paradoxical content of the example.
-
Surjectivity is a binary expansion theorem in disguise. Step 3.2 constructs the binary digits of an arbitrary by the same canonical recursion that The Cantor set is exactly the set of with every , and this gives a bijection with uses for ternary digits, so no general expansion theorem is presupposed and no choice is made.
Why the nested-interval proof of Baire category in needs no choice, while the general complete-metric statement does
Remark
What the proof on this page spends. The proof of Baire category in , by nested intervals with canonically chosen rational endpoints: a countable intersection of dense open sets is dense, so is not a countable union of nowhere dense sets uses exactly four things: the recursion theorem (The recursion theorem), the well-ordering principle for (The well-ordering principle), the nested interval property (A nested sequence of nonempty closed bounded intervals has nonempty intersection, and the intersection is a single point exactly when the lengths tend to ), and one fixed enumeration of the rationals ( is countably infinite, The rationals embed densely in the reals). None of these is a choice principle. The enumeration is a single object, fixed once by one instantiation of an existential statement; the interval used at stage is the one whose two rational endpoints have least index among those meeting the requirements, and "least" is determined by The well-ordering principle; so the successor rule is a function, and the whole construction is one application of The recursion theorem to it. In particular the proof does not use countable choice (The Axiom of Countable Choice ()), which the neighbouring measure-theoretic results on this page do use.
What the naive proof would spend, and why. The textbook argument says: given the interval produced at stage , choose an interval inside it meeting , and repeat. Each choice is made from a nonempty set that depends on the previous choice, and it is made infinitely often. That pattern is not countable choice, which selects from a family fixed in advance; it is the axiom of dependent choice (The axiom of dependent choice: a relation in which every element is related to something admits an -indexed chain). Replacing the choice by a canonical rule is the only edit the argument needs, and fixing an enumeration of a dense set in advance is what makes a canonical rule available.
What this does NOT establish. It establishes nothing about the Baire category theorem for complete metric spaces in general. That statement is genuinely stronger, and how much stronger is recorded, with references and without proof, in The Baire category theorem is four inequivalent statements over ZF ‡: over ZF the metric version is equivalent to dependent choice, whereas its restriction to spaces with a countable dense subset is a theorem of ZF, "a fixed countable dense set removes every choice from the construction". The proof of Baire category in , by nested intervals with canonically chosen rational endpoints: a countable intersection of dense open sets is dense, so is not a countable union of nowhere dense sets is precisely that restricted argument, specialised to with the rationals as the countable dense set. So the correct summary is:
- the statement proved here, for , needs no choice principle;
- the general metric statement is not proved here at all, and is not a corollary of what is proved here;
- the strength of that general statement over ZF is quoted from the literature in The Baire category theorem is four inequivalent statements over ZF ‡, which this library does not prove.
Why the distinction is worth a separate item. The two statements are routinely called by the same name, and a reader who has seen "Baire needs dependent choice" may reasonably suspect the proof above of hiding an appeal to it. It does not, and the place to look is the successor rule: it takes a minimum over rather than picking a witness. The same device appears in Every nonempty perfect subset of is uncountable, and in both places it is the enumeration of that pays for it.
A note on the surrounding page. Choice is not avoided everywhere here. A countable union of measure-zero sets has measure zero, by countable choice spends countable choice at one clearly marked step, and says so; Every at most countable subset of has measure zero and The Cantor set is compact, perfect, uncountable, nowhere dense and of measure zero, and it contains no interval of positive length, so its only nonempty connected subsets are single points spend none. The page is arranged so that each appeal is visible where it happens rather than absorbed into a general convention.
5 · Examples, counterexamples and false statements
FALSE: every nowhere dense subset of has measure zero
Statement
False claim: every nowhere dense subset of (Nowhere dense, meager (first category), residual, and second category subsets of ) has measure zero (Measure zero (a countable cover by intervals of total length below every ) and content zero (a finite such cover)).
The claim is tempting because a nowhere dense set is topologically thin: its closure contains no interval at all, so it is "full of holes" everywhere. The error is to read that as a statement about total length. Holes may be plentiful and short at the same time, and the Smith-Volterra-Cantor set is built precisely so that they are.
Facts & Assumptions
Given: The Smith-Volterra-Cantor set of The Smith-Volterra-Cantor set: the same construction removing, at stage , an open middle interval of length from each of the remaining intervals.
The false claim: every nowhere dense subset of has measure zero.
is nowhere dense (The Smith-Volterra-Cantor set is compact, perfect and nowhere dense, and does not have measure zero, claim 3).
If sequences , with cover and all their partial total lengths are at most , then ; in particular does not have measure zero (The Smith-Volterra-Cantor set is compact, perfect and nowhere dense, and does not have measure zero, claim 4).
A set is null when for every real it has a cover by a sequence of closed intervals with all partial total lengths at most (Measure zero (a countable cover by intervals of total length below every ) and content zero (a finite such cover)).
Refutation
The set is a subset of and is nowhere dense, by [L1].
does not have measure zero: a cover witnessing nullity at would have all partial total lengths at most , and [L2] then forces , which is false.
So is a nowhere dense subset of that does not have measure zero, and the claim [A1] fails at ; the claim is therefore false.
Remarks
-
The converse implication is also false, and for a completely different reason: has measure zero and is not nowhere dense (FALSE: every subset of of measure zero is nowhere dense). So neither of the two notions of smallness implies the other, and the two failures are witnessed by sets of different cardinality, being uncountable and countable.
-
What is true. A nowhere dense set contains no interval of positive length, which is a genuine consequence of the definition; and a set of measure zero also contains no interval of positive length (A sequence of intervals covering has total length at least , so no interval of positive length has measure zero). The two conditions share that consequence and nothing beyond it.
-
The named witness is The Smith-Volterra-Cantor set is nowhere dense and does not have measure zero ↗.
FALSE: every subset of of measure zero is nowhere dense
Statement
False claim: every subset of of measure zero (Measure zero (a countable cover by intervals of total length below every ) and content zero (a finite such cover)) is nowhere dense (Nowhere dense, meager (first category), residual, and second category subsets of ).
The claim confuses two different smallness conditions. Measure zero constrains the total length of a cover; nowhere density constrains the closure. A set may be covered by intervals of total length below any and still have every real as an adherent point, and does exactly that.
Facts & Assumptions
Given: The set of rationals, that is the image of under the canonical embedding (The rationals embed densely in the reals).
The false claim: every subset of of measure zero is nowhere dense.
, so is at most countable ( is countably infinite, Finite, countably infinite, countable, uncountable, The rationals embed densely in the reals).
Every at most countable subset of has measure zero (Every at most countable subset of has measure zero).
A set is nowhere dense when the interior of its closure is empty; the interior of an open set is itself, and is open (Nowhere dense, meager (first category), residual, and second category subsets of , Interior, closure, boundary and exterior of a subset of , Open subset of (every point has a neighbourhood inside it), closed subset (complement open), and clopen).
Refutation
has measure zero, being at most countable by [L1] and hence null by [L2].
is not nowhere dense: its closure is by [L3], and the interior of is itself by [L4], since is an open subset of ; so the interior of the closure is .
So is a subset of of measure zero that is not nowhere dense, and the claim [A1] fails at it; the claim is therefore false.
Remarks
-
is nonetheless meager, being a union of countably many singletons, each of which is nowhere dense ( is , meager and not , while the irrationals are , residual and not ). So the failure above is not a failure of topological smallness in every sense: it is exactly the failure of the one-step condition. Meagreness is the countable-union closure of nowhere density, and it is the notion under which is small.
-
The converse implication is also false, and needs an uncountable witness: the Smith-Volterra-Cantor set is nowhere dense and not null (FALSE: every nowhere dense subset of has measure zero).
-
The named witness is is dense in and has measure zero ↗.
FALSE: every set of measure zero has content zero
Statement
False claim: every set of measure zero has content zero (Measure zero (a countable cover by intervals of total length below every ) and content zero (a finite such cover)).
The converse is true and is A set of content zero has measure zero; the two notions do coincide for compact sets (For a compact subset of , measure zero and content zero coincide). The claim above drops the compactness, and boundedness alone is not a substitute: the witness below is a bounded set of measure zero with no finite cover by intervals of total length less than .
Facts & Assumptions
Given: The set , where is the image of in (The rationals embed densely in the reals).
The false claim: every subset of of measure zero has content zero.
and a subset of an at most countable set is at most countable, so is at most countable, hence null ( is countably infinite, Every subset of an at most countable set is at most countable, Finite, countably infinite, countable, uncountable, Every at most countable subset of has measure zero, The rationals embed densely in the reals).
is dense in : strictly between any two reals lies a rational (Both and are dense in , and every nonempty open subset of is uncountable, The rationals embed densely in the reals).
is a closed set, a finite union of closed sets is closed, and is the set of points every neighbourhood of which meets , so a closed set containing contains (Intervals of : the nine order-convex forms, nondegeneracy, and length, Open subset of (every point has a neighbourhood inside it), closed subset (complement open), and clopen, Arbitrary unions and finite intersections of open subsets of are open, and dually for closed sets, The closure equals the set together with its limit points, equals the set of points every neighbourhood of which meets it, and is the smallest closed superset; a set is closed iff it contains its limit points, The -neighbourhood and the punctured -neighbourhood of a point of ).
has content zero when for every real it has a finite cover by closed intervals of total length at most (Measure zero (a countable cover by intervals of total length below every ) and content zero (a finite such cover)).
Every nonempty finite set of reals has a maximum and a minimum (Every nonempty finite set of reals has a maximum and a minimum, Maximum and minimum of a set).
Ordered-field arithmetic: , so and and ; adding a constant and multiplying by a positive preserve an inequality; the order is total and transitive (The multiplicative identity is positive, Order is preserved by adding a constant and by adding inequalities, Sign rules for products and monotonicity of multiplication, Ordered field, Complete ordered field (least-upper-bound property)). These order-arithmetic facts are stated by their sources for the strict order only; the nonstrict forms used below follow by adjoining the equality case, in which the two sides coincide.
Refutation
has measure zero by [L1], and is bounded.
Every is adherent to : given a real , put and , which exist by [L6]. Then : indeed by [L7] and , while would need hence , and would need hence , and otherwise . By [L2] there is a rational strictly between and ; it lies in because and , and within of because and . So .
Let and be any finite family of closed intervals with . The union is a closed set by [L3], and it contains , hence contains by [L3]; by step 1.2 every point of lies in , so and [L4] gives .
So no finite family of closed intervals covers with total length at most , and does not have content zero by [L5] and [L7]; yet has measure zero by step 1.1. The claim [A1] therefore fails at and is false.
Remarks
-
Boundedness is not the missing hypothesis, closedness is. is bounded and its failure is total: no finite cover does better than total length , the same bound as for all of . What lacks is closedness, and with it compactness; For a compact subset of , measure zero and content zero coincide shows that supplying it repairs the implication completely.
-
The gap between the two notions is a quantifier, not a constant. Given , the countable cover of from Every at most countable subset of has measure zero uses intervals whose lengths shrink geometrically; no finite initial segment of it covers , because the rationals left over are still dense in . Compactness is exactly what turns a countable cover into a finite one, and that is the whole content of the repair.
-
The named witness is has measure zero and not content zero, although it is bounded ↗.
FALSE: is a subset of
Statement
False claim: , that is the set of rationals inside (The rationals embed densely in the reals), is a set ( and subsets of ): there is a sequence of open subsets of with .
The claim looks plausible by symmetry. is , being a countable union of singletons; the irrationals are , being a countable intersection of complements of singletons; and the two classes are exchanged by complementation. So one expects each set to belong to both classes. It does not: the symmetry between the two classes says nothing about a single set, and the obstruction is the Baire category theorem.
Facts & Assumptions
Given: The set of rationals.
The false claim: is a subset of .
is and meager, the irrationals are and residual, and is not ( is , meager and not , while the irrationals are , residual and not , claims 1, 2 and 3).
is when it is the intersection of a sequence of open sets ( and subsets of , Open subset of (every point has a neighbourhood inside it), closed subset (complement open), and clopen).
A countable intersection of dense open subsets of is dense; in particular it is nonempty (Baire category in , by nested intervals with canonically chosen rational endpoints: a countable intersection of dense open sets is dense, so is not a countable union of nowhere dense sets).
Refutation
By claim 3 of [L1], is not a subset of , which is the direct negation of [A1].
The reason, recorded here so that the refutation is not merely a pointer: were with each open, every would contain the dense set and so be dense; adjoining the dense open sets , one for each rational , would produce an at most countable family of dense open sets whose intersection is minus every rational, that is , contradicting [L3].
So [A1] is false, and the refutation is carried out in full in [L1].
Remarks
-
What is true about . It is , meager, of measure zero, dense, and countable. What fails is only the property, and its failure is a genuine theorem about , resting on completeness through A nested sequence of nonempty closed bounded intervals has nonempty intersection, and the intersection is a single point exactly when the lengths tend to inside Baire category in , by nested intervals with canonically chosen rational endpoints: a countable intersection of dense open sets is dense, so is not a countable union of nowhere dense sets. Inside itself the corresponding claim is true and trivial, being the whole space there.
-
The dual false statement is not recorded separately, because it is the same statement: the irrationals fail to be exactly because fails to be ( and subsets of ). The witness is The irrationals form a residual set that is not ↗.
-
Context, not a result of this library. In classical analysis the set of points at which a real function is continuous is always , and it is the false statement above that then rules out a function continuous at every rational and at no irrational. That classical result is not proved here, and continuity is not available at this point in the reading order; the connection is recorded as orientation and nothing on this page depends on it.
FALSE: the Cantor set is countable because only countably many intervals were removed
Statement
False claim: the Cantor set (The Cantor middle-thirds set as the intersection of the sets obtained by removing open middle thirds) is at most countable (Finite, countably infinite, countable, uncountable), because it is obtained from by removing at most countably many intervals, and what survives such a removal is the at most countable set of their endpoints.
The claim rests on two inferences and both fail. The count of removed intervals itself is correct, and it is irrelevant: removing an at most countable family of intervals from says nothing about the cardinality of the remainder. And the endpoints do not exhaust : the point belongs to and is the endpoint of no removed interval, as the remarks below record.
Facts & Assumptions
Given: The Cantor set of The Cantor middle-thirds set as the intersection of the sets obtained by removing open middle thirds and the set of sequences with values in .
The false claim: is at most countable.
There is a bijection from onto (The Cantor set is exactly the set of with every , and this gives a bijection with , claim 3, Injection, surjection, bijection).
There is no surjection from a set onto its power set (Cantor's theorem: ).
A nonempty at most countable set admits a surjection from , and "uncountable" means "not at most countable" (A nonempty set is at most countable iff it is a surjective image of , Finite, countably infinite, countable, uncountable, Equinumerous sets, and ).
Refutation
is uncountable by [L1], which is the direct negation of [A1].
A second and independent refutation, which does not go through perfect sets: the map is a bijection from onto , its inverse sending a set to its indicator sequence, so composing with [L2] gives a bijection from onto . If were at most countable it would be nonempty and admit a surjection by [L4], and composing with that bijection would give a surjection , contradicting [L3].
So the claim [A1] is false. The premise about the removed intervals is not what fails; it is the inference from it, and step 1.2 shows why no counting of removed intervals could have settled the question: the surviving set is in bijection with the power set of .
Remarks
-
The correct statement about the removed intervals. The number removed at each stage doubles and there are countably many stages, so the removed family is at most countable and its endpoints form an at most countable set. That much of the claim survives. What is false is that the endpoints exhaust : an endpoint has an eventually constant digit sequence, and lies in the Cantor set and is the endpoint of no removed interval, so the endpoints do not exhaust it ↗ exhibits a point of whose digits alternate for ever.
-
Length and cardinality are independent here. has measure zero (The Cantor set is compact, perfect, uncountable, nowhere dense and of measure zero, and it contains no interval of positive length, so its only nonempty connected subsets are single points) and is in bijection with (claim 3 of The Cantor set is exactly the set of with every , and this gives a bijection with ), hence uncountable (Cantor's theorem: ), while the Smith-Volterra-Cantor set is uncountable and is not null (The Smith-Volterra-Cantor set is compact, perfect and nowhere dense, and does not have measure zero). Nothing about cardinality follows from a length computation, in either direction.
-
The named witness is lies in the Cantor set and is the endpoint of no removed interval, so the endpoints do not exhaust it ↗.
Sources
Standard references
Recommended treatments; not extraction sources.
- Nowhere dense set (Wikipedia)
- Meagre set (Wikipedia)
- W. Rudin, Principles of Mathematical Analysis, 3rd ed., Ch. 2 and Ch. 3
- E. Zakon, Mathematical Analysis, §6.8: Baire Categories
- Meager set (Encyclopedia of Mathematics)
- Fσ set (Wikipedia)
- Gδ set (Wikipedia)
- W. Rudin, Principles of Mathematical Analysis, 3rd ed., Ch. 2 and Ch. 11
- Borel set (Encyclopedia of Mathematics)
- Baire category theorem (Wikipedia)
- Nested intervals (Wikipedia)
- W. Rudin, Principles of Mathematical Analysis, 3rd ed., Ch. 3 (Exercise 22) and Ch. 2
- Baire theorem (Encyclopedia of Mathematics)
- W. Rudin, Principles of Mathematical Analysis, 3rd ed., Ch. 3 (Exercise 22)
- E. Zakon, Problems on Baire Categories and Linear Maps
- Null set (Wikipedia)
- Jordan measure (Wikipedia)
- W. Rudin, Principles of Mathematical Analysis, 3rd ed., Ch. 11
- MIT 18.125, Homework 2: Measure-zero sets
- UAF Math 641, Measure Theory notes
- Heine-Borel theorem (Wikipedia)
- Axiom of countable choice (Wikipedia)
- Cantor set (Wikipedia)
- W. Rudin, Principles of Mathematical Analysis, 3rd ed., Ch. 2 (§2.44)
- University of Chicago MATH 395 notes
- Stanford Math 205A, Homework 1
- Perfect set (Wikipedia)
- Smith-Volterra-Cantor set (Wikipedia)
- A. Jin, Cantor sets in topology, analysis, and financial markets
- Cantor function (Wikipedia)
- Axiom of dependent choice (Wikipedia)
- Cantor's theorem (Wikipedia)