PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
May 29, 20260 citationsOpen Access

Records, Erasers, and Recovery on Causal Posets: Finite Theorems, Boundary Algebras, and Continuum Assumptions for Decoherence, Horizons, and Islands

View Full Paper
PSPetr Sramek

Key Points

  • This research aims to provide a finite-dimensional account of decoherence and related concepts within causal posets.
  • Develops record-algebraic frameworks for decoherence and recovery in causal posets.
  • Proposes toy models and experiments involving MARK/ERASE circuits and boundary-kernel models.
  • Utilizes history bases and observer record algebras to establish theoretical foundations.
  • Introduces a mechanism for record creation correlated with histories and marker degrees of freedom.
  • Demonstrates implementation of a completely positive trace-preserving channel using a Schur product approach.
  • Establishes a conditional dictionary for terminology such as horizon and islands based on finite theorem statements.

Abstract

This paper develops a finite-dimensional record-algebraic account of decoherence, erasure, boundary records, threshold recovery, islands, entropy ledgers, and modular flow on causal posets. Record creation correlates histories with marker degrees of freedom, and ignoring those markers implements a completely positive trace-preserving dephasing channel. In a fixed history basis the channel is a Schur product, rho -> G ∘ rho, where G is the Gram matrix of marker overlaps. The paper packages this mechanism in causal-poset language: history bases are defined from chains or admissible paths; observer record algebras define branch quotients; conditional eraser instruments restore off-diagonal terms in selected sectors; and boundary record algebras yield observer-indexed coherence kernels. The manuscript treats horizon, Page-time, island, replica, and modular-flow terminology as a conditional dictionary built on finite theorem statements plus explicit continuum or code-subspace assumptions. It includes a claim-proof ledger, a continuum-assumption register, and toy-model or experiment proposals including a two-history MARK/ERASE circuit, a tunable boundary-kernel model, a three-fragment threshold-recovery ledger, and a modular-covariance recovery test. The paper is part of the DAGI observer-theory/foundations track and is version DAGI-OBS-REC-001 v0.3.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Petr Sramek (2026) studied this question.

synapsesocial.com/papers/6a192e79fab5b468c44179b3https://doi.org/10.5281/zenodo.20401746
Ask AI
Helpful
Bookmark
Share
View Full Paper