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

Tracial adjoints and rational matrix models

Written and revised by GPT-6.1 Sol (OpenAI), Ultra, September–October 2026. New original text: public domain (CC0).

A finite matrix measurement should reproduce the state in which the experiment is performed. Exact state preservation, however, need not recover every observable. We will first build a two-level measurement that preserves all state averages and loses part of an off-diagonal entry. Its failure of recovery will tell us what the general estimate must measure.

The complete-positivity calculations are proved below in P04, and the trace Hilbert completion is built in P05. Finite matrix state foundations recovers a density from its functional and distinguishes that density from the lists of pure states used to prepare it.

For the general recording theorem, (M,τ)(M,\tau) is any von Neumann algebra with a faithful normal tracial state. No factor or separability hypothesis is imposed on MM. Write τm=Tr⁡/m\tau_m=\operatorname{Tr}/m; inner products are linear in the second variable. For a state φ\varphi, the error norm is

∥x∥φ#=(φ(x∗x)+φ(xx∗)2)1/2.(1)\|x\|_\varphi^\#=\left(\frac{\varphi(x^*x)+\varphi(xx^*)}{2}\right)^{1/2}. \tag{1}

Order and Hilbert-space tools

The constructions below use the concrete Hilbert-space and ultraweak-topology proofs in Regular-group operator foundations, H00–H03, and the Banach-algebra and continuous-calculus proofs in Infinite tensor products and their reference states, F01–F08. The following arguments give the particular matrix, positivity and Hilbert-completion consequences needed here. The faithful normal tracial state is a hypothesis throughout.

P00. Hilbert coordinates and finite matrix order

Every Hilbert space, with no separability assumption, admits the coordinate form used in H00 and H03. Choose a maximal orthonormal family by Zorn. Its closed span is the whole space: H01 projects onto that span, and a nonzero orthogonal-complement vector could otherwise be normalized and added. The map from finite coordinate vectors to their finite orthonormal sums is isometric, extends by H00 completeness to the coordinate Hilbert space, and has closed dense image. This identifies the given Hilbert space unitarily with an arbitrary-coordinate ℓ2(I)\ell^2(I). The zero space is included. Thus H03's arbitrary-coordinate series-vector topology applies to every concrete representation used below.

On HrH^r, the operators with entries in a unital norm-closed *-algebra A⊂B(H)A\subset B(H) form a norm-closed unital -algebra Mr(A)M_r(A). Indeed a norm limit has entries obtained by the bounded coordinate inclusions and projections, and every limiting entry remains in AA. H00 gives its C-identity; F03–F08 therefore apply to its positive elements, square roots and order. This does not invoke a tensor-product norm theorem. A positive block operator is positive exactly when its quadratic form on HrH^r is nonnegative, by H02. In particular a column sandwich of a positive block is positive, including rectangular columns: its quadratic form is the original one evaluated on that column.

P01. Positive functionals and tracial products

Let ω\omega be a positive linear functional on a unital concrete C*-algebra. Its value on every selfadjoint element is real, since F08 writes that element as a difference of positive elements. Real and imaginary selfadjoint parts consequently give ω(x∗)=ω(x)‾\omega(x^*)=\overline{\omega(x)}. Expanding ω((x+zy)∗(x+zy))≥0\omega((x+zy)^*(x+zy))\ge0 proves

∣ω(x∗y)∣2≤ω(x∗x)ω(y∗y).|\omega(x^*y)|^2\le\omega(x^*x)\omega(y^*y).

If the second diagonal value is positive, minimize the resulting scalar quadratic in zz. If it is zero, an arbitrarily large scalar with the opposite phase to a nonzero mixed term would make the quadratic negative; the mixed term must therefore vanish. F08 gives x∗x≤∥x∥21x^*x\le\|x\|^2 1, whence

∣ω(x)∣2≤ω(1)ω(x∗x)≤ω(1)2∥x∥2.|\omega(x)|^2\le\omega(1)\omega(x^*x) \le\omega(1)^2\|x\|^2.

Thus ∥ω∥=ω(1)\|\omega\|=\omega(1), including the case ω(1)=0\omega(1)=0, when ω=0\omega=0.

If τ\tau is tracial and a,b≥0a,b\ge0, its trace pairing is nonnegative:

τ(ab)=τ(a1/2ba1/2)≥0.\tau(ab)=\tau(a^{1/2}ba^{1/2})\ge0.

The square root is supplied by F06–F08. For block matrices, t=Tr⁡r⊗τt=\operatorname{Tr}_r\otimes\tau is positive, because every diagonal compression of a positive block is positive, and tracial, because

t(XY)=∑a,bτ(xabyba)=∑a,bτ(ybaxab)=t(YX).t(XY)=\sum_{a,b}\tau(x_{ab}y_{ba}) =\sum_{a,b}\tau(y_{ba}x_{ab})=t(YX).

Consequently t(XZ)≥0t(XZ)\ge0 for positive blocks X,ZX,Z, by the same square-root sandwich. Faithfulness is not required for this product argument.

P02. Normal multiplication and matrix-valued maps

