RSS ⧉

Pioneering Spirit (Blyg)

PAtwater

Some quick biographical context: 38, male, So Cal born, bred and still belong here, stereotypically spent a couple stints in the Bay / NYC / DC (also Philly!), once drove from Cincinnati to LA with a new employee at a crazy indie publishing venture, helped launch the CaDC, married, work as a data sophist of sorts, father of two girls (4 years and 8 months).

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.

from Venkatesh Rao's Blyg ↗ · excerpt of v2

UPDATE: now blyg studio 0.62.0 and we're cooking.

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.

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

|x|={−xif x≤0xif x>0 |x| = \begin{cases} -x & \text{if } x \le 0 \\ x & \text{if } x > 0 \end{cases}

Second, I cannot resist an opportunity to share about the Cantor Set.


Cantor Set: the infinite void, a Grand Canyon's worth of majesty, where out of nothing emerges everything

Claim. The Cantor set CC has Lebesgue measure m(C)=0m(C)=0, and yet CC contains infinitely many points.

Construction. Let C0=[0,1]C_0=[0,1]. Given CnC_n, a union of disjoint closed intervals, form Cn+1C_{n+1} by deleting the open middle third of each interval. Put C=⋂n≥0CnC=\bigcap_{n\ge 0} C_n.

Measure zero. By induction, CnC_n is a union of 2n2^n disjoint closed intervals, each of length 3−n3^{-n}. Indeed, C0C_0 is one interval of length 1=301=3^0, and trisecting an interval of length 3−n3^{-n} leaves two intervals of length 3−n−13^{-n-1}. Hence

m(Cn)=2n⋅3−n=(23)n. m(C_n)=2^n\cdot 3^{-n}=\left(\tfrac{2}{3}\right)^n.

Since C⊆CnC\subseteq C_n for every nn, monotonicity of measure gives

0≤m(C)≤(23)nfor every n. 0\le m(C)\le \left(\tfrac{2}{3}\right)^n \quad\text{for every } n.

Because (23)n→0\left(\tfrac{2}{3}\right)^n\to 0 as n→∞n\to\infty, we conclude that m(C)=0m(C)=0. Equivalently, the sets CnC_n decrease and m(C0)<∞m(C_0)<\infty, so continuity from above gives m(C)=limn→∞⁡m(Cn)=0m(C)=\lim_{n\to\infty} m(C_n)=0.

Infinitely many points. Call a point an endpoint at stage nn if it is an endpoint of one of the intervals making up CnC_n.

Lemma. If xx is an endpoint at stage nn, then xx is an endpoint at stage n+1n+1, and so x∈Cmx\in C_m for all m≥nm\ge n.

Proof. Let xx be an endpoint of the interval [a,b][a,b] of CnC_n. When [a,b][a,b] is trisected, the remaining pieces are

[a,a+b−a3]and[b−b−a3,b]. \left[a,\thinspace a+\tfrac{b-a}{3}\right] \quad\text{and}\quad \left[b-\tfrac{b-a}{3},\thinspace b\right].

The point aa is the left endpoint of the first piece and bb is the right endpoint of the second, so whichever of them xx is, it is still an endpoint at stage n+1n+1. Induction on mm finishes the argument. □\square

Now consider the points xn=3−nx_n=3^{-n} for n≥0n\ge 0. The point xnx_n is the right endpoint of the interval [0,3−n][0,3^{-n}], which belongs to CnC_n. This holds because [0,3−k][0,3^{-k}] is the left third of [0,3−k+1][0,3^{-k+1}], so it survives each stage. By the lemma, xn∈Cmx_n\in C_m for all m≥nm\ge n. For m<nm<n we have

xn∈[0,3−n]⊆[0,3−m]⊆Cm. x_n\in[0,3^{-n}]\subseteq[0,3^{-m}]\subseteq C_m.

Therefore xn∈Cmx_n\in C_m for every mm, that is, xn∈Cx_n\in C. The numbers 1,13,19,…1,\tfrac13,\tfrac19,\dots are pairwise distinct, so CC contains infinitely many points. ■\blacksquare

Remark (far more than infinitely many). For each sequence ε=(εk)k≥1\varepsilon=(\varepsilon_k)_{k\ge1} with εk∈{0,1}\varepsilon_k\in\lbrace 0,1\rbrace, define

f(ε)=∑k=1∞2εk3−k. f(\varepsilon)=\sum_{k=1}^{\infty} 2\varepsilon_k\thinspace 3^{-k}.

Every such sum lies in CC, because its ternary digits are all 00 or 22, and so it never falls in a removed middle third. Distinct sequences give distinct sums: if two sequences first differ at index kk, then the sums differ by at least

2⋅3−k−∑j>k2⋅3−j=3−k>0. 2\cdot 3^{-k}-\sum_{j>k}2\cdot 3^{-j}=3^{-k}>0.

So ff is an injection from {0,1}ℕ\lbrace 0,1\rbrace^{\mathbb N}, a set of cardinality 2ℵ02^{\aleph_0}, into CC. The Cantor set is therefore uncountable, even though it has measure zero.

v6

“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.”

Created: Nov 16, 2026 Most recent: Nov 16, 2026, v6