# Curved graph geometry and neutral words

Original mathematical figure and generator expression: CC0 1.0. No external image, text, font bytes or glyph outlines are incorporated. Installed renderer and viewer fonts retain their terms.

Run `python -B generate.py --output-dir generated`, then `node render.cjs generated` with existing Playwright and Chromium installations. Optional PLAYWRIGHT_MODULE and CHROME_EXECUTABLE select those installations. No runtime is bundled.

Exact proofs: Theorem11BP.1, NK.3–NK.16, Exercises300–302. The neutral compact-word frame count is B_n=M(2n+2)^E. The coordinate strip is theta/(2pi) in [0,1], with its two angular edges identified and t in (0,1), both t-ends omitted. Its metric is dt²+exp(2t²)dtheta², curvature -2-4t², and holonomy shift theta/(2pi) by 1/sqrt(2) modulo one. It is a periodic coordinate picture, not an isometric Euclidean embedding. The full Killing rank is one; the original normal degree is two. The graph construction uses the actual reduced diagonal, completed Cech multiplication and entire physical carrier, with the original full inverse coefficient and Bott +1. Connes's graph-normal question is the human context credited in the lesson.