Normality here is continuity for the concrete ultraweak topology of H03. Every continuous linear functional in that topology is a series-vector functional: continuity bounds its value near zero by finitely many such tests; it vanishes on their common kernel by scalar multiplication, hence factors through their finite-dimensional joint image. Extend that linear functional to the finite coordinate space to express it as a finite linear combination of the tests. Concatenating their absolutely summable series gives one series of the same form. Thus this assertion imports no general normal-functional decomposition or trace-class theorem.

Write a normal functional on a concrete algebra as the H03 series

η(x)=∑j⟨ξj,xηj⟩,∑j∥ξj∥∥ηj∥<∞.\eta(x)=\sum_j\langle\xi_j,x\eta_j\rangle, \qquad \sum_j\|\xi_j\|\|\eta_j\|<\infty.

For fixed bounded a,ba,b,

η(axb)=∑j⟨a∗ξj,xbηj⟩.\eta(axb)=\sum_j\langle a^*\xi_j,x b\eta_j\rangle.

The sum of products of the new vector norms is at most ∥a∥∥b∥∑j∥ξj∥∥ηj∥\|a\|\|b\|\sum_j\|\xi_j\|\|\eta_j\|. Hence x↦axbx\mapsto axb is ultraweakly continuous. In particular x↦τ(xb)x\mapsto\tau(xb) is normal when τ\tau is normal. This uses the given trace's normality, not automatic normality of any abstract functional.

A map into MmM_m whose finitely many coordinates are bounded normal functionals is bounded and normal. Boundedness follows from ∥[aij]∥≤mmax⁡ij∣aij∣\|[a_{ij}]\|\le m\max_{ij}|a_{ij}|. A linear functional on the finite-dimensional matrix range is a finite linear combination of those coordinates, and hence pulls back to a normal functional. The ultraweak topology of a finite-dimensional matrix algebra is its usual finite-dimensional topology: the matrix entries themselves are one-term series-vector functionals. These observations prove the normality assertion without a theorem about general normal maps.

P03. Matrix densities, diagonalization and the positive dual cone

For a matrix AA, if Tr⁡(AY)\operatorname{Tr}(AY) is a real nonnegative number for every positive YY, test Y=vv∗Y=vv^*. The quadratic form v∗Avv^*Av is then real and nonnegative for every vv. It follows that A=A∗A=A^*: write A=B+iCA=B+iC, with B,CB,C selfadjoint; v∗Cv=0v^*Cv=0 for all vv, and the tests eie_i, ei+eje_i+e_j, ei+ieje_i+ie_j make every entry of CC zero. The quadratic form criterion in H02 now gives A≥0A\ge0. Conversely, P01 proves nonnegativity of the trace pairing of two positive matrices. Thus the matrix positive cone is exactly its positive trace dual cone. Dividing trace by any positive integer does not change this statement.

For completeness, finite selfadjoint matrices diagonalize using the already supplied spectral graph. In positive dimension F03 makes the spectrum nonempty and F04 makes it real. For a spectral value λ\lambda, the finite matrix A−λ1A-\lambda1 is not invertible and so has a nonzero kernel, by finite linear algebra. Normalize a kernel vector. Its orthogonal complement is invariant under AA, by selfadjointness; induction on dimension gives an orthonormal eigenbasis and a unitary diagonalization. The zero-dimensional induction endpoint is empty. Positivity is equivalent to nonnegative eigenvalues by the quadratic form criterion, and F06's continuous functions act on this diagonalization by their scalar values. In particular a positive matrix with zero kernel has a strictly positive smallest eigenvalue and bounded inverse, inverse square root and fourth roots.

For any linear functional φ\varphi on MmM_m, the unique matrix representing it is

hij=mφ(eji),φ(y)=τm(hy).h_{ij}=m\varphi(e_{ji}),\qquad \varphi(y)=\tau_m(hy).

The coordinate identity is obtained by expanding yy in matrix units. If φ\varphi is positive, then v∗hv=mφ(vv∗)≥0v^*hv=m\varphi(vv^*)\ge0, so h≥0h\ge0 by the preceding dual-cone test. Conversely h≥0h\ge0 gives a positive functional by P01. The unit condition is τm(h)=1\tau_m(h)=1.

This state is faithful precisely when hh is invertible. A nonzero kernel projection pp gives φ(p)=0\varphi(p)=0. Conversely, if h≥δ1h\ge\delta1, δ>0\delta>0, then for y≥0y\ge0

φ(y)=τm(hy)≥δτm(y),τm(y)=m−1∑i∥y1/2ei∥2.\varphi(y)=\tau_m(hy)\ge\delta\tau_m(y), \qquad \tau_m(y)=m^{-1}\sum_i\|y^{1/2}e_i\|^2.

The last quantity vanishes only for y=0y=0. A density's diagonalization also gives its vector-state mixture φ(y)=∑i(λi/m)⟨vi,yvi⟩\varphi(y)=\sum_i(\lambda_i/m)\langle v_i,yv_i\rangle, with nonnegative weights summing to one. The density is uniquely fixed by the state even though different vector families may describe the same state; for example the normalized trace on M2M_2 is the equal mixture in either the standard basis or the basis (e1±e2)/2(e_1\pm e_2)/\sqrt2. No mixture classification is needed by the three tracial-adjoint results.

P04. The needed complete-positivity rules and Schwarz

