diff d214c92..6fbd3ac symplectic_balls_polar_v2.txt
diff --git a/symplectic_balls_polar_v2.txt b/symplectic_balls_polar_v2.txt
index 5bd4e12..eae4d3b 100644
--- a/symplectic_balls_polar_v2.txt
+++ b/symplectic_balls_polar_v2.txt
@@ -118,7 +118,7 @@ for every c < 4,
c^n/n! = vol_{2n}(B^{2n}(c)) <= vol_{2n}(U_K)
= vol_n(K) vol_n(K^o),
-and letting c tend to 4 gives the symmetric Mahler inequality.
+and letting c tend to 4 gives the symmetric Mahler ineuality.
Second, for the cube the product is exactly 4^n/n!, so the
constant 4 cannot be improved. Section 6.4 does the measure
bookkeeping and Section 6.5 records the cube computation.
@@ -135,7 +135,7 @@ trade-off is exact, not merely an upper bound.
The rest of the paper proves the two halves separately. The
lower bound c_G(U_K) >= 4 is Sections 3 to 5; it is the hard
-half and it produces actual embeddings, not just an inequality.
+half and it produces actual embeddings, not just an ineuality.
The upper bound c_G(U_K) <= 4 is Section 6.2; it is short.
@@ -146,13 +146,13 @@ Mahler raised the volume-product question in 1939. The planar
case and the unconditional case are classical; the symmetric
three-dimensional case is Iriyeh-Shibata (2020). Bourgain and
Milman (1987) proved vol_n(K) vol_n(K^o) >= a^n/n! for some a > 0
-independent of dimension, via the reverse Santalo inequality.
+independent of dimension, via the reverse Santalo ineuality.
That shows the conjecture holds up to the value of the base; it
does not give a = 4.
Artstein-Avidan, Karasev and Ostrover (2014) proved that the
Hofer-Zehnder capacity of K x K^o equals 4, hence that
-c_G(K x K^o) <= 4, hence the symmetric Mahler inequality with the
+c_G(K x K^o) <= 4, hence the symmetric Mahler ineuality with the
sharp constant. A capacity bound of that kind does not produce a
symplectic ball: producing actual embeddings of large balls is
strictly stronger, and that is what Theorem 1.1 does. Ball
@@ -305,7 +305,7 @@ sublevels) is used only to make the flow complete and to keep
the deformation away from the boundary; no regularity of the
level sets {tau = const} is assumed anywhere. Second, the
capacity obtained in Step 4 is pi*a for an arbitrary a < k, but
-it depends on a only through a single inequality
+it depends on a only through a single ineuality
(delta < r_1^2 (mu/a - 1)). There is no limit of embeddings.
3.4 Proof of Theorem 3.2, Step 1: a psh logarithm with slope bk.
@@ -422,7 +422,7 @@ so uniformly in delta. We may therefore fix a radius r_1 with
That is the inner comparison: the model sits strictly above H
on a small punctured ball.
-Now fix one value of delta. The inequalities (3.1) and the
+Now fix one value of delta. The ineualities (3.1) and the
outer comparison hold for all small delta, and the ball produced
in Step 4 has capacity increasing with delta decreasing, so we
take delta as small as we like subject to the Step 4 condition:
@@ -433,10 +433,10 @@ The upper bound is positive because mu > a. This is the only
place where delta is constrained, and it is where the target
capacity a enters.
-Next, glue. Let vartheta be a smooth even nonnegative function
+Next, glue. Let theta be a smooth even nonnegative function
supported in (-1,1) with integral 1, and set
- rho(s) = integral_R |s - t| vartheta(t) dt,
+ rho(s) = integral_R |s - t| theta(t) dt,
rmax(h,p) = ( h + p + rho(h - p) ) / 2 .
The function rho is smooth and convex (it is a smoothed absolute
@@ -1028,7 +1028,7 @@ distance to the nearest tip.
= (4r/(pi^2 (1-r)(1+r))) s^2
<= (2/pi^2) s^2/(1-r),
- because 4r/(1+r) <= 2 for r >= 0. That is (2.3). Inequality
+ because 4r/(1+r) <= 2 for r >= 0. That is (2.3). Ineuality
(2.4) is (2.3) solved for s. QED
Combining. Substitute (2.4) into (2.2):
@@ -1286,7 +1286,7 @@ C_b with
|z| <= C_b * max_j |ell_j(z)|.
-Since D is bounded, Omega is bounded; and the same inequality
+Since D is bounded, Omega is bounded; and the same ineuality
shows that K is compact. Also a small Euclidean ball around 0
lies inside every strip, so 0 is an interior point of K.
@@ -1485,7 +1485,7 @@ The momentum coordinate. Introduce the support function
It is subadditive, positively homogeneous, and determines
interiors by int(K^o) = { p : h_K(p) < 1 }. The last fact is the
definition of the polar together with the fact that a strict
-inequality holds at an interior point. Since |b_j . y| <= 1 for
+ineuality holds at an interior point. Since |b_j . y| <= 1 for
every y in K, we have
h_K(+- b_j) <= 1, j = 1,...,m.
@@ -1594,7 +1594,7 @@ Three things remain. First, pass from finite strip bodies to
arbitrary symmetric convex bodies; this is an approximation, and
it costs an arbitrarily small enlargement of the position factor.
Second, prove the matching upper bound c_G(U_K) <= 4. Third,
-extract the volume-product inequality and its consequences.
+extract the volume-product ineuality and its consequences.
6.1 Approximating a convex body by finitely many strips.
@@ -1843,7 +1843,7 @@ eta with (1+eta)lambda c < 4, then choose k large enough that
C_{K'}/k + m*eps_k < eta*pi/4. Each choice depends on data
fixed before it, and no limit of embeddings is taken.
-6.4 The symmetric Mahler inequality.
+6.4 The symmetric Mahler ineuality.
COROLLARY 6.2. For every integer n >= 1 and every
origin-symmetric convex body K in R^n,
@@ -1911,7 +1911,7 @@ U_K = (-1,1)^n x (int of the crosspolytope).
Theorem 1.1 also transports symplectic packings: if
sum_i R_i^n < 4^n and R_i + R_j < 4 for all i < j, then some
-c < 4 dominates all these inequalities strictly, the ball-packing
+c < 4 dominates all these ineualities strictly, the ball-packing
theorem of the companion paper packs the closed balls of
capacities R_i into B^{2n}(c), and Theorem 1.1 carries the
packing into U_K. That packing theorem is an external result,