diff 763cb89..6fbd3ac landau_siegel_zero_exclusion_v2.txt
diff --git a/landau_siegel_zero_exclusion_v2.txt b/landau_siegel_zero_exclusion_v2.txt
index 2279d2c..5f33e4e 100644
--- a/landau_siegel_zero_exclusion_v2.txt
+++ b/landau_siegel_zero_exclusion_v2.txt
@@ -186,7 +186,7 @@ bounded neighborhood of the compact set K holds only finitely many lattice
points. Let y in K be nearest to m and put h = m - y. The equality h = 0
would put m in K cap Z^4, where R(A m) = 0 by (2), so h != 0.
-For every x in K the nearest-point inequality gives h . (x - y) <= 0.
+For every x in K the nearest-point ineuality gives h . (x - y) <= 0.
Writing x = 4w with w in P gives h . (w - y/4) <= 0 for every w in P, so
y/4 lies on the supporting face
@@ -267,8 +267,8 @@ T_1 T_2 T_3 = 32^3 N^4. In particular t_j >= 3(N - 1), and
>= T_1 T_2 T_3 / 8
= 4096 N^4 > (4N - 3)^4.
-The strict inequality on the first line holds because t_j > T_j - 1, and the
-middle inequality holds because T_j - 3(N - 1) >= T_j / 2, which follows from
+The strict ineuality on the first line holds because t_j > T_j - 1, and the
+middle ineuality holds because T_j - 3(N - 1) >= T_j / 2, which follows from
T_j >= 6(N - 1). Lemma two applied to the monomial basis of P_t gives the
corollary.
@@ -359,7 +359,7 @@ M = k Q_0 + r with 0 <= r < Q_0,
= Q_0 k(k - 1)/2 + k r.
The right side minus (M^2/(2 Q_0) - M/2) equals r(Q_0 - r)/(2 Q_0), which is
-nonnegative, so S_1 >= M^2/(2 Q_0) - M/2. For fixed H the inequality
+nonnegative, so S_1 >= M^2/(2 Q_0) - M/2. For fixed H the ineuality
M >= 2 Q_0 holds once H^(2/3) N^(4/3) >= 2 * 97^2, and then
M^2/(2 Q_0) - M/2 >= M^2/(4 Q_0). Therefore, uniformly in the field,
@@ -384,7 +384,7 @@ Indeed nu(a) has modulus sqrt|d| <= sqrt q and nu(b) has modulus sqrt 2, and
the four monomials n_1, n_2 nu(a), n_3 nu(b), n_4 nu(a) nu(b) are each at most
(N - 1) times the corresponding product of moduli. Each row indexed by a has
Euclidean norm at most sqrt(M) (8 N sqrt q)^(a1 + a2 + a3) at every embedding.
-Hadamard's inequality over the M rows and the four embeddings gives
+Hadamard's ineuality over the M rows and the four embeddings gives
(1/4) log|Norm(Delta)|
<= (M/2) log M + (S_1 + S_2) (log N + (1/2) ell + log 8). (upper)
@@ -437,7 +437,7 @@ primes are distinct and Norm(Delta) is a nonzero integer, so
>= S_1 sum over admissible p <= U of (log p) / p
- M sum over p <= U of log p.
-The second inequality uses floor(x) >= x - 1 in each row. Chebyshev's bound
+The second ineuality uses floor(x) >= x - 1 in each row. Chebyshev's bound
sum over p <= U of log p << U, together with Lemma one at X = U, gives
(1/4) log|Norm(Delta)|