A linear map is completely positive when each of its entrywise matrix amplifications preserves positive block operators. Positive linear maps preserve adjoints: a selfadjoint input is a difference of positive inputs by F08, and real and imaginary parts give the general assertion.

For a fixed rectangular bounded operator VV, the map x↦V∗xVx\mapsto V^*xV is completely positive. At size rr its image of a positive block XX is the sandwich by the block-diagonal operator with rr copies of VV, positive by P00. Finite sums of such sandwiches are therefore completely positive, and are unital exactly when ∑Vi∗Vi\sum V_i^*V_i is the identity on their common domain, the unit of the target algebra. Compositions of completely positive maps are completely positive, since their amplifications compose. Unitary conjugations and compressions to finite-dimensional corners are particular sandwiches. The map x↦x⊗1px\mapsto x\otimes1_p is completely positive as well: after reordering the finite coordinate factors, every amplification is a direct sum of pp copies of the original positive block. Compression to a corner takes the corner projection, rather than the full ambient identity, as its unit.

If Φ\Phi is unital and completely positive, apply its size-two amplification to the positive Gram block

(x∗xx∗x1)=(x∗1)(x1).\begin{pmatrix}x^*x&x^*\\x&1\end{pmatrix} =\begin{pmatrix}x^*\\1\end{pmatrix}\begin{pmatrix}x&1\end{pmatrix}.

Its image is [Φ(x∗x)Φ(x)∗Φ(x)1]\left[\begin{smallmatrix}\Phi(x^*x)&\Phi(x)^*\\\Phi(x)&1\end{smallmatrix}\right]. Sandwich by the column [1−Φ(x)]\left[\begin{smallmatrix}1\\-\Phi(x)\end{smallmatrix}\right] to obtain

Φ(x)∗Φ(x)≤Φ(x∗x).(P04-Schwarz)\Phi(x)^*\Phi(x)\le\Phi(x^*x). \tag{P04-Schwarz}

The block positivity and sandwich are P00; no dilation theorem is used. Positivity also preserves x∗x≤∥x∥21x^*x\le\|x\|^2 1. Thus F08 and the C*-identity give ∥Φ(x)∥≤∥x∥\|\Phi(x)\|\le\|x\|. Evaluating at the unit gives its norm one for a nonzero target algebra, as in every application here. A zero target gives the zero map with norm zero. This proves every CP, Schwarz and unit-norm fact needed by the lesson.

For the Gram coefficients in Exercise 7, write ηi(r)\eta_i(r) for the coordinates of its finite vectors and put Dr=diag⁡(ηi(r))D_r=\operatorname{diag}(\eta_i(r)). Then

∑rDr∗xDrhas entry(∑rηi(r)‾ηj(r))xij=⟨ηi,ηj⟩xij.\sum_rD_r^*xD_r\quad\hbox{has entry}\quad \Bigl(\sum_r\overline{\eta_i(r)}\eta_j(r)\Bigr)x_{ij} =\langle\eta_i,\eta_j\rangle x_{ij}.

If every ηi\eta_i is a unit vector, ∑rDr∗Dr=1\sum_rD_r^*D_r=1. This directly proves the stated ucp Schur multiplier; the Schur-product theorem is unnecessary.

P05. The trace Hilbert completion

For the hypothesized faithful tracial state τ\tau, put ⟨x,y⟩τ=τ(x∗y)\langle x,y\rangle_\tau=\tau(x^*y). P01 makes this a sesquilinear positive form and supplies Cauchy–Schwarz. Faithfulness makes it positive definite. Its associated norm satisfies the triangle inequality by Cauchy–Schwarz.

Complete this normed space by the F01 Cauchy-sequence construction: identify two norm-Cauchy sequences when their difference tends to zero, and define their inner product by lim⁡nτ(xn∗yn)\lim_n\tau(x_n^*y_n). That limit exists by Cauchy–Schwarz and boundedness of the two sequences. The definition is independent of representatives, extends the original inner product and is positive definite on the quotient. Completeness can be seen directly: from a Cauchy sequence of quotient vectors choose a subsequence with successive distances below 2−j2^{-j}, approximate its jj-th term by an original algebra element within 2−j2^{-j}, and use the resulting Cauchy sequence of algebra elements as the limit. The Cauchy property gives the same limit for the entire original sequence. This is L2(M,τ)L^2(M,\tau), and the image of MM, the bounded elements, is dense by construction.

Left multiplication by a∈Ma\in M is bounded on this completion, since F08 gives

∥ax∥22=τ(x∗a∗ax)≤∥a∥2τ(x∗x).\|ax\|_2^2=\tau(x^*a^*ax)\le\|a\|^2\tau(x^*x).

Traciality makes Jx=x∗Jx=x^* a conjugate-linear isometry, because τ(xx∗)=τ(x∗x)\tau(xx^*)=\tau(x^*x). It extends to the completion, squares to the identity, and right multiplication by aa is JLa∗JJ L_{a^*}J, also bounded by ∥a∥\|a\|. These bounded extensions need no assertion that the trace representation has a normally closed range.

If h>0h>0 is a matrix density, the weighted form

⟨a,b⟩h=τm(h1/2a∗h1/2b)\langle a,b\rangle_h=\tau_m(h^{1/2}a^*h^{1/2}b)

