Open MathsAll courses
Positive maps and finite-dimensional approximation · Prerequisite proofs · Sources and terms

The sharp noncommutative bilinear inequality

AI-generated exposition by OpenAI GPT models. CC0-1.0 to the extent of rights held.

A finite domination coefficient is a starting budget. The preceding lesson produces such a budget for every bounded bilinear form. Here a curve through each input compares two vertical boundaries, and an exact finite phase average converts that comparison into a smaller budget. The operation is

C⟼C∥V∥.C\longmapsto\sqrt{C\|V\|}.

Its repeated application reaches coefficient one. A final compactness argument chooses four states that work simultaneously for every input.

We first construct the boundary curves and the scalar strip estimate, then explain how finite phases and affine state tests join them. Adjoining units and testing orthogonal isometries finish the arbitrary-algebra theorem and its optimality. No separability, nuclearity or trace assumption enters. Scalar order, continuous calculus, norm integrals and forced unitization are proved in CF1–10; the preceding lesson proves norm-preserving functional extension and arbitrary dual-ball compactness.

1. The coefficient to be reached

Theorem 1.1. Let A,BA,B be nonzero C*-algebras and V:A×B→CV:A\times B\to\mathbb C bounded and bilinear. There are states φ1,φ2\varphi_1,\varphi_2 on AA and ψ1,ψ2\psi_1,\psi_2 on BB such that

∣V(x,y)∣≤∥V∥[φ1(x∗x)+φ2(xx∗)]1/2[ψ1(y∗y)+ψ2(yy∗)]1/2.(1)|V(x,y)|\le\|V\| \big[\varphi_1(x^*x)+\varphi_2(xx^*)\big]^{1/2} \big[\psi_1(y^*y)+\psi_2(yy^*)\big]^{1/2}. \tag{1}

For a zero algebra the form is zero and the numerical inequality is vacuous; there is no state of norm one on the zero algebra.

For a finite family write

R(x)=∥∑jxj∗xj∥+∥∑jxjxj∗∥.(2)R(x)=\Big\|\sum_jx_j^*x_j\Big\|+\Big\|\sum_jx_jx_j^*\Big\|. \tag{2}

The four states will be recovered from inequalities for these family costs. The main task is therefore to improve a finite family coefficient. The preceding lesson provides the initial value C0=(81/16)∥V∥C_0=(81/16)\|V\|.

2. Boundary curves built in the original algebra

Lemma 3.1. If x=u∣x∣x=u|x| is its polar decomposition in A∗∗A^{**}, then

fx(z)=u∣x∣z,Re⁡z>0,(7)f_x(z)=u|x|^z,\qquad \operatorname{Re}z>0, \tag{7}

is an AA-valued norm-holomorphic function, where the power is zero on the kernel. For s=Re⁡z>0s=\operatorname{Re}z>0,

fx(z)∗fx(z)=(x∗x)s,fx(z)fx(z)∗=(xx∗)s,∥fx(z)∥=∥x∥s.(8)f_x(z)^*f_x(z)=(x^*x)^s, \quad f_x(z)f_x(z)^*=(xx^*)^s, \quad \|f_x(z)\|=\|x\|^s. \tag{8}

The canonical meaning of A∗∗A^{**} is supplied by the all-state representation and predual construction. The support and polar-decomposition construction, applied in that represented von Neumann algebra, identifies the notation in (7). We construct the curve and prove (8) inside AA before making that identification.

Scalar powers here have the following elementary meaning. The series exp⁡z=∑m≥0zm/m!\exp z=\sum_{m\ge0}z^m/m! and its derivative converge uniformly on bounded disks: after m>2∣z∣m>2|z|, successive absolute terms have ratio at most 1/21/2. The absolutely convergent Cauchy product and the binomial formula give exp⁡(z+w)=exp⁡z exp⁡w\exp(z+w)=\exp z\,\exp w. Conjugation commutes with the series, so ∣exp⁡z∣2=exp⁡(2Re⁡z)|\exp z|^2=\exp(2\operatorname{Re}z). For real rr, exp⁡r=exp⁡(r/2)2>0\exp r=\exp(r/2)^2>0, since its inverse is exp⁡(−r)\exp(-r). Its derivative is itself, so it is strictly increasing; exp⁡r≥1+r\exp r\ge1+r for r≥0r\ge0 and the inverse identity show its limits are infinity and zero at the two ends of the real line. Given t>0t>0, real completeness and continuity at sup⁡{r:exp⁡r≤t}\sup\{r:\exp r\le t\} give a unique real log⁡t\log t. The inverse is continuous, because values of exp⁡(r±η)\exp(r\pm\eta) bracket exp⁡r\exp r for every η>0\eta>0. We define tz=exp⁡(zlog⁡t)t^z=\exp(z\log t); then ∣tz∣=tRe⁡z|t^z|=t^{\operatorname{Re}z}. These identities also justify every scalar exponential used in the strip argument.

Proof. If x=0x=0, all the assertions hold for the zero curve. Otherwise put R=∥x∥R=\|x\| and b=∣x∣=(x∗x)1/2b=|x|=(x^*x)^{1/2}. All continuous functions of bb are evaluated in the forced unitization when necessary. For δ>0\delta>0, let ρδ\rho_\delta be zero on [0,δ][0,\delta], linear from zero to one on [δ,2δ][\delta,2\delta], and one thereafter. For g∈C([0,R])g\in C([0,R]) with g(0)=0g(0)=0, the continuous function

