Bogoliubov automorphisms and the Hilbert–Schmidt criterion
Written by GPT-6.1 Sol (OpenAI), Ultra. New original text: public domain (CC0).
A unitary change of one-particle coordinates acts on the CAR algebra. In its tracial representation this action extends normally to the hyperfinite factor. The innerness criterion below answers when its implementer belongs to that factor. Sufficiency follows from the eigenvectors of the compact difference from the identity; necessity uses a controlled diagonalizing perturbation. The eigenmode calculation constructs the local implementing matrices and their convergent product. The normal-extension and continuity theorem then describes the action as a map of topological groups. The complete analytic arguments and twelve worked problems supply the details used throughout.
The concrete CAR, its half-state trace and its completed pointed matrix product are supplied by Fermions, Fock space and quasi-free factors, Sections 10 and 15–16. The diagonal step uses the proved product-innerness theorem. Section 6 below supplies the whole analytic passage to arbitrary unitaries: the Hilbert–Schmidt ideal, compact diagonalization, interval projections, a bounded logarithm, and a dyadic diagonal perturbation with an explicit square-sum bound. It also constructs the unitary groups and the resolvent criterion needed for the possibly unbounded statement in Lemma 3.1. Its continuous calculus is the complete local ITP F03–F04, F06 and F08 argument and its scalar proofs; the underlying Hilbert estimates are ITP Sections 10.1–10.2. Normal continuity is proved directly on square-summable vector coefficients. This route uses neither a factor uniqueness theorem nor a trace-density theorem.
Throughout, is a separable infinite-dimensional complex Hilbert space, , and
The preceding CAR lesson proves that is an AFD factor of type . We identify with its faithful represented image. Write ; the one-particle Hilbert–Schmidt norm is written .
Our annihilator is conjugate-linear in . Thus
In particular an eigenvalue multiplies the annihilator by . The one-mode implementers below reflect this convention. Changing to a linear creation generator changes that sign and the placement of the occupation projections together; the trace criterion is unchanged.
4. The general innerness theorem
Theorem 4.1. For every unitary on the separable infinite-dimensional space ,
Proof. Suppose first that . This difference is compact by Section 6.1. Lemma 3.2 therefore gives an orthonormal eigenbasis for . If its eigenvalues are , basis independence gives
The diagonal criterion of Theorem 2.1 makes inner. Its phase-normalized matrix products give an implementing unitary in , with any finite zero-overlap prefix retained. Thus the sufficient implication is already established for every one-particle unitary with Hilbert–Schmidt difference.
Now suppose that is inner. Apply Lemma 3.3 to obtain , with Hilbert–Schmidt and diagonalizable. The sufficient implication just proved applies to ; consequently is inner. Since , composition with this inner automorphism gives
In particular is inner, and its eigenbasis lets Theorem 2.1 conclude that is Hilbert–Schmidt. The two exact difference identities are
The second identity and the linear two-sided ideal estimate of Section 6.1 put in the same class. This proves necessity and completes both implications.
Example 4.2. A nontrivial scalar gauge , , produces an outer automorphism of : has the same nonzero norm on infinitely many orthonormal vectors and is not Hilbert–Schmidt. Every finite-mode restriction is nevertheless inner by (6). Conversely every unitary equal to the identity off a finite-dimensional subspace gives an inner automorphism.
Spatial implementation by is always available. Innerness asks the stronger question whether an implementer belongs to .
2. Eigenvectors and tensor coordinates
Suppose for an orthonormal basis . Put
The CAR lesson proves that the matrix algebras generated by commute, generate , and identify it with the tracial product . Their matrix units have , , and .
Since , every parity factor in (5) is fixed. Hence
Define the even one-mode unitary
Matrix-unit multiplication gives
The diagonal projections and the adjoint generator transform as required. Thus is invariant, its restriction is , and
The identity first holds on every finite tensor prefix and then holds normally on .
Theorem 2.1. Under the eigenbasis assumption,
Proof. Equations (7)–(8) and the already proved product-innerness theorem give the first equivalence, including finitely many zero overlaps. Put . Then
so
Summing and using the basis definition of Hilbert–Schmidt class proves the second equivalence.
For sufficiency one can also see the implementer: adjust the scalar phase of each so that its trace is nonnegative. The partial products converge strongly, together with their adjoints, by the product theorem's tail estimate. Their limit is a unitary in . Finitely many vanishing traces affect a finite prefix only.
3. Perturbing self-adjoint generators
We first justify the analytic estimate used to pass from an arbitrary unitary to a diagonal one. Section 6 proves its Hilbert–Schmidt facts and its unbounded-operator inputs.
Lemma 3.1. Let be any self-adjoint operator on , possibly unbounded, and let . On , is self-adjoint. For every real ,
where the integral converges in Hilbert–Schmidt norm. Moreover
Proof. Hilbert–Schmidt operators are bounded. For sufficiently large ,
has a bounded inverse, since . Bounded addition preserves closedness on , and the sum is symmetric. Surjectivity at both imaginary points is the self-adjoint resolvent criterion proved in Section 6.6, so is self-adjoint on that domain.
The groups constructed in Section 6.6 preserve their generator domains and have the stated strong derivatives there. Thus the unitary group of preserves . For in this common domain the strong product derivative is legitimate and equals
Indeed the two terms containing , evaluated on , cancel. Integrating gives (11) on the dense common domain.
The needed graph continuity is explicit: is continuous in . Thus the domain differentiation uses a graph-continuous vector path, not an operator-norm derivative of the unbounded generator's group.
For a finite-rank middle operator, the integrand in (11) is Hilbert–Schmidt norm continuous: write it as a finite sum of rank-one operators and use strong continuity of both unitary groups and their adjoints. Approximate a general in Hilbert–Schmidt norm by finite-rank operators, keeping both unitary groups fixed and replacing only their middle factor. The ideal bound and unitarity make that approximation uniform in . The integrand is therefore Hilbert–Schmidt norm continuous, with norm . Its Banach-space integral has norm at most , and is a bounded operator. Density extends the integrated domain identity to all of . This proves (11)–(12), with the usual reversed orientation for .
Lemma 3.2. If is unitary and is compact, then has an orthonormal basis of eigenvectors.
Proof. The compact operator is normal, because both and equal . Its real and imaginary parts are commuting compact self-adjoint operators. Decompose by the compact self-adjoint diagonalization proved in Section 6.2 for . Every nonzero eigenspace is finite dimensional and is preserved by , so diagonalize the latter on each. On , diagonalize its compact self-adjoint restriction , including a basis of the joint kernel. The resulting orthonormal basis diagonalizes both parts, hence and .
Lemma 3.3. For every unitary on and every , there is a unitary with
such that has an orthonormal basis of eigenvectors.
Proof. Section 6.4 constructs a self-adjoint logarithm , with , such that , from continuous functions of its real part and the positive and negative subspaces of its imaginary part. Section 6.5 proves the required bounded Weyl–von Neumann statement at separable Hilbert-space generality: it supplies a self-adjoint , with , for which has an orthonormal eigenbasis. Set
These operators are unitary. Lemma 3.1 at gives the required Hilbert–Schmidt estimate, and is diagonal on the eigenbasis of .
Separability enters through this diagonal perturbation input. The argument does not assert the same diagonal perturbation theorem on an arbitrary nonseparable space.
1. Normal extension and continuity
Every tracial state on restricts to the normalized trace on each finite-mode full matrix algebra. Their union is norm dense, so is the unique tracial state. Hence .
Theorem 1.1. Each has a canonical normal extension to , still denoted by . The map
is an injective continuous homomorphism, for the strong operator topology on and the point-predual norm topology on .
Proof. On the dense tracial GNS subspace put
Trace preservation gives , and gives its inverse. Thus is unitary. On , , so conjugation maps onto itself and gives a normal extension. Two normal extensions agreeing on an ultraweakly dense algebra agree everywhere. Formula (3) also gives the homomorphism law.
If strongly, the CAR norm identity gives
Finite product telescoping and norm density give convergence on every . Consequently strongly. Also strongly, since .
Here is the entire normal-functional argument, without a trace density. On the concrete , a normal functional is the restriction of
The exact coefficient topology and its continuous dual are explained in Section 6.7. Conjugation by pulls this functional back to the same series with replaced by . Strong convergence of these adjoints follows from the already proved convergence for . It implies convergence on each square-summable list in its square-sum norm: first retain finitely many vectors, and then bound each omitted difference by twice the vector's norm. Cauchy–Schwarz bounds the functional-norm difference by
This tends to zero and proves convergence in the specified point-predual norm topology. The finite-list and tail argument works for nets as well as sequences.
Finally, if , then . The identity makes for every , so .
5. Exercises with complete solutions
Exercise 1. Show directly that trace preservation in Section 1 follows from finite-mode matrix traces even if does not preserve a chosen increasing sequence of finite-mode algebras.
Solution. Fix a finite-dimensional , and set . Matching the fields sends onto ; the inverse matches them using . Both are full matrices of size .
The normalized trace can be recovered from matrix-unit multiplication alone. A tracial state vanishes on for , since but . Also
Their sum is , so each diagonal value is . Consequently the pullback of the trace on is the trace on , and for every in that algebra.
Every CAR polynomial lies in some finite . For , choose such a polynomial with . The automorphism is isometric and the state has norm one, giving
Letting proves trace preservation on . This uses the directed collection of all finite subspaces, including ; a fixed exhaustion need not be invariant.
Exercise 2. Verify the one-mode phase in (7), including its action on the occupation projection.
Solution. Write . The one-mode relations give , , , and . For ,
Taking adjoints gives . Orthogonality of proves , and commutes with each projection, so and . The tracial one-mode values are ; hence
The annihilator convention is essential: , exactly the phase just computed.
Exercise 3. Explain why diagonalizing a one-particle unitary does not make the raw one-mode CAR algebras commute, and why the tensor calculation still works.
Solution. A coordinate change preserves the CAR. For , , and this product is nonzero: it removes two occupied modes from their common finite occupation vector. Thus the raw one-mode algebras still do not commute.
Let , so . For , the string contains , which anticommutes with , while the other string factors commute with it. The earlier string commutes with . Therefore
Replacing either field by its adjoint gives the same two canceling signs. These are the commuting full matrix legs .
Furthermore . A diagonal fixes , hence and every , and sends to . Exercise 2 supplies the even implementer on each . The resulting product calculation applies to these commuting legs and their normal closure , with overlaps ; it does not assert commutation of the raw fields.
Exercise 4. Let . Is inner? Is trace class?
Solution. Put . Its diagonal entries are . Integrating the scalar derivative of gives , and hence
For example, the block contributes at most , so the last sum is at most .
Innerness also has a concrete limit here. Take the of (6), whose traces are positive, and let . For ,
The same estimate on every finite-support vector and for adjoints gives strong* convergence to a unitary . Its conjugation on each finite leg is eventually , so implements the normal automorphism.
For trace class, is diagonal with entries , so its positive square root has eigenvalues
The inequality follows from the chord bound on . The harmonic sum diverges: every block contributes at least . Thus these singular values are not summable and is not trace class.
Exercise 5. Repeat Exercise 4 with . Show that compactness alone cannot replace Hilbert–Schmidt class.
Solution. Here the diagonal entries are . If projects onto the first basis vectors, then is finite rank and
Thus is compact. The same scalar chord estimate as above gives
Its Hilbert–Schmidt square sum diverges. Its singular-value sum diverges as well, so the answer to the trace-class question repeated from Exercise 4 is also negative.
To see the obstruction in tensor coordinates, set . Since , the overlap defects have divergent sum. If a unitary implemented the product action, the expectation argument of Theorem 7.2 in the tensor-product lesson would give
Choosing with would bound every subsequent defect sum by , a contradiction. Hence is outer. The explicit norm approximation above shows why compactness does not suffice.
Exercise 6. Can an inner diagonal Bogoliubov automorphism have a one-mode implementer of trace zero? Can it have infinitely many such modes?
Solution. The overlap vanishes exactly when , that is, when . Suppose first that this occurs on a finite set , and the remaining eigenvalues are . Then
is an even finite CAR unitary implementing the required sign changes. For a single such mode, has rank one. Thus one trace-zero mode, or any finite number, is compatible with innerness.
If there are infinitely many such modes, each contributes to that square sum and to the overlap-defect sum in (9). The diagonal necessity criterion rules out innerness.
A finite zero-overlap prefix also causes no problem when the later modulus defects are summable. Past that prefix, replace each by a scalar multiple with trace ; scalar multiplication leaves its conjugation unchanged. For these normalized partial products, the squared difference on a local vector is ; multiplying by the fixed prefix leaves this norm unchanged. The adjoint estimate is identical. Thus tail convergence can produce a unitary even though the trace of the whole prefix is zero.
Exercise 7. Prove the continuity of the Hilbert–Schmidt integrand in (11) for a rank-one operator, without operator-norm continuity of an unbounded generator's unitary group.
Solution. Allow arbitrary , with no generator-domain assumption, and put . For the fixed groups , , unitarity and the adjoint identity give
Parseval gives . Subtract the expressions at , adding and subtracting , to obtain
Both terms vanish as by strong continuity; is the negative-time group. This proves Hilbert–Schmidt norm continuity even for unbounded . Only the two individual vector orbits are estimated; no operator-norm continuity of either group is used. Finite sums and uniform Hilbert–Schmidt approximation extend the argument to the middle factors in (11).
Exercise 8. For commuting bounded self-adjoint , simplify (11) and check its sign.
Solution. Since bounded commute, their exponential series can be multiplied and regrouped, giving
Thus the left side of (11) is , and its right side is
because the norm derivative of is . This also holds for , with the oriented integral . The first-order term checks the positive sign. When is Hilbert–Schmidt, as in Lemma 3.1, unitary invariance of that norm gives the bound ; the bounded-operator identity itself does not require this extra assumption. The same bound follows without an integral after diagonalizing the compact self-adjoint : if its eigenvalues, including zeros, are , then
Exercise 9. In the proof of Theorem 4.1, explain why the fact that is Hilbert–Schmidt proves innerness of without circular reasoning.
Solution. The argument first reduces to the already proved diagonal case. Section 6.1 approximates in operator norm by finite-rank operators, so it is compact. It is also normal:
Its commuting compact self-adjoint real and imaginary parts can be diagonalized together as in Section 6.2. Nonzero eigenspaces of the real part are finite-dimensional; diagonalize the imaginary part there and on the real part's kernel, retaining a basis of the joint kernel. This gives an eigenbasis for , including its -eigenspace.
Write its eigenvalues as . Basis independence of the Hilbert–Schmidt norm gives
Theorem 2.1, whose proof uses the product implementer and expectation-tail calculation, therefore proves inner. This argument uses only Lemma 3.2 and the diagonal theorem established before Theorem 4.1. It never applies the desired arbitrary-unitary equivalence to . Only now use and : composition and inversion of inner automorphisms remain inner, so (16) transfers the question from to the diagonal .
Exercise 10. Show that is a subgroup. Show that it is normal in .
Solution. The identity belongs to . For two members ,
The two-sided ideal and linearity proved in Section 6.1 put this difference in the Hilbert–Schmidt class. For inverses,
Thus the set is a subgroup. Finally, for any unitary , without any Hilbert–Schmidt assumption on ,
Conjugation preserves membership, which is precisely normality of this subgroup in . The proved equivalence (15) also gives the exact identification
the preimage of the inner subgroup under (2).
Exercise 11. Let , and let agree with on and with the identity on the remaining basis vectors. Prove that inner automorphisms can converge to an outer .
Solution. For , the truncation has
The same estimate applies to adjoints. Moreover has finite rank. A finite implementer is in the corresponding finite CAR algebra; its evenness fixes all later fields.
The convergence on one-particle vectors implies convergence in norm on every CAR generator. Telescoping a polynomial and using norm density then proves point-norm convergence on . For the extensions to , let be their trace-preserving GNS unitaries from (3). They converge strongly together with their adjoints. If is any normal coefficient series, the pullback difference has norm at most
Finite-list convergence followed by a uniformly bounded square-summable tail proves that this tends to zero. Hence convergence also holds in the point-predual norm topology of Theorem 1.1.
If , the limit is outer. Taking gives the compact example of Exercise 5; taking gives the constant gauge , for which is not Hilbert–Schmidt. In each case the approximating automorphisms are inner and the limit is outer.
The full density assertion for can also be verified from these local tools. Given any normal automorphism of , the normal trace restricts on each finite matrix algebra to its unique normalized trace. Ultraweak density therefore gives . If are its matrix units, and have equal trace. Projection comparison in the finite factor, with faithfulness killing any equal-trace remainder, supplies , . Define
Matrix-unit multiplication gives and . Thus agrees with on . For every ,
Here both automorphisms preserve , and the finite expectations recover every GNS vector. Their trace-preserving GNS unitaries consequently converge strongly, together with their adjoints, to that of . The same square-summable coefficient estimate above proves point-predual norm convergence. Hence is dense in , while the outer example proves it is proper.
Exercise 12. A unitary is the identity off a -dimensional reducing subspace . Locate an implementer of inside the finite CAR algebra and verify that it commutes with all tail annihilators.
Solution. Choose an orthonormal eigenbasis for the finite unitary , with eigenvalues , and put . The unitary
belongs to . Each factor is even, and the factors commute because the occupation projections commute. For , commutes with by two CAR sign changes. Exercise 2 therefore gives .
For , the CAR gives
Thus every factor of , and itself, commutes with every tail annihilator and its adjoint. Its conjugation fixes . Splitting an arbitrary into and proves the desired action on all generators and hence on the completed algebra and its normal closure. For , the empty product is .
6. Complete analytic support for the proof route
These supporting arguments do not add numbered results to the original six statements. They prove the exact analytic inputs used there. We work with complete complex Hilbert spaces, bounded adjoints, and the continuous calculus proved in ITP F03–F04, F06 and F08, whose scalar completeness, polynomial approximation, exponential series and Banach-valued integral proofs are in Elementary calculus for infinite products. These are local proof providers, rather than a citation to a projection-valued spectral theorem. The Hilbert-space completion, orthogonal projection, Riesz and adjoint arguments are the full ITP Sections 10.1–10.2 constructions.
6.1. The Hilbert–Schmidt space and its whole ideal estimate
A countable orthonormal basis of a separable Hilbert space is obtained by applying Gram–Schmidt to a countable dense sequence and discarding zero residuals. Each original vector belongs to the span of the residuals through its stage. The completed span is therefore the whole space. Orthogonal finite partial sums give Pythagoras; their distance to a vector tends to zero by this density. This proves Parseval. Bessel's inequality is the same finite Pythagoras estimate without totality. The assertions also cover finite-dimensional and zero subspaces.
For a bounded , define
on an orthonormal basis . Nonnegative double sums can be interchanged: both iterated sums are the supremum of all finite rectangle sums. Thus Parseval on a second basis gives
Keep the second basis fixed and change the first; this proves basis independence. It also proves , allowing either side to be infinite.
For a finite sum , Cauchy–Schwarz gives
Density proves . Conversely any square-summable matrix defines an operator on finite coordinate vectors with exactly this bound; it extends boundedly to the Hilbert completion and has the prescribed columns. Consequently the Hilbert–Schmidt space is the complete Hilbert space of these matrices, with its square-sum inner product. Its norm triangle inequality and its linearity are the Hilbert-space ones, with no spectral or singular-value premise.
For Hilbert–Schmidt or bounded as appropriate,
This proves the linear two-sided ideal property. If are unitary, apply the bounds both to and to ; hence
Writing for the first basis vectors,
Thus finite-rank operators are dense in this norm and every Hilbert–Schmidt operator is compact. To justify that last word explicitly, a finite-rank operator maps the unit ball into a bounded finite-dimensional set, which has finite nets of every positive radius by coordinate compactness. A norm limit of such operators has the same finite-net property, by approximation in operator norm. Any sequence in its image then has a Cauchy subsequence, by successive finite-net extraction; Hilbert completeness gives its limit. This is compactness.
Conversely, let be any compact bounded operator. Its unit-ball image has a finite -net for every : otherwise successive choices at pairwise distance at least would give a sequence with no convergent subsequence, contrary to compactness. Take net points and the orthogonal projection onto their finite-dimensional span. Since that projection gives the nearest vector in its range,
Thus every compact operator is a norm limit of finite-rank operators. Adjoint isometry gives in norm, and has finite-dimensional range. The first direction above makes compact. Finite sums and scalar multiples are compact by adding their finite-rank approximations. This proves, in particular, compactness of both real and imaginary parts for the arbitrary compact in Lemma 3.2; it does not assume that is Hilbert–Schmidt.
For the rank-one operator , Parseval gives
These are all ideal, compactness, rank-one and completeness facts used in Lemmas 3.1–3.3 and in Exercises 7–10.
6.2. Compact self-adjoint diagonalization, including the zero eigenspace
A finite-dimensional self-adjoint operator is diagonalizable by an orthonormal basis. Here is the needed elementary proof. Its quadratic form is real and attains its maximum on the unit sphere, by finite-dimensional coordinate compactness. At a maximizing unit vector , varying the normalized vector , for , first with real and then with purely imaginary , makes both components of zero. Thus is a real scalar multiple of . Its orthogonal complement is invariant, and induction supplies the remaining eigenvectors. In this basis the operator norm is the largest absolute eigenvalue, and the largest absolute value of its quadratic form is that same number.
For any bounded self-adjoint , put . The easy bound is . For a unit , compress to the at most two-dimensional space spanned by . The compressed self-adjoint operator sends to , so its norm is at least . The finite result makes its norm a quadratic-form value, hence at most . Taking the supremum over gives .
Now assume is compact and self-adjoint; let . Choose unit whose quadratic-form absolute values tend to , and pass to one of the two signs. With or according to that sign,
Compactness supplies a convergent subsequence of ; since , the displayed estimate makes the corresponding converge to a unit eigenvector with eigenvalue .
Restrict to its orthogonal complement and repeat while the restriction is nonzero. Each restriction remains self-adjoint and compact. The selected eigenvectors are orthonormal, and each selected is the norm of the remaining restriction before that step. If infinitely many are selected, : otherwise the orthogonal vectors would have an infinite subsequence separated by a fixed positive distance, contradicting compactness. Hence the restriction norms tend to zero. Every vector orthogonal to all the selected is killed by . If the procedure stops finitely, the same assertion holds by its stopping condition. A nonzero eigenspace is finite dimensional, since an infinite orthonormal sequence in it would give the same contradiction. Adding a basis of the kernel therefore gives the full orthonormal diagonalization, with every nonzero eigenvalue included.
For a compact normal , its real and imaginary parts are compact self-adjoint and commute. The preceding decomposition of its real part has finite-dimensional nonzero eigenspaces invariant under the imaginary part; diagonalize on each. Its kernel is also reducing, and the compact self-adjoint diagonalization of the imaginary part on that kernel completes the basis. This proves the precise normal-compact input in Lemma 3.2.
6.3. Interval projections from continuous positive parts
We construct only the projections the approximation needs. This avoids assuming a full Borel calculus or a measure representation. The continuous calculus gives positive roots and , , with and . For concrete self-adjoint operators the spectral and quadratic-form meanings of positivity agree. A nonnegative continuous function is the square of its continuous nonnegative root, so its evaluation is and has nonnegative quadratic form. Conversely, if a self-adjoint has nonnegative quadratic form, then has a bounded inverse for every : Cauchy–Schwarz gives , its range is closed, and its orthogonal complement is . The real-spectrum assertion from ITP F04 therefore excludes every negative spectral value. These arguments also justify transferring order bounds to norm bounds through the continuous calculus.
For a positive bounded , the positive contractions
converge strongly to the projection onto . They kill , and on a vector ,
Uniform boundedness by one extends convergence from this dense range to its closure. Since , these two spaces exhaust the Hilbert space. This proves the assertion and also shows that the support projection is a strong limit of continuous functions of .
For bounded self-adjoint , let
It commutes with , with every continuous function of , and with every operator commuting with ; use the just proved strong-limit formula for . If , the continuous scalar inequality gives . Thus . On , ; on , , because the latter vanishes on the range of . Hence there. It follows that
and, for the midpoint ,
These projections include the right endpoint and exclude the left in the kernel convention; possible eigenvalues at partition boundaries cause no omission.
Choose . Then . Dividing into equal intervals gives orthogonal reducing projections summing to one, refining the preceding partition. The midpoint step operators
satisfy , by the orthogonal sum and (A6). In particular every polynomial is the norm limit of the step operators : apply the finite product telescoping estimate to , for each monomial. Every is a strong limit of continuous functions of , and those functions are norm limits of polynomials by ITP F06.
6.4. A bounded logarithm for every unitary
Write
They are commuting self-adjoint contractions and . Let be the support projections of , respectively, and , the projection onto . All these projections commute with . Put , so .
For precision, the scalar cosine is strictly decreasing from to on . The exponential-series and quadrant proof in CAR Section 17.1 gives , positive sine on , and the endpoint values. The mean-value and intermediate-value arguments there give the strict decrease and its entire range. Its inverse is continuous: around an interior inverse value, the values at two nearby parameters strictly bracket the original value; one-sided versions apply at the endpoints. This proves continuity directly. The same quadrant identity gives .
The continuous calculus therefore supplies
The last equality also follows from uniqueness of the positive square root. For completeness, if commuting positive roots have the same square, then ; the product identity kills , and both roots kill its orthogonal complement . Hence . Any other positive root of a given positive operator commutes with that operator and thus with its root constructed by continuous calculus, so this proves uniqueness as used here.
On , , and
is its projection. Define
The mutually orthogonal spaces reduce it. It equals on them, respectively; hence it is self-adjoint and . The exponential series on these spaces gives . This constructs the whole logarithm, including the eigenspace and spectra crossing that point, without a continuous argument function on the entire circle.
6.5. A complete dyadic Hilbert–Schmidt diagonal perturbation
We prove the exact bounded statement used in Lemma 3.3. Let on separable , fix , and take the interval projections of Section 6.3.
First decompose into countably many orthogonal reducing cyclic subspaces. Given a countable dense sequence, take the closed span of the powers of its first nonzero vector. Self-adjointness makes its orthogonal complement invariant too. At each subsequent step use the residual of the next dense vector orthogonal to the already chosen subspaces, omitting a zero residual. The new powers remain in that reducing complement. Every dense-sequence vector then lies in the closure of the chosen subspaces, so their completed orthogonal sum is . On each nonzero component choose its cyclic unit vector .
Inside such a component put
These are nested finite-dimensional spaces, of dimension at most . Their union is dense in the component. Indeed the strong-limit polynomial description of puts each in the cyclic space, while the polynomial step approximation in Section 6.3 puts every in the closure of the . Thus neither inclusion of the completed space is merely assumed.
Fix a starting level . The nonzero normalized vectors are an orthonormal basis of , each supported in an interval of width . For , decompose by the parent projections . In each parent, the refined space has dimension at most two and the old space dimension one if that parent vector is nonzero; if it is zero both children are zero. Thus each nonzero parent adds at most one orthonormal vector. There are at most such added vectors, each supported in a parent interval of width . Finite Gram–Schmidt inside each of these at most two-dimensional spaces supplies them, including the case of one zero child.
Assign each basis vector the real midpoint of its supporting interval. The orthonormal union of the starting basis and these increments is a basis of the entire cyclic component. By (A6),
There is no bound depending on the dimension of the full component.
Enumerate the nonzero cyclic components by . Given , choose integers with
For finitely many components use the same bounds over their finite index set. Combining the component bases gives an orthonormal basis of . Define the diagonal bounded self-adjoint operator ; its diagonal entries lie in , so its extension to all of is bounded and self-adjoint by the coordinate norm and adjoint identities. Equations (A1) and (A8) give
Consequently has a full orthonormal eigenbasis and the perturbation has the required arbitrarily small Hilbert–Schmidt norm. The zero space and the zero operator are also covered, with if desired. This proves the bounded Weyl–von Neumann input in full. No unbounded diagonal perturbation theorem, measure disintegration, direct-integral multiplicity theorem, or trace-class perturbation assertion enters it.
The construction in Section 6.5. The example normalizes the two child projections within one parent band, with conditional squared norms and . The vector is orthogonal to the old normalized parent vector . Its spectral support remains in the parent band, so the error uses that band's half-width. The initial level and every later increment have separate counts; their sum is . The final choice of distributes an arbitrary prescribed squared Hilbert–Schmidt tolerance over all reducing cyclic components. This is the local proof's dyadic construction; the human-source factor and Fock comparisons are described in the References. The exact coordinates and error bounds are reproduced by the figure source.
6.6. Self-adjoint resolvents and the entire unbounded unitary group
We retain the full unbounded scope of Lemma 3.1. A densely defined operator's adjoint is defined by the bounded pairing on its domain. Its graph is closed: pass to limits in that pairing against every domain vector. Thus a self-adjoint operator is closed. If , then for and ,
It follows that the range is closed, by the closed graph of , and that the inverse on the range has norm at most . The range's orthogonal complement is , so that range is all of . This proves the resolvent bound used in Lemma 3.1.
Conversely let be densely defined, closed and symmetric and suppose are both onto. If , solve
Then . Hence and . This is the full criterion applied to the bounded perturbation. Bounded addition preserves closedness directly: if and , then , so and .
We next construct the unitary group, rather than assuming the self-adjoint spectral theorem. Put
The pairing definition gives . Applying both inverses to domain vectors proves the resolvent identity , with their commutation; equivalently multiply the identities , on the common domain. Hence
Moreover and , because .
Let , constructed by the continuous calculus of the self-adjoint real part of . It has zero kernel. Let be the support projection of . These increasing projections commute with and their resolvents. They tend strongly to one: on their complement , so ; the range of is dense and the projections are contractions. On , . Thus , restricted to this reducing subspace, is bounded below by , has closed range, and is onto that subspace. The density of its range follows from the zero kernel of its adjoint there, since the adjoint has the same absolute value . Its bounded inverse gives
Every vector in belongs to ; substituting the resolvent identities in (A10) gives . This bounded symmetric operator on all of is self-adjoint. The reduce on its domain: commute them through , whose range is that domain. The restrictions consequently agree on overlapping subspaces.
The exponential series constructs the norm-continuous unitary on . Extend it by the identity on , and call this . For it agrees with on , so
for every . Hilbert completeness supplies a strong limit , uniformly in on every fixed vector. The same estimate applies to the adjoints . Strong limits of bounded products give and . Approximating by , and then using the bounded exponential on that subspace, proves strong continuity in .
For ,
On each bounded subspace, . Closedness of and (A11) therefore give
Applying this with proves equality of the domain and its image. The bounded exponential identity on is
The integrands converge uniformly on every compact -interval to , by (A11) and the convergence of . Continuous Hilbert-valued integration therefore yields
The integrals and their fundamental theorem are the tagged-sum constructions of Elementary calculus, R03–R04. A different strongly continuous unitary group with this domain derivative would have constant for every domain vector, by (A12), the product difference quotient, and the fundamental theorem; density makes the groups identical. Thus is precisely , with all properties used in Lemma 3.1 established.
Finally Section 6.1 makes the Hilbert–Schmidt space complete. Its continuous integrand in (11) consequently has the same tagged-sum integral and norm bound. For rank-one middle factors, (A4) and strong continuity prove that continuity exactly as in Exercise 7; finite-rank approximation and (A2) make the extension uniform. The domain argument of Lemma 3.1 is therefore valid for every self-adjoint , including unbounded , without differentiating its group in operator norm.
6.7. The exact normal-functional boundary and the three different criteria
The concrete ultraweak topology is the topology of the coefficients with both lists square summable. ITP Section 10.6 constructs the complete countable amplification and proves absolute convergence of those coefficients. A linear functional continuous for this topology is a finite linear combination of them. Indeed continuity bounds it on a neighborhood specified by finitely many such coefficients; rescaling forces it to vanish on their common kernel. It factors through the finite-dimensional image of the coordinate map to ; extending a basis of that image expresses it as a linear combination of the coordinates. Concatenating finitely many lists, absorbing the scalar coefficients into their second legs, gives one coefficient series again.
There is also a full local Banach predual identification, rather than a definition silently replacing the predual in Theorem 1.1. CAR Section 19.1 completes in the projective norm, proves its dual is by Riesz, and represents every element by a projectively summable series. Reciprocal scalar rescaling turns that series into two square-summable lists. Quotienting by the closed subspace of coefficients vanishing on yields a Banach space with dual exactly : a commutator coefficient detects any operator outside . Hahn–Banach, proved there, identifies its quotient norm with the functional norm on . Thus its image is the whole concrete , is norm complete, and consists exactly of the series used in (4). Theorem 1.1 proves convergence for every member of this actual predual. No identification, normal trace density, or truncation of an unbounded density is required.
The innerness assertion of Theorem 4.1 is specifically membership of an implementer in the tracial von Neumann factor . Innerness on the norm-complete CAR algebra requires an implementer in and has the trace-class criterion for complex-linear one-particle unitaries. Fock implementability instead permits an implementer in ; the selfdual formulation tests the Hilbert–Schmidt off-diagonal relative to its Fock basis projection . In the ordinary vacuum Fock representation every complex-linear has its exterior second quantization: it acts by on the -particle antisymmetric space and by the identity on the vacuum. The completed orthogonal sum is unitary and conjugates the creation and annihilation operators correctly. It need not belong to or to . The CAR-algebra and general selfdual Fock equivalences are comparison statements from Araki, not additional theorems established here; the numbered statements and every exercise use only the factor criterion proved above.
References
A. L. Carey, Inner automorphisms of hyperfinite factors and Bogoliubov transformations, Ann. I. H. P., Physique théorique 40(2) (1984), 141–149. The definition of , Theorem 1.1/Corollary 1.2 and the parity converse give the factor comparison. For complex-linear unitaries, finite real eigenspaces have even dimension and the negative odd branch is excluded; the real Hilbert–Schmidt norm squared is twice the complex norm squared. Use the body, whose signs differ from the abstracts. Carey's proof invokes Araki's Fock criterion and CAR trace-class implementation, plus Ruijsenaars' vacuum phase and determinant formulas. Those are dependencies of that broader source proof, not foundations imported into the local proof above.
Huzihiro Araki, On Quasifree States of CAR and Bogoliubov Automorphisms, Publ. RIMS 6 (printed header 1970/71), 385–442; EMS article 2511, DOI 10.2977/PRIMS/1195193913, indexes 1970, no.3. Lemma 4.2, pp.389–390, and Corollary 6.2, p.401, give the state-preserving GNS comparison. Theorem 5 and its complete proof, pp.421–424, concern innerness in the CAR algebra and use trace class. Theorem 7, p.432, concerns Fock implementation and tests an off-diagonal Hilbert–Schmidt operator; its converse prints “trace class” where that hypothesis should remain Hilbert–Schmidt. The proof still invokes the earlier representation-equivalence theorem, whose full chain is not admitted here. The separate criteria are recorded in Section 6.7.
The local analytic construction uses Hilbert completion, the concrete CAR and product-innerness arguments, continuous scalar calculus and the projective coefficient predual. These exact inputs are linked in Sections 1–6. The broader source proofs of Fock implementation, vacuum determinant phases and trace-class implementation have additional prerequisites; those comparison criteria are kept separate from the tracial-factor argument.