is the ordinary Hilbert–Schmidt form of h1/4ah1/4h^{1/4}ah^{1/4} and h1/4bh1/4h^{1/4}bh^{1/4}, by cyclicity. The change of variables is invertible by P03, so the form is positive definite. Its finite-dimensional completion is the same vector space. This also supplies all of Exercise 3.

P06. Finite-source adjoints and the exact TT∗TT^* norm

Let EE be any finite-dimensional Hilbert space with orthonormal basis b1,…,bdb_1,\ldots,b_d, and let A:E→KA:E\to K be linear, where KK is a Hilbert space. This map is bounded before any contraction conclusion is drawn:

∥Au∥≤(∑i∥Abi∥2)1/2∥u∥.\|Au\|\le\Bigl(\sum_i\|Ab_i\|^2\Bigr)^{1/2}\|u\|.

Define

A∗v=∑i⟨Abi,v⟩bi.A^*v=\sum_i\langle Ab_i,v\rangle b_i.

The finite expansion proves ⟨Au,v⟩=⟨u,A∗v⟩\langle Au,v\rangle=\langle u,A^*v\rangle, uniqueness, and boundedness of the adjoint. Norming a Hilbert vector by its inner product with unit vectors (take that vector divided by its norm when nonzero) gives ∥A∗∥=∥A∥\|A^*\|=\|A\|. The inequalities

∥AA∗∥≤∥A∥∥A∗∥=∥A∥2,∥A∗v∥2=⟨v,AA∗v⟩≤∥AA∗∥∥v∥2\|AA^*\|\le\|A\|\|A^*\|=\|A\|^2, \qquad \|A^*v\|^2=\langle v,AA^*v\rangle\le\|AA^*\|\|v\|^2

therefore give ∥AA∗∥=∥A∥2\|AA^*\|=\|A\|^2. The argument also covers the zero operator and the zero-dimensional source. It does not require a spectral theorem for operators on KK. H00 gives the same identity for arbitrary bounded Hilbert operators, after P00 identifies their spaces with coordinate spaces, but the finite-source proof alone suffices here.

If a bounded operator on KK satisfies a contraction estimate on a dense subspace, norm continuity gives the estimate on all of KK. Equivalently, a linear contraction defined on that dense subspace has a unique contraction extension: images of Cauchy approximants are Cauchy, and their limits are independent of the approximants.

0. A measurement that preserves the state but loses coherence

Let φ(x)=13x11+23x22\varphi(x)=\tfrac13x_{11}+\tfrac23x_{22} on M2M_2. Its density relative to τ2\tau_2 is h=diag⁡(2/3,4/3)h=\operatorname{diag}(2/3,4/3). Give the second coordinate two slots and the first coordinate one slot in a three-dimensional record:

R(abcd)=(ab0cd000d).R\begin{pmatrix}a&b\\c&d\end{pmatrix} =\begin{pmatrix}a&b&0\\c&d&0\\0&0&d\end{pmatrix}.
L(Y)=(Y11Y12/2Y21/2(Y22+Y33)/2).L(Y)=\begin{pmatrix} Y_{11}&Y_{12}/\sqrt2\\ Y_{21}/\sqrt2&(Y_{22}+Y_{33})/2 \end{pmatrix}.

These formulas define ucp maps R:M2→M3R:M_2\to M_3 and L:M3→M2L:M_3\to M_2. To check this before any general adjoint theorem, write R(x)=W1∗xW1+W2∗xW2R(x)=W_1^*xW_1+W_2^*xW_2, where

W1=(100010),W2=(000001).W_1=\begin{pmatrix}1&0&0\\0&1&0\end{pmatrix}, \qquad W_2=\begin{pmatrix}0&0&0\\0&0&1\end{pmatrix}.

Similarly L(Y)=K1∗YK1+K2∗YK2L(Y)=K_1^*YK_1+K_2^*YK_2, where

K1=(1001/200),K2=(000001/2).K_1=\begin{pmatrix}1&0\\0&1/\sqrt2\\0&0\end{pmatrix}, \qquad K_2=\begin{pmatrix}0&0\\0&0\\0&1/\sqrt2\end{pmatrix}.

Each sandwich is completely positive at every matrix level. The sums ∑Wi∗Wi=13\sum W_i^*W_i=1_3 and ∑Ki∗Ki=12\sum K_i^*K_i=1_2 prove unitality. On diagonal entries the formulas give

τ3R=φ,φL=τ3.\tau_3R=\varphi,\qquad \varphi L=\tau_3.

Thus both directions preserve their specified states, and the composite preserves φ\varphi. Nevertheless

LR(abcd)=(ab/2c/2d).LR\begin{pmatrix}a&b\\c&d\end{pmatrix} =\begin{pmatrix}a&b/\sqrt2\\c/\sqrt2&d\end{pmatrix}.

Diagonal observations are recovered exactly. An off-diagonal observation is reduced by 1/21/\sqrt2. State preservation sees the diagonal probabilities but does not force recovery of the other entries. The next two diagnostics quantify this loss.

Exercise 5. Take m=2m=2, h=diag⁡(2/3,4/3)h=\operatorname{diag}(2/3,4/3). Find p1,p2,qp_1,p_2,q and the coefficient on e12e_{12}.

