Conditional result
Positive null-stable word kernel reconstructs cyclic representation
finding:positive-word-kernel-reconstructs-cyclic-gns
Given a positive Gram kernel K with normalized reference, compatible composition/adjunction, and null-stable continuation, quotienting by null vectors and completing constructs H_K and the well-defined word action. Cyclic realizations of the same complete K values are unitarily equivalent on the common word domain; for unbounded operators, closures and self-adjointness remain additional requirements.
Scope: Construction applies only with complete coherent K values and stated domain conditions; K from the original TFPT source has not been derived.
Required premises and original source excerpts
- Positive word kernel with null stability
The GNS/Gram reconstruction requires a Hermitian positive kernel K, normalized reference, declared composition and adjunction, and stability of null relations under every allowed continuation; these are conditions on a supplied K source, not TFPT axioms proved from bare future answers.
premise:positive-word-kernel-null-stability
- experiments/theory-contracts/universalraum-primitive-source-audit-20260915/RESULTS.md, lines 145–194
Source SHA256: ae9880339326e402dee9783185defc0671bdec430a777d961d54e7636335aa80
bounded-excerpt · current-at-snapshot
- experiments/theory-contracts/universalraum-primitive-source-audit-20260915/RESULTS.md, lines 195–235
Source SHA256: ae9880339326e402dee9783185defc0671bdec430a777d961d54e7636335aa80
bounded-excerpt · current-at-snapshot