Skip to main content

Explore the foundations and current research.

Follow the published construction into its registered claims, then explore reviewed research questions, attempts and the connections that remain open.

Universalraum

The published foundation in this area

14 authored claim references lead into the original ledger and paper sections. This source record remains available even where no separate reviewed research packet is attached.

Read the foundational statements and sources

Universalraum keeps two directions separate: operationally complete TFPT as a common parent, and derive TFPT readouts from a deeper shared source. Future equivalence is defined relative to an explicit menu of interventions and records.

Starting structure in the Atlas orientation
Formal future-equivalence criteria, finite filters and parents, and counterexamples to premature correlation removal are available.
Which connection is sought
The goal is either operational completion of TFPT or a deeper source process that generates TFPT readouts; both require states, interventions, events, and records.
How it connects
Universalraum→TFPT asks for the deeper source; TFPT→Universalraum asks for complete common implementation. Readout matches answer neither direction automatically.

Reviewed conclusions to explore

Established in scopeFinite sequential data admit a classical history realizationEstablished in scopeReport repeatability is not complete state stabilityEstablished in scopeRepeatable distinctions select no unique response geometry

Reviewed results · Universalraum

All resultsEstablishedConditionalScoped exclusions

1 matching reviewed results

Conditional result

Positive null-stable word kernel reconstructs cyclic representation

In the question: Future quotient and positive GNS reconstruction

Construction applies only with complete coherent K values and stated domain conditions; K from the original TFPT source has not been derived.

Read the exact result, assumptions and evidence

Result

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.

Required assumptions

  • 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.

Original evidence

  • RESULTS.md lines 145–194

    Source checked at this snapshot

    Original location and fingerprint

    experiments/theory-contracts/universalraum-primitive-source-audit-20260915/RESULTS.md

    ae9880339326e402dee9783185defc0671bdec430a777d961d54e7636335aa80

  • RESULTS.md lines 195–235

    Source checked at this snapshot

    Original location and fingerprint

    experiments/theory-contracts/universalraum-primitive-source-audit-20260915/RESULTS.md

    ae9880339326e402dee9783185defc0671bdec430a777d961d54e7636335aa80

finding:positive-word-kernel-reconstructs-cyclic-gns