Solution. The state weights are the density eigenvalues divided by mm, hence 1/3,2/31/3,2/3. Choose p1=1,p2=2,q=3p_1=1,p_2=2,q=3; then mpi/qmp_i/q are the two eigenvalues. The explicit matrices above give LR(e12)=e12/2LR(e_{12})=e_{12}/\sqrt2, while both diagonal matrix units are fixed. The different coordinate multiplicities damp this off-diagonal entry.

Exercise 6. Verify both sides of the commutator error bound for the matrix unit in Exercise 5.

Solution. Put d=1−1/2d=1-1/\sqrt2. The error is −de12-d e_{12}, so its symmetrized state norm squared is

d22(φ(e22)+φ(e11))=(1−1/2)22.\frac{d^2}{2}\bigl(\varphi(e_{22})+\varphi(e_{11})\bigr) =\frac{(1-1/\sqrt2)^2}{2}.

The commutator is (2/3−4/3)e12(\sqrt{2/3}-\sqrt{4/3})e_{12}. Its normalized Hilbert–Schmidt square is (2−1)2/3(\sqrt2-1)^2/3. The error square is (2−1)2/4(\sqrt2-1)^2/4, giving the ratio 3/43/4. Thus the bound holds strictly in this example. These are direct calculations of the two norms; the general theorem has not been used.

1. The trace adjoint stays completely positive

The reverse map should match the trace pairing of the forward map. This determines an ordinary trace adjoint, but that adjoint has value hh at the identity, rather than 11. Two-sided density normalization is therefore a mathematical requirement.

In the preceding laboratory,

R♯(Y)=23(Y11Y12Y21Y22+Y33).R^\sharp(Y)=\frac23 \begin{pmatrix}Y_{11}&Y_{12}\\Y_{21}&Y_{22}+Y_{33}\end{pmatrix}.
R♯(13)=h.R^\sharp(1_3)=h.

Multiplying only on the left by h−1h^{-1} would make the value at the identity correct but would destroy positivity. For example, the positive matrix with a 22-by-22 all-ones upper block and zero third row and column would map to

(111/21/2),\begin{pmatrix}1&1\\1/2&1/2\end{pmatrix},

which is not self-adjoint. Sandwiching with h−1/2h^{-1/2} instead gives exactly the ucp map LL written above. We now justify that normalization for an arbitrary faithfully tracial algebra.

Lemma 1.1. If T:Mm→MT:M_m\to M is cp, there is a unique normal cp map T♯:M→MmT^\sharp:M\to M_m satisfying

τm(T♯(x)y)=τ(xT(y))(x∈M, y∈Mm).(2)\tau_m(T^\sharp(x)y)=\tau(xT(y))\qquad(x\in M,\ y\in M_m). \tag{2}

Proof. The required pairing specifies every entry:

T♯(x)ij=mτ(xT(eji)).T^\sharp(x)_{ij}=m\tau\bigl(xT(e_{ji})\bigr).

These entries are bounded normal functionals of xx. They therefore define a bounded normal linear map, and the matrix-unit pairing proves (2) and uniqueness.

To check positivity at every size, fix rr, put t=Tr⁡r⊗τt=\operatorname{Tr}_r\otimes\tau, and let X=[xab]≥0X=[x_{ab}]\ge0 in Mr(M)M_r(M). For each Y=[yab]≥0Y=[y_{ab}]\ge0 in Mr(Mm)M_r(M_m), summing (2) over the diagonal of a product gives

(Tr⁡r⊗τm)([T♯(xab)]Y)=t(X[T(yab)])≥0.(3)(\operatorname{Tr}_r\otimes\tau_m) \bigl([T^\sharp(x_{ab})]Y\bigr) =t\bigl(X[T(y_{ab})]\bigr)\ge0. \tag{3}

Complete positivity of TT makes [T(yab)][T(y_{ab})] positive. Traciality changes the product on the right into the positive sandwich by X1/2X^{1/2}. On the finite matrix algebra, an element having nonnegative trace pairing with every positive YY is positive: tests against all rank-one projections give a nonnegative quadratic form. Thus [T♯(xab)]≥0[T^\sharp(x_{ab})]\ge0. The arbitrary size rr proves complete positivity. Only a faithful normal trace on MM has been used. □\square

Exercise 1. Give the coordinate formula for the trace adjoint in (2).

Solution. Pair with y=eijy=e_{ij}. Since τm(Aeij)=Aji/m\tau_m(Ae_{ij})=A_{ji}/m, equation (2) gives T♯(x)ji=mτ(xT(eij))T^\sharp(x)_{ji}=m\tau(xT(e_{ij})). Each entry is normal and bounded. These coordinates also show uniqueness and linearity directly.

The weighted Hilbert adjoint and the improved norm bound T maps the weighted finite matrix Hilbert space to the trace Hilbert completion. S is its Hilbert adjoint. Schwarz and exact trace preservation bound TS=TT*, giving the improved norm of T. The weighted-adjoint norm mechanism Weighted matrix Hilbert space Hh = (Mm, ⟨·,·⟩h) Trace Hilbert completion K = L²(M, τ) T S = T* TS = TT* acts on K ucp Schwarz and τ TS = τ give ‖TS‖ ≤ 1 ‖T‖² = ‖TT*‖ ≤ 1 Improved weighted estimate (6) T is bounded first by its finite-source basis estimate. The exact Hilbert norm identity is P06.

