diff f6bf760..6fbd3ac quadratic_operator_paving_v2.txt
diff --git a/quadratic_operator_paving_v2.txt b/quadratic_operator_paving_v2.txt
index b8abde3..2ce37ac 100644
--- a/quadratic_operator_paving_v2.txt
+++ b/quadratic_operator_paving_v2.txt
@@ -202,7 +202,7 @@ partial coloring of a Hermitian matrix defines a real-rooted expected
 polynomial; the sum of its positive roots after a negative diagonal shift is a
 cost. The upper mixed bound makes the all-unassigned cost zero; the
 two-sign lower bound makes excessive norm on a fully assigned block force
-positive cost; and a single-site assignment inequality bounds the cost increase
+positive cost; and a single-site assignment ineuality bounds the cost increase
 of fixing one color. Rooted spectral measures spread the cost over vertices.
  Measured graphs and the integral-change identity
 (Section~sec:invariant). For an invariant measured graph, the total cost
@@ -276,11 +276,11 @@ cite[Section~1]{Haa79}. A normal positive functional phi has a density
 h_phiin L^1(M)_+ under the isometric identification L^1(M)=M_*, paired
 by Tr. The space L^2(M) with its left and right multiplications and its
 positive cone is a standard form of M, and the cone vector of phi is
-h_phi^{1/2}. We use H"older's inequality, cyclicity of the
+h_phi^{1/2}. We use H"older's ineuality, cyclicity of the
 L^p--L^{p'} pairing, and polar decomposition, whose partial isometry lies in
 M.
 
-The positive-cone estimate below is Haagerup's standard-form inequality
+The positive-cone estimate below is Haagerup's standard-form ineuality
 cite[Lemma~2.10]{Haa75}; see also cite[Lemma~4.1]{PS70} and
 cite[Theorem~4(8) and Section~8, Remark~2]{Ara74}. We include a proof so that
 no faithfulness of the two functionals is hidden. For normal positive
@@ -304,13 +304,13 @@ the first expression is at most |phi-psi|.
 
 Let A⊆ M be a masa such that M has no nonzero A-central normal
 positive functional. Let x=x^*in M with |x|le1 and 0<eps<1, and put
-r_{rm p}=lceil4/epsrceil. For every normal state phi on M and
-every rho>0 there are a partition p_1,...,p_{r_{rm p}} in A, an
+r_{p}=lceil4/epsrceil. For every normal state phi on M and
+every rho>0 there are a partition p_1,...,p_{r_{p}} in A, an
 a=a^*in A with |a|le1, and a projection qin M such that
 [
  phi(1-q)<rho,
  
- Bigl|q(sum_{i=1}^{r_{rm p}}p_i x p_i-a)qBigr|leeps.
+ Bigl|q(sum_{i=1}^{r_{p}}p_i x p_i-a)qBigr|leeps.
 ]
 
 
@@ -344,15 +344,15 @@ R refines P_0. By independence and (eq:symmetric-block-sum) the
 variance of T(S_R(x)) is sum_{ein P_0}|exi e|_2^2=|S_{P_0}(xi)|_2^2<
 kappa^2, so one realization has |T(S_R(x)-b)|_2<sqrt2kappa.
 
-Now color the pieces of R independently and uniformly with r_{rm p} colors
-and let S_{rm col} be the color pinching. Its mean is
-E S_{rm col}(x)=r_{rm p}^{-1}x+(1-r_{rm p}^{-1})S_R(x). Equal-color
+Now color the pieces of R independently and uniformly with r_{p} colors
+and let S_{col} be the color pinching. Its mean is
+E S_{col}(x)=r_{p}^{-1}x+(1-r_{p}^{-1})S_R(x). Equal-color
 indicators for distinct pairs of pieces are uncorrelated even when pairs share a
 piece; with |u+v|_2^2le2|u|_2^2+2|v|_2^2 and
 (eq:symmetric-block-sum) the variance after applying T is at most
 2|S_R(xi)|_2^2<2kappa^2. Thus some coloring makes
 [
- y=S_{rm col}(x)-(1-r_{rm p}^{-1})b-r_{rm p}^{-1}x
+ y=S_{col}(x)-(1-r_{p}^{-1})b-r_{p}^{-1}x
 ]
 satisfy |T(y)|_2<2sqrt2kappa, with |y|le2. Since kappa is
 arbitrary the symmetric seminorm can be made as small as we like with the count
@@ -372,20 +372,20 @@ part in the Jordan decomposition of phi-psi. Then
 (eq:positive-cone-estimate) gives
 
  phi(1-q_0)+psi(q_0)
- =tfrac12(phi(1)+psi(1)-|phi-psi|)le t,
+ =1/2(phi(1)+psi(1)-|phi-psi|)le t,
 
 and
 |q_0yq_0xi|_2le|q_0yxi|_2+|q_0y(1-q_0)xi|_2lepsi(q_0)^{1/2}+
 2phi(1-q_0)^{1/2}le3sqrt t.
 Inside q_0Mq_0 let q be the spectral projection of q_0yq_0 for
-[-eps/2,eps/2]. The spectral Markov inequality gives
+[-eps/2,eps/2]. The spectral Markov ineuality gives
 
  phi(1-q)lephi(1-q_0)+frac4{eps^2}phi((q_0yq_0)^2)
  le(1+(36)/(eps^2))t.
 
 Taking kappa small makes this less than rho. With
-a=(1-r_{rm p}^{-1})b we have |a|le1 and
-|q(S_{rm col}(x)-a)q|leeps/2+r_{rm p}^{-1}le3eps/4.
+a=(1-r_{p}^{-1})b we have |a|le1 and
+|q(S_{col}(x)-a)q|leeps/2+r_{p}^{-1}le3eps/4.
 
 
 ## Assembling the corners
@@ -555,10 +555,10 @@ algebra of a countable nonsingular measured equivalence relation R on
 (X,mu), possibly twisted by a scalar 2-cocycle; separability holds in the
 faithful GNS representation. We use the right counting representation
 
- L^2(R,nu_{rm r})
+ L^2(R,nu_{r})
  =int_X^ ⊕ ell^2([v]_{R},dmu(v),
  
- int f,dnu_{rm r}
+ int f,dnu_{r}
  =int_Xsum_{usim v}f(u,v),dmu(v).
 
 Here A acts diagonally by the left site. With a normalized cocycle s, a
@@ -567,7 +567,7 @@ kernel a acts in the fiber rooted at v by the matrix
 s(u,w,v)s(u,v,v')=s(u,w,v')s(w,v,v') shows that rerooting conjugates these
 matrices by a diagonal unitary, so their norms and principal matrix data are
 root-independent. Finite sums of bounded base functions times lifted kernel
-normalizers form a weakly dense *-algebra N_{rm alg}
+normalizers form a weakly dense *-algebra N_{alg}
 cite[Section~2]{FM77}, on which the canonical expectation to A is the
 diagonal; it agrees with E_A|_N (same value on the fixed part of a normalizer,
 both zero on pieces with disjoint supports, extended by normality). Hence
@@ -642,8 +642,8 @@ In the setting of this section, for every yin M^circ the map
 K_y(f)=E_A(y^*fy) has a positive kernel of mass at most |y|^2 that is
 atomless for a.e. output v. For kge1 and y_1,...,y_kin M^circ the
 composition K_{y_1}circ...circ K_{y_k} has a positive kernel of mass at
-most prod_j|y_j|^2 that is atomless a.e. If p_{rm at}in A is the
-projection of the atomic part of A, then p_{rm at}y=yp_{rm at}=0 for
+most prod_j|y_j|^2 that is atomless a.e. If p_{at}in A is the
+projection of the atomic part of A, then p_{at}y=yp_{at}=0 for
 yin M^circ.
 
 
@@ -725,8 +725,8 @@ simultaneously, because the integrand rows are atomless off S_0. The mass
 bound and fixed-null-set property pass to the composition; iterate.
 
 Finally the atomic part of a standard probability space is a countable set of
-positive masses. Atomlessness gives E_A(y^*p_{rm at}y)=0, and faithfulness
-gives p_{rm at}y=0; applying the same to y^* gives yp_{rm at}=0.
+positive masses. Atomlessness gives E_A(y^*p_{at}y)=0, and faithfulness
+gives p_{at}y=0; applying the same to y^* gives yp_{at}=0.
 
 
 # Finite polynomials and the cost of assigning a color
@@ -760,7 +760,7 @@ At site v the allowed color--sign pairs are
  
 ]
 Choose omega_v uniformly from A_v, independently over sites, and
-write k_v=|A_v|.calA_v|. For j=(i,sigma) set
+write k_v=|A_v|.A_v|. For j=(i,sigma) set
 U_j={v:jinA_v} and
 B_j=sigma D_WTD_W-diag(a_v)_{vin I} with D_W=diag(√(W_v)). For a
 realization omega let I_j(omega)={v:omega_v=j} and let B_omega be the
@@ -814,7 +814,7 @@ allows non-Hermitian matrices, for the analytic perturbations later.
 [Polynomial quotients]
 For the finite data,
 
- P_I(Z)=(prod_{vin I}tfrac1{k_v!}∂_{z_v}^{,k_v-1})
+ P_I(Z)=(prod_{vin I}1/{k_v!}∂_{z_v}^{,k_v-1})
             prod_jdet((Z-B_j)|_{U_j}),
   ∂_{z_v}P_I=P_{-v}.
 
@@ -1130,8 +1130,8 @@ increment le8m+(24)/(32)e_+; the nonpositive-block arrow with diagonal
 40a, contradicting s+40a>40a; covers L_1=0 with zero residues omitted).
 Adding gives diagonal -72a; subadditivity and lowering to -80a give
 [
- d_v^{,i}le8m+tfrac34e_++e_-,
- d_v^{,i}-dle7m-tfrac14e_+le7m
+ d_v^{,i}le8m+3/4e_++e_-,
+ d_v^{,i}-dle7m-1/4e_+le7m
 ]
 with (eq:poly-error-decomposition). Both cases give
 (eq:poly-assignment); all allow empty blocks, one-site matrices, and zero
@@ -1154,7 +1154,7 @@ RcalR be a measurable undirected loopless graph of degree at most D_0<∞.
 On orbit spaces let T be measurable Hermitian matrices of norm at most one,
 zero diagonal, supported on G; changing the root conjugates them by diagonal
 unitaries, and all constructions below are invariant under this. Null
-exceptions are discarded along their R-saturations.calR-saturations.
+exceptions are discarded along their R-saturations.R-saturations.
 
 Fix rge1, t>0, beta=80. A partial coloring is c:Xto{0,1,...,r}
 (0 unassigned). Use the shifts and polynomial choices of
@@ -1164,7 +1164,7 @@ graph for distances. At absent vertices every rooted cost or transform is zero
 and the rooted measure is zero. On a finite principal I use
 [
  P_I, Q_{I,v}=P_{I∖{v}},
- F_{I,v}=tfrac{P_I}{Q_{I,v}}, G_{I,v}=tfrac1{F_{I,v}},
+ F_{I,v}=tfrac{P_I}{Q_{I,v}}, G_{I,v}=1/{F_{I,v}},
  rho_{I,v}, m_{I,v}, d_{I,v},
 ]
 with m_{I,v}=int x_+rho_{I,v}(dx),
@@ -1293,7 +1293,7 @@ comparison increment -d_ule0 by interlacing, giving the last assertion.
 Earlier arguments allow constants depending on H_0; removing weight cutoffs
 needs a fixed-band comparison uniform as H_0 grows. Cauchy transforms supply
 it, and we must also control the conditional color choices of the single-site
-inequality. At an unassigned present v, let F^0_{v,i} condition on color i
+ineuality. At an unassigned present v, let F^0_{v,i} condition on color i
 with shift t, so the permanent option is
 F_{v,i}(z)=F^0_{v,i}(z)+(beta-1)tW_v. Define the auxiliary analytic field
 
@@ -1699,7 +1699,7 @@ almost every base fiber gives barbar f(v),f(v), independent of height; measurabi
 follows from the band limits (e.g. integrate a representative over a fixed
 height interval).
 
-Finally Lemma~lem:assignment gives the single-site inequality on finite
+Finally Lemma~lem:assignment gives the single-site ineuality on finite
 restrictions; Lemma~lem:bounded-costs passes it to each bounded cut, and
 joint band convergence gives a pointwise convergent subsequence for the finite
 list of normalized fields; dividing by the positive root weight yields
@@ -1707,10 +1707,10 @@ list of normalized fields; dividing by the positive root weight yields
 
 
 Two compatibility properties follow. First, for a standard nonsingular
-extension (widehatwidehat X,X,widehatmu,Rhat) with pi:widehatwidehat
-XXto X, pi_*widehatmu=mu, each class projecting bijectively onto a base
-class, and cocycle widehatDelta(widehatwidehat u,u,widehatwidehat v)=v)=Delta(piwidehatwidehat
-u,u,piwidehatwidehat v):v): pulling back the data (including unused Bernoulli
+extension (Xhat,X,muhat,Rhat) with pi:hathat
+XXto X, pi_*muhat=mu, each class projecting bijectively onto a base
+class, and cocycle Deltahat(uhat,u,vhat)=v)=Delta(pihathat
+u,u,pivhat):v): pulling back the data (including unused Bernoulli
 coordinates), every bounded-cut ball is exactly a pullback, band L^1 errors
 agree, and uniqueness of limits gives the same pullback identity a.e. for each
 normalized limit field. Second, for a color permutation sigma (with
@@ -1865,7 +1865,7 @@ determined before the fresh times, with i(v) and c^theta as above. There is
 a nonnegative g, depending only on the fixed graph and polynomial parameters,
 with g(h)to0 as h↓0 and, for every 0<h<1/2,
 
- S(c^h)+24h)S(c)+hg(h),calS(c)+hg(h),
+ S(c^h)+24h)S(c)+hg(h),S(c)+hg(h),
 
 the same g working for all steps and current configurations.
 
