diff 763cb89..6fbd3ac fujita_freeness_v2.txt
diff --git a/fujita_freeness_v2.txt b/fujita_freeness_v2.txt
index 5489007..6ab15a1 100644
--- a/fujita_freeness_v2.txt
+++ b/fujita_freeness_v2.txt
@@ -49,7 +49,7 @@ divisors, is a simple normal crossing divisor: locally a union of
coordinate hyperplanes, which makes every local computation monomial.
The argument has five stages. Failure of generation at x is first
-translated into a strict inequality for how fast sections of large mL
+translated into a strict ineuality for how fast sections of large mL
vanish at x: the normalized mean order of a Taylor basis has lower limit
strictly above n/(n+1), which is a statement about lattice points. Next,
a finite-degree exponential average over bases and weighted orders is
@@ -63,7 +63,7 @@ Fourth, a point-centered minimizer yields rational supporting data on
finitely many polytopes of normalized section orders, from which an
effective ideal and a normal-crossing boundary are built, with exact
equality of boundary coefficient and log discrepancy on a reduced
-divisor over x and strict inequality on every neighbor. Fifth,
+divisor over x and strict ineuality on every neighbor. Fifth,
Kawamata-Viehweg vanishing lifts a nonzero element of the fiber at x from
that divisor, and descent turns the lift into a global section of
K_X+(n+1)L not vanishing at x.
@@ -170,7 +170,7 @@ Proof. Each pulled-back divisor is locally a monomial times a unit,
giving the first equality. The reduced SNC divisor is log canonical: a
logarithmic volume form has at most a simple pole along each prime on a
higher model. So the log discrepancy relative to Y is at least sum u_j;
-adding the order of K_{Y/X} gives the inequality and the claimed
+adding the order of K_{Y/X} gives the ineuality and the claimed
discrepancy of the monomial order. The stratum closure contains the
generic center, so its image contains the original closed center.
@@ -286,7 +286,7 @@ generated at x, then
liminf over j of (1/(j N_j)) * sum_{gamma in H_j} |gamma|_1
> n/(n+1).
-Proof. Failure of the strict inequality will be shown to force
+Proof. Failure of the strict ineuality will be shown to force
generation at x. Three steps: lattice near-equality forces
L^n = 1 along a subsequence; the leading forms on the exceptional
divisor of the blowup at x then have a strict multiplier threshold;
@@ -300,7 +300,7 @@ degree, and using N_j = V j^n / n! + O(j^(n-1)), gives
Indeed the last occupied degree for the N_j smallest lattice points is
V^(1/n) j + O(1), and summing total degree over these points gives mean
degree V^(1/n) n j/(n+1) + O(1). Since V is a positive integer, V^(1/n)
-is at least 1, so if the strict inequality of the proposition fails,
+is at least 1, so if the strict ineuality of the proposition fails,
then necessarily V = 1 and equality holds along a subsequence.
Let Delta = {u in R^n : u >= 0, |u|_1 <= 1}. Along the equality
@@ -348,7 +348,7 @@ vector in ordinary interior. Hence for every nonzero u in R_{>=0}^{n-1},
(1/h) min_l <u, beta_l^(k)> < sum_i u_i.
For a prime order over this chart use its values on the coordinates as
u. The left side is the order of the monomial ideal over h; the right
-side is at most the log discrepancy (SNC inequality of the retraction
+side is at most the log discrepancy (SNC ineuality of the retraction
lemma). So the monomial ideal is klt at coefficient 1/h; computing its
threshold on a log resolution gives a strict threshold > 1/h at every
point. (If u=0 the order is 0 and the discrepancy is positive.)
@@ -477,10 +477,10 @@ Proof. Let F be the projective flag variety; a flag has subspaces
U_i of dimensions i and base ideals b_i, by evaluation after twisting by
-mL. If the list holds, the flag spanned by the first i basis vectors
satisfies v(b_i) >= alpha_i A(v) (because the list is decreasing);
-conversely these inequalities imply the list for every adapted basis.
+conversely these ineualities imply the list for every adapted basis.
If some alpha_i > 0, choose M making M/alpha_i integral for each
positive entry and set a_alpha = sum_{alpha_i>0} b_i^{M/alpha_i}. The
-simultaneous inequalities are equivalent to v(a_alpha) >= M A(v). A
+simultaneous ineualities are equivalent to v(a_alpha) >= M A(v). A
divisorial witness with center containing z exists iff
lct_z(X, a_alpha) <= 1/M,
since the local threshold is computed by a component on a log
@@ -541,7 +541,7 @@ orders are linear in the weights, so tilde_v(s_i) >= q_i for all i.
Set v = a tilde_v. Comparing with the limit objective,
F_{m,t}(v,s) <= (1/N_m) sum_i exp( a/t - a q_i/m ) = f_{m,t}(x).
-The reverse inequality holds by definition of the infimum, so this pair
+The reverse ineuality holds by definition of the infimum, so this pair
attains it. The discrepancy bounds for all minimizers and eventually for
minimizing sequences follow from the uniform sublevel bounds.
@@ -720,7 +720,7 @@ projective trivialization to the local frame is a unit, and a unit has
initial exponent zero. Hence
{0,1}^d is contained in G_0(h_0).
-The cube turns the continuous Brunn-Minkowski inequality into the
+The cube turns the continuous Brunn-Minkowski ineuality into the
discrete statement required. For nonempty finite A and C in Z^d,
(A+[0,1]^d) + (C+[0,1]^d) is contained in A+C+{0,1}^d+[0,1]^d,
and the volume of a finite lattice set thickened by the unit cube is
@@ -798,7 +798,7 @@ Gamma_j, the defining property of f_j therefore gives
Q_j >= N_j f_j exp( -j A(v)/(m t) )
for all sufficiently large j. This comparison happens at x and does not
require the point y to satisfy the specialization bound in degree j; only
-the degree-m variation used that. Combining the displayed inequality
+the degree-m variation used that. Combining the displayed ineuality
with Q_m = N_m f_m exp(-A(v)/t),
Q_{j_i}/Q_m >= (N_{j_i}/N_m)(f_{j_i}/f_m)
* exp( (1 - j_i/m) A(v)/t ).
@@ -867,7 +867,7 @@ decreases whenever a section order decreases, so
Vanishing needs rational coefficients, so both q and b must be
approximated without changing which polytopes contain the profile and
-without losing the supporting inequalities. The elementary fact is this.
+without losing the supporting ineualities. The elementary fact is this.
Let a finite family of rational polytopes in R^N be given, let q lie in
the union of the family, and let b in R^N with positive entries satisfy b.q = 1
and b.z <= 1 for every z in C whenever q lies in C. Fix an open
@@ -886,7 +886,7 @@ every member of the family that does not contain q, since those members
are closed and finitely many. Then b.q^0 = 1 and the incidences match.
For this fixed rational q^0 the conditions on a functional c are the
rational linear equation c.q^0 = 1 and finitely many rational linear
-inequalities c.z <= 1 at the vertices of the members containing q^0.
+ineualities c.z <= 1 at the vertices of the members containing q^0.
The feasible polyhedron is rational and contains b, rational points are
dense in its smallest face through b, and a sufficiently close one lies
in V with strictly positive entries.
@@ -903,7 +903,7 @@ A rational point of a rational convex hull has a rational convex
representation, so clearing denominators produces a primitive rational
ray in the crossing. Toroidal extraction of that ray gives a prime
divisor F_0 over X whose normalized order vector is q^0, with equality in
-the retraction inequality for monomial discrepancy, and with center x by
+the retraction ineuality for monomial discrepancy, and with center x by
the exclusion just noted. The divisor is retained on every later common
resolution, because its orders, discrepancy, and the equality under
retraction depend on the divisorial valuation and not on the model that
@@ -967,7 +967,7 @@ polytope C associated to it. Every component with positive order along
F or along F_S contains the relevant generic center on Y and hence
contains y, so both retraction profiles lie in that single polytope
whenever the profiles are nonzero; in particular q^0 lies in C, and the
-supporting inequality applies on C.
+supporting ineuality applies on C.
If r_F = 0, the retraction lemma gives zero order on every D_i and the
minimum formula gives zero order on G, so the coefficient of B at F is
@@ -985,7 +985,7 @@ force q'_i/q_i^0 = 1 for every i in I, while strict positivity of every
b_i^0 forces q'_i = 0 for i outside I; hence q' = q^0 including its zero
coordinates. Since F meets F_S over x its image contains x, so F itself
satisfies all three defining conditions and is a component of S. That
-proves the strict inequality for every other prime meeting S.
+proves the strict ineuality for every other prime meeting S.
Define the integral Cartier divisor
D = K_T + (n+1) rho^* L - floor(B).
@@ -1041,8 +1041,8 @@ dimension.
The sharp constant enters twice and nowhere else. In the minimizing
stage the strict budget m sum over i of b_i < n+1, inherited from
t < n+1, is what makes the coefficient of rho^* L in the nef and big
-difference positive. In the center stage the same inequality t < n+1
+difference positive. In the center stage the same ineuality t < n+1
combined with a_* > 0 is what makes the limiting integral exceed 1/t.
-Any argument that relaxes either inequality loses the constant n+1, and
+Any argument that relaxes either ineuality loses the constant n+1, and
any sharpening must keep both, which is why the two stages cannot be
separated.