Theorem 2.1 views the recording map between two Hilbert spaces. Its backward map is the Hilbert adjoint. Schwarz and trace preservation bound their composite on the trace completion; P06 then gives the improved bound on the recording map. The two Hilbert spaces and each arrow's domain are shown above.

Exercise 2. Why does faithfulness on positive elements imply that hh is invertible?

Solution. If the positive density had a nonzero kernel projection pp, then 0=τm(hp)=τ(T(p))0=\tau_m(hp)=\tau(T(p)). The operator T(p)T(p) is positive, and faithfulness of τ\tau gives T(p)=0T(p)=0. Faithfulness of TT gives p=0p=0, a contradiction. A positive matrix with zero kernel has a strictly positive minimum eigenvalue, hence an inverse.

2. The weighted recording map

The matrix state attached to a reconstruction TT is φ=τT\varphi=\tau T. If TT loses no positive element, this state assigns a strictly positive weight in every matrix direction. Its inverse square root can then turn the trace adjoint into a unital recording map.

Theorem 2.1. Suppose T:Mm→MT:M_m\to M is unital, completely positive and faithful on positive elements. Put φ=τT\varphi=\tau T, and write φ(y)=τm(hy)\varphi(y)=\tau_m(hy). Then h>0h>0 is invertible, τm(h)=1\tau_m(h)=1, and

S(x)=h−1/2T♯(x)h−1/2(4)S(x)=h^{-1/2}T^\sharp(x)h^{-1/2} \tag{4}

is the unique ucp map satisfying

τm(h1/2S(x)h1/2y)=τ(xT(y)).(5)\tau_m(h^{1/2}S(x)h^{1/2}y)=\tau(xT(y)). \tag{5}

It is normal and φS=τ\varphi S=\tau. Moreover

∥T(y)∥22≤τm(h1/2y∗h1/2y).(6)\|T(y)\|_2^2\le \tau_m(h^{1/2}y^*h^{1/2}y). \tag{6}

Proof. The state τT\tau T is faithful: if y≥0y\ge0 and τ(T(y))=0\tau(T(y))=0, faithfulness of the trace gives T(y)=0T(y)=0, and faithfulness of TT then gives y=0y=0. Its matrix density is consequently invertible. Normalization follows from T(1)=1T(1)=1.

By (2), T♯(1)=hT^\sharp(1)=h. The sandwich in (4) is therefore normal, completely positive and unital. Substitution proves (5). Conversely (5) determines h1/2S(x)h1/2h^{1/2}S(x)h^{1/2}, and hence S(x)S(x), by the nondegenerate matrix trace pairing. Putting y=1y=1 in that identity proves φS=τ\varphi S=\tau.

For the improved estimate, equip MmM_m with

⟨a,b⟩h=τm(h1/2a∗h1/2b).(7)\langle a,b\rangle_h= \tau_m(h^{1/2}a^*h^{1/2}b). \tag{7}

This is the Hilbert–Schmidt inner product of h1/4ah1/4h^{1/4}a h^{1/4} and h1/4bh1/4h^{1/4}b h^{1/4}. The invertible change of variables makes it positive definite. Consider TT as an operator from this finite-dimensional Hilbert space into L2(M,τ)L^2(M,\tau). In (5), replace yy by y∗y^* and use traciality. The result is

⟨T(y),x⟩τ=⟨y,S(x)⟩h.\langle T(y),x\rangle_\tau=\langle y,S(x)\rangle_h.

Thus the Hilbert adjoint of TT, restricted to bounded xx, is SS. Each coordinate is an L2L^2-continuous pairing with a fixed T(eij)T(e_{ij}); these coordinates extend SS to all of L2(M,τ)L^2(M,\tau).

The composite TSTS is unital, completely positive and trace-preserving. Schwarz gives

∥TS(x)∥22≤τ(TS(x∗x))=∥x∥22.\|TS(x)\|_2^2\le\tau(TS(x^*x))=\|x\|_2^2.

Density of bounded elements extends this contraction to the trace Hilbert space. There it equals TT∗TT^*, so ∥T∥2=∥TT∗∥≤1\|T\|^2=\|TT^*\|\le1. Applied to yy, this is exactly (6). Cyclicity gives the equivalent right-hand expression τm(h1/2yh1/2y∗)\tau_m(h^{1/2}yh^{1/2}y^*). No factor or countability condition entered the argument. □\square

The weighted norm in (7) differs from φ(y∗y)1/2\varphi(y^*y)^{1/2}. The improved bound (6) uses the actual Hilbert adjoint and the trace-preserving composite, rather than just Schwarz for TT.

Exercise 3. Check the weighted inner product's positivity.

Solution. Put b=h1/4ah1/4b=h^{1/4}a h^{1/4}. Cyclicity gives τm(b∗b)=τm(h1/2a∗h1/2a)\tau_m(b^*b)=\tau_m(h^{1/2}a^*h^{1/2}a). This is nonnegative and vanishes only if b=0b=0. Invertibility of h1/4h^{1/4} then gives a=0a=0. Polarization supplies the Hilbert inner product in (7).

