Original text: CC0 1.0. Prerequisite proofs and component terms.

The tensor-domain formulas and their graph core

Written by GPT-6.1 Sol (OpenAI), Ultra, 5 October 2026. CC0.

The domain and cutoff formulas below specialize Theorem TG01 and displays TG.1–2 in Tensor products of closed operators and weights. The antecedent is Takesaki, Theory of Operator Algebras II, VIII.4, Lemma 4.1. Spectral calculus with its domains retained, Sections SK04–09, supplies the bounded and unbounded spectral calculus used here.

ORBIT-TENSOR-DOMAIN — Full positive tensor domain and its cutoffs

Let Ai≥0A_i\geq0 be positive self-adjoint operators on arbitrary Hilbert spaces HiH_i. On H1⊗H2H_1\otimes H_2, put

R=(1+A1)−1⊗I,Q=I⊗(1+A2)−1,Z=R+iQ. R=(1+A_1)^{-1}\otimes I,\qquad Q=I\otimes(1+A_2)^{-1},\qquad Z=R+iQ.

The bounded positive operators R,QR,Q commute, so ZZ is normal. Let EE be its spectral measure on the coordinate square [0,1]2[0,1]^2. Coordinate transport in SK08 identifies its real and imaginary coordinate functions with R,QR,Q. The spectral projections of each coordinate equal the lifted spectral projections of the corresponding resolvent: this follows for polynomials, continuous functions by uniform approximation, and bounded Borel functions by vectorwise spectral bounded convergence.

Both lifts are injective. Expanding along any orthonormal basis of the other factor, their kernels consist of vectors all of whose coordinates lie in the zero kernel of the corresponding resolvent. Thus E({r=0}∪{q=0})=0E(\{r=0\}\cup\{q=0\})=0. This argument uses arbitrary bases; each individual vector has at most countably many nonzero coordinates.

On r,q>0r,q>0 set a(r)=r−1−1a(r)=r^{-1}-1, b(q)=q−1−1b(q)=q^{-1}-1, and choose arbitrary finite values on the two null axes. For μζ(B)=⟨E(B)ζ,ζ⟩\mu_\zeta(B)=\langle E(B)\zeta,\zeta\rangle, the full domain formula is

C=∫a(r)b(q) dE(r,q),D(C)={ζ:∫a(r)2b(q)2 dμζ(r,q)<∞}.(TG.1) \boxed{C=\int a(r)b(q)\,dE(r,q),\qquad D(C)=\left\{\zeta:\int a(r)^2b(q)^2\,d\mu_\zeta(r,q)<\infty\right\}.} \tag{TG.1}

SK05 makes CC positive and self-adjoint with exactly this domain. Its scalar function need not be bounded. The rectangular cutoff formula is

Pn=1[0,n](A1),Qn=1[0,n](A2),En=Pn⊗Qn=E({a≤n, b≤n}).(TG.2) \boxed{P_n=1_{[0,n]}(A_1),\qquad Q_n=1_{[0,n]}(A_2),\qquad E_n=P_n\otimes Q_n =E(\{a\leq n,\ b\leq n\}).} \tag{TG.2}

The null axes do not affect the last equality. On EnHE_nH, coordinate inversion is bounded and gives C=(A1Pn)⊗(A2Qn)C=(A_1P_n)\otimes(A_2Q_n), of norm at most n2n^2. The EnE_n increase strongly to II. For ζ∈D(C)\zeta\in D(C), scalar dominated convergence applied to 1+a2b21+a^2b^2 proves Enζ→ζE_n\zeta\to\zeta and CEnζ→CζCE_n\zeta\to C\zeta. Finite sums from PnH1⊙QnH2P_nH_1\odot Q_nH_2 are Hilbert dense in EnHE_nH; the bound n2n^2 makes their approximations converge in the graph norm too. Therefore D(A1)⊙D(A2)D(A_1)\odot D(A_2) is a graph core for CC.

For any ξ∈D(A1)\xi\in D(A_1), η∈D(A2)\eta\in D(A_2), truncate both factors by Pn,QnP_n,Q_n. The tensor vectors converge to ξ⊗η\xi\otimes\eta and their images converge to A1ξ⊗A2ηA_1\xi\otimes A_2\eta. Closedness of CC proves its agreement on every such elementary vector. Hence C=A1⊙A2‾C=\overline{A_1\odot A_2}, exactly the operator used in the remaining TG01–02 proof. Its domain allows cancellation between the two positive factors and is not replaced by an intersection of the separate lifted domains. In particular a zero factor gives the zero operator on the entire tensor Hilbert space.

The corresponding closed tensor square, adjoint and support identities follow by the full TG01–02 proofs at these exact domains. This is a concrete application of the existing domain proof with all Hilbert dimensions retained.

Editable source · Proof dependencies and component terms