cronokirby

Misc 0

This post has a lot of interesting information about green threads:

https://graphitemaster.github.io/fibers/

I kind of like the idea of using green threads for Iku, that programming language I've been wanting to work on for a while. The implementation of this seems a bit complicated though.

Topological Groups

If GG is a Topological Group, then the connected component CC containing the identity ee is a normal subgroup of GG.

First, note that for any g∈Gg \in G, gCgC is also a connected component. If gx,gy∈gCgx, gy \in gC, then x,y∈Cx, y \in C. This means they share a connected subspace AA. The image gAgA is also a connected subspace, since the action of gg is a continuous function. Evidently, gAgA contains gxgx and gygy. This means that any two points of gCgC share a connected subspace.

A similar proof shows that CgCg is also a connected component.

It's easy to see that CC is a subgroup.

First, e∈Ce \in C, by assumption.

Second, we need to show that a,b∈C⟹ab−1∈Ca, b \in C \implies ab^{-1} \in C. Because e∈Ce \in C, we have ab−1∈ab−1Cab^{-1} \in ab^{-1}C. Since a=ab−1ba = ab^{-1}b, and b∈Cb \in C, we have a∈ab−1Ca \in ab^{-1}C as well. But since ab−1Cab^{-1}C is a connected component, i.e. equivalence class, and it contains aa, it must be equal to CC, since CC is an equivalence class containining aa. Since ab−1C=Cab^{-1}C = C, ab−1ab^{-1} must be in CC.

To see that CC is normal, we show that gC=CggC = Cg. For this, note that gCgC and CgCg are both connected components, as we showed earlier. But, since they both contain gg, they must be equal.

□\square

Font Rendering

For some reason I've gotten somewhat curious about font rendering as a potential project. It falls under the "software I use without really understanding, for sure".

Here's some links I got on Discord:

https://gankra.github.io/blah/text-hates-you/ https://crates.io/crates/fontdue