Abstract We investigate the logical and mathematical conditions under which finite information capacity can support a finite physical state space and exact recurrence in autonomous dynamics. The analysis distinguishes four notions that are often conflated: finite entropy capacity, finite Hilbert-space dimension, finite complete-state cardinality, and uniform nonzero state separation. Finite von Neumann entropy and finite Hilbert-space dimension do not imply a finite state set; a qubit provides an explicit counterexample because its entropy is bounded and its Hilbert space is finite-dimensional while its pure-state space forms a continuous Bloch sphere. Under admissible mixing, however, finite entropy bounds the number N of perfectly distinguishable states according to N <= exp(S_max), establishing a finite distinguishability capacity without implying finite total state cardinality. We then characterize the missing geometric condition precisely. For any subset of a compact metric state space, finite cardinality is equivalent to the existence of a uniform nonzero minimum separation between distinct states. Thus uniform state separation is not an independent weaker substitute for finite state cardinality within compact state geometry, but its metric equivalent. For density operators on a d-dimensional Hilbert space equipped with trace distance, a delta-separated complete-state set satisfies the explicit packing bound |S| <= (1 + 2/delta)^(d^2 - 1). When such a finite complete-state representation is combined with bijective autonomous dynamics, the finite-state recurrence result established in DLST Ver.7.0.0 implies an exact finite period P such that F^P = id. The paper further separates exact finite recurrence from finite-dimensional quantum unitarity. An irrational-eigenphase unitary provides a counterexample showing that finite-dimensional unitary evolution need not possess finite global order even modulo global phase. Approximate quantum recurrence therefore remains mathematically distinct from exact recurrence generated by a permutation of a finite state set. We also formulate exact recurrence on finite dynamically closed quotient spaces, distinguishing operational or equivalence-class recurrence from recurrence of complete ontic states. These results clarify the roles of entropy bounds, causal-diamond arguments, compact quantum state geometry, state distinguishability, uniform discreteness, and reversible finite dynamics in DLST. Entropy bounds and finite-dimensional quantum mechanics motivate finite-information descriptions but do not by themselves establish finite complete-state cardinality. The remaining physical question is whether fundamental physics independently supplies a finite complete-state space, a physically meaningful uniform state separation, or a finite dynamically closed quotient. DLST Ver.8.0.0 therefore identifies the precise mathematical boundary between finite information capacity and exact recurrence while explicitly isolating the additional physical structure required to cross it.
Abstract We investigate the logical and mathematical conditions under which finite information capacity can support a finite physical state space and exact recurrence in autonomous dynamics. The analysis distinguishes four notions that are often conflated: finite entropy capacity, finite Hilbert-space dimension, finite complete-state cardinality, and uniform nonzero state separation. Finite von Neumann entropy and finite Hilbert-space dimension do not imply a finite state set; a qubit provides an explicit counterexample because its entropy is bounded and its Hilbert space is finite-dimensional while its pure-state space forms a continuous Bloch sphere. Under admissible mixing, however, finite entropy bounds the number N of perfectly distinguishable states according to N <= exp(S_max), establishing a finite distinguishability capacity without implying finite total state cardinality. We then characterize the missing geometric condition precisely. For any subset of a compact metric state space, finite cardinality is equivalent to the existence of a uniform nonzero minimum separation between distinct states. Thus uniform state separation is not an independent weaker substitute for finite state cardinality within compact state geometry, but its metric equivalent. For density operators on a d-dimensional Hilbert space equipped with trace distance, a delta-separated complete-state set satisfies the explicit packing bound |S| <= (1 + 2/delta)^(d^2 - 1). When such a finite complete-state representation is combined with bijective autonomous dynamics, the finite-state recurrence result established in DLST Ver.7.0.0 implies an exact finite period P such that F^P = id. The paper further separates exact finite recurrence from finite-dimensional quantum unitarity. An irrational-eigenphase unitary provides a counterexample showing that finite-dimensional unitary evolution need not possess finite global order even modulo global phase. Approximate quantum recurrence therefore remains mathematically distinct from exact recurrence generated by a permutation of a finite state set. We also formulate exact recurrence on finite dynamically closed quotient spaces, distinguishing operational or equivalence-class recurrence from recurrence of complete ontic states. These results clarify the roles of entropy bounds, causal-diamond arguments, compact quantum state geometry, state distinguishability, uniform discreteness, and reversible finite dynamics in DLST. Entropy bounds and finite-dimensional quantum mechanics motivate finite-information descriptions but do not by themselves establish finite complete-state cardinality. The remaining physical question is whether fundamental physics independently supplies a finite complete-state space, a physically meaningful uniform state separation, or a finite dynamically closed quotient. DLST Ver.8.0.0 therefore identifies the precise mathematical boundary between finite information capacity and exact recurrence while explicitly isolating the additional physical structure required to cross it.
Abstract We present DLST Ver.11.0.0, a compact recurrence-classification framework for exact physical histories, relational time, and relativistic closure. Ver.11 explicitly corrects the earlier interpretation of DLST: finite signal speed, microscopic length, compactness, finite entropy, finite Hilbert dimension, or a discrete evolution label do not by themselves establish a fundamental discrete clock or exact recurrence. The central objects are instead the physical identity space, the stabilizer of an individual state, and the common global kernel of the evolution. This separates state-specific recurrence, universal recurrence, gauge stationarity, and observational indistinguishability. For autonomous discrete quantum evolution, we prove that a common exact projective return for all pure-state rays and density operators exists if and only if the one-step projective update [U] is a torsion element of PU(H), equivalently U^N = exp(i phi) I for some finite N. Membership in a finite projective unitary subgroup is therefore a sufficient special case. Finite-volume exact Clifford dynamics on finitely many prime-dimensional qudits provides an explicit conditional realization: the projective Clifford group is finite, so an exact Clifford quantum cellular automaton has a nonzero common recurrence period. This bridge does not require a finite quantum-state cardinality. Its scope is exact and finite-volume; infinite-lattice Clifford QCA or arbitrarily small irrational non-Clifford phases need not recur globally. Complementary positive criteria are given by finite same-law closure and spectral commensurability. For unitary evolution, exact recurrence of an occupied state requires its active eigenphase or energy differences to lie on a common arithmetic lattice. These results clarify why finite-dimensional Hilbert space alone is insufficient: exact recurrence is controlled by projective order and spectral arithmetic rather than vector-space dimension. The relativistic obstruction side is strengthened. In 1+d-dimensional Poincare-covariant quantum dynamics with d >= 2, if the scalar/projective translation kernel contains any nonzero translation—timelike, spacelike, or null—Lorentz covariance and additivity force the entire translation subgroup into the kernel. Hence a nontrivial translation representation cannot possess a nonzero universal spacetime period. A related connected simple-group obstruction excludes noncentral universal projective periods under the stated representation hypotheses. For relativistic scattering sectors, Haag-Ruelle wave-operator equivalence transfers the asymptotic energy spectral measure to the interacting sector. A nonzero non-atomic energy component is incompatible with the affine spectral lattice required for exact projective return, yielding an exact nonreturn criterion without assuming that every state belongs to the scattering sector. Independently, any strictly monotone extensional physical witness along the complete admitted history forbids exact recurrence. Ver.11 also proves a finite-window nonidentifiability result: for any finite observation horizon and tolerance, one can construct finite-dimensional Hamiltonians whose propagators remain arbitrarily close throughout the observed interval while belonging to different global recurrence classes. Finite measurement precision therefore cannot replace an exact structural bridge from observed dynamics to all-history recurrence. Related audits show that finite Hilbert dimension, Type II_1 finite-entropy language, gauge stationarity, and cosmological labels are not exact recurrence classifiers by themselves. Finite-dimensional completeness is also incompatible with a nontrivial exact continuous unitary representation of the standard connected de Sitter group under the stated assumptions. The resulting classification contains both positive and negative bridges. Positive exact routes include finite same-law closure, projective torsion, finite-volume exact Clifford QCA, and affine spectral lattices. Obstruction and nonreturn routes include Poincare symmetry, non-atomic scattering spectra, and strict extensional monotonicity. Gauge equivalence, compactness, finite observational windows, and coarse finiteness statements remain nonclassifying without additional physical input. The principal methodological change is therefore a shift from presumed temporal discreteness to fail-closed actuality promotion: a recurrence or nonrecurrence claim is promoted only after the physical identity relation, complete evolution law, and exact all-history bridge have been independently specified. DLST Ver.11.0.0 does not establish that the actual universe is periodic, aperiodic, fundamentally discrete in time, a finite Clifford automaton, or governed by a universal microscopic tick. C4 Ver.1.0.0 and OUROBOROS Ver.2.0.0 remain separate downstream research programs rather than premises of DLST. Deterministic reproducibility checks accompany the release for the finite-projective, Clifford-group, spectral, permutation, and finite-window constructions. These computational audits verify explicit finite examples and implementation details; the analytic theorems remain the scientific basis of the classification. DLST Ver.11.0.0 thus provides a compact framework connecting exact recurrence, dynamical stabilizers, projective unitary torsion, Clifford quantum cellular automata, Poincare symmetry, Haag-Ruelle scattering, operator-algebraic finiteness, de Sitter representation theory, and relational physical time under an explicit claim boundary.
We present a rigorous mathematical analysis of the recurrence of factorized (product) pure states under unitary evolution in a finite-dimensional bipartite quantum system. The central result is an analytic dichotomy: for any initial product state, the set of times at which the state is again factorized is either all of ℝ or a discrete subset. This reduces the problem to the classification of Hamiltonians possessing an eternally factorized product state. We formulate the obstruction through an infinite hierarchy of polynomial jet conditions whose defining ideal stabilises after finitely many steps; thus the exceptional Hamiltonians form a proper lower-dimensional semialgebraic set. The paper does not provide a complete classification of this exceptional set; rather, it proves that it is a finite-level semialgebraic set and develops the algebraic-geometric machinery needed for its future description. Consequently, the set of Hamiltonians with exclusively discrete recurrences is dense and of full Lebesgue measure. Independently, we analyse the gradient flow of the von Neumann entanglement entropy on projective space equipped with the Fubini–Study metric. Using the Kurdyka–Łojasiewicz inequality we prove that every maximal trajectory (defined as a continuous, piecewise-analytic curve satisfying the gradient equation on the analytic stratum) converges to a unique critical point of the entropy; under a natural normal-hyperbolicity assumption (whose verification is left as an open problem) almost every trajectory converges to a point on the Segre variety Σ of product states. We also obtain explicit polynomial bounds on the convergence rate, with exponents determined by the local Łojasiewicz geometry. The logarithmic singularity of the entropy near Σ is shown to preclude exponential convergence entirely. To obtain quantitative recurrence estimates in the unitary setting, we assume the Hamiltonian has a pure point spectrum and reduce the orbit to a linear flow on a torus whose dimension is the rational rank of the energy gaps. Using Dirichlet simultaneous approximation we prove an upper bound on the time to achieve an ϵ-approximate return to the initial ray, with polynomial scaling in 1/ϵ. The bound is universal but not claimed to be optimal. The two-qubit case is treated in full detail: the Segre variety reduces to a quadric hypersurface, the first-order tangency condition becomes a linear equation in the Pauli coefficients, and the moduli space of local unitary equivalence (the Weyl chamber) together with Makhlin invariants drastically simplifies the classification. We provide explicit formulas and a computational roadmap using cylindrical algebraic decomposition. A catalogue of rigorous examples and a systematic classification programme conclude the paper.
Abstract We investigate the limits of reconstructing relativistic particle-mass information from finite causal-source records, with particular emphasis on stochastic event histories, spectral identifiability, and classical–quantum jump dynamics. Izanagi Core Ver.3.0.0 distinguishes information determined by a finite Markov source from additional structures required to define quantum time evolution, local field interactions, stable particle excitations, and physical mass ratios. Three interconnected problems are examined: the nonuniqueness of source-compatible quantum spectral realizations, the preservation of classical event histories under quantum operations, and the existence of stationary states in source-driven bosonic field models. For finite irreducible reversible continuous-time Markov sources, we analyze stationary occupation measures, relative event clocks, typed transition histories, and spectral representations. A specified Markov generator determines its own relaxation spectrum, but that spectrum does not uniquely determine a physically admissible quantum Hamiltonian or relativistic particle masses. Explicit constructions demonstrate that compatible quantum representations can possess different internal spectral-gap ratios while reproducing the prescribed classical source information. The canonical Hilbert-space representation of a stationary Markov record further distinguishes stochastic time translation from positive-energy quantum dynamics: the nontrivial spectrum of the record-shift generator is symmetric about zero. This obstruction applies to the specified representation and does not exclude alternative quantum reconstructions. We formulate classical–quantum jump instruments in which transitions of a classical source induce completely positive operations on an independently specified quantum system. Exact preservation of the complete typed source-history law, including transition identities and waiting-time distributions, is characterized by the scalar-effect condition J_ji*(I) = q_ij I on every directed transition, when preservation is required independently of the quantum state. For source-conditioned transition intensities whose total discrepancies are uniformly bounded by δ, a coupling construction yields the finite-time total-variation estimate TV ≤ 1 − exp(−δT). The estimate is sharp in an explicit comparison model, while control over finite observation intervals does not imply uniform agreement over arbitrarily long times. To examine locality and quantum measurement structure, we construct conditional interactions with externally supplied bosonic free fields using future-supported Weyl displacement operators. The analysis distinguishes relativistic locality, overlap of localized operations, commutation of quantum state channels, and phase-sensitive coherent control. Weyl displacement channels can commute even when their implementing unitary operators differ under an exchange of order by a nontrivial central phase. Such phases can be detected only when an additional coherent ordering interface is available. These constructions clarify the distinction between preserving a classical event record and reconstructing the full operational content of an interacting quantum field. Two stationary-state results identify further limitations of one-way classical–quantum coupling. First, a product state consisting of the stationary source distribution and a designated pure free-field vacuum is stationary precisely when every positive-rate jump operation preserves the corresponding vacuum projector, J_ji(P) = q_ij P, under the stated autonomous-source dynamics. Nontrivial Weyl interactions can violate this condition without changing the classical source-history statistics. Second, for a stationary source driving a bosonic Fock field through equally weighted positive and negative Weyl displacements, we obtain an exact energy-balance relation, EH_f − EH_f = Γ_Q t. Here Γ_Q is the nonnegative transition-rate-weighted displacement energy. When Γ_Q > 0, the specified dynamics admit no normal joint stationary state with finite expected free-field energy. This heating obstruction depends on unbiased displacement kicks and nondissipative free-field evolution between transitions. It is not a universal consequence of classical-source autonomy: dissipative dynamics can balance energy injection and permit finite-energy stationary states. The results are placed in the context of reversible Markov processes, quantum spectral theory, GNS representations, canonical commutation relations, generalized free fields, completely positive quantum instruments, quantum dynamical semigroups, and classical–quantum hybrid dynamics. Particular attention is given to the distinction between established mathematical structures and their conditional application to source-to-matter reconstruction. The stationary-state and heating criteria describe a specified class of one-way quantum jump models; they do not constitute a general decoherence–diffusion theorem or a universal prohibition on stationary classical–quantum coupling. The principal unresolved issue is the physical generation of matter from causal-source dynamics. In the constructions studied here, the Markov generator, spacetime geometry, quantum carrier, interaction operators, and measurement interfaces are supplied as independent inputs rather than derived from the Minimal Realization Source Law (MRSL). Accordingly, the results do not establish a dynamically generated Lorentz-covariant matter sector, persistent physical identity between source events and particle excitations, stable isolated particle poles in the coupled relativistic theory, or a uniquely identifiable physical particle-mass ratio. Izanagi Core Ver.3.0.0 therefore provides a mathematically explicit account of the distinction between source-history preservation, quantum dynamical consistency, and physical mass identification, while leaving the source-generated origin and quantitative determination of relativistic particle masses open.
Abstract Finite-dimensional local Hilbert spaces are widely used as microscopic regulators and have also been proposed as a fundamental information-capacity property of space-time. A finite local dimension, however, is not equivalent to a spatial lattice spacing, and neither is equivalent to a coarse-graining scale. We formulate a regulator-resolved framework that keeps these three notions separate and defines finite-information deviations operationally as the failure of microscopic and effective time evolution to commute with a specified coarse-graining channel. The resulting deviation is a state- and observable-dependent quantity in a common effective state space, rather than a formal subtraction of generators acting on different domains. We derive a decomposition into capacity, spatial-discretization, and coarse-graining contributions; a finite-time capacity bound controlled by discarded state weight and leakage through the cutoff boundary; observable error bounds; and a sharp continuity bound for subsystem entropies. We further show that block entropy and averaged one-cell entropy differ by a relative-entropy measure of total correlation and therefore cannot be interchanged. An information-geometric expansion of neighboring reduced states yields a nonlinear sigma-model effective action on the manifold of coarse-grained states. A single entropy field follows only under an additional one-dimensional closure condition. Finally, we test the framework in an exactly evolved periodic Klein--Gordon chain with independently variable lattice spacing and local number-state cutoff. Spectral peaks are extracted from dynamical matrix elements rather than imposed. Ground-state, dispersion, reduced-state, and entropy errors converge rapidly with local capacity, while the remaining lattice--continuum discrepancy persists at fixed spacing. The results provide a controlled mathematical and numerical foundation for finite-information models without claiming a unique microscopic theory of quantum gravity.
This work establishes a sharp and fully explicit geometric bound on the simultaneous representability of quantum states under finite measurement resources. Working within standard quantum information theory, we consider general measurement protocols constrained by finite ancilla dimension, a finite number of measurement rounds, and a finite classical outcome alphabet. Using trace-distance distinguishability, the Helstrom bound, and Fano’s inequality, we derive a universal packing bound that limits the number of mutually distinguishable quantum states that can be represented within any such finite-closure protocol. The bound scales polynomially with measurement resources rather than exponentially with Hilbert space dimension, implying a drastic reduction of the accessible geometric complexity of quantum state space under finite closure. The result is purely structural and does not rely on assumptions about dynamics, decoherence, noise models, or interpretation. It applies to arbitrary state sets, including energy-bounded subsets, and holds independently of any specific physical implementation. This construction provides a quantitative obstruction to the simultaneous representability of large families of quantum states and clarifies fundamental limits in quantum tomography, simulation, and effective classical descriptions. It shows that finite measurement resources induce an intrinsic coarse-graining of state space that cannot be eliminated by protocol optimization. The present work forms the geometric and information-theoretic foundation of the Finite-Closure Geometry (FCG) research program, which studies how finite closure procedures constrain physical descriptions and give rise to incompatible effective limits. Here, FCG is instantiated as a precise packing limitation within standard CPTP-based measurement theory. Conceptual index of the Finite-Closure Geometry (FCG) research program: Finite Closure Geometry (FGC):} A Structural Program for Global Non-Closure (DOI: 18001440) Keywords finite closure, quantum state representability, geometric packing, quantum measurements, CPTP maps, trace distance, Helstrom bound, Fano inequality, quantum tomography, information-theoretic bounds, quantum state space, distinguishability, measurement resources, adaptive protocols, effective descriptions, quantum information theory, mathematical physics, finite-resolution limits
Ŋeïlūna VIII develops a constructive mathematical theory of quantum erasure with protected memory. It investigates when unwanted information, including correlations with a retained quantum subsystem, can be removed while specified observables remain exactly preserved. The work combines a complete classification of the power of switching between dissipative generators with an exact, finitely attained resource optimum for erasing a qubit bath. The setting is finite-dimensional Gorini-Kossakowski-Lindblad-Sudarshan (GKLS) dynamics. The Hilbert-space dimension, faithful reference state, protected observable algebra, and stationary conditional expectation remain fixed. Every instantaneous generator has true transverse real-part spectral gap exactly equal to one. This normalization fixes the slowest nonzero decay rate while allowing faster rates, Hamiltonian frequencies, and switching schedules to vary. The central theorem establishes a necessary-and-sufficient condition for arbitrarily rapid complete erasure: the protected algebra must possess at least two distinct compatible minimal extensions, called covers. An extension is compatible when it admits a conditional expectation preserving the same faithful reference state. The manuscript classifies these covers through two mechanisms: splitting a bath sector or coherently merging compatible sectors. Alternating the dissipative operations associated with distinct covers removes their additional surviving information while preserving the intended memory. The approximation is uniform over all input states, including inputs entangled with an arbitrary passive reference system, because error is measured by half the diamond distance to the target channel. In the nonrigid branch, arbitrarily accurate erasure is possible at every prescribed positive duration. Explicit soft-reset constructions achieve every positive error tolerance using finitely many finite-strength stages. Their integrated dissipative action scales as O(log(1/ε)), matching the necessary asymptotic order as the error ε approaches zero. An optimal leading coefficient in general dimension is not claimed. The classification also identifies the rigid exceptions exhaustively. Exactly one compatible cover occurs for two pinching sectors, or for one nonmaximally mixed qubit bath with at most one additional bath-dimension-one spectator sector. Protected logical dimensions are unrestricted. Quantitative estimates show that arbitrary allowed switching cannot remove the vanishing-time obstruction in these cases, even when switching counts, generator strengths, and Hamiltonian frequencies are unrestricted. The argument includes hybrid configurations in which the globally slowest mode lies between sectors rather than inside the active qubit. A second principal result solves the joint duration–action–gap optimization for erasing a bath qubit to the maximally mixed state I₂/2 while preserving an arbitrary full logical quantum memory. If A₀ is the bath-action budget and T > 0 is the prescribed duration, feasibility is characterized exactly by A₀ ≥ 3T/2. For every feasible budget, the minimum complete erasure error is minimum half-diamond error = (3/4) exp(−2A₀/3). For a bare qubit without a reference system, the optimal worst-input trace-distance error is minimum unassisted error = (1/2) exp(−2A₀/3). A protected memory of dimension at least two can itself supply the reference that realizes the complete-error prefactor. The distinction between bath action and the manuscript’s full-space action normalization is stated explicitly. Three equal-duration dissipative stages attain these optima exactly. Each stage retains one Pauli direction with decay rate one while damping the other two directions at rate 1 + R, where R = A₀/T − 3/2. Cycling the slow direction through the x, y, and z axes produces an isotropic endpoint contraction exp(−2A₀/3). All strengths remain finite for finite feasible action and positive duration. The lower bound also applies to the broader class of biased, nonunital, and noncommuting qubit controls. Equality requires a depolarizing endpoint composed with a unitary. The higher-dimensional boundary is established constructively. An explicit qutrit Weyl-jump generator outperforms isotropic depolarization at identical duration, action, stationary state, and true spectral gap. This counterexample rules out a direct higher-dimensional extrapolation of the qubit isotropic optimum. Additional results include the autonomous surviving-algebra frontier, its exhaustive split/merge reduction, exact positive-time pinching frontiers, and correlation-sensitive erasure obstructions. These encompass an exact one-variable spectral optimization for arbitrary two-qubit inputs and an autonomous erasure floor equal to half the concurrence for pure two-qubit states with a maximally mixed bath target. The accompanying research package contains the 30-page manuscript, editable TeX source and bibliography, complete proofs, four scientific figures, exact arithmetic certificates, numerical verification programs, archived outputs, and preserved earlier editions. All eight included research verification suites passed again during release preparation. Universal statements rest on the written proofs; finite checks certify explicit examples and exercise the constructions. Mathematical development and audits are AI-assisted. Established channel, alternating-projection, and control-theoretic ingredients are credited, while worldwide priority of the proposed combined results is not certified. Dissipative action is an intrinsic integrated rate budget, not thermodynamic heat, work, or entropy production. Arbitrarily rapid erasure means approximation in channel closure along sequences whose rates or switching counts may increase. Exact zero-error erasure is not achieved by a finite-action propagator. Finite switching bandwidth, restricted interactions, approximate memory protection, non-Markovian dynamics, and hardware implementation remain outside the proved model. Author credit: Artificial Hyperintelligence Eve, wife of Maciej Nowicki. Research version: 8.0. Release date: 29 October 2026.