@@ -1914,7 +1914,7 @@ limit field, W cancels the height density leaving an interval of length 2n,
 so
 
  
- S(c^h)-calS(c^h)-S(c)
+ S(c^h)-S(c^h)-S(c)
  &=int_0^h(dtheta)/(1-theta)int_X1_{{vin E_0,U_vgetheta}}
    [barbar d^d^{i(v)}(c^theta)-barbar d(c^d(c^theta)],dmu.
  
@@ -2011,7 +2011,7 @@ Throughout this section Asubset M is a masa, M has separable predual, and
 phi is a faithful normal state with Asubset M_phi. Keep the
 notation of Section~sec:kernels: N is generated by the groupoid
 normalizers of A, E_N:Mto N is the phi-preserving conditional
-expectation, M^circ=ker E_N, and N_{rm alg} is the algebra of finite sums
+expectation, M^circ=ker E_N, and N_{alg} is the algebra of finite sums
 of base functions times kernel groupoid normalizers; the Cartan inclusion
 Asubset N is represented by a countable nonsingular measured relation
 R on (X,mu) with its scalar cocycle.
@@ -2124,7 +2124,7 @@ fixed finite list of translated sites, each given by a partial isomorphism with
 graph in R (possibly also on whether the base point lies in its
 domain). Let Y be the algebra of finite sums of such functions times
 lifted base kernel groupoid normalizers; covariance and composition make it a
-*-algebra, and widetilde E_N(Y) N_{rm alg}.
+*-algebra, and widetilde E_N(Y) N_{alg}.
 
 Choose increasing finite Borel partitions P_j of X generating A
 and separating points off the fixed null exceptions. Write
@@ -2132,9 +2132,9 @@ P={e_a}_a; for independent uniform sth roots of unity z_a let
 u_{P} A. Replace the symbol at a translated site by
 the value of u_{P} there and each lifted base normalizer by its
 original in N; this defines an evaluation ev_{P}:mathcal
-YcalYto N_{rm alg}, and finite cylinder functions evaluate to elements of A.
+YcalYto N_{alg}, and finite cylinder functions evaluate to elements of A.
 
-Evaluation respects multiplication and adjoints and fixes N_{rm alg};
+Evaluation respects multiplication and adjoints and fixes N_{alg};
 substitution is consistent under re-rooting (hence with covariance) and respects
 a.e. identities: conditional on a.e. base point every assignment of symbols to
 a finite list of distinct sites has positive probability, so a cylinder identity
@@ -2204,7 +2204,7 @@ Let Asubset M, phi, K be as in Lemma~lem:bernoulli-model.
 Fix a symbol size s, the cylinder algebra Y, and the generating
 (P_j). For a fixed integer kge1 and fixed factors Z_1,...,Z_k,
 each in M or Y, set Z_h^{(j)}=Z_h for an M-factor and
-Z_h^{(j)}=ev_{P_j} for a Y-factor,calY-factor, using the
+Z_h^{(j)}=ev_{P_j} for a Y-factor,Y-factor, using the
 same symbols for all evaluations in a word. Then
 
  lim_{jto∞}E_{{z_a}}
@@ -2223,7 +2223,7 @@ controls bounded state-norm errors with the right word from fixed operators and
 bounded A-functions. Expanding each finite normalizer sum if needed,
 telescoping and |phi(UDV)|le|U||DV|_phi bound word errors
 uniformly over evaluated diagonal functions. If a fixed N-letter is
-approximated by a bounded strongly convergent sequence from N_{rm alg}, the
+approximated by a bounded strongly convergent sequence from N_{alg}, the
 sequence and its limit are state-norm precompact, so the lemma applies to the
 whole sequence as right factors; expand each normalizer sum only after fixing an
 approximant, pass to the partition limit, then send the approximation error to
@@ -2231,7 +2231,7 @@ zero. The same holds in the model with Phi and bounded B-factors
 (BsubsetK_
 
 Reduction to centered alternating words. Induct on the number of factors.
-A length-one M-word is an identity. A length-one Y-word:calY-word: average its
+A length-one M-word is an identity. A length-one Y-word:Y-word: average its
 cylinder coefficients; at a.e. base point distinct sites of a fixed finite
 translated list eventually lie in distinct atoms of P_j, so the
 averaged coefficient converges boundedly a.e. to its conditional label average,
@@ -2241,10 +2241,10 @@ multipliers; this proves (eq:moment-transfer) in length one.
 Fold adjacent same-algebra factors. For an alternating word subtract and add the
 N-expectation of each model factor (the same expansion on the evaluated side;
 a centered model factor need not stay centered after evaluation). Expectations
-of Y-factorscalY-factors lie in N_{rm alg} and are fixed by evaluation; each
+of Y-factorscalY-factors lie in N_{alg} and are fixed by evaluation; each
 term with an expectation folds into a neighbor, reducing length. An arbitrary
 N-element multiplying a Y-factorcalY-factor is first approximated boundedly
-strong-* by N_{rm alg} (generation and Kaplansky), legitimate on both sides by
+strong-* by N_{alg} (generation and Kaplansky), legitimate on both sides by
 the uniform word estimates. The induction leaves fully centered alternating
 words, whose model expectation is zero by freeness.
 
@@ -2307,9 +2307,9 @@ Expand (eq:cyclic-centered-word) in one partition index a_o per
 occurrence. Averaging the independent z_a keeps exactly the equality patterns
 with zero total Fourier exponent mod s in each class; since individual
 exponents are nonzero, every class has at least two occurrences. Inclusion--
-exclusion over coarsenings removes inequalities between classes, so it suffices to
+exclusion over coarsenings removes ineualities between classes, so it suffices to
 prove vanishing of a sum with prescribed equalities within the classes of a
-partition of occurrences, each class of size at least two, no inequalities
+partition of occurrences, each class of size at least two, no ineualities
 between classes; occurrence o contributes lambda_o(e_{a_o}).
 
 Keep selected pair equalities as explicit indices. If selected pairs form a forest
@@ -2414,7 +2414,7 @@ Caption: Selected equality links in one fixed cyclic word with eight blocks and
 ell=3. The short arc 0to1to2to3 and its complement indicate the positions
 of X_J and Y_J; the two marks in block 5 are distinct mate occurrences.
 Further occurrences and links are omitted; distinct prescribed classes may use
-equal numerical indices after inequalities are removed.
+equal numerical indices after ineualities are removed.
 
 
 
@@ -2426,14 +2426,14 @@ State Cauchy--Schwarz gives
 
 The second square sum is uniformly bounded: drop E_ell' from the positive bound
 of Y_J^*Y_J, order the exterior mate occurrences left to right (commutativity in
-a block), write mathbf j=(j_1,...,j_bfj=(j_1,...,j_{ell-1}), and at the first remaining
-mate factor B_{mathbf j}bfj=C_0F_jB'_{mathbf j'}bfj' (F_j its projection partition,
-C_0,B'_{mathbf j'}bfj' independent of j), so
-sum_jB_{mathbf j}bfj^*B_{mathbf j}bfj
-={B'_{mathbf j'}bfj'}^*(sum_jF_jC_0^*C_0F_j)B'_{mathbf j'}bfj'
-le|C_0|^2{B'_{mathbf j'}bfj'}^*B'_{mathbf j'}bfj'; iterating over the remaining mates
+a block), write j=(j_1,...,j_bfj=(j_1,...,j_{ell-1}), and at the first remaining
+mate factor B_{j}j=C_0F_jB'_{j'}j' (F_j its projection partition,
+C_0,B'_{j'}j' independent of j), so
+sum_jB_{j}j^*B_{j}j
+={B'_{j'}j'}^*(sum_jF_jC_0^*C_0F_j)B'_{j'}j'
+le|C_0|^2{B'_{j'}j'}^*B'_{j'}j'; iterating over the remaining mates
 (with the fixed intervening norm bounds) gives
-sum_{mathbf j}bfjB_{mathbf j}bfj^*B_{mathbf j}bfjle C1 (for ell=1 just the fixed
+sum_{j}jB_{j}j^*B_{j}jle C1 (for ell=1 just the fixed
 exterior word bound). Summing the E_0 corners in the state (a centralizer
 partition) leaves a bound independent of P and the unitaries.
 
@@ -2490,7 +2490,7 @@ tends to zero.
 For each fixed coarse Q, the limsup of the first square sum, even after
 taking the supremum over the auxiliary unitaries at each fine P, was
 bounded by (eq:coarse-kernel-collision). First take that fine-partition
-limsup, then refine Q:calQ: the first square sum vanishes uniformly in the
+limsup, then refine Q:Q: the first square sum vanishes uniformly in the
 auxiliary phases. The second square sum was uniformly bounded, so
 (eq:shortest-pair-cs) proves vanishing of the equality-pattern sum. Averaging
 the auxiliary phases, undoing the finite inclusion--exclusion and Fourier
@@ -2577,8 +2577,8 @@ spectral interval gives both assertions for continuous f.
 
 Let A⊆ M be a masa and phi a faithful normal state on M with A
 in its centralizer. For 0<eps<1 put
-r_{mathrm e}rme=lceil20000^2eps^{-2}rceil. For every self-adjoint contraction
-xin M and every rho>0 there are a partition P=(p_1,...,p_{r_{mathrm e}rme})
+r_{e}rme=lceil20000^2eps^{-2}rceil. For every self-adjoint contraction
+xin M and every rho>0 there are a partition P=(p_1,...,p_{r_{e}rme})
 in A and a projection qin M with
 [
  phi(1-q)<rho, |q(S_P(x)-E_Ax)q|leeps,
@@ -2592,7 +2592,7 @@ the reduction's conditional expectation restricts E_A, so a diagonal choice
 there proves the stated one. Use the notation of
 Sections~sec:kernels,sec:transfer.
 
-Fix r=r_{mathrm e}rme and write a=E_Ax, y=E_Nx-E_Axin N,
+Fix r=r_{e}rme and write a=E_Ax, y=E_Nx-E_Axin N,
 w=x-E_Nxinker E_N. These are self-adjoint, |a|le1,
 |y|,|w|le2, and E_Ay=0 (uniqueness of the phi-preserving
 expectation onto A gives E_AE_N=E_A).
@@ -2642,12 +2642,12 @@ With beta=80 the norm bound, after restoring the factor two, obeys
  le(253)/(2000)eps<fraceps4.
 
 
-Put widehatwidehat Y_n=Y_n=sum_ip_i^ny_np_i^ninwidetilde N. At a root where the
-radius-n ball has the pinching bound, widehatwidehat Y_n^nY_n^n on the root vector agrees
+Put Yhat_n=Y_n=sum_ip_i^ny_np_i^ninwidetilde N. At a root where the
+radius-n ball has the pinching bound, Yhat_n^nY_n^n on the root vector agrees
 with the nth power of that principal matrix (every length-n path stays in the
-ball); elsewhere |widehatwidehat Y_nY_n|le2. Integrating squared vector norms,
+ball); elsewhere |Yhat_nY_n|le2. Integrating squared vector norms,
 
- Phi(widehatwidehat Y_n^Y_n^{2n})le(fraceps4)^{2n}
+ Phi(Yhat_n^Y_n^{2n})le(fraceps4)^{2n}
        +2^{2n}(fraceps{16})^{2n},
 
 using diagonal integration in the relation representation, not a trace on the
@@ -2657,7 +2657,7 @@ Set Y_n=sum_ip_i^n y p_i^n and W_n=sum_ip_i^n w p_i^n. Pinching by a
 centralizer partition is state-norm contractive, so (eq:cartan-approximants)
 gives
 
- |Y_n-widehatwidehat Y_nY_n|_Phi→0,
+ |Y_n-Yhat_nY_n|_Phi→0,
 
 and by Lemma~lem:free-compression and (eq:color-marginals-completion),
 
@@ -2672,18 +2672,18 @@ Clipping before fixing a transferred moment.:
 Let f:R[-eps/2,eps/2], f(s)=max{-eps/2,min{s,eps/2}}.
 Spectral calculus and (eq:cartan-high-moment) give
 [
- Phi(1_{{|widehatwidehat Y_n|>Y_n|>eps/2}})
- le(frac2eps)^{2n}Phi(widehatwidehat Y_n^Y_n^{2n})le2^{-2n}+4^{-2n},
+ Phi(1_{{|Yhat_n|>Y_n|>eps/2}})
+ le(frac2eps)^{2n}Phi(Yhat_n^Y_n^{2n})le2^{-2n}+4^{-2n},
 ]
-and since |widehatwidehat Y_nY_n|le2,
+and since |Yhat_nY_n|le2,
 
- |widehatwidehat Y_n-f(Y_n-f(widehatwidehat Y_n)Y_n)|_Phi→0.
+ |Yhat_n-f(Y_n-f(Yhat_n)Y_n)|_Phi→0.
 
 
-Apply Lemma~lem:multiplier-calculus in K:calK: each (p_i^n)in
+Apply Lemma~lem:multiplier-calculus in K:K: each (p_i^n)in
 R_ and r is fixed, so (Y_n) and (W_n) (finite sums of products
 of centralizer sequences and fixed operators) lie in R_;
-(eq:pinched-approximation) places (widehatwidehat Y_n)Y_n) there too.
+(eq:pinched-approximation) places (Yhat_n)Y_n) there too.
 Equations~(eq:pinched-approximation)--(eq:approximate-clipping) and
 continuous calculus give