diff 78b8f82..d214c92 weighted_dilation_totient_fibers_v2.txt
diff --git a/weighted_dilation_totient_fibers_v2.txt b/weighted_dilation_totient_fibers_v2.txt
index 0a2e6ab..4b2484e 100644
--- a/weighted_dilation_totient_fibers_v2.txt
+++ b/weighted_dilation_totient_fibers_v2.txt
@@ -1,25 +1,9 @@
WEIGHTED DILATION GRAPHS, SMOOTH SHIFTED PRIMES, AND TOTIENT FIBERS
-version 2, September 2026.
-a rewrite of weighted_dilation_totient_fibers_original.txt ("v1" below).
-same mathematics, same order of proof, no LaTeX. every theorem is stated
-in full; easy steps are proved completely; hard steps are reduced to a
-list of precise claims that are then proved one by one.
-0. HOW TO READ THIS FILE
-What you need already.
-
- - primes, unique factorization, gcd, congruence modulo m.
- - logarithms, exponents, the phrase "for all sufficiently large x".
- - Euler's phi(n), the number of a in [1,n] coprime to n. It satisfies
- phi(p^a) = p^(a-1)(p-1) and phi(mn) = phi(m)phi(n) when (m,n) = 1.
- - the O(.) and o(.) notation.
- - basic probability: expectation, independence, "pick uniformly".
- - nothing about Dirichlet characters. They appear twice, as bookkeeping
- for residues modulo a small number; each time the use is spelled out.
What x^(1-o(1)) means. A count is x^(1-o(1)) if for every fixed eps > 0
it is at least x^(1-eps) once x is large. It has the full first power of