# Complete generator and scalar inputs for Bogoliubov innerness

*Written by GPT-6.1 Sol (OpenAI), Ultra, October 2026. Original programme text: CC0 to the extent of rights held. Human-source notices remain with their sources.*

The [Bogoliubov lesson](../src/bogoliubov-automorphisms-and-innerness.md) concerns the tracial representation of the CAR over a separable infinite-dimensional complex Hilbert space \(K\). Its six results and twelve solved exercises use the entire Hilbert space, the whole normal factor and, in Lemma 3.1, an arbitrary self-adjoint generator. This component supplies the generator and scalar proofs and identifies the complete algebraic inputs.

For the bounded continuous calculus, Hilbert completion, adjoints, orthogonal projections and positive square roots, use CF1–10. For all normal functionals, rather than a selected family of vector states, use the complete CP1–6 coefficient predual. Continuous vector and operator integrals are constructed by tagged sums in [Elementary calculus R03–R04](../src/elementary-calculus-for-infinite-products.md#r03).

<a id="bg0"></a>

## BG0. The complete CAR and product inputs

The concrete construction in [CO3](continuous-outer-action-regular-and-car-inputs.md#co3-complete-tracial-car-action) starts with the tracial product of full \(2\)-by-\(2\) matrices. With \(Z_j=1-2n_j\), its fields are
\[
c_j=Z_1\cdots Z_{j-1}e_{12}^{(j)},\qquad
a(f)=\sum_j\overline{f_j}c_j.
\]
CO3 proves the CAR signs and \(\|a(f)\|=\|f\|\), extends the fields in norm to all \(K\), proves the full matrix algebra for every finite subspace \(E\), and constructs the isometric map from that algebra to the one for \(uE\). No fixed finite-mode exhaustion is required to be invariant under \(u\). The compatible maps extend to the completed CAR. Uniqueness of each normalized finite matrix trace gives preservation of the complete tracial state.

CO3 then constructs the trace GNS unitary
\[
W_u(x\Omega)=\alpha_u(x)\Omega
\]
and the normal automorphism \(x\mapsto W_uxW_u^*\) of the whole factor. Its inverse is the extension for \(u^*\). Strong convergence of \(u\) gives convergence on every field and polynomial and then on every CAR element. Strong convergence of both GNS unitaries and their adjoints gives norm convergence of the pullback of every square-summable coefficient series in CP1–6. This proves the exact point-predual topology used in Theorem 1.1, for nets as well as sequences.

For an eigenbasis \(uf_j=e^{is_j}f_j\), the commuting matrix legs are generated by \(b_j=Z_1\cdots Z_{j-1}a(f_j)\), not by the raw anticommuting fields. The even unitary
\[
w_j=e^{-is_j/2}(1-n_j)+e^{is_j/2}n_j
\]
sends \(b_j\) to \(e^{-is_j}b_j\) and has trace \(\cos(s_j/2)\). The negative phase agrees with the conjugate-linear annihilator convention.

The complete diagonal necessity and sufficiency argument is [CO4](continuous-outer-action-regular-and-car-inputs.md#co4-whole-hilbert-schmidt-innerness), using the whole matrix-tail expectation [FH3](fullness-hypercentrality-and-tail-inputs.md#fh3-exact-matrix-tail-map) and finite trace products [SS2](strong-stability-matrix-and-product-inputs.md#ss2-whole-variable-matrix-tracial-product). Necessity writes \(E_m(U)=a_m\prod_{j\le m}w_j\), with \(|a_m|\to1\), and bounds every later product of overlap moduli from below. Sufficiency adjusts phases after a finite zero-overlap prefix and proves strong convergence of the products and their adjoints on every finite-support vector. Thus the limit is unitary in the factor, not merely an isometry on the trace vector. The zero-prefix cases are part of this proof.

The five complete analytic arguments [in Sections 6.1–6.5 of the lesson](../src/bogoliubov-automorphisms-and-innerness.md#6-1-the-hilbert-schmidt-space-and-its-whole-ideal-estimate) prove the whole Hilbert–Schmidt ideal, arbitrary compact-normal diagonalization including its kernel, interval projections with every boundary eigenspace, a logarithm including the \(-1\) eigenspace, and the dyadic diagonal perturbation. Its full squared-error budget is \(3M^2\,2^{-N}\), with the initial level counted separately from the later parent-band increments. The proof works on every reducing cyclic component and distributes an arbitrary prescribed tolerance over their countable orthogonal sum. BG1 supplies the unbounded input; using only a bounded exponential does not cover Lemma 3.1.

<a id="bg1"></a>

## BG1. Resolvents, the common domain and every real time

Let \(h=h^*\) be a densely defined self-adjoint operator on a complex Hilbert space. The adjoint is defined by its pairing against all vectors in \(\operatorname{Dom}h\). That definition makes the adjoint graph closed: if \(y_n\to y\) and \(h^*y_n\to z\), the pairing passes to the limit against each domain vector and gives \(y\in\operatorname{Dom}h^*\), \(h^*y=z\). Consequently \(h\) is closed.

For \(r>0\) and \(x\in\operatorname{Dom}h\), symmetry makes the cross terms cancel:
\[
\|(h\pm ir)x\|^2=\|hx\|^2+r^2\|x\|^2.                 \tag{G1}
\]
If \((h\pm ir)x_n\) converges, this identity makes both \(x_n\) and \(hx_n\) Cauchy. Completeness and closedness show that its limit is again in the range. The range is therefore closed. Its orthogonal complement is \(\ker(h\mp ir)\), which is zero by (G1). Thus \(h\pm ir\) is onto, with inverse norm at most \(1/r\).

Conversely, let \(S\) be closed, densely defined and symmetric, and suppose both \(S-ir\) and \(S+ir\) are onto. For \(y\in\operatorname{Dom}S^*\), choose \(x\in\operatorname{Dom}S\) with
\[
(S-ir)x=(S^*-ir)y.
\]
Then \(y-x\in\ker(S^*-ir)=\operatorname{Ran}(S+ir)^\perp=0\). Since symmetry already gives \(S\subset S^*\), this proves equality of the domains and \(S=S^*\). This is the surjective-resolvent criterion, including its domain conclusion.

Now let \(k=k^*\) be bounded. The operator \(h+k\) on exactly \(\operatorname{Dom}h\) is symmetric. It is closed: convergence of \(x_n\) and \((h+k)x_n\) implies convergence of \(hx_n=(h+k)x_n-kx_n\), so closedness of \(h\) applies. For \(r>\|k\|\),
\[
h+k\mp ir=\bigl(1+k(h\mp ir)^{-1}\bigr)(h\mp ir).
\]
The first factor is invertible by its norm-convergent geometric inverse series. Both ranges are all of \(K\). The criterion just proved makes \(h+k\) self-adjoint on the original domain, with no extension of that domain.

We construct its groups for an arbitrary \(h\), before differentiating a product. Set
\[
R_\pm=(h\pm i)^{-1},\qquad c=1-2iR_+.
\]
Pairings give \(R_+^*=R_-\). To verify the resolvent identity, apply \(h+i\) to \(R_-x-R_+x\): the result is \(2iR_-x\), so \(R_--R_+=2iR_+R_-\). Applying \(h-i\) instead gives the same identity with the two inverses reversed. They commute. Hence
\[
c^*=1+2iR_-,\qquad cc^*=c^*c=1,\qquad
1-c=2iR_+.
\]
In particular \(\ker(1-c)=0\) and \(\operatorname{Ran}(1-c)=\operatorname{Dom}h\).

The bounded continuous calculus gives
\[
D=|1-c|=(2-c-c^*)^{1/2}.
\]
It commutes with \(c,c^*\), has zero kernel and dense range. Let \(P_n\) be the support projection of \((D-1/n)_+\). The support is obtained as the strong limit of \(B(B+\delta)^{-1}\) for \(B=(D-1/n)_+\). The proof of the limit and the interval order bounds is the full Section 6.3 argument. Thus the \(P_n\) increase, commute with \(c,c^*\), satisfy \(D\ge1/n\) on \(P_nK\) and \(D\le1/n\) on its complement. The bound
\[
\|(1-P_n)Dy\|\le\|y\|/n
\]
and density of \(\operatorname{Ran}D\) show \(P_n\to1\) strongly.

On \(P_nK\), both \(1-c\) and its adjoint are bounded below by \(1/n\). Its range is closed and dense there, hence onto. Define the bounded operator
\[
H_n=i(1+c)(1-c)^{-1}\quad\hbox{on }P_nK.
\]
Every vector in this subspace belongs to \(\operatorname{Ran}(1-c)=\operatorname{Dom}h\). Substitution using \(1-c=2iR_+\) gives \(H_nx=hx\). It is bounded symmetric on its whole Hilbert space, so is self-adjoint. Also \(P_n\) preserves \(\operatorname{Dom}h\) and commutes there with \(h\): commute it through \(R_+\), whose range is precisely that domain. These restrictions agree on nested subspaces.

The exponential series for the bounded \(H_n\) gives \(e^{itH_n}\). Extend it by the identity on \((1-P_n)K\) and denote that unitary by \(U_n(t)\). For \(n\ge m\), the restrictions agree on \(P_mK\), so for every real \(t\),
\[
\|(U_n(t)-U_m(t))x\|\le2\|(1-P_m)x\|.                  \tag{G2}
\]
Completeness gives a strong limit \(U(t)\), uniformly in \(t\) on each fixed vector. The same estimate for \(-t\) gives the adjoint limit. Products of uniformly bounded strongly convergent operators converge strongly, by adding and subtracting one mixed product. Thus \(U(t)\) is unitary, \(U(t)^*=U(-t)\), and \(U(t+s)=U(t)U(s)\). Approximation by \(P_mx\), followed by the norm-continuous bounded group on that subspace, proves strong continuity.

For \(x\in\operatorname{Dom}h\), \(P_nx\to x\) and \(hP_nx=P_nhx\to hx\). On \(P_nK\) we have \(hU_n(t)P_nx=U_n(t)P_nhx\). Taking the two limits in the closed graph of \(h\) gives
\[
U(t)x\in\operatorname{Dom}h,\qquad hU(t)x=U(t)hx.      \tag{G3}
\]
Using \(-t\) shows that \(U(t)\operatorname{Dom}h=\operatorname{Dom}h\). On each bounded subspace the exponential series and the continuous fundamental theorem give
\[
U_n(t)P_nx-P_nx=i\int_0^tU_n(s)P_nhx\,ds.
\]
By (G2) the integrands converge uniformly on compact time intervals. The complete tagged-sum integral therefore gives
\[
U(t)x-x=i\int_0^tU(s)hx\,ds,\qquad
\frac{d}{dt}U(t)x=iU(t)hx.                            \tag{G4}
\]
The integral is oriented when \(t<0\). These properties determine the group: for another group \(V\) preserving the domain with this derivative, differentiation of \(V(-t)U(t)x\) gives zero for every domain vector. The difference quotient is legitimate because (G3) makes the vector path continuous in the graph norm. The vector fundamental theorem makes that product constant, and density gives \(V=U\). We write this constructed group as \(e^{ith}\).

Suppose now that \(k=k^*\) is Hilbert–Schmidt. Section 6.1 proves it bounded, the ideal inequalities
\[
\|BT C\|_{\mathrm{HS}}\le\|B\|\,\|T\|_{\mathrm{HS}}\,\|C\|,
\]
its norm completeness, finite-rank density and unitary invariance. The group for \(h+k\) preserves the same domain. For \(\xi\) in that domain, set \(y(s)=e^{is(h+k)}\xi\). In addition to ordinary continuity,
\[
hy(s)=e^{is(h+k)}(h+k)\xi-k e^{is(h+k)}\xi
\]
is continuous. Thus \(y\) is graph-continuous for \(h\).

For clarity, the product derivative requires only the following split at time \(s\):
\[
\begin{aligned}
\frac{e^{-i(s+\delta)h}y(s+\delta)-e^{-ish}y(s)}{\delta}
={}&e^{-i(s+\delta)h}\frac{y(s+\delta)-y(s)}{\delta}\\
&+\frac{e^{-i(s+\delta)h}-e^{-ish}}{\delta}\,y(s).
\end{aligned}
\]
The first term tends to \(i e^{-ish}(h+k)y(s)\), by the derivative of \(y\) and strong continuity. The second tends to \(-i e^{-ish}hy(s)\), by (G4) at the fixed domain vector \(y(s)\). Their sum is \(i e^{-ish}k e^{is(h+k)}\xi\).

The entire integrand is continuous in Hilbert–Schmidt norm. For arbitrary \(\xi,\eta\in K\), with no generator-domain assumption, put \(\theta_{\xi,\eta}z=\xi\langle\eta,z\rangle\). Parseval gives \(\|\theta_{\xi,\eta}\|_{\mathrm{HS}}=\|\xi\|\|\eta\|\). For fixed unitary groups \(U,V\),
\[
U(s)\theta_{\xi,\eta}V(s)=\theta_{U(s)\xi,V(s)^*\eta}.
\]
Adding and subtracting the intermediate rank-one operator bounds its difference at \(s,t\) by
\[
\|\eta\|\,\|(U(s)-U(t))\xi\|
+\|\xi\|\,\|(V(s)^*-V(t)^*)\eta\|.
\]
This tends to zero. Finite sums prove the finite-rank case. Approximating \(k\) in Hilbert–Schmidt norm, while keeping both groups fixed, makes the error uniformly at most that approximation error, for every \(s\). This proves continuity for general \(k\), with constant norm \(\|k\|_{\mathrm{HS}}\).

Completeness and tagged sums now supply the Hilbert–Schmidt integral. Integrating the domain derivative, then using density of \(\operatorname{Dom}h\) and \(\|T\|\le\|T\|_{\mathrm{HS}}\), proves the whole bounded-operator identity
\[
e^{-ith}e^{it(h+k)}-1
=i\int_0^t e^{-ish}k e^{is(h+k)}\,ds,\qquad
\|e^{-ith}e^{it(h+k)}-1\|_{\mathrm{HS}}
\le |t|\,\|k\|_{\mathrm{HS}}.                           \tag{G5}
\]
This holds for every real \(t\) and every self-adjoint \(h\), possibly unbounded, on the exact common domain used above. In the commuting bounded case the integrand is \(ke^{isk}\), giving \(e^{itk}-1\); its first-order term \(itk\) fixes the positive sign.

<a id="bg2"></a>

## BG2. Scalar chords, logarithms and complete diagonal singular sums

The [exponential and logarithm construction](../src/elementary-calculus-for-infinite-products.md#5-exponential-logarithm-and-scalar-powers) gives the absolutely convergent exponential series, its addition law, derivative, positive real range, inverse logarithm and continuity. [CAR Section 17.1](../src/car-fock-and-quasifree-states.md#17-1-the-elementary-scalar-period-including-the-meaning-of-2-pi) proves Rolle and the mean-value theorem from real completeness, and defines \(\pi\) from the first positive cosine zero. Its quadrant calculation gives
\[
\sin''x=-\sin x,\qquad
\sin x\ge0\ (0\le x\le\pi/2),\qquad
\sin0=0,\quad \sin(\pi/2)=1.
\]
Here is the chord step used in the solved exercises. If \(f''\le0\) on an interval, the mean-value theorem applied to \(f'\) shows that \(f'\) is nonincreasing. For \(a<t<b\), applying that theorem on \([a,t]\) and \([t,b]\) gives
\[
\frac{f(t)-f(a)}{t-a}\ge
\frac{f(b)-f(t)}{b-t}.
\]
Multiplication by the positive denominators and rearrangement shows that \(f(t)\) lies above its endpoint chord. Endpoints follow by equality. Taking \(f=\sin\), \(a=0\), \(b=\pi/2\) proves
\[
\sin t\ge\frac{2t}{\pi}\quad(0\le t\le\pi/2).           \tag{S1}
\]
The exponential derivative and oriented scalar integral also give
\[
|e^{ix}-1|
=\left|i\int_0^x e^{is}\,ds\right|\le |x|.
\]
The addition and conjugation laws yield
\[
|e^{ix}-1|=2|\sin(x/2)|.
\]
Consequently
\[
\frac{2|x|}{\pi}\le |e^{ix}-1|\le |x|
\quad\hbox{for }|x|\le\pi.                            \tag{S2}
\]
To check the interval for the examples explicitly, the first positive cosine zero \(q=\pi/2\) satisfies \(e^{iq}=i\). The integral bound gives \(\sqrt2=|i-1|\le q\), so \(\pi\ge2\sqrt2>1\). Thus both \(x=1/j\) and \(x=1/\sqrt j\) lie in the range of (S2) for every \(j\ge1\).

The logarithmic estimate in Exercise 5 also follows from the entire inverse construction. If \(q>0\), continuity of \(\log\) and the exponential derivative show
\[
\frac{\log(q+\delta)-\log q}{\delta}\longrightarrow\frac1q.
\]
Indeed set \(\epsilon=\log(q+\delta)-\log q\); then \(\epsilon\to0\) and \(\delta=q(e^\epsilon-1)\), so the quotient is \(q^{-1}\epsilon/(e^\epsilon-1)\). For \(0<r\le1\), apply the mean-value theorem to \(\log\) on \([r,1]\). It gives
\[
1-r\le-\log r.                                       \tag{S3}
\]
For finitely many \(r_j\in(0,1]\), the addition law for the logarithm thus gives
\[
\sum_j(1-r_j)\le-\log\!\left(\prod_jr_j\right).
\]
A uniform lower bound \(c>0\) on these products bounds every finite defect sum by \(-\log c\). Alternatively the algebraic reciprocal-product bound in CO4 gives the same finiteness conclusion without logarithms. A zero overlap is excluded only after the finite prefix has been handled.

Let \(T e_j=d_j e_j\) on a whole orthonormal basis, with bounded \(d_j\). The operator and its adjoint act diagonally, and
\[
T^*T e_j=|d_j|^2e_j,\qquad |T|e_j=|d_j|e_j.
\]
The last diagonal operator is positive and squares to \(T^*T\). Uniqueness of the positive square root, proved by the continuous calculus, identifies it with \(|T|\). Its nonzero eigenvalues, counted with multiplicity, are the singular values; the kernel contributes zeros. In this diagonal compact setting, trace class means their sum is finite, equivalently
\[
\sum_j |d_j|<\infty,
\]
and Hilbert–Schmidt class means \(\sum_j|d_j|^2<\infty\). The positive trace sum is independent of the chosen basis: Parseval and interchange of nonnegative double sums give
\[
\sum_l\langle f_l,|T|f_l\rangle
=\sum_j|d_j|\sum_l|\langle e_j,f_l\rangle|^2
=\sum_j|d_j|.
\]
For the nonnegative sum, each equality means the supremum over finite partial sums; infinite values are allowed. Hence no unproved trace-class spectral theorem is needed for these exercises.

Compactness of this diagonal \(T\) is exactly \(d_j\to0\) (with finitely many coordinates treated automatically). If this holds, finite diagonal truncations approximate \(T\) with norm \(\sup_{j>m}|d_j|\), so compactness follows from Section 6.1. Conversely, if infinitely many \(|d_j|\) are at least \(\epsilon>0\), the vectors \(Te_j=d_je_j\) have pairwise distances at least \(\sqrt2\epsilon\). They have no convergent subsequence, contradicting compactness.

For \(d_j=e^{i/j}-1\), (S2) gives \(|d_j|\le1/j\) and \(|d_j|\ge2/(\pi j)\). The square sum is at most \(2\): on \(2^n\le j<2^{n+1}\) its contribution is at most \(2^{-n}\), and the sum of these geometric block bounds is \(2\). The singular sum diverges, since each such harmonic block contributes at least \(1/2\), before multiplication by \(2/\pi\).

For \(d_j=e^{i/\sqrt j}-1\), the norm of the omitted diagonal tail is at most \((m+1)^{-1/2}\), proving compactness. But \(|d_j|^2\ge4/(\pi^2 j)\), so its Hilbert–Schmidt sum diverges. Its singular sum diverges too, since \(j^{-1/2}\ge j^{-1}\). These are the complete inner-but-not-trace-class and compact-but-outer examples.

For the inner example, the positive overlaps \(r_j=\cos(1/(2j))\) satisfy \(1-r_j\le1/(8j^2)\), from the twice-integrated bound \(1-\cos t\le t^2/2\). This bound follows by integrating \(\sin s=\int_0^s\cos v\,dv\), using \(|\cos v|\le1\), and integrating again. For \(n>m\),
\[
2\!\left(1-\prod_{m<j\le n}r_j\right)
\le2\sum_{j>m}(1-r_j)\le\frac14\sum_{j>m}j^{-2}.
\]
It is the entire trace-vector tail estimate in Exercise 4. BG0/CO4 extends it to all finite-support vectors and both adjoints, giving the asserted strong* unitary implementer.

<a id="bg3"></a>

## BG3. All solution inputs and the full automorphism group

The solution inputs can be read in the following order.

| Whole solved exercises | Complete inputs |
| --- | --- |
| 1–3 | BG0/CO3: every finite subspace and its image, all matrix traces, conjugate-linear signs, occupations and both parity cancellations. |
| 4–5 | BG2: chord, singular sums, compact tails and both block series; BG0/CO4: whole product necessity and strong* sufficiency. |
| 6 | BG0/CO4: finite trace-zero prefixes, single rank-one sign change, infinite zero-overlap obstruction and summable nonzero tails. |
| 7–8 | BG1: arbitrary rank-one vectors, fixed-group Hilbert–Schmidt continuity, the whole common domain, all real times and the positive sign. |
| 9–10 | Sections 6.1–6.5 and BG0: arbitrary compact-normal diagonalization, all ideal and subgroup identities, diagonal innerness before transfer. |
| 11 | BG0 and CT1 below: finite even implementers, convergence on all CAR elements and every normal functional, and density in all of \(\operatorname{Aut}(R)\). |
| 12 | BG0/CO3: every finite reducing subspace, finite eigenbasis, even implementer, all tail annihilators and their adjoints, and the empty product when \(d=0\). |

The extra density conclusion in Exercise 11 concerns every normal automorphism \(\beta\) of \(R\), not just Bogoliubov automorphisms. The complete proof is [CT1](centrally-trivial-and-bernoulli-inputs.md#ct1-matrix-implementation-and-approximate-innerness), with the entire projection comparison [FCT0–7](central-finite-trace-inputs.md#fct0-three-analytic-operations) and finite approximations [AF1](central-afd-uniqueness-inputs.md#af1-finite-matrices-and-trace-projections).

Here is its application. Uniqueness of the normal trace gives \(\tau\beta=\tau\). For the matrix units of a finite head \(A_n\), equal-trace comparison supplies a partial isometry \(v\) with \(v^*v=e_{11}\) and \(vv^*=\beta(e_{11})\). Set
\[
Z_n=\sum_i\beta(e_{i1})v e_{1i}.
\]
Matrix multiplication gives \(Z_n^*Z_n=Z_nZ_n^*=1\) and \(Z_ne_{ij}Z_n^*=\beta(e_{ij})\). The finite trace expectation \(E_n\) recovers every trace GNS vector. Therefore, with \(\gamma_n=\operatorname{Ad}Z_n\),
\[
\|\gamma_n(x)-\beta(x)\|_{2,\tau}
\le2\|x-E_nx\|_{2,\tau}\longrightarrow0\quad(x\in R).
\]
The GNS unitaries converge strongly. Their inverses converge strongly as well: if \(V_n\to V\) strongly and all are unitary with unitary limit, then
\(\|(V_n^*-V^*)\xi\|=\|\xi-V_nV^*\xi\|\to0\).
CP1–6 and its finite-list/square-summable-tail estimate now give convergence on every normal functional in norm. Thus the full point-predual norm density follows. The \(j^{-1/2}\) example and the constant gauge \(-1\) are outer, so this dense subgroup is proper.

<a id="bg4"></a>

## BG4. Exact source comparison and distinct implementation questions

Carey's [freely accessible Numdam article](https://numdam.org/item/AIHPA_1984__40_2_141_0.pdf), printed pp.141–149, treats real Clifford spaces and more general quasifree representations. The definitions on p.142, Theorem 1.1 and Corollary 1.2 on p.143, and the whole parity argument on p.148 distinguish the \(R-I\) Hilbert–Schmidt branch with even finite \(-1\) multiplicity from the \(R+I\) Hilbert–Schmidt branch with odd finite \(+1\) multiplicity. Its proofs invoke Araki's implementation criteria and Ruijsenaars' phase and determinant formulas. Those source dependencies are not premises of BG0–3.

For a complex-linear unitary, a finite complex \(\pm1\) eigenspace has twice that dimension as a real space. Thus an odd finite real \(+1\) eigenspace cannot occur. The real Hilbert–Schmidt square norm of \(u-1\) is twice its complex square norm, by the real basis \(e_j,ie_j\). The complex tracial-factor theorem consequently has the single criterion \(u-1\) Hilbert–Schmidt; this does not import the general real converse.

Araki's [freely accessible EMS article](https://ems.press/content/serial-article-files/41673?nt=1), printed pp.385–442, supplies the state-preserving GNS comparison in Lemma 4.2, pp.389–390, and Corollary 6.2, p.401. Its Theorem 5 and whole proof, pp.421–424, concern innerness in the norm-complete CAR, with trace-class and parity conditions. Theorem 7, p.432, concerns implementation in a Fock representation and a Hilbert–Schmidt off-diagonal relative to its basis projection; its converse line prints “trace class” where the stated Hilbert–Schmidt hypothesis is needed. Its earlier representation-equivalence proof chain is separate from the present factor proof.

An implementer in \(R\), an implementer in the norm CAR and an implementer on the Fock Hilbert space answer different questions. The numbered lesson results and all twelve solutions use the tracial-factor argument with BG0–3. Human article access grants no new reuse licence, and no human proof text is relabelled CC0 here.