History

History and Mythology of Set Theory

Reading preferences

Optional display controls need JavaScript. All reading content and navigation work without it.

Source file content/history/set-theory/set-theory.tex

Editorial

This chapter includes the historical prelude from Tim Button's Open Set Theory text.

Source file content/history/set-theory/infinitesimals.tex

Infinitesimals and Differentiation

Newton and Leibniz discovered the calculus (independently) at the end of the 17th century. A particularly important application of the calculus was differentiation. Roughly speaking, differentiation aims to give a notion of the “rate of change”, or gradient, of a function at a point.

Here is a vivid way to illustrate the idea. Consider the function f(x)=x24+12f(x) = \nicefrac{x^2}{4} + \nicefrac{1}{2}source, depicted in black below:

Parabola with three secant triangles

Coordinate diagram for the function f of x equals x squared over four plus one half. The horizontal axis is x, and the vertical axis is f of x. The horizontal tick labels use the horizontal-axis tick values one through four; the vertical tick labels use the vertical-axis tick values one through five. A black upward-opening parabola is shown. Three right secant triangles share the point where x is one half. The red triangle has base three and slope one; the smaller blue triangle has base two and slope three quarters; the smallest green triangle has base one and slope one half. End diagram.

Nodes

    Edges

      Elements

      • horizontal axis. xxsourcerole: axis; direction: right.
      • vertical axis. f(x)f(x)sourcerole: axis; direction: up.
      • parabola. role: function curve; equation speech: f of x equals x squared over four plus one half; style: black thick.
      • red secant triangle. role: approximation; base: 3; slope: 1; style: red.
      • blue secant triangle. role: approximation; base: 2; slope: 3/4; style: blue.
      • green secant triangle. role: approximation; base: 1; slope: 1/2; style: green.
      1,2,3,4\xtextsource
      1,2,3,4,5\ytextsource
      source 17

      Suppose we want to find the gradient of the function at c=12c = \nicefrac{1}{2}source. We start by drawing a triangle whose hypotenuse approximates the gradient at that point, perhaps the red triangle above. When β\betasource is the base length of our triangle, its height is f(12+β)f(12)f(\nicefrac{1}{2}+\beta) - f(\nicefrac{1}{2})source, so that the gradient of the hypotenuse is:

      f(12+β)f(12)β.\frac{f(\nicefrac{1}{2}+\beta) - f(\nicefrac{1}{2})}{\beta}.source

      So the gradient of our red triangle, with base length 33source, is exactly 11source. The hypotenuse of a smaller triangle, the blue triangle with base length 22source, gives a better approximation; its gradient is 34\nicefrac{3}{4}source. A yet smaller triangle, the green triangle with base length 11source, gives a yet better approximation; with gradient 12\nicefrac{1}{2}source.

      Ever-smaller triangles give us ever-better approximations. So we might say something like this: the hypotenuse of a triangle with an infinitesimal base length gives us the gradient at c=12c = \nicefrac{1}{2}source itself. In this way, we would obtain a formula for the (first) derivative of the function ffsource at the point ccsource:

      f(c)=f(c+β)f(c)β where β is infinitesimal.{f'}(c) = \frac{f(c+\beta) - f(c)}{\beta} \text{ where $\beta$ is infinitesimal.}source

      And, roughly, this is what Newton and Leibniz said.

      However, since they have said this, we must ask them: what is an infinitesimal? A serious dilemma arises. If β=0\beta = 0source, then ff'source is ill-defined, for it involves dividing by 00source. But if β>0\beta > 0source, then we just get an approximation to the gradient, and not the gradient itself.

      This is not an anachronistic concern. Here is Berkeley, criticizing Newton's followers:

      I admit that signs may be made to denote either any thing or nothing: and consequently that in the original notation c+βc + \betasource, β\betasource might have signified either an increment or nothing. But then which of these soever you make it signify, you must argue consistently with such its signification, and not proceed upon a double meaning: Which to do were a manifest sophism. (George Berkeley 1734, §XIII, variables changed to match preceding text)

      To defend the infinitesimal calculus against Berkeley, one might reply that the talk of “infinitesimals” is merely figurative. One might say that, so long as we take a really small triangle, we will get a good enough approximation to the tangent. Berkeley had a reply to this too: whilst that might be good enough for engineering, it undermines the status of mathematics, for

      we are told that in rebus mathematicis errores quàm minimi non sunt contemnendi. [In the case of mathematics, the smallest errors are not to be neglected.] (George Berkeley, 1734, §IX)

      The italicised passage is a near-verbatim quote from Newton's own Quadrature of Curves (1704).

      Berkeley's philosophical objections are deeply incisive. Nevertheless, the calculus was a massively successful enterprise, and mathematicians continued to use it without falling into error.

      Source file content/history/set-theory/limits.tex

      Rigorous Definition of Limits

      These days, the standard solution to the foregoing problem is to get rid of the infinitesimals. Here is how.

      We saw that, as β\betasource gets smaller, we get better approximations of the gradient. Indeed, as β\betasource gets arbitrarily close to 00source, the value of f(c)f'(c)source “tends without limit” to the gradient we want. So, instead of considering what happens at β=0\beta = 0source, we need only consider the trend of f(c)f'(c)source as β\betasource approaches 00source.

      Put like this, the general challenge is to make sense of claims of this shape:

      As xxsource approaches ccsource, g(x)g(x)source tends without limit to \ellsource.

      which we can write more compactly as follows:

      limxcg(x)=.\lim_{x \rightarrow c}g(x) = \ell.source

      In the 19th century, building upon earlier work by Cauchy, Weierstrass offered a perfectly rigorous definition of this expression. The idea is indeed that we can make g(x)g(x)source as close as we like to \ellsource, by making xxsource suitably close to ccsource. More precisely, we stipulate that limxcg(x)=\lim_{x \rightarrow c} g(x) = \ellsource will mean:

      (ε>0)(δ>0)x(|xc|<δ|g(x)|<ε).(\forall\epsilon > 0)(\exists \delta > 0)\forall x \left(|x - c| < \delta \lif |g(x) - \ell| < \epsilon \right).source

      The vertical bars here indicate absolute magnitude. That is, |x|=x|x| = xsource when x0x \geq 0source, and |x|=x|x| =-xsource when x<0x < 0source; you can depict that function as follows:

      Graph of the absolute-value function

      Coordinate diagram of the absolute-value function. The horizontal axis is x, and the vertical axis is the absolute value of x. The horizontal tick command uses the printed horizontal-axis tick values, including the duplicated positive-one position; the vertical tick command uses the vertical-axis tick values one and two. The thick graph is a V shape, descending with slope negative one to the origin and ascending with slope one from the origin. The source tick list prints positive one twice; that duplication is preserved and disclosed. End diagram.

      Nodes

        Edges

          Elements

          • horizontal axis. xxsourcerole: axis; direction: right.
          • vertical axis. |x||x|sourcerole: axis; direction: up.
          • absolute value graph. role: piecewise linear curve; style: black thick; vertices: -2.5; 2.5; 0; 0; 2.5; 2.5.
          2,1,1,1,2\xtextsource
          1,2\ytextsource
          source 43

          So the definition says roughly this: you can make your “error” less than ε\epsilonsource (i.e., |g(x)|<ε|g(x) - \ell| < \epsilonsource) by choosing arguments which are no more than δ\deltasource away from ccsource (i.e., |xc|<δ|x - c| < \deltasource).

          Having defined the notion of a limit, we can use it to avoid infinitesimals altogether, stipulating that the gradient of ffsource at ccsource is given by:

          f(c)=limx0(f(c+x)f(c)x) where a limit exists.{f}'(c) = \lim_{x \rightarrow 0}\left(\frac{f(c +x) - f(c)}{x}\right) \text{ where a limit exists}.source

          It is important, though, to realise why our definition needs the caveat “where a limit exists”. To take a simple example, consider f(x)=|x|f(x) = |x|source, whose graph we just saw. Evidently, f(0)f'(0)source is ill-defined: if we approach 00source “from the right”, the gradient is always 11source; if we approach 00source “from the left”, the gradient is always 1-1source; so the limit is undefined. As such, we might add that a function ffsource is differentiable at xxsource iff such a limit exists.

          We have seen how to handle differentiation using the notion of a limit. We can use the same notion to define the idea of a continuous function. (Bolzano had, in effect, realised this by 1817.) The Cauchy--Weierstrass treatment of continuity is as follows. Roughly: a function ffsource is continuous (at a point) provided that, if you demand a certain amount of precision concerning the output of the function, you can guarantee this by insisting upon a certain amount of precision concerning the input of the function. More precisely: ffsource is continuous at ccsource provided that, as xxsource tends to zero, the difference between f(c+x)f(c + x)source and f(c)f(c)source itself tends to 00source. Otherwise put: ffsource is continuous at ccsource iff f(c)=limxcf(x)f(c) = \lim_{x \rightarrow c} f(x)source.

          To go any further would just lead us off into real analysis, when our subject matter is set theory. So now we should pause, and state the moral. During the 19th century, mathematicians learnt how to do without infinitesimals, by invoking a rigorously defined notion of a limit.

          Source file content/history/set-theory/pathologies.tex

          Pathologies

          However, the definition of a limit turned out to allow for some rather “pathological” constructions.

          Around the 1830s, Bolzano discovered a function which was continuous everywhere, but differentiable nowhere. (Unfortunately, Bolzano never published this; the idea was first encountered by mathematicians in 1872, thanks to Weierstrass's independent discovery of the same idea.)Footnote: The history is documented in extremely thorough footnotes to the Wikipedia article on the Weierstrass function (external resource; internet required). This was, to say the least, rather surprising. It is easy to find functions, such as |x||x|source, which are continuous everywhere but not differentiable at a particular point. But a function which is continuous everywhere but differentiable nowhere is a very different beast. Consider, for a moment, how you might try to draw such a function. To ensure it is continuous, you must be able to draw it without ever removing your pen from the page; but to ensure it is differentiable nowhere, you would have to abruptly change the direction of your pen, constantly.

          Further “pathologies” followed. In January 5 1874, Cantor wrote a letter to Dedekind, posing the problem:

          Can a surface (say a square including its boundary) be one-to-one correlated to a line (say a straight line including its endpoints) so that to every point of the surface there corresponds a point of the line, and conversely to every point of the line there corresponds a point of the surface?

          It still seems to me at the moment that the answer to this question is very difficult---although here too one is so impelled to say no that one would like to hold the proof to be almost superfluous. [Quoted in Fernando Q. Gouvêa 2011]

          But, in 1877, Cantor proved that he had been wrong. In fact, a line and a square have exactly the same number of points. He wrote on 29 June 1877 to Dedekind “je le vois, mais je ne le crois pas”; that is, “I see it, but I don't believe it”. In the “received history” of mathematics, this is often taken to indicate just how literally incredible these new results were to the mathematicians of the time. (The correspondence is presented in Fernando Q. Gouvêa (2011), and we return to it in the section More Myth than History. Cantor's proof is outlined in the section Cantor on the Line and the Plane.)

          Inspired by Cantor's result, Peano started to consider whether it might be possible to map a line smoothly onto a plane. This would be a curve which fills space. In 1890, Peano constructed just such a curve. This is truly counter-intuitive: Euclid had defined a line as “breadthless length” (Book I, Definition 2), but Peano had shown that, by curling up a line appropriately, its length can be turned into breadth. In 1891, Hilbert described a slightly more intuitive space-filling curve, together with some pictures illustrating it. The curve is constructed in sequence, and here are the first six stages of the construction:

          First six Hilbert-curve stages

          Six square panels show the first six Hilbert-curve approximations in source order: stages one, two, and three across the top row, then stages four, five, and six across the bottom row. Each red curve lies in a gray square. The step sizes halve from stage to stage, while the recursive order rises from one through six, making the curve increasingly dense. No arrow direction, coordinate label, or filled region is printed. End diagram.

          Nodes

            Edges

              Elements

              • hilbert stage one. role: curve stage; style: red in gray square; order: 1; panel: top-left.
              • hilbert stage two. role: curve stage; style: red in gray square; order: 2; panel: top-middle.
              • hilbert stage three. role: curve stage; style: red in gray square; order: 3; panel: top-right.
              • hilbert stage four. role: curve stage; style: red in gray square; order: 4; panel: bottom-left.
              • hilbert stage five. role: curve stage; style: red in gray square; order: 5; panel: bottom-middle.
              • hilbert stage six. role: curve stage; style: red in gray square; order: 6; panel: bottom-right.
              source 64

              In the limit---a notion which had, by now, received rigorous definition---the entire square is filled in solid red. And, in passing, Hilbert's curve is continuous everywhere but differentiable nowhere; intuitively because, in the infinite limit, the function abruptly changes direction at every moment. (We will outline Hilbert's construction in more detail in the appendix on Hilbert's space-filling curves.)

              For better or worse, these “pathological” geometric constructions were treated as a reason to doubt appeals to geometric intuition. They became something approaching propaganda for a new way of doing mathematics, which would culminate in set theory. In the later myth-building of the subject, it was repeated, often, that these results were both perfectly rigorous and perfectly shocking. They therefore served a dual purpose: as a warning against relying upon geometric intuition, and as a demonstration of the fertility of new ways of thinking.

              Source file content/history/set-theory/mythology.tex

              More Myth than History?

              Looking back on these events with more than a century of hindsight, we must be careful not to take these verdicts on trust. The results were certainly novel, exciting, and surprising. But how truly shocking were they? And did they really demonstrate that we should not rely on geometric intuition?

              On the question of shock, Fernando Q. Gouvêa (2011) points out that Cantor's famous note to Dedekind, “je le vois, mais je ne le crois pas” is taken rather out of context. Here is more of that context (quoted from Fernando Q. Gouvêa):

              Please excuse my zeal for the subject if I make so many demands upon your kindness and patience; the communications which I lately sent you are even for me so unexpected, so new, that I can have no peace of mind until I obtain from you, honoured friend, a decision about their correctness. So long as you have not agreed with me, I can only say: je le vois, mais je ne le crois pas.

              Cantor knew his result was “so unexpected, so new”. But it is doubtful that he ever found his result unbelievable. As Fernando Q. Gouvêa points out, he was simply asking Dedekind to check the proof he had offered.

              On the question of geometric intuition: Peano published his space-filling curve without including any diagrams. But when Hilbert published his curve, he explained his purpose: he would provide readers with a clear way to understand Peano's result, if they “help themselves to the following geometric intuition”; whereupon he included a series of diagrams just like those provided in the section Pathologies.

              More generally: whilst diagrams have fallen rather out of fashion in published proofs, there is no getting round the fact that mathematicians frequently use diagrams when proving things. (Roughly put: good mathematicians know when they can rely upon geometric intuition.)

              In short: don't believe the hype; or at least, don't just take it on trust. For more on this, you could read Marcus Giaquinto (2007).

              Source file content/history/set-theory/cantor-plane.tex

              Cantor on the Line and the Plane

              Some of the circumstances surrounding the proof of Schröder-Bernstein tie in with the history we discussed in the section Pathologies. Recall that, in 1877, Cantor proved that there are exactly as many points on a square as on one of its sides. Here, we will present his (first attempted) proof.

              Let L\unitlinesource be the unit line, i.e., the set of points [0,1][0,1]source. Let S\unitsquaresource be the unit square, i.e., the set of points L×L\unitline \times \unitlinesource. In these terms, Cantor proved that LS\cardeq{\unitline}{\unitsquare}source. He wrote a note to Dedekind, essentially containing the following argument.

              Cantor's line-and-square theorem

              LS\cardeq{\unitline}{\unitsquare}source

              Proof

              [Proof: first part.] Fix a,bLa, b \in \unitlinesource. Write them in binary notation, so that we have infinite sequences of 00sources and 11sources, a1a_1source, a2a_2source, dots, and b1b_1source, b2b_2source, dots, such that:

              a=0.a1a2a3a4b=0.b1b2b3b4Now consider the function f:SL given byf(a,b)=0.a1b1a2b2a3b3a4b4a &= 0.a_1a_2a_3a_4\dots\\ b &= 0.b_1b_2b_3b_4\dots \intertext{Now consider the function $f \colon \unitsquare \to \unitline$ given by} f(a, b) & = 0.a_1b_1a_2b_2a_3b_3a_4b_4\dotssource

              Now ffsource is an injection, since if f(a,b)=f(c,d)f(a, b) = f(c,d)source, then an=cna_n = c_nsource and bn=dnb_n = d_nsource for all nn \in \Natsource, so that a=ca = csource and b=db = dsource.

              Unfortunately, as Dedekind pointed out to Cantor, this does not answer the original question. Consider 0.1˙0˙=0.10101010100.\dot{1}\dot{0} = 0.1010101010\ldotssource. We need that f(a,b)=0.1˙0˙f(a,b) = 0.\dot{1}\dot{0}source, where:

              a=0.1˙1˙=0.111111b=0a&= 0.\dot{1}\dot{1} = 0.111111\ldots\\ b&= 0source

              But a=0.1˙1˙=1a = 0.\dot{1}\dot{1} = 1source. So, when we say “write aasource and bbsource in binary notation”, we have to choose which notation to use; and, since ffsource is to be a function, we can use only one of the two possible notations. But if, for example, we use the simple notation, and write aasource as “1.0001.000\ldotssource”, then we have no pair a,b\tuple{a, b}source such that f(a,b)=0.1˙0˙f(a, b) = 0.\dot{1}\dot{0}source.

              To summarise: Dedekind pointed out that, given the possibility of certain recurring decimal expansions, Cantor's function ffsource is an injection but not a surjection. So Cantor has shown only that SL\cardle{\unitsquare}{\unitline}source and not that SL\cardeq{\unitsquare}{\unitline}source.

              Cantor wrote back to Dedekind almost immediately, essentially suggesting that the proof could be completed as follows:

              Proof

              [Proof: completed.] So, we have shown that SL\cardle{\unitsquare}{\unitline}source. But there is obviously an injection from L\unitlinesource to S\unitsquaresource: just lay the line flat along one side of the square. So LS\cardle{\unitline}{\unitsquare}source and SL\cardle{\unitsquare}{\unitline}source. By Schröder--Bernstein (the Schroeder-Bernstein theorem), LS\cardeq{\unitline}{\unitsquare}source.

              But of course, Cantor could not complete the last line in these terms, for the Schröder-Bernstein Theorem was not yet proved. Indeed, although Cantor would subsequently formulate this as a general conjecture, it was not satisfactorily proved until 1897. (And so, later in 1877, Cantor offered a different proof of the theorem that the unit interval and unit square have equal cardinality, which did not go via Schröder--Bernstein.)

              Source file content/history/set-theory/hilbert-curve.tex

              Appendix: Hilbert's Space-filling Curves

              In chapter the section Pathologies, we mentioned that Cantor's proof that a line and a square have exactly the same number of points (the theorem that the unit interval and unit square have equal cardinality) prompted Peano to ask whether there might be a space-filling curve. He obtained a positive answer in 1890. In this section, we explain (in a hand-wavy way) how to construct Hilbert's space-filling curve (with a tiny tweak).Footnote: For a more rigorous explanation, see Nicholas J Rose (2010). The tweak amounts to the inclusion of the red parts of the curves below. This makes it slightly easier to check that the curve is continuous.

              We must define a function, hhsource, as the limit of a sequence of functions h1h_1source, h2h_2source, h3h_3source, dots We first describe the construction. Then we show it is space-filling. Then we show it is a curve.

              We will take hhsource's range to be the unit square, S\unitsquaresource. Here is our first approximation to hhsource, i.e., h1h_1source:

              First Hilbert-curve approximation

              First Hilbert-curve approximation in a square divided by a two by two grid. A black first-order Hilbert path connects the four quarter-cells in the order bottom left, top left, top right, bottom right. Short red segments connect the two bottom endpoints to the square boundary. End diagram.

              Nodes

                Edges

                  Elements

                  • grid. role: square grid; style: gray; rows: 2; columns: 2.
                  • hilbert core. role: curve; style: black thick; order: 1; cell order: bottom-left; top-left; top-right; bottom-right.
                  • boundary connectors. role: endpoint connectors; style: red thick; count: 2.
                  source 24

                  To keep track of things, we have imposed a 2×22 \times 2source grid on the square. We can think of the curve starting in the bottom left quarter, moving to the top left, then to the top right, then finally to the bottom right. Here is the second stage in the construction, i.e., h2h_2source:

                  Second Hilbert-curve approximation

                  Second Hilbert-curve approximation in a square divided by a four by four grid. Four scaled black copies of the first-order core occupy the quarter-squares. The lower-left copy is rotated two hundred seventy degrees, the two upper copies are unrotated, and the lower-right copy is rotated ninety degrees. Three green segments join consecutive copies, and two red segments connect the outer endpoints to the left and right boundary. End diagram.

                  Nodes

                    Edges

                      Elements

                      • grid. role: square grid; style: gray; rows: 4; columns: 4.
                      • four hilbert cores. role: curve copies; style: black thick; order: 1; count: 4; rotations degrees: 270; 0; 0; 90.
                      • internal connectors. role: curve connectors; style: green thick; count: 3.
                      • boundary connectors. role: endpoint connectors; style: red thick; count: 2.
                      source 36

                      The different colours will help explain how h2h_2source was constructed. We first place scaled-down copies of the non-red bit of h1h_1source into the bottom left, top left, top right, and bottom right of our square (drawn in black). We then connect these four figures (with green lines). Finally, we connect our figure to the boundary of the square (with red lines).

                      Now to h3h_3source. Just as h2h_2source was made from four connected, scaled-down copies of the non-red bit of h1h_1source, so h3h_3source is made up of four scaled-down copies of the non-red bit of h2h_2source (drawn in black), which are then joined together (with green lines) and finally connected to the boundary of the square (with red lines).

                      Third Hilbert-curve approximation

                      Third Hilbert-curve approximation in a square divided by an eight by eight grid. Four scaled black copies of the second-order core occupy the quarter-squares. The lower-left copy is rotated two hundred seventy degrees, the two upper copies are unrotated, and the lower-right copy is rotated ninety degrees. The source draws three distinct green connector positions, but repeats the right connector command once at the same coordinates; two red segments connect the outer endpoints to the bottom boundary. End diagram.

                      Nodes

                        Edges

                          Elements

                          • grid. role: square grid; style: gray; rows: 8; columns: 8.
                          • four hilbert cores. role: curve copies; style: black thick; order: 2; count: 4; rotations degrees: 270; 0; 0; 90.
                          • internal connectors. role: curve connectors; style: green thick; distinct count: 3; source command count: 4.
                          • boundary connectors. role: endpoint connectors; style: red thick; count: 2.
                          source 61

                          And now we see the general pattern for defining hn+1h_{n+1}source from hnh_nsource. At last we define the curve hhsource itself by considering the point-by-point limit of these successive functions h1h_1source, h2h_2source, dots That is, for each xSx \in \unitsquaresource:

                          h(x)=limnhn(x)h(x) &= \lim_{n \rightarrow \infty} h_n(x)source

                          We now show that this curve fills space. When we draw the curve hnh_nsource, we impose a 2n×2n2^n \times 2^nsource grid onto S\unitsquaresource. By Pythagoras's Theorem, the diagonal of each grid-location is of length:

                          (12n)2+(12n)2=2(12n)\sqrt{\left(\nicefrac{1}{2^{n}}\right)^2+\left(\nicefrac{1}{2^{n}}\right)^2} = 2^{(\frac{1}{2}-n)}source

                          and evidently hnh_nsource passes through every grid-location. So each point in S\unitsquaresource is at most 2(12n)2^{(\frac{1}{2}-n)}source distance away from some point on hnh_nsource. Now, hhsource is defined as the limit of the functions h1h_1source, h2h_2source, h3h_3source, dots So the maximum distance of any point from hhsource is given by:

                          limn2(12n)=0.\lim_{n \rightarrow \infty} 2^{(\frac{1}{2}-n)} = 0.source

                          That is: every point in S\unitsquaresource is 00source distance from hhsource. In other words, every point of S\unitsquaresource lies on the curve. So hhsource fills space!

                          It remains to show that hhsource is, indeed, a curve. To show this, we must define the notion. The modern definition builds on one given by Jordan in 1887 (i.e., only a few years before the first space-filling curve was provided):

                          Definition of a curve

                          A curve is a continuous map from L\unitlinesource to 2\Real^2source.

                          This is fairly intuitive: a curve is, intuitively, a “smooth” map which takes a canonical line onto the plane 2\Real^2source. Our function, hhsource, is indeed a map from L\unitlinesource to 2\Real^2source. So, we just need to show that hhsource is continuous. We defined continuity in the section Rigorous Definition of Limits using ε\epsilonsource/δ\deltasource notation. In the vernacular, we want to establish the following: If you specify a point ppsource in S\unitsquaresource, together with any desired level of precision ε\epsilonsource, we can find an open section of L\unitlinesource such that, given any xxsource in that open section, h(x)h(x)source is within ε\epsilonsource of ppsource.

                          So: assume that you have specified ppsource and ε\epsilonsource. This is, in effect, to draw a circle with centre ppsource and radius ε\epsilonsource on S\unitsquaresource. (The circle might spill off the edge of S\unitsquaresource, but that doesn't matter.) Now, recall that, when describing the function hnh_nsource, we drew a 2n×2n2^n \times 2^nsource grid upon S\unitsquaresource. It is obvious that, no matter how small ε\epsilonsource is, there is some nnsource such that some individual grid-location of the 2n×2n2^n \times 2^nsource grid on S\unitsquaresource lies wholly within the circle with centre ppsource and radius ε\epsilonsource.

                          So, take that nnsource, and let IIsource be the largest open part of L\unitlinesource which hnh_nsource maps wholly into the relevant grid location. (It is clear that (a,b)(a,b)source exists, since we already noted that hnh_nsource passes through every grid-location in the 2n×2n2^n\times 2^nsource grid.) It now suffices to show to show that, whenever xIx \in Isource the point h(x)h(x)source lies in that same grid-location. And to do this, it suffices to show that hm(x)h_m(x)source lies in that same grid location, for any m>nm > nsource. But this is obvious. If we consider what happens with hmh_msource for m>nm > nsource, we see that exactly the “same part” of the unit interval is mapped into the same grid-location; we just map it into that region in an increasingly stretched-out, wiggly fashion.

                          Source disclosures