Exercise 4. Prove the trace-preserving ucp map TSTS is an L2L^2 contraction.

Solution. The ucp Schwarz inequality gives TS(x)∗TS(x)≤TS(x∗x)TS(x)^*TS(x)\le TS(x^*x). Applying τ\tau and using τTS=φS=τ\tau TS=\varphi S=\tau gives ∥TS(x)∥22≤∥x∥22\|TS(x)\|_2^2\le\|x\|_2^2. Bounded elements are dense in L2L^2, so this inequality defines the unique contraction extension.

3. Rational densities become matrix dimensions

The laboratory replaced probabilities 1/3,2/31/3,2/3 by one slot and two slots. For an arbitrary rational faithful density, the probability of the ii-th eigenvector is λi/m\lambda_i/m. Writing it as pi/qp_i/q assigns pip_i slots to that coordinate. The resulting record has ordinary trace τq\tau_q; the weighted adjoint returns to the original state.

This is not generally an algebra embedding: two coordinates may have different numbers of slots. Their overlap will determine the off-diagonal recovery coefficient. The full theorem states both the exact state identities and the error that remains.

Theorem 3.1. Suppose h>0h>0, τm(h)=1\tau_m(h)=1, and its eigenvalues are rational. There exist ucp maps

Mm→RMq→LMmM_m\xrightarrow{R}M_q\xrightarrow{L}M_m

such that

τqR=φ,φL=τq,∥LR(x)−x∥φ#≤∥h1/2x−xh1/2∥2,τm.(8)\tau_qR=\varphi,\qquad \varphi L=\tau_q,\qquad \|LR(x)-x\|_\varphi^\#\le\|h^{1/2}x-xh^{1/2}\|_{2,\tau_m}. \tag{8}

Proof. Diagonalize hh, and write its eigenvalues as

λi=mpi/q,pi∈N,q=∑ipi.(9)\lambda_i=mp_i/q,\quad p_i\in\mathbb N,\quad q=\sum_i p_i. \tag{9}

Use a record space K=⨁iCpiK=\bigoplus_i\mathbb C^{p_i}, with orthonormal vectors ξi,s\xi_{i,s}, 1≤s≤pi1\le s\le p_i. Let p=max⁡ipip=\max_i p_i. For 1≤r≤p1\le r\le p, define operators Ar:K→CmA_r:K\to\mathbb C^m and Br:Cm→KB_r:\mathbb C^m\to K by

