{"blyg":"0.4","id":"1dj5bas3dvjcc8cnac0dt5df2z","kind":"thread","origin":"https://blyg.pioneeringspirit.xyz/","page":"t/1dj5bas3dvjcc8cnac0dt5df2z/","author":{"name":"PAtwater","url":"https://blyg.pioneeringspirit.xyz"},"created":"2026-11-17T05:08:36Z","updated":"2026-11-17T06:02:08Z","version":6,"content_md":"![[09may6xg0m07gbe18st4jm6pxm]]\n> Blygger Studio 0.62.0 can write mathematics. Put TeX between dollar signs and it publishes as MathML, which every current browser draws: no script, no stylesheet and no font travels with the page.\n\n*UPDATE: now blyg studio 0.62.0 and we're cooking.*\n\nOooh this might be fun for sharing out problems of a new ai native sort in the spirit of project euler? Or fermi gym? I will cogitate. \n\nFirst, I would have thought the test environment would be less than or equal to zero for this function, which is mathematically equivalent though more on brand :P \n\n$$\n|x| = \\begin{cases} -x & \\text{if } x \\le 0 \\\\ x & \\text{if } x > 0 \\end{cases}\n$$\n\nSecond, I cannot resist an opportunity to share about the Cantor Set. \n\n***\n\n### Cantor Set: the infinite void, a Grand Canyon's worth of majesty, where out of nothing emerges everything \n\n**Claim.** The Cantor set $C$ has Lebesgue measure $m(C)=0$, and yet $C$ contains infinitely many points.\n\n**Construction.** Let $C_0=[0,1]$. Given $C_n$, a union of disjoint closed intervals, form $C_{n+1}$ by deleting the open middle third of each interval. Put $C=\\bigcap_{n\\ge 0} C_n$.\n\n**Measure zero.** By induction, $C_n$ is a union of $2^n$ disjoint closed intervals, each of length $3^{-n}$. Indeed, $C_0$ is one interval of length $1=3^0$, and trisecting an interval of length $3^{-n}$ leaves two intervals of length $3^{-n-1}$. Hence\n\n$$\nm(C_n)=2^n\\cdot 3^{-n}=\\left(\\tfrac{2}{3}\\right)^n.\n$$\n\nSince $C\\subseteq C_n$ for every $n$, monotonicity of measure gives\n\n$$\n0\\le m(C)\\le \\left(\\tfrac{2}{3}\\right)^n \\quad\\text{for every } n.\n$$\n\nBecause $\\left(\\tfrac{2}{3}\\right)^n\\to 0$ as $n\\to\\infty$, we conclude that $m(C)=0$. Equivalently, the sets $C_n$ decrease and $m(C_0)<\\infty$, so continuity from above gives $m(C)=\\lim_{n\\to\\infty} m(C_n)=0$.\n\n**Infinitely many points.** Call a point an endpoint at stage $n$ if it is an endpoint of one of the intervals making up $C_n$.\n\n*Lemma.* If $x$ is an endpoint at stage $n$, then $x$ is an endpoint at stage $n+1$, and so $x\\in C_m$ for all $m\\ge n$.\n\n*Proof.* Let $x$ be an endpoint of the interval $[a,b]$ of $C_n$. When $[a,b]$ is trisected, the remaining pieces are\n\n$$\n\\left[a,\\thinspace a+\\tfrac{b-a}{3}\\right] \\quad\\text{and}\\quad \\left[b-\\tfrac{b-a}{3},\\thinspace b\\right].\n$$\n\nThe point $a$ is the left endpoint of the first piece and $b$ is the right endpoint of the second, so whichever of them $x$ is, it is still an endpoint at stage $n+1$. Induction on $m$ finishes the argument. $\\square$\n\nNow consider the points $x_n=3^{-n}$ for $n\\ge 0$. The point $x_n$ is the right endpoint of the interval $[0,3^{-n}]$, which belongs to $C_n$. This holds because $[0,3^{-k}]$ is the left third of $[0,3^{-k+1}]$, so it survives each stage. By the lemma, $x_n\\in C_m$ for all $m\\ge n$. For $m<n$ we have\n\n$$\nx_n\\in[0,3^{-n}]\\subseteq[0,3^{-m}]\\subseteq C_m.\n$$\n\nTherefore $x_n\\in C_m$ for every $m$, that is, $x_n\\in C$. The numbers $1,\\tfrac13,\\tfrac19,\\dots$ are pairwise distinct, so $C$ contains infinitely many points. $\\blacksquare$\n\n**Remark (far more than infinitely many).** For each sequence $\\varepsilon=(\\varepsilon_k)_{k\\ge1}$ with $\\varepsilon_k\\in\\lbrace 0,1\\rbrace$, define\n\n$$\nf(\\varepsilon)=\\sum_{k=1}^{\\infty} 2\\varepsilon_k\\thinspace 3^{-k}.\n$$\n\nEvery such sum lies in $C$, because its ternary digits are all $0$ or $2$, and so it never falls in a removed middle third. Distinct sequences give distinct sums: if two sequences first differ at index $k$, then the sums differ by at least\n\n$$\n2\\cdot 3^{-k}-\\sum_{j>k}2\\cdot 3^{-j}=3^{-k}>0.\n$$\n\nSo $f$ is an injection from $\\lbrace 0,1\\rbrace^{\\mathbb N}$, a set of cardinality $2^{\\aleph_0}$, into $C$. The Cantor set is therefore uncountable, even though it has measure zero.","content_html":"<blockquote class=\"blyg-transclusion blyg-partial\" data-blyg-id=\"09may6xg0m07gbe18st4jm6pxm\" data-blyg-version=\"2\" data-blyg-origin=\"https://venkateshrao.com/blyg/\">\n<p>Blygger Studio 0.62.0 can write mathematics. Put TeX between dollar signs and it publishes as MathML, which every current browser draws: no script, no stylesheet and no font travels with the page.</p>\n</blockquote>\n<p><em>UPDATE: now blyg studio 0.62.0 and we're cooking.</em></p>\n<p>Oooh this might be fun for sharing out problems of a new ai native sort in the spirit of project euler? Or fermi gym? I will cogitate.</p>\n<p>First, I would have thought the test environment would be less than or equal to zero for this function, which is mathematically equivalent though more on brand :P</p>\n<p><math display=\"block\" class=\"tml-display\"><semantics><mrow><mi>|</mi><mi>x</mi><mi>|</mi><mo>=</mo><mrow><mo fence=\"true\" form=\"prefix\" stretchy=\"true\">{</mo><mtable><mtr><mtd class=\"tml-left\"><mrow><mo form=\"prefix\" stretchy=\"false\">−</mo><mi>x</mi></mrow></mtd><mtd class=\"tml-left\"><mrow><mtext>if </mtext><mi>x</mi><mo>≤</mo><mn>0</mn></mrow></mtd></mtr><mtr><mtd class=\"tml-left\"><mi>x</mi></mtd><mtd class=\"tml-left\"><mrow><mtext>if </mtext><mi>x</mi><mo>&gt;</mo><mn>0</mn></mrow></mtd></mtr></mtable><mo fence=\"true\" form=\"postfix\" stretchy=\"true\"></mo></mrow></mrow><annotation encoding=\"application/x-tex\">\n|x| = \\begin{cases} -x &amp; \\text{if } x \\le 0 \\\\ x &amp; \\text{if } x &gt; 0 \\end{cases}\n</annotation></semantics></math></p>\n<p>Second, I cannot resist an opportunity to share about the Cantor Set.</p>\n<hr>\n<h3>Cantor Set: the infinite void, a Grand Canyon's worth of majesty, where out of nothing emerges everything</h3>\n<p><strong>Claim.</strong> The Cantor set <math><semantics><mi>C</mi><annotation encoding=\"application/x-tex\">C</annotation></semantics></math> has Lebesgue measure <math><semantics><mrow><mi>m</mi><mrow><mo fence=\"true\" form=\"prefix\" stretchy=\"false\">(</mo><mi>C</mi><mo fence=\"true\" form=\"postfix\" stretchy=\"false\">)</mo></mrow><mo>=</mo><mn>0</mn></mrow><annotation encoding=\"application/x-tex\">m(C)=0</annotation></semantics></math>, and yet <math><semantics><mi>C</mi><annotation encoding=\"application/x-tex\">C</annotation></semantics></math> contains infinitely many points.</p>\n<p><strong>Construction.</strong> Let <math><semantics><mrow><msub><mi>C</mi><mn>0</mn></msub><mo>=</mo><mrow><mo fence=\"true\" form=\"prefix\" stretchy=\"false\">[</mo><mn>0,1</mn><mo fence=\"true\" form=\"postfix\" stretchy=\"false\">]</mo></mrow></mrow><annotation encoding=\"application/x-tex\">C_0=[0,1]</annotation></semantics></math>. Given <math><semantics><msub><mi>C</mi><mi>n</mi></msub><annotation encoding=\"application/x-tex\">C_n</annotation></semantics></math>, a union of disjoint closed intervals, form <math><semantics><msub><mi>C</mi><mrow><mi>n</mi><mo>+</mo><mn>1</mn></mrow></msub><annotation encoding=\"application/x-tex\">C_{n+1}</annotation></semantics></math> by deleting the open middle third of each interval. Put <math><semantics><mrow><mi>C</mi><mo>=</mo><msub><mo movablelimits=\"false\">⋂</mo><mrow><mi>n</mi><mo>≥</mo><mn>0</mn></mrow></msub><msub><mi>C</mi><mi>n</mi></msub></mrow><annotation encoding=\"application/x-tex\">C=\\bigcap_{n\\ge 0} C_n</annotation></semantics></math>.</p>\n<p><strong>Measure zero.</strong> By induction, <math><semantics><msub><mi>C</mi><mi>n</mi></msub><annotation encoding=\"application/x-tex\">C_n</annotation></semantics></math> is a union of <math><semantics><msup><mn>2</mn><mi>n</mi></msup><annotation encoding=\"application/x-tex\">2^n</annotation></semantics></math> disjoint closed intervals, each of length <math><semantics><msup><mn>3</mn><mrow><mo form=\"prefix\" stretchy=\"false\" lspace=\"0em\" rspace=\"0em\">−</mo><mi>n</mi></mrow></msup><annotation encoding=\"application/x-tex\">3^{-n}</annotation></semantics></math>. Indeed, <math><semantics><msub><mi>C</mi><mn>0</mn></msub><annotation encoding=\"application/x-tex\">C_0</annotation></semantics></math> is one interval of length <math><semantics><mrow><mn>1</mn><mo>=</mo><msup><mn>3</mn><mn>0</mn></msup></mrow><annotation encoding=\"application/x-tex\">1=3^0</annotation></semantics></math>, and trisecting an interval of length <math><semantics><msup><mn>3</mn><mrow><mo form=\"prefix\" stretchy=\"false\" lspace=\"0em\" rspace=\"0em\">−</mo><mi>n</mi></mrow></msup><annotation encoding=\"application/x-tex\">3^{-n}</annotation></semantics></math> leaves two intervals of length <math><semantics><msup><mn>3</mn><mrow><mo form=\"prefix\" stretchy=\"false\" lspace=\"0em\" rspace=\"0em\">−</mo><mi>n</mi><mo>−</mo><mn>1</mn></mrow></msup><annotation encoding=\"application/x-tex\">3^{-n-1}</annotation></semantics></math>. Hence</p>\n<p><math display=\"block\" class=\"tml-display\"><semantics><mrow><mi>m</mi><mrow><mo fence=\"true\" form=\"prefix\" stretchy=\"false\">(</mo><msub><mi>C</mi><mi>n</mi></msub><mo fence=\"true\" form=\"postfix\" stretchy=\"false\">)</mo></mrow><mo>=</mo><msup><mn>2</mn><mi>n</mi></msup><mo>⋅</mo><msup><mn>3</mn><mrow><mo form=\"prefix\" stretchy=\"false\" lspace=\"0em\" rspace=\"0em\">−</mo><mi>n</mi></mrow></msup><mo>=</mo><msup><mrow><mo fence=\"true\" form=\"prefix\" stretchy=\"true\">(</mo><mstyle displaystyle=\"false\" scriptlevel=\"0\"><mfrac><mn>2</mn><mn>3</mn></mfrac></mstyle><mo fence=\"true\" form=\"postfix\" stretchy=\"true\">)</mo></mrow><mi>n</mi></msup><mi>.</mi></mrow><annotation encoding=\"application/x-tex\">\nm(C_n)=2^n\\cdot 3^{-n}=\\left(\\tfrac{2}{3}\\right)^n.\n</annotation></semantics></math></p>\n<p>Since <math><semantics><mrow><mi>C</mi><mo>⊆</mo><msub><mi>C</mi><mi>n</mi></msub></mrow><annotation encoding=\"application/x-tex\">C\\subseteq C_n</annotation></semantics></math> for every <math><semantics><mi>n</mi><annotation encoding=\"application/x-tex\">n</annotation></semantics></math>, monotonicity of measure gives</p>\n<p><math display=\"block\" class=\"tml-display\"><semantics><mrow><mn>0</mn><mo>≤</mo><mi>m</mi><mrow><mo fence=\"true\" form=\"prefix\" stretchy=\"false\">(</mo><mi>C</mi><mo fence=\"true\" form=\"postfix\" stretchy=\"false\">)</mo></mrow><mo>≤</mo><msup><mrow><mo fence=\"true\" form=\"prefix\" stretchy=\"true\">(</mo><mstyle displaystyle=\"false\" scriptlevel=\"0\"><mfrac><mn>2</mn><mn>3</mn></mfrac></mstyle><mo fence=\"true\" form=\"postfix\" stretchy=\"true\">)</mo></mrow><mi>n</mi></msup><mspace width=\"1em\"></mspace><mtext>for every </mtext><mi>n</mi><mi>.</mi></mrow><annotation encoding=\"application/x-tex\">\n0\\le m(C)\\le \\left(\\tfrac{2}{3}\\right)^n \\quad\\text{for every } n.\n</annotation></semantics></math></p>\n<p>Because <math><semantics><mrow><msup><mrow><mo fence=\"true\" form=\"prefix\" stretchy=\"true\">(</mo><mstyle displaystyle=\"false\" scriptlevel=\"0\"><mfrac><mn>2</mn><mn>3</mn></mfrac></mstyle><mo fence=\"true\" form=\"postfix\" stretchy=\"true\">)</mo></mrow><mi>n</mi></msup><mo>→</mo><mn>0</mn></mrow><annotation encoding=\"application/x-tex\">\\left(\\tfrac{2}{3}\\right)^n\\to 0</annotation></semantics></math> as <math><semantics><mrow><mi>n</mi><mo>→</mo><mi>∞</mi></mrow><annotation encoding=\"application/x-tex\">n\\to\\infty</annotation></semantics></math>, we conclude that <math><semantics><mrow><mi>m</mi><mrow><mo fence=\"true\" form=\"prefix\" stretchy=\"false\">(</mo><mi>C</mi><mo fence=\"true\" form=\"postfix\" stretchy=\"false\">)</mo></mrow><mo>=</mo><mn>0</mn></mrow><annotation encoding=\"application/x-tex\">m(C)=0</annotation></semantics></math>. Equivalently, the sets <math><semantics><msub><mi>C</mi><mi>n</mi></msub><annotation encoding=\"application/x-tex\">C_n</annotation></semantics></math> decrease and <math><semantics><mrow><mi>m</mi><mrow><mo fence=\"true\" form=\"prefix\" stretchy=\"false\">(</mo><msub><mi>C</mi><mn>0</mn></msub><mo fence=\"true\" form=\"postfix\" stretchy=\"false\">)</mo></mrow><mo>&lt;</mo><mi>∞</mi></mrow><annotation encoding=\"application/x-tex\">m(C_0)&lt;\\infty</annotation></semantics></math>, so continuity from above gives <math><semantics><mrow><mi>m</mi><mrow><mo fence=\"true\" form=\"prefix\" stretchy=\"false\">(</mo><mi>C</mi><mo fence=\"true\" form=\"postfix\" stretchy=\"false\">)</mo></mrow><mo>=</mo><msub><mi>lim</mi><mrow><mi>n</mi><mo>→</mo><mi>∞</mi></mrow></msub><mo>⁡</mo><mspace width=\"0.1667em\"></mspace><mi>m</mi><mrow><mo fence=\"true\" form=\"prefix\" stretchy=\"false\">(</mo><msub><mi>C</mi><mi>n</mi></msub><mo fence=\"true\" form=\"postfix\" stretchy=\"false\">)</mo></mrow><mo>=</mo><mn>0</mn></mrow><annotation encoding=\"application/x-tex\">m(C)=\\lim_{n\\to\\infty} m(C_n)=0</annotation></semantics></math>.</p>\n<p><strong>Infinitely many points.</strong> Call a point an endpoint at stage <math><semantics><mi>n</mi><annotation encoding=\"application/x-tex\">n</annotation></semantics></math> if it is an endpoint of one of the intervals making up <math><semantics><msub><mi>C</mi><mi>n</mi></msub><annotation encoding=\"application/x-tex\">C_n</annotation></semantics></math>.</p>\n<p><em>Lemma.</em> If <math><semantics><mi>x</mi><annotation encoding=\"application/x-tex\">x</annotation></semantics></math> is an endpoint at stage <math><semantics><mi>n</mi><annotation encoding=\"application/x-tex\">n</annotation></semantics></math>, then <math><semantics><mi>x</mi><annotation encoding=\"application/x-tex\">x</annotation></semantics></math> is an endpoint at stage <math><semantics><mrow><mi>n</mi><mo>+</mo><mn>1</mn></mrow><annotation encoding=\"application/x-tex\">n+1</annotation></semantics></math>, and so <math><semantics><mrow><mi>x</mi><mo>∈</mo><msub><mi>C</mi><mi>m</mi></msub></mrow><annotation encoding=\"application/x-tex\">x\\in C_m</annotation></semantics></math> for all <math><semantics><mrow><mi>m</mi><mo>≥</mo><mi>n</mi></mrow><annotation encoding=\"application/x-tex\">m\\ge n</annotation></semantics></math>.</p>\n<p><em>Proof.</em> Let <math><semantics><mi>x</mi><annotation encoding=\"application/x-tex\">x</annotation></semantics></math> be an endpoint of the interval <math><semantics><mrow><mo fence=\"true\" form=\"prefix\" stretchy=\"false\">[</mo><mi>a</mi><mo separator=\"true\">,</mo><mi>b</mi><mo fence=\"true\" form=\"postfix\" stretchy=\"false\">]</mo></mrow><annotation encoding=\"application/x-tex\">[a,b]</annotation></semantics></math> of <math><semantics><msub><mi>C</mi><mi>n</mi></msub><annotation encoding=\"application/x-tex\">C_n</annotation></semantics></math>. When <math><semantics><mrow><mo fence=\"true\" form=\"prefix\" stretchy=\"false\">[</mo><mi>a</mi><mo separator=\"true\">,</mo><mi>b</mi><mo fence=\"true\" form=\"postfix\" stretchy=\"false\">]</mo></mrow><annotation encoding=\"application/x-tex\">[a,b]</annotation></semantics></math> is trisected, the remaining pieces are</p>\n<p><math display=\"block\" class=\"tml-display\"><semantics><mrow><mrow><mo fence=\"true\" form=\"prefix\" stretchy=\"true\">[</mo><mi>a</mi><mo separator=\"true\">,</mo><mspace width=\"0.1667em\"></mspace><mi>a</mi><mo>+</mo><mstyle displaystyle=\"false\" scriptlevel=\"0\"><mfrac><mrow><mi>b</mi><mo>−</mo><mi>a</mi></mrow><mn>3</mn></mfrac></mstyle><mo fence=\"true\" form=\"postfix\" stretchy=\"true\">]</mo></mrow><mspace width=\"1em\"></mspace><mtext>and</mtext><mspace width=\"1em\"></mspace><mrow><mo fence=\"true\" form=\"prefix\" stretchy=\"true\">[</mo><mi>b</mi><mo>−</mo><mstyle displaystyle=\"false\" scriptlevel=\"0\"><mfrac><mrow><mi>b</mi><mo>−</mo><mi>a</mi></mrow><mn>3</mn></mfrac></mstyle><mo separator=\"true\">,</mo><mspace width=\"0.1667em\"></mspace><mi>b</mi><mo fence=\"true\" form=\"postfix\" stretchy=\"true\">]</mo></mrow><mi>.</mi></mrow><annotation encoding=\"application/x-tex\">\n\\left[a,\\thinspace a+\\tfrac{b-a}{3}\\right] \\quad\\text{and}\\quad \\left[b-\\tfrac{b-a}{3},\\thinspace b\\right].\n</annotation></semantics></math></p>\n<p>The point <math><semantics><mi>a</mi><annotation encoding=\"application/x-tex\">a</annotation></semantics></math> is the left endpoint of the first piece and <math><semantics><mi>b</mi><annotation encoding=\"application/x-tex\">b</annotation></semantics></math> is the right endpoint of the second, so whichever of them <math><semantics><mi>x</mi><annotation encoding=\"application/x-tex\">x</annotation></semantics></math> is, it is still an endpoint at stage <math><semantics><mrow><mi>n</mi><mo>+</mo><mn>1</mn></mrow><annotation encoding=\"application/x-tex\">n+1</annotation></semantics></math>. Induction on <math><semantics><mi>m</mi><annotation encoding=\"application/x-tex\">m</annotation></semantics></math> finishes the argument. <math><semantics><mi>□</mi><annotation encoding=\"application/x-tex\">\\square</annotation></semantics></math></p>\n<p>Now consider the points <math><semantics><mrow><msub><mi>x</mi><mi>n</mi></msub><mo>=</mo><msup><mn>3</mn><mrow><mo form=\"prefix\" stretchy=\"false\" lspace=\"0em\" rspace=\"0em\">−</mo><mi>n</mi></mrow></msup></mrow><annotation encoding=\"application/x-tex\">x_n=3^{-n}</annotation></semantics></math> for <math><semantics><mrow><mi>n</mi><mo>≥</mo><mn>0</mn></mrow><annotation encoding=\"application/x-tex\">n\\ge 0</annotation></semantics></math>. The point <math><semantics><msub><mi>x</mi><mi>n</mi></msub><annotation encoding=\"application/x-tex\">x_n</annotation></semantics></math> is the right endpoint of the interval <math><semantics><mrow><mo fence=\"true\" form=\"prefix\" stretchy=\"false\">[</mo><mn>0</mn><mo separator=\"true\">,</mo><msup><mn>3</mn><mrow><mo form=\"prefix\" stretchy=\"false\" lspace=\"0em\" rspace=\"0em\">−</mo><mi>n</mi></mrow></msup><mo fence=\"true\" form=\"postfix\" stretchy=\"false\">]</mo></mrow><annotation encoding=\"application/x-tex\">[0,3^{-n}]</annotation></semantics></math>, which belongs to <math><semantics><msub><mi>C</mi><mi>n</mi></msub><annotation encoding=\"application/x-tex\">C_n</annotation></semantics></math>. This holds because <math><semantics><mrow><mo fence=\"true\" form=\"prefix\" stretchy=\"false\">[</mo><mn>0</mn><mo separator=\"true\">,</mo><msup><mn>3</mn><mrow><mo form=\"prefix\" stretchy=\"false\" lspace=\"0em\" rspace=\"0em\">−</mo><mi>k</mi></mrow></msup><mo fence=\"true\" form=\"postfix\" stretchy=\"false\">]</mo></mrow><annotation encoding=\"application/x-tex\">[0,3^{-k}]</annotation></semantics></math> is the left third of <math><semantics><mrow><mo fence=\"true\" form=\"prefix\" stretchy=\"false\">[</mo><mn>0</mn><mo separator=\"true\">,</mo><msup><mn>3</mn><mrow><mo form=\"prefix\" stretchy=\"false\" lspace=\"0em\" rspace=\"0em\">−</mo><mi>k</mi><mo>+</mo><mn>1</mn></mrow></msup><mo fence=\"true\" form=\"postfix\" stretchy=\"false\">]</mo></mrow><annotation encoding=\"application/x-tex\">[0,3^{-k+1}]</annotation></semantics></math>, so it survives each stage. By the lemma, <math><semantics><mrow><msub><mi>x</mi><mi>n</mi></msub><mo>∈</mo><msub><mi>C</mi><mi>m</mi></msub></mrow><annotation encoding=\"application/x-tex\">x_n\\in C_m</annotation></semantics></math> for all <math><semantics><mrow><mi>m</mi><mo>≥</mo><mi>n</mi></mrow><annotation encoding=\"application/x-tex\">m\\ge n</annotation></semantics></math>. For <math><semantics><mrow><mi>m</mi><mo>&lt;</mo><mi>n</mi></mrow><annotation encoding=\"application/x-tex\">m&lt;n</annotation></semantics></math> we have</p>\n<p><math display=\"block\" class=\"tml-display\"><semantics><mrow><msub><mi>x</mi><mi>n</mi></msub><mo>∈</mo><mrow><mo fence=\"true\" form=\"prefix\" stretchy=\"false\">[</mo><mn>0</mn><mo separator=\"true\">,</mo><msup><mn>3</mn><mrow><mo form=\"prefix\" stretchy=\"false\" lspace=\"0em\" rspace=\"0em\">−</mo><mi>n</mi></mrow></msup><mo fence=\"true\" form=\"postfix\" stretchy=\"false\">]</mo></mrow><mo>⊆</mo><mrow><mo fence=\"true\" form=\"prefix\" stretchy=\"false\">[</mo><mn>0</mn><mo separator=\"true\">,</mo><msup><mn>3</mn><mrow><mo form=\"prefix\" stretchy=\"false\" lspace=\"0em\" rspace=\"0em\">−</mo><mi>m</mi></mrow></msup><mo fence=\"true\" form=\"postfix\" stretchy=\"false\">]</mo></mrow><mo>⊆</mo><msub><mi>C</mi><mi>m</mi></msub><mi>.</mi></mrow><annotation encoding=\"application/x-tex\">\nx_n\\in[0,3^{-n}]\\subseteq[0,3^{-m}]\\subseteq C_m.\n</annotation></semantics></math></p>\n<p>Therefore <math><semantics><mrow><msub><mi>x</mi><mi>n</mi></msub><mo>∈</mo><msub><mi>C</mi><mi>m</mi></msub></mrow><annotation encoding=\"application/x-tex\">x_n\\in C_m</annotation></semantics></math> for every <math><semantics><mi>m</mi><annotation encoding=\"application/x-tex\">m</annotation></semantics></math>, that is, <math><semantics><mrow><msub><mi>x</mi><mi>n</mi></msub><mo>∈</mo><mi>C</mi></mrow><annotation encoding=\"application/x-tex\">x_n\\in C</annotation></semantics></math>. The numbers <math><semantics><mrow><mn>1</mn><mo separator=\"true\">,</mo><mstyle displaystyle=\"false\" scriptlevel=\"0\"><mfrac><mn>1</mn><mn>3</mn></mfrac></mstyle><mo separator=\"true\">,</mo><mstyle displaystyle=\"false\" scriptlevel=\"0\"><mfrac><mn>1</mn><mn>9</mn></mfrac></mstyle><mo separator=\"true\">,</mo><mi>…</mi></mrow><annotation encoding=\"application/x-tex\">1,\\tfrac13,\\tfrac19,\\dots</annotation></semantics></math> are pairwise distinct, so <math><semantics><mi>C</mi><annotation encoding=\"application/x-tex\">C</annotation></semantics></math> contains infinitely many points. <math><semantics><mi>■</mi><annotation encoding=\"application/x-tex\">\\blacksquare</annotation></semantics></math></p>\n<p><strong>Remark (far more than infinitely many).</strong> For each sequence <math><semantics><mrow><mi>ε</mi><mo>=</mo><msub><mrow><mo fence=\"true\" form=\"prefix\" stretchy=\"false\">(</mo><msub><mi>ε</mi><mi>k</mi></msub><mo fence=\"true\" form=\"postfix\" stretchy=\"false\">)</mo></mrow><mrow><mi>k</mi><mo>≥</mo><mn>1</mn></mrow></msub></mrow><annotation encoding=\"application/x-tex\">\\varepsilon=(\\varepsilon_k)_{k\\ge1}</annotation></semantics></math> with <math><semantics><mrow><msub><mi>ε</mi><mi>k</mi></msub><mo>∈</mo><mrow><mo fence=\"true\" form=\"prefix\" stretchy=\"false\">{</mo><mn>0,1</mn><mo fence=\"true\" form=\"postfix\" stretchy=\"false\">}</mo></mrow></mrow><annotation encoding=\"application/x-tex\">\\varepsilon_k\\in\\lbrace 0,1\\rbrace</annotation></semantics></math>, define</p>\n<p><math display=\"block\" class=\"tml-display\"><semantics><mrow><mi>f</mi><mrow><mo fence=\"true\" form=\"prefix\" stretchy=\"false\">(</mo><mi>ε</mi><mo fence=\"true\" form=\"postfix\" stretchy=\"false\">)</mo></mrow><mo>=</mo><mrow><munderover><mo movablelimits=\"false\">∑</mo><mrow><mi>k</mi><mo>=</mo><mn>1</mn></mrow><mi>∞</mi></munderover></mrow><mn>2</mn><msub><mi>ε</mi><mi>k</mi></msub><mspace width=\"0.1667em\"></mspace><msup><mn>3</mn><mrow><mo form=\"prefix\" stretchy=\"false\" lspace=\"0em\" rspace=\"0em\">−</mo><mi>k</mi></mrow></msup><mi>.</mi></mrow><annotation encoding=\"application/x-tex\">\nf(\\varepsilon)=\\sum_{k=1}^{\\infty} 2\\varepsilon_k\\thinspace 3^{-k}.\n</annotation></semantics></math></p>\n<p>Every such sum lies in <math><semantics><mi>C</mi><annotation encoding=\"application/x-tex\">C</annotation></semantics></math>, because its ternary digits are all <math><semantics><mn>0</mn><annotation encoding=\"application/x-tex\">0</annotation></semantics></math> or <math><semantics><mn>2</mn><annotation encoding=\"application/x-tex\">2</annotation></semantics></math>, and so it never falls in a removed middle third. Distinct sequences give distinct sums: if two sequences first differ at index <math><semantics><mi>k</mi><annotation encoding=\"application/x-tex\">k</annotation></semantics></math>, then the sums differ by at least</p>\n<p><math display=\"block\" class=\"tml-display\"><semantics><mrow><mn>2</mn><mo>⋅</mo><msup><mn>3</mn><mrow><mo form=\"prefix\" stretchy=\"false\" lspace=\"0em\" rspace=\"0em\">−</mo><mi>k</mi></mrow></msup><mo>−</mo><mrow><munder><mo movablelimits=\"false\">∑</mo><mrow><mi>j</mi><mo>&gt;</mo><mi>k</mi></mrow></munder></mrow><mn>2</mn><mo>⋅</mo><msup><mn>3</mn><mrow><mo form=\"prefix\" stretchy=\"false\" lspace=\"0em\" rspace=\"0em\">−</mo><mi>j</mi></mrow></msup><mo>=</mo><msup><mn>3</mn><mrow><mo form=\"prefix\" stretchy=\"false\" lspace=\"0em\" rspace=\"0em\">−</mo><mi>k</mi></mrow></msup><mo>&gt;</mo><mn>0.</mn></mrow><annotation encoding=\"application/x-tex\">\n2\\cdot 3^{-k}-\\sum_{j&gt;k}2\\cdot 3^{-j}=3^{-k}&gt;0.\n</annotation></semantics></math></p>\n<p>So <math><semantics><mi>f</mi><annotation encoding=\"application/x-tex\">f</annotation></semantics></math> is an injection from <math><semantics><msup><mrow><mo fence=\"true\" form=\"prefix\" stretchy=\"false\">{</mo><mn>0,1</mn><mo fence=\"true\" form=\"postfix\" stretchy=\"false\">}</mo></mrow><mi>ℕ</mi></msup><annotation encoding=\"application/x-tex\">\\lbrace 0,1\\rbrace^{\\mathbb N}</annotation></semantics></math>, a set of cardinality <math><semantics><msup><mn>2</mn><msub><mi>ℵ</mi><mn>0</mn></msub></msup><annotation encoding=\"application/x-tex\">2^{\\aleph_0}</annotation></semantics></math>, into <math><semantics><mi>C</mi><annotation encoding=\"application/x-tex\">C</annotation></semantics></math>. The Cantor set is therefore uncountable, even though it has measure zero.</p>\n","content_hash":"sha256:c082ca11578863e37bed120edef7e724986333b7d9e8a07c4f544bc1b7278de3","media":[],"transclusions":[{"id":"09may6xg0m07gbe18st4jm6pxm","version":2,"origin":"https://venkateshrao.com/blyg/","selector":{"exact":"Blygger Studio 0.62.0 can write mathematics. Put TeX between dollar signs and it publishes as MathML, which every current browser draws: no script, no stylesheet and no font travels with the page.","prefix":"possible.\nMathematics on a Blyg\n","suffix":" This post is itself the demonst"},"cited":{"source":"Venkatesh Rao's Blyg","author":"Venkatesh Rao","excerpt":"Very pleased to get this done in studio. A vendored (MIT license) dependency but…","url":"https://venkateshrao.com/blyg/t/09may6xg0m07gbe18st4jm6pxm/","retrieved":"2026-11-17T06:02:08Z"}}],"changelog":[{"version":1,"at":"2026-11-17T05:28:23Z","note":null},{"version":2,"at":"2026-11-17T05:30:49Z","note":"Removed the preamble about Blygger Studio and reformatted several inline equations as displayed equations for clarity. Reorganized the proof that $x_n$ belongs to $C$, and replaced the brief statement about ternary uniqueness with a detailed calculation showing that distinct sequences yield distinct sums.","generated":true},{"version":3,"at":"2026-11-17T05:34:56Z","note":"Added thin spaces around commas in display equations for better typographic spacing, and replaced curly braces with LaTeX brace commands in the remark section.","generated":true},{"version":4,"at":"2026-11-17T05:41:00Z","note":"Completed the remark section by adding the formula for f(ε) and the proof that the Cantor set is uncountable, explaining how distinct binary sequences map to distinct points in C.","generated":true},{"version":5,"at":"2026-11-17T05:44:37Z","note":"Removed an internal note about software requirements that was not intended for readers.","generated":true},{"version":6,"at":"2026-11-17T06:02:08Z","note":"Added an introductory section with a note about absolute value notation and a poetic subtitle for the Cantor Set section, then reorganized the mathematical content under that new heading.","generated":true}]}