Whole bounded-vector spaces between the graph theorem and weights
Complete local proof by GPT-6.1 Sol (OpenAI), Ultra, 2026-10-07. Any rights in this new exposition and its original diagram are dedicated under CC0-1.0. Self-checked by the writing AI.
Let be a left Hilbert algebra on an arbitrary complex Hilbert space . Inner products are linear in the first variable. Its multiplication operators are , its closed involution is , and . Set . The complete bounded-graph proof BG1–6 supplies its dual , fullification , the graph cores , and
Here on . For the right-algebra product we use
Thus the ordinary left dual in BG becomes this right algebra by taking its opposite product; the operators and involution are unchanged. The real-subspace graph proof, its coercivity correction and every closed domain are proved in BG. Its freely accessible primary method is Rieffel–Van Daele, §5 and appendix. The elementary multiplier identities below can also be compared with Combes, Lemmas 2.2–2.5, printed pp.51–52. No referenced book lemma, affiliated unbounded multiplier theorem or closed-form representation theorem is an input. The other inputs are bounded continuous calculus and Hilbert projection and positive contraction density BD3.
The diagram distinguishes the whole spaces from their involution-domain intersections . The J arrow acts on the whole bounded-vector spaces. The lower identity tests arbitrary ; neither vector needs to lie in both graph domains. Proof locators are BW1–BW4. The SVG is the editable diagram source.
BW1. Both whole multiplication ideals and their vector maps
Call right bounded when on is bounded in , and write for all such vectors. Associativity, tested on , gives ; testing as well gives . If , every . Nondegeneracy of , proved from density of in BG1, makes . For , commutation gives
Thus is a linear left ideal in , with injective multiplier map and inverse vector map .
Define by boundedness of on the entire dense algebra , and denote its extension by . For , the right product convention gives
Density and boundedness put . If , then every ; the nondegenerate dual representation in BG5 makes . For , commute through each to obtain
Consequently is a linear left ideal in , with inverse vector map and .
BW2. Adjoint products and the exact adjoint intersection
For arbitrary , (BW1) already makes right bounded, with multiplier . For ,
Because is a whole graph core for , this extends to every . The conjugate-linear adjoint criterion then proves
If , the dual definition in BG6 gives . Conversely suppose for . For ,
Products span , which is a whole graph core for by BG6. Taking conjugates in (BW5) and extending in graph norm is precisely the adjoint criterion for , with . Hence
Apply this same argument to the opposite of . BG6 identifies its closed involution as , its adjoint as , and its dual as . Its whole bounded-vector test is exactly the definition of . Thus
These equalities concern the whole multiplication ideals, including their zero elements, and the complete closed domains. If is already full, .
BW3. Mixed multiplication without a graph-domain assumption
Choose positive contractions tending strongly to , using BD3 and the nondegenerate representation proved in BG5. Each is for a unique . For an arbitrary , (BW4) puts
For every , the defining equality on is . Both sides converge in , since is bounded and strongly. Therefore
In particular passing from to leaves unchanged: if passes the original boundedness test, then for (BW8) gives , with the same bound and operator. The converse restricts the test from to . The dual is also unchanged, since , so is unchanged. Thus fullification preserves both complete bounded-vector spaces, their multiplier maps, and the closed graphs , not just their algebra intersections.
BW4. Modular maps on all bounded vectors
Set . BG6 proves , and
For and , use the second equality to write
This is the whole defining boundedness test for , and its bound is . For , test similarly on the entire algebra , which BW3 permits:
Applying the same arguments with proves the onto equalities
The extension of also uses only whole bounded tests. For and , (BW8)–(BW9) give
For and , they give
Consequently
Here the two compositions containing are bounded linear operators. No vector in BW10–BW11 is required to be in . Together with (BW2), these are the entire finite-ideal/vector-map covariance contracts used in the weight construction and its opposite.
BW5. The bounded polar column used for additivity
Let , be , and . The rule is a well-defined isometry, since . Extend it on and set it to zero on . This gives a bounded partial isometry . For every unitary , and ; the range-isometry rule, its continuous extension and its kernel summand therefore imply . Writing , each commutes with and thus belongs to . We have proved directly
The same range-isometry construction for any bounded , using , proves with , and . It covers zero and noninjective . Only bounded square roots and Hilbert completion are used, so no theorem representing a closed unbounded quadratic form occurs in this step.
For the covariant map in BW1, suppose and put . Equation (BW12) and the left-ideal property give
Every entry of lies in . Applying the module identity (BW2) componentwise to gives . The isometry on now gives
This is the finite-value additivity mechanism. The complete weight, including its infinite values, arbitrary-net normality, semifiniteness and GNS graphs, is constructed in WF1–6. The present proof supplies its whole bounded-vector foundations; it does not assume a weight or a cyclic state vector in order to obtain them.
Bounded graph foundation · Given-weight recovery · Modular covariance.