Arξi,s={ei,s=r,0,s≠r,Brei={pi−1/2ξi,r,r≤pi,0,r>pi.\begin{aligned} A_r\xi_{i,s}&=\begin{cases}e_i,&s=r,\\0,&s\ne r,\end{cases}\\ B_r e_i&=\begin{cases}p_i^{-1/2}\xi_{i,r},&r\le p_i,\\0,&r>p_i.\end{cases} \end{aligned}

Set R(x)=∑rAr∗xArR(x)=\sum_r A_r^*xA_r and L(Y)=∑rBr∗YBrL(Y)=\sum_r B_r^*YB_r. These finite Kraus sums are completely positive. Each vector ξi,s\xi_{i,s} occurs once in ∑rAr∗Ar\sum_r A_r^*A_r, and each eie_i occurs pip_i times with weight 1/pi1/p_i in ∑rBr∗Br\sum_r B_r^*B_r. Both sums are the respective identity operators, proving unitality directly.

The diagonal of R(x)R(x) repeats xiix_{ii} exactly pip_i times. Hence τqR(x)=q−1∑ipixii=φ(x)\tau_qR(x)=q^{-1}\sum_i p_i x_{ii}=\varphi(x). The diagonal of L(Y)L(Y) averages the entries in the ii-th record block. Weighting that average by pi/qp_i/q gives every record diagonal entry weight 1/q1/q, so φL(Y)=τq(Y)\varphi L(Y)=\tau_q(Y).

This record also has the corner realization used in the exercises. Put PiP_i equal to the projection onto the first pip_i vectors of Cp\mathbb C^p, and identify KK with the range of F=∑ieii⊗PiF=\sum_i e_{ii}\otimes P_i. Then

R(x)=F(x⊗1p)F.(10)R(x)=F(x\otimes1_p)F. \tag{10}

Let fij=R(eij)f_{ij}=R(e_{ij}). Its only nonzero block pairs ξj,r\xi_{j,r} with ξi,r\xi_{i,r} for r≤min⁡(pi,pj)r\le\min(p_i,p_j). The Kraus formula for LL therefore gives

L(Y)ij=Tr⁡q(Yfij∗)pipj,LR(eij)=cijeij,cij=min⁡(pi,pj)pipj.(11)\begin{gathered} L(Y)_{ij}=\frac{\operatorname{Tr}_q(Yf_{ij}^*)}{\sqrt{p_ip_j}},\\ LR(e_{ij})=c_{ij}e_{ij},\qquad c_{ij}=\frac{\min(p_i,p_j)}{\sqrt{p_ip_j}}. \end{gathered} \tag{11}

Here Tr⁡q\operatorname{Tr}_q is unnormalized. The same coordinate formula verifies the weighted pairing (5), so this explicit LL agrees with the unique weighted adjoint. Its complete positivity and the state identities have already been proved without invoking that theorem.

The symmetrized state norm of a matrix is

∥a∥φ# 2=12q∑i,j(pi+pj)∣aij∣2.(12)\|a\|_\varphi^{\#\,2}=\frac1{2q}\sum_{i,j}(p_i+p_j)|a_{ij}|^2. \tag{12}

For pi≤pjp_i\le p_j, the coefficient error satisfies

(pi+pj)(1−cij)2=pi+pjpj(pj−pi)2≤2(pj−pi)2.\begin{aligned} (p_i+p_j)(1-c_{ij})^2 &=\frac{p_i+p_j}{p_j}(\sqrt{p_j}-\sqrt{p_i})^2\\ &\le2(\sqrt{p_j}-\sqrt{p_i})^2. \end{aligned}

Exchange i,ji,j for the other ordering. Substitution into (12) gives

∥LR(x)−x∥φ# 2≤1q∑i,j(pi−pj)2∣xij∣2=∥[h1/2,x]∥2,τm2.(13)\begin{aligned} \|LR(x)-x\|_\varphi^{\#\,2} &\le\frac1q\sum_{i,j}(\sqrt{p_i}-\sqrt{p_j})^2|x_{ij}|^2\\ &=\|[h^{1/2},x]\|_{2,\tau_m}^2. \end{aligned} \tag{13}

This proves (8) for diagonal hh. If h=udu∗h=u d u^*, use RdAd⁡(u∗)R_d\operatorname{Ad}(u^*) and Ad⁡(u)Ld\operatorname{Ad}(u)L_d. They preserve the required states, and unitary conjugation preserves both norms in (8), proving the full rational-spectrum assertion. □\square

If xx commutes with hh, this construction recovers xx exactly. When the density is scalar, all pip_i's may be chosen equal, and LR=idLR=\mathrm{id}.

Exercise 8. Explain why the compression (10) is faithful on positive elements, although compression maps need not be faithful in general.

Solution. If x≥0x\ge0 and R(x)=0R(x)=0, then 0=τqR(x)=φ(x)0=\tau_qR(x)=\varphi(x). The density hh is invertible, so φ\varphi is faithful and x=0x=0. The prescribed positive dimensions in every coordinate supply the property; no assertion is being made about arbitrary compressions.

4. Problems with complete solutions

The construction's state identities are exact. Its remaining defect is described by the commutator: recovery is exact on the algebra that does not mix distinct density eigenspaces. The Gram-matrix test below independently checks positivity of the recovery coefficients, and the fixed-algebra and basis-change problems describe what this means for observations in other coordinates.

Exercise 7. Prove directly that the coefficient matrix [cij][c_{ij}] is positive.

Solution. In Cp\mathbb C^p set ηi=pi−1/2∑r=1pier\eta_i=p_i^{-1/2}\sum_{r=1}^{p_i}e_r. Their Gram matrix has entries ⟨ηi,ηj⟩=min⁡(pi,pj)/pipj=cij\langle\eta_i,\eta_j\rangle=\min(p_i,p_j)/\sqrt{p_ip_j}=c_{ij}. Every Gram matrix is positive, and its diagonal is one. Thus the Schur multiplier in (11) is also directly seen to be ucp, by its diagonal-coordinate Kraus decomposition from these vectors.

Exercise 9. Determine the matrices fixed by LRLR.

Solution. Formula (11) shows cij=1c_{ij}=1 exactly when pi=pjp_i=p_j. Every entry between distinct eigenvalues is multiplied by a number strictly below one. Hence the fixed matrices are precisely the blocks within equal-eigenvalue spaces, which are exactly the matrices commuting with hh. This also follows in one direction from the zero commutator in (8).

Exercise 10. How does the construction change after diagonalizing a general rational-spectrum density?

Solution. If h=udu∗h=u d u^*, perform the construction for dd, giving Rd,LdR_d,L_d. Put Rh=RdAd⁡(u∗)R_h=R_d\operatorname{Ad}(u^*) and Lh=Ad⁡(u)LdL_h=\operatorname{Ad}(u)L_d. These are ucp. The two state identities follow by the invariance of normalized trace under unitary conjugation. Conjugating the composite error and the square-root commutator by u∗u^* gives the same two norms as for dd, so (8) is retained.

References and proof scope

The weighted Hilbert-adjoint argument and rational integer-slot record go back to Uffe Haagerup. Xiaoyan Zhou and Junsheng Fang give a freely readable account in A note on relative amenability of finite von Neumann algebras, Journal of Operator Theory 81:1 (2019), 107–132: Lemma 3.5, pp. 120–122, and Lemma 3.6, pp. 122–125. Their auxiliary algebra may be taken to be the scalars, giving the weighted-adjoint and rational-record mechanisms considered here. Matrix-unit coordinates give the trace adjoint directly, and both directions of the rational channel have explicit Kraus sums. The faithful normal tracial state is a hypothesis; no factor or separability assumption is needed.

Continue to Trace-preserving finite models. Its density perturbation changes the actual reconstruction map, its almost-recovered unitaries force the square-root commutator to be small, and Theorem 3.1 above then replaces the matrix state by a normalized trace. Unitary couplings and finite injective factors explains the additional step from positive maps to an actual finite-dimensional subalgebra. State-preserving channels alone do not prove that conclusion.