# Reproduction

*K-theory of the leaf space*, Section11AQ, SL.1–SL.15. The actual JD common reciprocal gives a first logarithm with bounded completed transport differences. An adaptive positive resolvent sum gives compact additive defects, a controlled weighted normal core and the coefficient oscillator phase at C0(Y). The original-unit graph realization remains unproved.

Use Python3.13.9 and Pillow12.2.0. Run python -B draw_slow_transport.py --output-dir out; --resources selects the adjacent labelled-geometric-kernel resources if relocated. Compare PNG/SVG with ../../figures/ and SLOW-TRANSPORT-CHECKS.json with this folder. The shared resources retain the complete font notice, CC0 dedication and Python/Pillow notices; the SVG embeds the unchanged font and notice. No private files are read.

The pair-swap example has exact reciprocal-square order constants4. Its plotted first-log and slow differences are numerical samples of the displayed formulas, rather than interval certificates. The blue samples sum24 positive terms; the omitted tail is at most(log2)/2^24. The green curve is the analytic bound min(log2,4log2/Hm). Compactness and all normal/operator domains are proved in the lesson. The actual generic slow sequence is selected by SL.6; the example is constant in normal directions and uses sn=2^n.