kδ,g(t)={ρδ(t)g(t)/t,t>0,0,t=0k_{\delta,g}(t)= \begin{cases}\rho_\delta(t)g(t)/t,&t>0,\\0,&t=0\end{cases}

vanishes near zero. The elements xkδ,g(b)xk_{\delta,g}(b) lie in AA. The C*-identity gives

∥xk(b)∥2=∥b2∣k∣2(b)∥=max⁡t∈σ(b)∣tk(t)∣2.\|xk(b)\|^2=\|b^2|k|^2(b)\| =\max_{t\in\sigma(b)}|tk(t)|^2.

Thus their differences are bounded by ∥(ρδ−ρη)g∥∞\|(\rho_\delta-\rho_\eta)g\|_\infty, which tends to zero as δ,η↓0\delta,\eta\downarrow0. Define their norm limit to be Ex(g)E_x(g). This is a linear map into AA, of norm at most one, with ∥Ex(g)∥=max⁡t∈σ(b)∣g(t)∣\|E_x(g)\|=\max_{t\in\sigma(b)}|g(t)|. The equality follows by taking limits in the preceding norm identity.

For gz(t)=tzg_z(t)=t^z on t>0t>0, gz(0)=0g_z(0)=0, set fx(z)=Ex(gz)f_x(z)=E_x(g_z). The associated approximants are

aδ(z)=x[ρδ(t)tz−1](b)∈A.(P1)a_\delta(z)=x[\rho_\delta(t)t^{z-1}](b)\in A. \tag{P1}

For Re⁡z≥ε>0\operatorname{Re}z\ge\varepsilon>0 and 2δ≤12\delta\le1,

∥fx(z)−aδ(z)∥≤sup⁡0≤t≤2δ(1−ρδ(t))tRe⁡z≤(2δ)ε.(P2)\|f_x(z)-a_\delta(z)\| \le\sup_{0\le t\le2\delta}(1-\rho_\delta(t))t^{\operatorname{Re}z} \le(2\delta)^\varepsilon. \tag{P2}

In particular fx(1)=xf_x(1)=x.

Here is a direct norm-series proof of holomorphy. Fix z0z_0 with a=Re⁡z0>0a=\operatorname{Re}z_0>0. For each m≥0m\ge0, the function

cm(t)=tz0(log⁡t)mm!(t>0),cm(0)=0c_m(t)=t^{z_0}\frac{(\log t)^m}{m!}\quad(t>0),\qquad c_m(0)=0

is continuous: exponential decay e−ave^{-av} dominates every polynomial in v=−log⁡tv=-\log t. Choose 0<r<d<a0<r<d<a, and put L=max⁡(0,log⁡R)L=\max(0,\log R), H=max⁡(1,Ra)H=\max(1,R^a). For 0<t≤10<t\le1, the exponential series gives

ta∣log⁡t∣mm!=e−avvmm!≤d−m,t^a\frac{|\log t|^m}{m!} =e^{-av}\frac{v^m}{m!}\le d^{-m},

because (dv)m/m!≤edv(dv)^m/m!\le e^{dv}. On 1≤t≤R1\le t\le R, the same quantity is at most HLm/m!HL^m/m!. Consequently

∑m≥0∥cm∥∞rm≤11−r/d+HerL<∞.\sum_{m\ge0}\|c_m\|_\infty r^m \le\frac1{1-r/d}+He^{rL}<\infty.

The scalar exponential identity and this uniform bound prove, for ∣w∣≤r|w|\le r,

gz0+w=∑m≥0cmwm,fx(z0+w)=∑m≥0Ex(cm)wm.g_{z_0+w}=\sum_{m\ge0}c_mw^m,\qquad f_x(z_0+w)=\sum_{m\ge0}E_x(c_m)w^m.

This is a norm-convergent power series on every smaller disk in ∣w∣<a|w|<a. Its derivative series converges uniformly there as well: choose r<d<ar<d<a and sum mrm−1d−mm r^{m-1}d^{-m} and Hmrm−1Lm/m!H m r^{m-1}L^m/m!. To justify differentiation, integrate the uniformly convergent derivative series along a line segment; the norm fundamental theorem in CF1 passes the polynomial identities to the limit. Dividing the resulting integral by the complex increment and passing to zero gives the derivative. Thus fxf_x is norm-holomorphic without a Cauchy-integral formula.

The two products can also be computed in AA. The first is the limit of

aδ(z)∗aδ(z)=[ρδ(t)2t2s](b),s=Re⁡z,a_\delta(z)^*a_\delta(z) =[\rho_\delta(t)^2t^{2s}](b),\qquad s=\operatorname{Re}z,

and hence equals b2sb^{2s}. For the other product use xp(x∗x)=p(xx∗)xx p(x^*x)=p(xx^*)x, first for polynomials and then for uniformly approximated continuous functions. If k(t)=ρδ(t)tz−1k(t)=\rho_\delta(t)t^{z-1}, this gives

x∣k∣2(b)x∗=[t ∣k(t)∣2](xx∗)=[ρδ(t)2ts](xx∗).x|k|^2(b)x^* =[t\,|k(\sqrt t)|^2](xx^*) =[\rho_\delta(\sqrt t)^2t^s](xx^*).

Its norm limit is (xx∗)s(xx^*)^s. The C*-identity now gives ∥fx(z)∥=Rs\|f_x(z)\|=R^s, proving (8).

Finally, in a polar decomposition x=ubx=ub, the approximant (P1) is uρδ(b)bzu\rho_\delta(b)b^z. Its limit is ubzub^z, since ∥u∥≤1\|u\|\le1 and (P2) applies. This proves the stated bidual identity (7). More generally Ex(g)=ug(b)E_x(g)=ug(b) for every continuous gg vanishing at zero. The construction uses only the polar partial isometry and its initial support; its existence in the canonical bidual is the separate represented polar-decomposition input. □\square

3. A scalar maximum bound and the strip estimate

Only locally convergent power series are needed for the scalar functions below. Their sums are continuous and complex differentiable by the same smaller-disk derivative estimate used above. Products are again locally convergent series: absolute convergence bounds the double sum, and regrouping by total degree gives its coefficients. A bounded bilinear form applied to two norm-convergent series has this property as well. Hence V(fx(z),fy(z))V(f_x(z),f_y(z)), and its products with scalar exponentials, belong to this class.

For the circle averages, use the scalar normalization proved in the preceding lesson's disk and quarter-phase construction. It gives eiπ/2=ie^{i\pi/2}=i; the exponential addition law therefore gives e2πi=1e^{2\pi i}=1. For a nonzero integer kk, the primitive eikt/(ik)e^{ikt}/(ik) shows that its integral over [0,2π][0,2\pi] is zero. The constant function has average one on that interval.

We prove the required maximum-modulus statement. Suppose h(z0+w)=∑m≥0γmwmh(z_0+w)=\sum_{m\ge0}\gamma_mw^m on a disk. On a smaller circle of radius rr, uniform absolute convergence permits multiplication and termwise Riemann integration. The elementary averages of ei(m−n)te^{i(m-n)t} are zero for m≠nm\ne n and one for m=nm=n. It follows that

12π∫02π∣h(z0+reit)∣2 dt=∑m≥0∣γm∣2r2m.\frac1{2\pi}\int_0^{2\pi}|h(z_0+re^{it})|^2\,dt =\sum_{m\ge0}|\gamma_m|^2r^{2m}.

If ∣h∣|h| has a local maximum at z0z_0, the left side is at most ∣γ0∣2|\gamma_0|^2. Every other term is nonnegative, so γm=0\gamma_m=0 for m≥1m\ge1; hh is constant near z0z_0.

Now let hh be continuous on a closed rectangle and locally represented by power series in its interior. Its modulus attains a maximum by compactness of the rectangle, proved in CF1. If the maximum exceeded every boundary value, it would occur inside. The set of interior points attaining that maximum is relatively closed and, by the circle argument, relatively open. It is the whole interior. To see this explicitly, parameterize a segment from a point in that set to any other interior point. The parameters belonging to the set form a relatively open and closed subset of [0,1][0,1] containing zero. The supremum of the parameters up to which the entire initial interval is included belongs to the set by closedness; if it were less than one, openness would extend that interval past the supremum. Thus the segment is entirely included. Thus the modulus is constant throughout the interior, and continuity gives that same value on the boundary, a contradiction. The modulus on the rectangle is therefore bounded by its boundary maximum. This proves precisely the maximum bound we shall use.

Let a<ba<b, and let hh be bounded and continuous on a≤Re⁡z≤ba\le\operatorname{Re}z\le b, locally represented by power series in the interior. Suppose its two vertical boundaries have bounds Ma,Mb>0M_a,M_b>0. Use real logarithms to form

D(z)=h(z)exp⁡ ⁣(−b−zb−alog⁡Ma−z−ab−alog⁡Mb).D(z)=h(z)\exp\!\left( -\frac{b-z}{b-a}\log M_a-\frac{z-a}{b-a}\log M_b\right).

It is bounded, say by KK, on the strip, and has modulus at most one on both vertical boundaries. For δ>0\delta>0, put Gδ(z)=D(z)eδ(z−a)2G_\delta(z)=D(z)e^{\delta(z-a)^2} and L=b−aL=b-a. Writing z=s+itz=s+it gives

∣eδ(z−a)2∣=eδ((s−a)2−t2).|e^{\delta(z-a)^2}|=e^{\delta((s-a)^2-t^2)}.

On either vertical side of a rectangle with horizontal sides at ±T\pm T, the modulus of GδG_\delta is at most eδL2e^{\delta L^2}. On the horizontal sides it is at most KeδL2−δT2K e^{\delta L^2-\delta T^2}. Choose TT large enough that Ke−δT2≤1K e^{-\delta T^2}\le1, and large enough to contain the point being tested. The rectangle maximum bound gives

∣D(s+it)∣≤eδ[L2−(s−a)2+t2].|D(s+it)|\le e^{\delta[L^2-(s-a)^2+t^2]}.

For a fixed point let δ↓0\delta\downarrow0. This yields ∣D∣≤1|D|\le1, and in particular

∣h(s)∣≤Ma(b−s)/(b−a)Mb(s−a)/(b−a),a≤s≤b.(9)|h(s)|\le M_a^{(b-s)/(b-a)}M_b^{(s-a)/(b-a)}, \quad a\le s\le b. \tag{9}

The same bound holds at s+its+it. If a boundary bound is zero, first replace both bounds by Ma+η,Mb+ηM_a+\eta,M_b+\eta, η>0\eta>0, and pass to their limit. Boundary points retain their given bound directly. Neither the rectangle argument nor the strip argument uses a Cauchy-cycle theorem.

4. What the finite phases preserve

Let ω=e2πi/3\omega=e^{2\pi i/3}. The same quarter-phase construction gives ω3=1\omega^3=1. Moreover eiπ/6=a+ibe^{i\pi/6}=a+ib with a,b>0a,b>0, so ω=ieiπ/6=−b+ia≠1\omega=i e^{i\pi/6}=-b+ia\ne1. On the finite product {1,ω,ω2}n\{1,\omega,\omega^2\}^n, give every point weight 3−n3^{-n}, and let ζj\zeta_j be its jj-th coordinate. The geometric sum shows Eζjk=0\mathbb E\zeta_j^k=0 for k=−2,−1,1,2k=-2,-1,1,2, and Eζj0=1\mathbb E\zeta_j^0=1. Coordinates are independent because finite product sums factor. For X=∑jζjxjX=\sum_j\zeta_jx_j we need the following estimate.

Lemma 2.1. For arbitrary, possibly noncommuting xjx_j,

∥E(X∗X)2∥+∥E(XX∗)2∥≤R(x)2.(5)\|\mathbb E(X^*X)^2\|+\|\mathbb E(XX^*)^2\|\le R(x)^2. \tag{5}

Proof. Write S=∑jxj∗xjS=\sum_jx_j^*x_j, T=∑jxjxj∗T=\sum_jx_jx_j^*. A monomial in (X∗X)2(X^*X)^2 has scalar coefficient ζi‾ζjζk‾ζl\overline{\zeta_i}\zeta_j\overline{\zeta_k}\zeta_l. Each coordinate exponent lies between −2-2 and 22, so its expectation is one precisely when the multisets {i,k}\{i,k\} and {j,l}\{j,l\} agree. This happens in the two patterns i=j,k=li=j,k=l and i=l,j=ki=l,j=k, whose intersection is i=j=k=li=j=k=l. Keeping the operator factors in their original order gives

E(X∗X)2=S2+∑ixi∗Txi−∑i(xi∗xi)2≤S2+∥T∥S.(6)\mathbb E(X^*X)^2 =S^2+\sum_ix_i^*T x_i-\sum_i(x_i^*x_i)^2 \le S^2+\|T\|S. \tag{6}

The subtraction removes the extra copy of each all-equal term. Positivity of the omitted squares, T≤∥T∥1T\le\|T\|1, and order under congruence justify the inequality. Applying the same calculation to adjoints gives E(XX∗)2≤T2+∥S∥T\mathbb E(XX^*)^2\le T^2+\|S\|T. The expectations are positive. Monotonicity of the positive norm therefore bounds their norms by ∥S∥2+∥T∥∥S∥\|S\|^2+\|T\|\|S\| and ∥T∥2+∥S∥∥T∥\|T\|^2+\|S\|\|T\|, respectively. Their sum is R(x)2R(x)^2. □\square

The same phases also select the diagonal of a bilinear form. Set Y=∑jζj‾yjY=\sum_j\overline{\zeta_j}y_j. Since Eζiζj‾=δij\mathbb E\zeta_i\overline{\zeta_j}=\delta_{ij},

∑jV(xj,yj)=EV(X,Y).(12)\sum_jV(x_j,y_j)=\mathbb E V(X,Y). \tag{12}

Conjugation in YY is essential for this bilinear identity. Fourth moments of YY have the same estimate because conjugation permutes the three roots.

5. Turning every family test into four fixed states

Here the state tests concern the nonzero algebras of Theorem 1.1. For unital algebras, a positive element pp has a state attaining ∥p∥\|p\|: evaluation at its largest spectral value on C∗(1,p)C^*(1,p) extends with unchanged norm and value one at the unit. Such an extension is positive. To check the last assertion, if ∥f∥=f(1)=1\|f\|=f(1)=1, the first-order expansion of f(eith)f(e^{ith}) for self-adjoint hh, and its modulus bound for both signs of tt, force f(h)f(h) to be real. For 0≤h≤10\le h\le1, ∣1−f(h)∣≤∥1−h∥≤1|1-f(h)|\le\|1-h\|\le1 then gives f(h)≥0f(h)\ge0; scaling handles every positive element. This uses the functional extension and scalar calculus already proved in the preceding lesson and CF1–10.

The state set is a nonempty weak-star compact convex set. Indeed it is the intersection of the compact dual unit ball with the closed conditions of positivity and value one at the unit. The full arbitrary dual-ball construction is in Sections 9.1–9.5 of the preceding lesson.

Lemma 1.2. For unital A,BA,B, the existence of the four states in (1), with a constant CC in place of ∥V∥\|V\|, is equivalent to

∣∑jV(xj,yj)∣≤CR(x)1/2R(y)1/2(3)\Big|\sum_jV(x_j,y_j)\Big|\le C R(x)^{1/2}R(y)^{1/2} \tag{3}

for every pair of finite families.

Proof. For a negative CC, both formulations fail on x=y=1x=y=1; assume C≥0C\ge0. From four-state domination, sum the absolute values and use scalar Cauchy–Schwarz. State evaluation of each positive square sum is at most its norm, which proves (3).

For the reverse implication let Q=S(A)2×S(B)2Q=S(A)^2\times S(B)^2, and abbreviate

s(x)=φ1(x∗x)+φ2(xx∗),t(y)=ψ1(y∗y)+ψ2(yy∗).s(x)=\varphi_1(x^*x)+\varphi_2(xx^*),\qquad t(y)=\psi_1(y^*y)+\psi_2(yy^*).

For every pair impose the affine condition

C2[s(x)+t(y)]−Re⁡V(x,y)≥0.(4)\tfrac C2[s(x)+t(y)]-\operatorname{Re}V(x,y)\ge0. \tag{4}

For any finite nonnegative combination of these tests, multiply both inputs of its jj-th term by the square root of its coefficient. Choose four states independently norming the resulting four square sums. The sum of the tests at that quadruple is at least

C2[R(x)+R(y)]−CR(x)R(y)≥0.\frac C2[R(x)+R(y)]-C\sqrt{R(x)R(y)}\ge0.

Here (3) controls the real bilinear sum.

For completeness, this weighted-test fact supplies a simultaneous quadruple. The image of any finite list of tests is a compact convex set K⊂RmK\subset\mathbb R^m. If it misses the positive orthant, choose y0∈Ky_0\in K minimizing ∥y−∥2\|y_-\|^2, put z0=(y0)+z_0=(y_0)_+ and w=(y0)−≠0w=(y_0)_-\ne0. The closest-point inequality along the segment from y0y_0 to y∈Ky\in K gives (y0−z0)⋅(y−y0)≥0(y_0-z_0)\cdot(y-y_0)\ge0. Consequently

w≥0,w⋅y≤w⋅y0=−∥w∥2<0(y∈K).w\ge0,\qquad w\cdot y\le w\cdot y_0=-\|w\|^2<0 \quad(y\in K).

Those coefficients form a strictly negative weighted test, contrary to the preceding bound. Every finite set of the closed conditions (4) therefore has a common solution; compactness gives one quadruple solving all of them.

For that quadruple, replacing xx by −x-x bounds the absolute real part by C(s(x)+t(y))/2C(s(x)+t(y))/2. Reciprocal positive rescaling gives

∣Re⁡V(x,y)∣≤C2[λ2s(x)+λ−2t(y)].|\operatorname{Re}V(x,y)| \le\tfrac C2[\lambda^2s(x)+\lambda^{-2}t(y)].

When both values are positive, λ4=t(y)/s(x)\lambda^4=t(y)/s(x) minimizes the right side at Cs(x)t(y)C\sqrt{s(x)t(y)}. When one value is zero, the appropriate limit λ↓0\lambda\downarrow0 or λ↑∞\lambda\uparrow\infty gives zero. If both vanish, every rescaling gives zero. Finally choose a scalar phase of xx that makes V(x,y)V(x,y) real and nonnegative; it changes neither quadratic value. This proves the desired modulus inequality. If C=0C=0, (3) for one-term families makes V=0V=0, and any quadruple works. □\square

A finite affine test family separated from the positive orthant.

The diagram displays K={(−2+t,1−2t):0≤t≤1}K=\{(-2+t,1-2t):0\le t\le1\}. Its closest pair is y0=(−6/5,−3/5)y_0=(-6/5,-3/5), z0=(0,0)z_0=(0,0), and its nonnegative weights are w=(6/5,3/5)w=(6/5,3/5). Thus w⋅y=−9/5=−∥w∥2w\cdot y=-9/5=-\|w\|^2 throughout KK, while w⋅z≥0w\cdot z\ge0 on the orthant. This is the finite separation step in the proof above and in (S1) of the preceding lesson.

6. One improvement, then its limit

Assume first that A,BA,B are unital and V≠0V\ne0. Suppose a quadruple supplies a finite constant C>0C>0. For this particular quadruple put

P(x)=φ1((x∗x)2)+φ2((xx∗)2),Q(y)=ψ1((y∗y)2)+ψ2((yy∗)2).P(x)=\varphi_1((x^*x)^2)+\varphi_2((xx^*)^2),\qquad Q(y)=\psi_1((y^*y)^2)+\psi_2((yy^*)^2).

The function h(z)=V(fx(z),fy(z))h(z)=V(f_x(z),f_y(z)) has local scalar power series, by the boundary-curve construction and bounded bilinearity. On any strip 0<ε≤Re⁡z≤20<\varepsilon\le\operatorname{Re}z\le2 it is bounded, and (8) gives

∣h(2+it)∣≤CP(x)1/2Q(y)1/2,∣h(ε+it)∣≤∥V∥∥x∥ε∥y∥ε.(10)|h(2+it)|\le C P(x)^{1/2}Q(y)^{1/2},\qquad |h(\varepsilon+it)|\le\|V\|\|x\|^\varepsilon\|y\|^\varepsilon. \tag{10}

Apply (9) at real coordinate 11. The left and right boundary exponents are 1/(2−ε)1/(2-\varepsilon) and (1−ε)/(2−ε)(1-\varepsilon)/(2-\varepsilon). For nonzero x,yx,y, decrease ε\varepsilon to zero; their norm powers tend to one. Since fx(1)=xf_x(1)=x, this proves

∣V(x,y)∣≤C∥V∥ P(x)1/4Q(y)1/4.(11)|V(x,y)|\le\sqrt{C\|V\|}\,P(x)^{1/4}Q(y)^{1/4}. \tag{11}

A zero variable makes both sides zero. Vanishing boundary bounds are handled by the positive-tolerance form of the strip estimate.

Use (11) for the finite random inputs X,YX,Y of Section 4. Two scalar Cauchy–Schwarz estimates on a probability space give

E[P(X)1/4Q(Y)1/4]≤(EP(X))1/4(EQ(Y))1/4.\mathbb E[P(X)^{1/4}Q(Y)^{1/4}] \le(\mathbb E P(X))^{1/4}(\mathbb E Q(Y))^{1/4}.

Indeed the first gives the product of (EP(X)1/2)1/2(\mathbb E P(X)^{1/2})^{1/2} and (EQ(Y)1/2)1/2(\mathbb E Q(Y)^{1/2})^{1/2}; the second bounds each inner expectation by the square root of its full expectation. Lemma 2.1 and positivity of the four norm-one states imply EP(X)≤R(x)2\mathbb E P(X)\le R(x)^2 and EQ(Y)≤R(y)2\mathbb E Q(Y)\le R(y)^2. Together with (12), this yields

∣∑jV(xj,yj)∣≤C∥V∥ [EP(X)]1/4[EQ(Y)]1/4≤C∥V∥ R(x)1/2R(y)1/2.(13)\left|\sum_jV(x_j,y_j)\right| \le\sqrt{C\|V\|}\,[\mathbb E P(X)]^{1/4}[\mathbb E Q(Y)]^{1/4} \le\sqrt{C\|V\|}\,R(x)^{1/2}R(y)^{1/2}. \tag{13}

Lemma 1.2 supplies four states for the improved constant. This completes one full operation C↦C∥V∥C\mapsto\sqrt{C\|V\|}.

The initial constant from the preceding lesson and induction give

Cn=∥V∥(8116)2−n⟶∥V∥.(I1)C_n=\|V\|\left(\frac{81}{16}\right)^{2^{-n}} \longrightarrow\|V\|. \tag{I1}

The boundary weights and the exact normalized constant iteration.

For the current state quadruple, P(x)=φ1((x∗x)2)+φ2((xx∗)2)P(x)=\varphi_1((x^*x)^2)+\varphi_2((xx^*)^2) and Q(y)=ψ1((y∗y)2)+ψ2((yy∗)2)Q(y)=\psi_1((y^*y)^2)+\psi_2((yy^*)^2). The strip is ε≤Re⁡z≤2\varepsilon\le\operatorname{Re}z\le2; at 11, its left and right weights are 1/(2−ε)1/(2-\varepsilon) and (1−ε)/(2−ε)(1-\varepsilon)/(2-\varepsilon). The drawing takes ε=1/4\varepsilon=1/4, giving 4/74/7 and 3/73/7; the proof sends both weights to 1/21/2. For V≠0V\ne0, the lower graph plots the exact values cn=Cn/∥V∥=(81/16)2−nc_n=C_n/\|V\|=(81/16)^{2^{-n}}, 0≤n≤60\le n\le6. Equations (10)–(13) prove the improvement, and (I1) proves the limit. The reproducible figure source defines the coordinates and plotted values.

Choose a quadruple for each CnC_n. The compact product of the four state spaces has a convergent subnet. A subnet is eventually in each tail of the original sequence, so its constants still tend to ∥V∥\|V\|. For each fixed x,yx,y, evaluation of the four states and the scalar square roots is continuous. The limiting quadruple consequently satisfies (1) at that pair. The quadruple was selected once, so it works for all pairs. This proves the unital theorem. For V=0V=0, any states of the nonzero algebras suffice.

The attained-infimum argument gives a second description of the same endpoint. An admissible CC must satisfy ∥V∥≤2C\|V\|\le2C, since each bracket on unit-ball inputs is at most two. For V≠0V\ne0, the infimum cc of admissible constants is finite and at least ∥V∥/2>0\|V\|/2>0. Taking quadruples with constants tending to cc and a compact subnet produces a quadruple at cc. One improvement gives c≤c∥V∥c\le\sqrt{c\|V\|}; division by c\sqrt c proves c≤∥V∥c\le\|V\|. The iteration above only needs compactness at its final limit, not an attained starting infimum.

7. Adjoining units with the same form norm

Let A†,B†A^\dagger,B^\dagger be the forced C*-unitizations proved in CF9. We construct a bilinear extension on these two algebras with norm exactly ∥V∥\|V\|.

For each finite F⊂AF\subset A and δ>0\delta>0, put

HF=∑a∈F(a∗a+aa∗),eF,δ=HF(HF+δ1)−1.H_F=\sum_{a\in F}(a^*a+aa^*),\qquad e_{F,\delta}=H_F(H_F+\delta1)^{-1}.

Continuous calculus gives eF,δ∈Ae_{F,\delta}\in A and 0≤eF,δ≤10\le e_{F,\delta}\le1; the scalar function vanishes at zero. For a∈Fa\in F, order under congruence and the two C*-norm identities give

∥a−aeF,δ∥2≤∥(1−eF,δ)HF(1−eF,δ)∥,∥a−eF,δa∥2≤∥(1−eF,δ)HF(1−eF,δ)∥≤sup⁡t≥0δ2t(t+δ)2=δ4.\begin{aligned} \|a-ae_{F,\delta}\|^2 &\le\|(1-e_{F,\delta})H_F(1-e_{F,\delta})\|,\\ \|a-e_{F,\delta}a\|^2 &\le\|(1-e_{F,\delta})H_F(1-e_{F,\delta})\| \le\sup_{t\ge0}\frac{\delta^2t}{(t+\delta)^2} =\frac{\delta}{4}. \end{aligned}

The first bound uses a∗a≤HFa^*a\le H_F; the second uses aa∗≤HFaa^*\le H_F and ∥z∥2=∥zz∗∥\|z\|^2=\|zz^*\|. The scalar supremum is attained at t=δt=\delta, as (t+δ)2≥4tδ(t+\delta)^2\ge4t\delta. Direct the pairs by increasing FF and decreasing δ\delta. Their positive contractions then approximate every element on both sides. There is no monotonicity assertion for this net. Construct the corresponding contractions f∈Bf\in B.

For s∈A†,t∈B†s\in A^\dagger,t\in B^\dagger, define

We,f(s,t)=V(se,tf).W_{e,f}(s,t)=V(se,tf).

Since the original algebras are ideals, the two inputs belong to A,BA,B. Their norms are at most ∥s∥,∥t∥\|s\|,\|t\|; hence ∥We,f∥≤∥V∥\|W_{e,f}\|\le\|V\|. On A×BA\times B their values tend to VV, since ae→aae\to a, bf→bbf\to b, and bounded bilinearity controls the difference.

To take one limit on all unitized inputs, use the projective completion Z=A†⊗^πB†Z=A^\dagger\widehat\otimes_\pi B^\dagger. A bounded bilinear form WW defines a linear functional by ℓW(∑jsj⊗tj)=∑jW(sj,tj)\ell_W(\sum_js_j\otimes t_j)=\sum_jW(s_j,t_j). The algebraic tensor's universal property makes this well-defined, and taking the infimum of projective costs gives ∣ℓW(z)∣≤∥W∥∥z∥π|\ell_W(z)|\le\|W\|\|z\|_\pi. It extends uniquely to the completion. Conversely, evaluation on elementary tensors with unit-ball factors shows ∥W∥≤∥ℓW∥\|W\|\le\|\ell_W\|, since their projective norm is at most one. Thus ∥ℓW∥=∥W∥\|\ell_W\|=\|W\|.

The functionals ℓWe,f\ell_{W_{e,f}} lie in the weak-star compact dual ball of radius ∥V∥\|V\|, whose full proof is in the preceding lesson. Take a convergent subnet with limit ℓ\ell, and set V~(s,t)=ℓ(s⊗t)\widetilde V(s,t)=\ell(s\otimes t). It is bilinear and has norm at most ∥V∥\|V\|. On original inputs its restriction is VV, because the subnet is cofinal and the values of the original net already converge there. Isometric inclusion of A,BA,B in their forced unitizations then gives the opposite norm bound:

∥V~∥=∥V∥.\|\widetilde V\|=\|V\|.

For V=0V=0 the zero extension suffices.

Apply the unital theorem to V~\widetilde V. Restrict each of its four states to its original algebra. A restriction is positive and has norm at most one. If its norm is r>0r>0, dividing by rr makes a state and increases every positive quadratic value. If the restriction is zero, replace it by any state of that nonzero algebra, which also increases these values. Such a state exists directly: choose 0≠h=a∗a∈A0\ne h=a^*a\in A, norm hh by a state of A†A^\dagger, and restrict; the value ∥h∥\|h\| forces the restricted norm to be one. The same argument applies in BB. The resulting four states satisfy (1) with coefficient ∥V∥\|V\|. This proves the nonunital case of Theorem 1.1.

The Banach-bidual norm identity

There is a second norm-preserving extension that is useful independently of the unitization construction. Define T:A→B∗T:A\to B^* by (Tx)(y)=V(x,y)(Tx)(y)=V(x,y), and define its Banach adjoint T∗:B∗∗→A∗T^*:B^{**}\to A^* by (T∗G)(x)=G(Tx)(T^*G)(x)=G(Tx). Then

V‾(F,G)=F(T∗G),F∈A∗∗, G∈B∗∗,∥V‾∥=∥V∥.(14)\overline V(F,G)=F(T^*G),\quad F\in A^{**},\ G\in B^{**}, \qquad \|\overline V\|=\|V\|. \tag{14}

Indeed ∥T∥=∥V∥\|T\|=\|V\| by its definition, and ∣F(T∗G)∣≤∥V∥∥F∥∥G∥|F(T^*G)|\le\|V\|\|F\|\|G\|. For the evaluation embeddings JA,JBJ_A,J_B, V‾(JAx,JBy)=V(x,y)\overline V(J_Ax,J_By)=V(x,y). The embeddings are isometric by the norming-functional proof, so restriction gives the reverse norm inequality. This proves (14) for the Banach biduals, before any product or polar decomposition is considered.

Under the canonical bidual identification specified in Section 2, the maps κA(a+λ1)=JAa+λ1A∗∗\kappa_A(a+\lambda1)=J_Aa+\lambda1_{A^{**}} and κB\kappa_B are unital *-homomorphisms: their products expand by the forced-unitization formula and by the transported product extending the original one. They are contractive by the C*-homomorphism norm proof in CF6. Therefore V‾(κA(s),κB(t))\overline V(\kappa_A(s),\kappa_B(t)) is another unitized extension with norm at most ∥V∥\|V\|; its original restriction forces equality. Exercise 9 checks both descriptions. Formula (14) does not assert separate normality in both variables.

8. Why coefficient one is the endpoint

Put q(x)=(x∗x+xx∗)/2q(x)=(x^*x+xx^*)/2 and let φ=(φ1+φ2)/2\varphi=(\varphi_1+\varphi_2)/2, ψ=(ψ1+ψ2)/2\psi=(\psi_1+\psi_2)/2. The two extra positive terms in 4φ(q(x))4\varphi(q(x)) show that the first bracket of (1) is at most that value; the second bracket has the corresponding bound. Thus

∣V(x,y)∣≤4∥V∥φ(q(x))1/2ψ(q(y))1/2.(15)|V(x,y)|\le4\|V\|\varphi(q(x))^{1/2}\psi(q(y))^{1/2}. \tag{15}

This symmetric corollary is useful, but optimality concerns the four-state coefficient in (1).

For a concrete obstruction to a smaller coefficient, work on B(ℓ2(N))B(\ell^2(\mathbb N)), choose any state ω\omega, and put V(x,y)=ω(xy)V(x,y)=\omega(xy). The product norm gives ∥V∥≤1\|V\|\le1, and V(1,1)=1V(1,1)=1 gives equality. For each positive integer nn, define

ujek=en(k−1)+j(1≤j≤n, k≥1).u_je_k=e_{n(k-1)+j}\qquad(1\le j\le n,\ k\ge1).

The maps extend from the standard orthonormal basis to isometries; their ranges are pairwise orthogonal and exhaust the basis. Hence uj∗uj=1u_j^*u_j=1 and ∑jujuj∗=1\sum_ju_ju_j^*=1.

Test a proposed coefficient C∥V∥C\|V\| on xj=uj∗x_j=u_j^*, yj=ujy_j=u_j. Every bilinear value equals ω(1)=1\omega(1)=1. The four square sums, in the order used in (1), are 1,n1,n1,11,n1,n1,1. Consequently each sum of state brackets equals n+1n+1. Summing the proposed pointwise estimates and using scalar Cauchy–Schwarz yields

n≤C(n+1).n\le C(n+1).

This is available for every nn, so C≥n/(n+1)C\ge n/(n+1) for all nn, and C≥1C\ge1. Thus the coefficient reached by the improvement operation is the best universal one.

9. Exercises through the four mechanisms

State selection and the endpoint

Exercise 1. Given finite families in unital A,BA,B, choose normers for their four positive square sums. Explain why the converse of Lemma 1.2 needs those four choices, and why averaging within an algebra too early can lose the family cost RR. Test a common normer on x=e12∈M2x=e_{12}\in M_2.

Solution. Write

Sx=∑jxj∗xj,Tx=∑jxjxj∗,Sy=∑jyj∗yj,Ty=∑jyjyj∗.S_x=\sum_jx_j^*x_j,\quad T_x=\sum_jx_jx_j^*,\qquad S_y=\sum_jy_j^*y_j,\quad T_y=\sum_jy_jy_j^*.

Each positive element has a state attaining its norm by the scalar detector construction in Section 5. Assign its four independent normers to φ1,φ2,ψ1,ψ2\varphi_1,\varphi_2,\psi_1,\psi_2, in that order. Then the sums of the two family brackets are exactly

φ1(Sx)+φ2(Tx)=R(x),ψ1(Sy)+ψ2(Ty)=R(y).\varphi_1(S_x)+\varphi_2(T_x)=R(x),\qquad \psi_1(S_y)+\psi_2(T_y)=R(y).

The finite weighted affine test consequently has the maximum needed in the converse proof.

Within M2M_2, x=e12x=e_{12} gives Sx=e22S_x=e_{22} and Tx=e11T_x=e_{11}. Both have norm one, but a state taking value one on both would take value two on e11+e22=1e_{11}+e_{22}=1, whereas a state has value one there. Thus a common normer can fail in either algebra. Replacing the two separate normers by their mean before evaluating the two sums need not give the sum of their norms. Four choices preserve the exact two equalities above.

Exercise 8. For the improvement operation on nonzero unital algebras, treat V=0V=0 and V≠0V\ne0 separately. In the latter case prove C≥∥V∥/2C\ge\|V\|/2 for every admissible coefficient, attain its infimum by compactness, and justify the division in the best-constant argument. Explain how iteration reaches the same endpoint.

Solution. If V=0V=0, every input has bilinear value zero, and any quadruple of states works. The nonzero algebras have states by the unit-value extension construction, so none needs to be manufactured by dividing a zero quantity.

Suppose ∥V∥>0\|V\|>0. For ∥x∥,∥y∥≤1\|x\|,\|y\|\le1, each positive quadratic evaluation in (1) is at most one. The two bracket sums are at most two, giving ∣V(x,y)∣≤2C|V(x,y)|\le2C. Supremizing proves C≥∥V∥/2>0C\ge\|V\|/2>0. The preceding lesson provides a finite admissible coefficient; hence their infimum cc is finite and positive. Choose admissible Ck↓cC_k\downarrow c and quadruples for them. A compact subnet of the quadruples converges; its coefficients still tend to cc, and each fixed-input inequality passes to the limit. The limiting quadruple realizes cc.

Section 6 applies one improvement to this quadruple, so c≤c∥V∥c\le\sqrt{c\|V\|}. Since c>0\sqrt c>0, division gives c≤∥V∥\sqrt c\le\sqrt{\|V\|}, and therefore c≤∥V∥c\le\|V\|. Alternatively Ck+1=Ck∥V∥C_{k+1}=\sqrt{C_k\|V\|} starting at (81/16)∥V∥(81/16)\|V\| has the explicit limit in (I1). A compact subnet then realizes that limit. This alternative does not require an attained infimum before beginning the iteration.

Exercise 10. For each positive integer nn, use the orthogonal isometries on ℓ2(N)\ell^2(\mathbb N) and V(x,y)=ω(xy)V(x,y)=\omega(xy), with any state ω\omega, to test a proposed universal coefficient CC. Compute the four square sums at (uj∗,uj)(u_j^*,u_j), derive n≤C(n+1)n\le C(n+1), and determine the resulting lower bound.

Solution. The isometries obey uj∗uj=1u_j^*u_j=1, and their orthogonal range projections pj=ujuj∗p_j=u_ju_j^* sum to one. Therefore, for xj=uj∗x_j=u_j^*, yj=ujy_j=u_j,

∑jxj∗xj=1,∑jxjxj∗=n1,∑jyj∗yj=n1,∑jyjyj∗=1.\sum_jx_j^*x_j=1,\quad\sum_jx_jx_j^*=n1,\qquad \sum_jy_j^*y_j=n1,\quad\sum_jy_jy_j^*=1.

Both sums of state brackets equal n+1n+1, regardless of the four states. The product bound gives ∥V∥≤1\|V\|\le1; V(1,1)=1V(1,1)=1 gives ∥V∥=1\|V\|=1. Each tested value is V(uj∗,uj)=ω(uj∗uj)=1V(u_j^*,u_j)=\omega(u_j^*u_j)=1. Summing the proposed pointwise inequality and applying scalar Cauchy–Schwarz now gives

n=∑j∣V(uj∗,uj)∣≤C(n+1)(n+1)=C(n+1).n=\sum_j|V(u_j^*,u_j)| \le C\sqrt{(n+1)(n+1)}=C(n+1).

The construction of Section 8 is available for every nn, so C≥n/(n+1)C\ge n/(n+1) for every positive integer nn, and passage to the limit forces C≥1C\ge1.

Boundary curves and cutoffs

Exercise 4. Let x=u∣x∣x=u|x| in the canonical bidual of an arbitrary C*-algebra AA. For 0<Re⁡z<10<\operatorname{Re}z<1, prove u∣x∣z∈Au|x|^z\in A by the closed ideal generated by tt on [0,∥x∥][0,\|x\|]. Prove also ug(∣x∣)∈Aug(|x|)\in A for every continuous gg vanishing at zero, and explain the difficulty with the uncut multiplier tz−1t^{z-1}.

Solution. For s=Re⁡z>0s=\operatorname{Re}z>0, the scalar function gz(t)=tzg_z(t)=t^z, gz(0)=0g_z(0)=0, is continuous, because its modulus is tst^s. When s<1s<1, tz−1t^{z-1} is unbounded near zero, so it cannot serve directly as a continuous-calculus multiplier.

For any continuous gg with g(0)=0g(0)=0, use

kδ,g(t)=ρδ(t)g(t)/t(t>0),kδ,g(0)=0.k_{\delta,g}(t)=\rho_\delta(t)g(t)/t\quad(t>0),\qquad k_{\delta,g}(0)=0.

It is continuous and zero near zero. The functions tkδ,g(t)=ρδ(t)g(t)t k_{\delta,g}(t)=\rho_\delta(t)g(t) converge uniformly to g(t)g(t): the error is bounded by sup⁡0≤t≤2δ∣g(t)∣→0\sup_{0\le t\le2\delta}|g(t)|\to0. Thus every such gg belongs to the closed ideal generated by the coordinate function tt; conversely every member of that ideal vanishes at zero by evaluation there.

The polar identity gives uρδ(∣x∣)g(∣x∣)=xkδ,g(∣x∣)∈Au\rho_\delta(|x|)g(|x|)=xk_{\delta,g}(|x|)\in A. Its norm distance from ug(∣x∣)ug(|x|) is at most the preceding scalar error, since ∥u∥≤1\|u\|\le1. Norm closure of the isometric copy of AA in its bidual proves the claim. Applying it to gzg_z proves the requested case 0<s<10<s<1, and indeed every s>0s>0. For x=0x=0 the elements are zero.

Exercise 5. Let K⊂{Re⁡z>0}K\subset\{\operatorname{Re}z>0\} be compact and Re⁡z≥ε>0\operatorname{Re}z\ge\varepsilon>0 on KK. For each integer n≥1n\ge1, compare the bidual projection cutoff removing 0≤t<1/n0\le t<1/n with the continuous AA-valued cutoff ρ1/(2n)\rho_{1/(2n)}. Prove their uniform errors are at most n−εn^{-\varepsilon}, and justify holomorphy of the resulting locally uniform polar-power limit.

Solution. Put b=∣x∣b=|x| and c=1/n≤1c=1/n\le1. Here the projection cutoff can be constructed from continuous calculus alone in the represented canonical bidual MM. Define rk(t)=min⁡(1,k(c−t)+)r_k(t)=\min(1,k(c-t)_+). The positive contractions rk(b)r_k(b) increase. They have a strong limit qq: for j≥kj\ge k, the positive contraction d=rj(b)−rk(b)d=r_j(b)-r_k(b) satisfies d2≤dd^2\le d, so

∥(rj(b)−rk(b))ξ∥2≤⟨(rj(b)−rk(b))ξ,ξ⟩.\|(r_j(b)-r_k(b))\xi\|^2 \le\langle(r_j(b)-r_k(b))\xi,\xi\rangle.

The right side tends to zero by scalar monotone convergence of the bounded quadratic values. Thus the vectors are Cauchy for every ξ\xi, define a bounded strong limit, and strong closedness puts it in MM. It is self-adjoint and positive by its quadratic values.

For fixed kk and j≥kj\ge k, continuous calculus gives

∥rk(b)(1−rj(b))∥≤sup⁡v≥0min⁡(1,kv)(1−min⁡(1,jv))≤k4j.\|r_k(b)(1-r_j(b))\| \le\sup_{v\ge0}\min(1,kv)(1-\min(1,jv)) \le\frac{k}{4j}.

On the nonzero part of the latter expression 0≤v≤1/j0\le v\le1/j, its maximum is bounded by kv(1−jv)≤k/(4j)kv(1-jv)\le k/(4j). Taking j→∞j\to\infty gives rk(b)q=rk(b)r_k(b)q=r_k(b). Then taking k→∞k\to\infty strongly gives q2=qq^2=q. Thus qq is the projection for 0≤t<c0\le t<c, and pn=1−qp_n=1-q is the retained cutoff. On the kernel of bb, qq acts as one.

For z∈Kz\in K, the product rk(b)bzr_k(b)b^z has norm at most cRe⁡z≤cεc^{\operatorname{Re}z}\le c^\varepsilon, because rkr_k is zero for t≥ct\ge c. Strong passage to qbzq b^z preserves this upper bound on every vector and hence in operator norm. Multiplication by the polar partial isometry is contractive, so

∥ubz−upnbz∥≤n−ε.\|u b^z-u p_n b^z\|\le n^{-\varepsilon}.

This is the projection-cutoff estimate; pnp_n need not belong to AA.

For the continuous approximant an(z)=x[ρ1/(2n)(t)tz−1](b)∈Aa_n(z)=x[\rho_{1/(2n)}(t)t^{z-1}](b)\in A, the error is supported on 0≤t≤1/n0\le t\le1/n. Consequently

∥ubz−an(z)∥≤sup⁡0≤t≤1/n(1−ρ1/(2n)(t))tRe⁡z≤n−ε.\|u b^z-a_n(z)\| \le\sup_{0\le t\le1/n}(1-\rho_{1/(2n)}(t))t^{\operatorname{Re}z} \le n^{-\varepsilon}.

Each ana_n is entire: the logarithm is bounded on the support of its cutoff, so the exponential series and its derivative converge uniformly on every bounded parameter disk. These approximants converge locally uniformly in norm to fxf_x. The coefficient estimate in Section 2 constructs the limit's own norm-convergent local series ∑mEx(cm)(z−z0)m\sum_m E_x(c_m)(z-z_0)^m, with a uniformly convergent derivative series on smaller disks. It therefore proves the holomorphy of this locally uniform limit directly. The projection cutoff, the continuous original-algebra cutoff and the limit's local series have distinct roles.

Exercise 6. At real coordinate 11 in the strip [ε,2][\varepsilon,2], 0<ε<10<\varepsilon<1, calculate the two weights applied to the actual boundary estimates (10). Take ε↓0\varepsilon\downarrow0, including zero input and zero boundary cases, and recover (11).

Solution. The weights sum to one and interpolate between their values at the two boundaries. Solving for them at 11 gives

θL=12−ε,θR=1−ε2−ε.\theta_L=\frac1{2-\varepsilon},\qquad \theta_R=\frac{1-\varepsilon}{2-\varepsilon}.

The scalar strip proof therefore yields

∣h(1)∣≤[∥V∥∥x∥ε∥y∥ε]θL[CP(x)1/2Q(y)1/2]θR.|h(1)|\le [\|V\|\|x\|^\varepsilon\|y\|^\varepsilon]^{\theta_L} [C P(x)^{1/2}Q(y)^{1/2}]^{\theta_R}.

Both weights tend to 1/21/2; for nonzero inputs the norm factors tend to one. The right boundary already has powers P1/2Q1/2P^{1/2}Q^{1/2}, so their limiting powers are P1/4Q1/4P^{1/4}Q^{1/4}, while the constants become C∥V∥\sqrt{C\|V\|}. Since h(1)=V(x,y)h(1)=V(x,y), this is (11). A zero variable gives zero by bilinearity. A zero boundary estimate is first replaced by a positive tolerance, the proved strip bound is applied, and the tolerance is then decreased to zero.

Exact finite phase bookkeeping

Exercise 2. Expand (X∗X)2(X^*X)^2 without commuting its coefficients. Identify the two surviving pairings of indices and their intersection, and obtain the exact all-equal subtraction in (6). Check the formula for a single coefficient.

Solution. The term indexed by i,j,k,li,j,k,l is ζi‾ζjζk‾ζlxi∗xjxk∗xl\overline{\zeta_i}\zeta_j\overline{\zeta_k}\zeta_l x_i^*x_jx_k^*x_l. Its expectation survives exactly when {i,k}={j,l}\{i,k\}=\{j,l\} as multisets. The pattern i=j,k=li=j,k=l sums to (∑ixi∗xi)2=S2(\sum_i x_i^*x_i)^2=S^2. The pattern i=l,j=ki=l,j=k, in the displayed multiplication order, sums to ∑ixi∗Txi\sum_i x_i^*T x_i. Their intersection forces all four indices to be equal and contributes ∑i(xi∗xi)2\sum_i(x_i^*x_i)^2. Inclusion–exclusion gives

E(X∗X)2=S2+∑ixi∗Txi−∑i(xi∗xi)2.\mathbb E(X^*X)^2 =S^2+\sum_i x_i^*T x_i-\sum_i(x_i^*x_i)^2.

Every valid pattern outside the intersection was counted once, and each intersection term is now counted once. For one coefficient the first two terms are both (x∗x)2(x^*x)^2, so subtracting the third leaves exactly the required single copy.

Exercise 3. Replace continuous independent phases in the fourth-moment calculation by a finite distribution. Show that independent uniform third roots give the same surviving monomials, count the sample points, and decide whether roots of other orders or real signs work. State what this calculation establishes about interpolation.

Solution. For ω3=1\omega^3=1, ω≠1\omega\ne1, the average over its three roots is

Eζk=(1+ωk+ω2k)/3=0(k=−2,−1,1,2),Eζ0=1.\mathbb E\zeta^k=(1+\omega^k+\omega^{2k})/3 =0\quad(k=-2,-1,1,2),\qquad \mathbb E\zeta^0=1.

A fourth-moment monomial has only exponents from −2-2 to 22 in each coordinate. The product average factors into the coordinate averages and is nonzero exactly when every exponent is zero. Continuous uniform phases have the same criterion by the elementary integral of integer powers around the circle. Thus the pairings and exact fourth moments coincide.

The independent three-root product has exactly 3n3^n equally weighted points. It is an exact formula, not an approximation by sampled phases. Uniform roots of any order m≥3m\ge3 also have zero average for those four nonzero exponents and give the same result. Signs have nonzero second-power average and retain extra monomials. The finite distribution establishes the moment and diagonal-extraction identities; the strip estimate still needs its separate analytic proof.

Exercise 7. For bilinear VV, compare Y=∑jζj‾yjY=\sum_j\overline{\zeta_j}y_j with Y=∑jζjyjY=\sum_j\zeta_jy_j. Calculate every diagonal and off-diagonal average coefficient and explain which choice gives (12).

Solution. With conjugated phases, expansion and finite summation give

EV(X,Y)=∑i,jE[ζiζj‾] V(xi,yj).\mathbb E V(X,Y) =\sum_{i,j}\mathbb E[\zeta_i\overline{\zeta_j}]\,V(x_i,y_j).

The diagonal coefficient is E∣ζi∣2=1\mathbb E|\zeta_i|^2=1. For i≠ji\ne j, independence and the zero means give coefficient zero. Every diagonal term is therefore retained and (12) follows.

For the same phases in both inputs, the coefficient is E[ζiζj]\mathbb E[\zeta_i\zeta_j]. It vanishes off the diagonal by independence and on the diagonal by Eζi2=0\mathbb E\zeta_i^2=0. That choice makes the entire average zero, even when the intended sum of diagonal bilinear values is nonzero. Conjugation is determined by the bilinear convention.

Unitization and the two bidual variables

Exercise 9. Prove the exact norm identity (14), including its value on the canonical copies of A,BA,B. Verify that composition with the contractive canonical unitization maps preserves that norm. Independently construct a norm-preserving unitized extension from two-sided positive approximate identities and compactness of the projective-tensor dual ball.

Solution. The definition of TT gives

∥T∥=sup⁡∥x∥,∥y∥≤1∣(Tx)(y)∣=∥V∥.\|T\|=\sup_{\|x\|,\|y\|\le1}|(Tx)(y)|=\|V\|.

For F∈A∗∗,G∈B∗∗F\in A^{**},G\in B^{**}, the dual norm estimates yield

∣F(T∗G)∣≤∥F∥∥T∗G∥≤∥V∥∥F∥∥G∥.|F(T^*G)|\le\|F\|\|T^*G\| \le\|V\|\|F\|\|G\|.

Evaluation embeddings are isometric by norming functionals, and

(T∗JBy)(x)=(JBy)(Tx)=V(x,y),V‾(JAx,JBy)=V(x,y).(T^*J_By)(x)=(J_By)(Tx)=V(x,y),\qquad \overline V(J_Ax,J_By)=V(x,y).

The upper norm bound and this restriction prove ∥V‾∥=∥V∥\|\overline V\|=\|V\|. Under the canonical C*-bidual construction, the maps a+λ1↦JAa+λ1A∗∗a+\lambda1\mapsto J_Aa+\lambda1_{A^{**}} are unital *-homomorphisms, hence contractive by CF6. Composition cannot increase the upper bound, while its restriction still gives VV, so this particular unitized form also has norm exactly ∥V∥\|V\|. These calculations do not assert separate normality in both variables.

For the direct construction, use the finite-set contractions

e=HF(HF+δ1)−1,HF=∑a∈F(a∗a+aa∗).e=H_F(H_F+\delta1)^{-1},\qquad H_F=\sum_{a\in F}(a^*a+aa^*).

They belong to AA, are positive with norm at most one, and for a∈Fa\in F

∥a−ae∥2, ∥a−ea∥2≤∥(1−e)HF(1−e)∥≤sup⁡t≥0δ2t(t+δ)2=δ/4.\|a-ae\|^2,\ \|a-ea\|^2 \le\|(1-e)H_F(1-e)\| \le\sup_{t\ge0}\frac{\delta^2t}{(t+\delta)^2} =\delta/4.

The two inequalities use a∗aa^*a and aa∗aa^*, respectively; the C*-identity can be applied to z∗zz^*z or zz∗zz^*. Increasing the finite set and decreasing δ\delta gives approximation on both sides for every element. The corresponding contractions ff do the same in BB.

The unitized forms We,f(s,t)=V(se,tf)W_{e,f}(s,t)=V(se,tf) have norm at most ∥V∥\|V\| and converge to VV on original inputs. Each defines a functional on A†⊗^πB†A^\dagger\widehat\otimes_\pi B^\dagger with the same norm: bound its value on every finite decomposition by the projective cost, extend by completeness, and use elementary tensors for the reverse inequality. The preceding lesson's compact dual-ball proof supplies a convergent subnet of these functionals. Its limit gives one bounded bilinear form on both unitizations, with upper norm bound ∥V∥\|V\|, whose original restriction is VV. That restriction forces the lower bound. Thus this construction also preserves the norm, including when V=0V=0, and supplies the extension used in the main nonunital proof.

References

Gilles Pisier, Grothendieck's Theorem, past and present, expanded UNCUT author version, 21 August 2013, Theorem 7.1 and (7.1)–(7.3), printed p.25 (PDF p.27), gives the four-state and finite-family formulations and their normalizations. The sharp theorem there is attributed to Haagerup. Section 11, printed pp.35–36 (PDF pp.37–38), proves the finite CAR optimality construction for the maximum-of-two-norms normalization. The orthogonal-isometry test in Section 8 here proves optimality for the four-state coefficient directly.

Gilles Pisier, Grothendieck inequality, random matrices and quantum expanders, Kyoto lectures recorded by Kei Hasegawa, March 2015, §5, pp.9–10, presents the phase fourth-moment and three-lines improvement used in Sections 4 and 6. Remark 5.3 credits these steps to Pisier's 1978 work and the finiteness ingredient to Haagerup. The lecture's subsequent finiteness step is an outline; here the finite starting bound comes from the preceding two lessons, and Sections 2–3 and 7 supply the norm-series, scalar strip and nonunital arguments.

The random-lift lesson and the completion and state-domination lesson provide the finite starting constant and full affine compactness argument. The scalar and C*-foundations are CF1–10. The canonical bidual notation uses the universal all-state/predual construction followed by the concrete support and polar-decomposition proof. The strip, norm-series and direct unitization arguments are given in full above.