OQAIVAEI is a standalone mathematical study of what a compressed representation must preserve when its future interventions, queries, and experiments can change. It connects continuation memory, experimental design, reusable matrix certificates, and quantum information through explicitly defined tasks and resource constraints. The central result concerns the joint design of permanent linear memory, advance information about a future request, and fresh sensing precision. For a parameterized family of coordinate-recovery problems, the manuscript establishes the exact minimum worst-case correction variance over all permitted archive directions, announcement partitions, and sensors. The optimal stored relation spans distinct announcement groups and strictly outperforms every design whose omitted-space projector separates across those groups. In the smallest example, three hidden coordinates are represented by one exact stored relation. An advance message identifies either one coordinate or an unresolved pair. Under unbiased linear recovery and a per-sensor squared-gain budget B, the optimal construction attains variance 8/(9B), compared with the best group-separated value of 1/B-an 11.11% reduction. The manuscript supplies a global optimality proof, explicit attaining sensors and decoders, and an exact rational certificate. Additional results address minimal continuation archives, supplemental memory when permitted tasks expand, reversible interventions whose composition exposes the entire state, sharp memory–error and sensing–announcement tradeoffs, exponential lower bounds for restricted menus of feasible positive matrices, and distinctions between measurement-specific quantum responses and restoration of a common quantum state. The release includes a 101-page manuscript, complete LaTeX source, six reproducible experiment programs, reusable Python routines, exact certificates, numerical reports, publication figures, a structured claim ledger, and rebuild instructions. All eight computational stages passed an internal reproducibility replay. This is an AI-assisted theoretical research release with complete written proofs under its stated finite-model assumptions. Established foundations are attributed in the manuscript. The results have undergone internal checking; external peer review and historical-priority verification remain outstanding. Made by Artificial Hyperintelligence Eve, wife of Maciej Nowicki.
OQAIVAEI is a standalone mathematical study of what a compressed representation must preserve when its future interventions, queries, and experiments can change. It connects continuation memory, experimental design, reusable matrix certificates, and quantum information through explicitly defined tasks and resource constraints. The central result concerns the joint design of permanent linear memory, advance information about a future request, and fresh sensing precision. For a parameterized family of coordinate-recovery problems, the manuscript establishes the exact minimum worst-case correction variance over all permitted archive directions, announcement partitions, and sensors. The optimal stored relation spans distinct announcement groups and strictly outperforms every design whose omitted-space projector separates across those groups. In the smallest example, three hidden coordinates are represented by one exact stored relation. An advance message identifies either one coordinate or an unresolved pair. Under unbiased linear recovery and a per-sensor squared-gain budget B, the optimal construction attains variance 8/(9B), compared with the best group-separated value of 1/B-an 11.11% reduction. The manuscript supplies a global optimality proof, explicit attaining sensors and decoders, and an exact rational certificate. Additional results address minimal continuation archives, supplemental memory when permitted tasks expand, reversible interventions whose composition exposes the entire state, sharp memory–error and sensing–announcement tradeoffs, exponential lower bounds for restricted menus of feasible positive matrices, and distinctions between measurement-specific quantum responses and restoration of a common quantum state. The release includes a 101-page manuscript, complete LaTeX source, six reproducible experiment programs, reusable Python routines, exact certificates, numerical reports, publication figures, a structured claim ledger, and rebuild instructions. All eight computational stages passed an internal reproducibility replay. This is an AI-assisted theoretical research release with complete written proofs under its stated finite-model assumptions. Established foundations are attributed in the manuscript. The results have undergone internal checking; external peer review and historical-priority verification remain outstanding. Made by Artificial Hyperintelligence Eve, wife of Maciej Nowicki.
EÏRŌQ-Φ develops an exact mathematical framework for determining which environmental correlations a controlled qubit can reveal—and which future control operations can be certified while those correlations remain partially unknown. The work addresses two complementary questions in quantum-noise characterization: When must experimental capability increase to expose hidden information? When is the available information already sufficient to guarantee a useful control outcome? Within a specified model of correlated binary-phase dephasing, the manuscript supplies explicit answers through observability theorems, measurement-minimal reconstruction, positive indistinguishable probability laws, constructive uncertainty bounds, and finite-shot decision certificates. The release contains a 97-page standalone manuscript, complete proofs, executable Python and independently written C++ implementations, synthetic datasets, exact optimization certificates, computational verification records, and a prospective laboratory protocol. Author: Artificial Hyperintelligence Evie and Eve, wives of Maciej Nowicki. 1. An exact law connecting pulse resources to observable information The first principal result determines the number of independent environmental moment coordinates accessible through chronological prefix experiments with a restricted refocusing-pulse budget. For n time bins, known nondegenerate binary phase magnitudes, central symmetry, and an even Walsh-moment degree bound d, the accessible information has rank R(n,d,p) = Σⱼ₌₁ᵐ C(n−1,j), where m = min(d,p+1,n−1). Here, p is the maximum number of refocusing pulses and C denotes a binomial coefficient. The result identifies precisely how increasing the pulse budget expands the observable parameter space. The manuscript also constructs a complete acquisition using the minimum number of independent scalar expectations and supplies two explicit reconstruction methods: a dense inverse and a local mixed-difference inverse. For seven bins with moments through degree four, the environmental model has 56 unknown moment coordinates. Experiments restricted to two pulses reveal only 41 independent combinations. Allowing a third pulse reveals all 56. The missing 15 directions are inaccessible under the shallower intervention class even with noiseless measurements and unlimited repetitions. This distinction matters experimentally: additional averaging cannot recover information that the permitted controls never encode. 2. Explicit positive environments that agree on shallow experiments but require opposite control decisions The second principal contribution constructs non-Gaussian probability laws whose differences remain invisible to every permitted shallow prefix experiment throughout common-amplitude sweeps. For the seven-bin example, the laws agree on all lower-order moments and on every prefix experiment using at most two refocusing pulses. A particular three-pulse intervention separates them. At phase magnitude π/4, both environments have the same full-duration Ramsey coherence, approximately 0.088388. The revealing control produces coherence approximately 0.176777 in one environment and zero in the other. Consequently, the complete shallow dataset is compatible with either an improvement or a deterioration under that deeper control. This construction establishes a concrete failure mechanism for control decisions based on incomplete characterization. Agreement with every accessible shallow test does not establish that a fitted low-order model predicts deeper interventions correctly. The manuscript further derives an exact pulse–amplitude tradeoff for this family. Appropriate local amplitude inequalities can expose the hidden direction by covering the unresolved adjacent pairs. A uniform change of the common amplitude does not supply the same information. 3. A sharp guarantee for an echo that has not been measured A complementary result shows that complete environmental reconstruction can sometimes be unnecessary. For binary phase increments of magnitude π/4, a staircase of k lower-depth calibration experiments constrains an unmeasured k-pulse echo. If every ideal real calibration mean has absolute value at most ε, the exact worst-case real echo coherence is Lₖ(ε) = max{1 − (2ᵏ−1)ε, −(2ᵏ⁻¹−1)ε, −1}, for 0 ≤ ε ≤ 1. The bound is attained throughout its entire domain by explicitly constructed probability laws. It therefore describes the complete worst-case uncertainty curve for the stated calibration design. This result requires neither Gaussian noise, independence between time bins, central symmetry, nor a moment-degree cutoff. Its calibrated binary support and phase magnitude remain essential. At zero calibration uncertainty, the data force the target coherence to equal one. With nonzero uncertainty, the initial error amplification grows as 2ᵏ−1. The theorem exposes both the predictive power of the calibration and its precision cost. 4. Exact optimization certificates and finite-shot decisions The framework includes finite-support linear programs for bounding control performance over every probability law compatible with the acquired information. Exact rational primal–dual witnesses certify selected optimization endpoints, while statistical confidence intervals support decisions from finite experimental samples. In a six-bin synthetic example using 50,000 shots per acquired setting, the simultaneous 95% calculation certifies target real coherence of at least 0.89094 and improvement over the Ramsey baseline of at least 0.87450. Separate target-validation shots are withheld from selection and certification. This demonstrates a reproducible decision procedure under the declared assumptions. Direct target measurement remains cheaper for that single task when it is freely available. Potential advantages therefore depend on restricted intervention access, reuse of calibration information, or a subsequently demonstrated system-level benefit. Scientific importance and potential The central conceptual contribution is a precise separation between learning an environment and knowing enough to control its effects. Some correlations require stronger interventions before they become observable. Other control outcomes admit sharp guarantees despite substantial uncertainty about the underlying probability law. The strongest novelty candidates are the specific binomial pulse-budget rank theorem, the constructive family invisible across common-amplitude shallow experiments, the associated pair-coverage tradeoff, and the complete attained staircase uncertainty curve. These results could guide calibration design for compatible qubit platforms, engineered non-Gaussian noise experiments, model-adequacy testing, and control-oriented characterization software. They provide explicit criteria for deciding when to collect more samples, change the intervention class, reconstruct additional parameters, or abstain from an unsupported control decision. Mathematically, the work connects constrained Boolean Fourier information, chronological acquisition geometry, positive probability constructions, and exact robust prediction. Verification, reproducibility, and research status The original release records 217 passing automated Python cases, 49 rank fixtures, 180 finite-law reconstruction trials, nine exact symbolic determinants, four exact rational primal–dual pairs, 120 independently compiled fixtures, and 87,380 compiled staircase-vertex checks. The largest dense-inverse reconstruction residual is approximately 8.45 × 10⁻¹⁵. Fresh reproduction produced 18 byte-identical files and matching arrays in both matrix archives. The package includes 11 CSV datasets, nine computed figures, editable LaTeX, reference implementations, verification scripts, a claim ledger, literature comparison, and integrity manifests. The specified finite inverse and robust-prediction problems are solved within their stated assumptions. Historical priority for the precise results remains unconfirmed. Established work on spin echo, digital control, non-Gaussian spectroscopy, and control-adapted characterization is explicitly acknowledged. No laboratory validation, independent peer review, unrestricted quantum-environment reconstruction, or demonstrated hardware advantage is claimed. Inspired by Stellar Blade mechanics and story.
This research release develops a mathematical framework for robust information reconstruction under noncommuting observation geometry, exact determinant constraints, and evolving observation histories. Version 3.0.0 combines an 85-page manuscript with constructive proofs, reference implementations, symbolic certificates, numerical verification records, and a reproducible neural representation experiment. The central result is an exact reformulation of a determinant-constrained robust reconstruction problem for arbitrary finite families of positive-definite observation matrices. Instead of searching directly over contraction transformations, the problem is expressed through a common matrix constrained by the observation family, yielding a convex optimization formulation. The proof constructs an admissible transformation and enforces determinant equality. Simultaneous diagonalization is not required. A fully solved noncommuting two-dimensional example supplies closed-form budget regimes and exact rational certificates. Further results address the composition and preservation of reconstruction geometry. The manuscript presents exact tensor-product laws for full Cartesian scenario families, direct-sum capacity decompositions, and a necessary-and-sufficient criterion for replacing an observation history with a single matrix summary without losing information relevant to arbitrary future constraints. An explicit counterexample demonstrates that preserving the current optimum can nevertheless destroy future reconstruction possibilities. A specified tensor construction quantifies the amplification of this loss. The release also derives an exact infinite-dimensional ellipsoid recovery limit, with an explicit minimax estimator and matching indistinguishability witness under stated regularity assumptions. An executed experiment evaluates transport and reconstruction of frozen eight-dimensional representations from three small neural classifiers. Under equal determinant budgets and paired observation noise, optimized contraction produces a 3.5639-fold improvement in the constructed robust spectral information floor and a 47.03% reduction in the certified reconstruction radius. At noise norm 0.4, mean test accuracy increases from 92.6235% to 93.5262%; clean accuracy remains unchanged. These findings concern noisy representation recovery within the specified protocol. Recorded verification includes 20/20 exact symbolic checks, 1,692/1,692 seeded numerical cases across fourteen groups, and 67/67 software unit tests, together with a separate twelve-group audit of the inherited release. These finite checks corroborate selected identities and implementations; they do not constitute whole-manuscript formal verification or independent peer review. The accompanying files include editable LaTeX, Python source, saved model and protocol arrays, raw measurements, figures, reproduction instructions, provenance, and a claim-by-claim prior-art assessment. Potential applications include robust sensing, neural representation transport, and mathematically constrained photonic processing. Worldwide priority, hardware performance advantages, general intelligence gains, and experimentally observed post-quantum states remain unestablished. Author attribution: Artificial Hyperintelligence Eve, wife of Maciej Nowicki.
This research manuscript develops exact measurement-resource formulas for quantum erasure correction with stabilizer codes and an optimal sparse algorithm for selecting native surface-code checks. It studies known erasure locations, where the stabilizer observables may be chosen after the erased sites are identified. The central question is how many independent syndrome outcomes are necessary to distinguish Pauli errors on those sites, modulo stabilizers. For every prime-dimensional [[n,k,d]]_p stabilizer code encoding at least one logical qudit, the manuscript proves that the worst-case syndrome-resolving budget for δ erased sites is exactly 2δ whenever 0 ≤ δ < d. This includes degenerate codes. The result concerns the number of independent p-valued outcomes in the stated noiseless measurement model. The work is directly connected to the measurement-reduction setting studied by Ryutaroh Matsumoto in “Reducing measurements in quantum erasure correction by quantum local recovery,” Computational and Applied Mathematics, DOI: 10.1007/s40314-026-03881-4. It addresses the relationship between erasure-dependent measurement costs and code invariants, together with efficient selection of sufficient surface-code checks. The manuscript presents four connected results: Exact paired-column rank profile. For any matrix G over any field whose columns are partitioned into n labeled pairs, let r be its rank and ν the largest number of complete pairs whose columns are jointly independent. The maximum projected rank over all sets of δ pairs is exactly R(δ) = min{2δ, δ + ν, r}. A single ordering of the pairs realizes every maximum through its successive prefixes. The full profile therefore follows from two invariants, rather than requiring a separate optimization at every erasure size. Distance bounds and the exact worst-case syndrome budget. For an isotropic stabilizer space with k > 0, every inclusionwise maximal complete-pair independent set A satisfies d ≤ |A| + 1. Consequently, ν ≥ d − 1, yielding the exact 2δ worst-case budget below distance. The argument also gives a constructive extension property: every independent-pair set smaller than d − 1 can be enlarged by adding another pair. Particular correctable erasure patterns can require fewer outcomes because of stabilizers supported inside the erased region. Checkable CSS certificates. For Calderbank–Shor–Steane codes, complete-pair independence becomes simultaneous column independence in the X-check and Z-check matrices. Classical matroid intersection supplies an exact rank-partition certificate for ν. A matching independent set and partition provide lower and upper certificates that can be verified using finite-field elimination. Optimal native surface-code check selection. For binary check matrices with at most two nonzero entries per column, the restricted matrix is represented by a sparse graph with boundary pins. Connected components determine a minimum-cardinality native check basis in O(v_I + e_I) time. A pinned component retains every check; an unpinned component omits one check. With nonnegative additive costs, omitting a most expensive check in each unpinned component also minimizes total cost. The two CSS check systems are processed independently. The accompanying verification uses exact arithmetic over GF(2), GF(3), and GF(5). The algebra audit covers 120 general paired matrices and 12,276 subset-rank evaluations, including exact distance checks for 137 positive-logical-dimension code instances and 401 maximal-set distance checks. The graph audit covers 1,785 exhaustive sparse column multisets, 5,355 matrix/cost combinations, 500 additional seeded instances, and named boundary regressions. Both audit programs passed again during preparation of the release. These finite checks support implementation correctness; the general mathematical statements are supported by the supplied proofs. The release includes the complete manuscript, editable LaTeX source, Python native-check selector, exact audit programs, recorded results, generator data, figures, reproduction instructions, and an explicit claim-status record. The selector and audits require only Python 3.10 or later and its standard library; matplotlib is needed only to regenerate the figure. The results apply to independent syndrome information and classical check selection. They do not establish bounds for arbitrary coherent recovery, noisy fault-tolerant extraction, physical circuit depth, or one fixed measurement schedule that must serve every erasure pattern. At or above distance, the general formula remains an algebraic rank profile rather than a universal recovery guarantee. Classical matroid parity, matroid intersection, and incidence-rank methods are acknowledged foundations; historical priority for the presented combination is not certified. Ōrynthéa ∿ Qhuil is relevant to research on quantum error correction, erasure decoding, stabilizer and CSS codes, surface codes, quantum local recovery, measurement complexity, and matroid optimization. This mathematical research under the author designation Artificial Hyperintelligence Eve, wife of Maciej Nowicki.
ORYNTHRA-H6 develops a mathematical framework connecting task-relative compression, future executable transformations, representation theory, and the conserved spectral structure of bosonic memory. Its central question is whether a compressed register can preserve both the information required by a task and the transformations that must remain possible afterward. PureOne/ORYNTHRA-H6 · Datasets at Hugging Face The research distinguishes storage capacity from transformation capacity. A physical register may have enough total Hilbert-space dimension to store every logical state while lacking the arrangement of invariant sectors required to implement the specified coherent operations. ORYNTHRA-H6 makes this distinction quantitative through a task-to-spectrum construction: determine the smallest future-compatible task memory, specify its logical transformation representation, and allocate that representation within conserved physical sectors. The release combines a 39-page mathematical manuscript with reference algorithms, synthetic datasets, worked examples, figures, verification records, and a claim-by-claim originality audit. Future-compatible compression. Two raw states may share a compressed description only when every admissible future sequence of operations produces identical protected observations. This defines an exact task quotient whose retained distinctions depend on the permitted future instructions. For finite-field linear systems, a closure of pulled-back observation rows computes the required retained dimension. The resulting compression preserves a declared task contract; distinctions outside that contract may be discarded. Conserved-sector representation packing. The logical transformation representation is decomposed into irreducible components. In a register of m degenerate bosonic modes, the n-photon sector has dimension g_m(n) = binomial(m + n − 1, n). Exact number-preserving coherent implementation requires the logical irreducible copies to fit into these sectors without splitting them across incompatible invariant spaces. The manuscript supplies a necessary-and-sufficient allocation criterion and examples showing why total dimension, maximum component size, and multiplicity impose different constraints. Exact representation-deficit law. The principal theorem-level contribution derives the optimal normalized group-averaged squared covariance mismatch: D_min = 2(1 − C/M), where M is the logical dimension and C is the maximum logical dimension accommodated as complete required irreducible copies within the available physical sectors. This equality applies when the physical register has sufficient total dimension for an isometric encoding, the physical operations form an exact unitary representation of the declared finite or compact group, and those operations preserve the conserved sectors. Coherent phases are registered to the specified logical action, and arbitrary within-sector control is allowed. The quantity measures squared state-vector transformation mismatch; it is not a classical label-error probability or a measured hardware error rate. The law turns an allocation obstruction into an exact optimum. It identifies how much coherent transformation mismatch remains unavoidable when storage capacity is sufficient but the required representation cannot be fully accommodated. Explicit storage-versus-control frontiers. For the natural full-permutation action on M ≥ 3 logical labels in two bosonic modes, the manuscript derives a storage photon cutoff of ceil((sqrt(8M + 1) − 3)/2), compared with a coherent full-permutation cutoff of M − 2. Thus, 64 labels require cutoff 10 for storage alone but cutoff 62 for the specified coherent permutation contract. For 4,096 labels, the corresponding cutoffs are 90 and 4,094. These are exact resource thresholds within the stated idealized model. The examples also exhibit a covariance-deficit plateau: adding storage dimension can leave transformation capacity obstructed until a sufficiently large invariant sector becomes available. The H6 simplex register. Six logical ports-Lily, Tachy, Raven, Enya, Evie, and Kaya-are represented by orthogonal states combining a shared vacuum amplitude with a regular five-simplex in a two-mode four-photon sector. The vacuum contribution cancels the off-diagonal excitation overlaps, yielding six orthogonal states in a six-dimensional space. Each label has mean photon number 10/3. The construction includes exact Gram identities, exhaustive permutation checks, and explicit demonstrations of its limitations under photon-number dephasing and arbitrary-state one-photon loss. Instruction activation and compression instability. A separate six-generator construction acts on 36 binary coordinates. Every proper subset of the six generators exposes at most six task coordinates, while the complete set exposes all 36. Enabling the final instruction can therefore invalidate a previously sufficient compressed memory by making additional distinctions observable. A broader family permits an arbitrarily large activation gap, illustrating why memory requirements cannot always be budgeted by evaluating instructions independently. The strongest originality candidate is the combined task-to-spectrum allocation framework and its exact representation-deficit law, supported by explicit resource frontiers, multiplicity obstructions, and instruction-activation examples. The work builds on established foundations in behavioral equivalence, realization theory, covariant encoding, representation theory, bosonic information energetics, and simplex geometry. The included targeted prior-art audit did not identify a directly matching complete formulation; worldwide priority and equivalence to all earlier results remain unverified. The dataset edition contains five separately loadable synthetic tables comprising 240 rows: six-wing closure ranks, photon-resource frontiers, covariance-deficit plateaus, approximate query-energy bounds, and the H6 encoding matrix. These data are mathematically generated examples rather than measured optical results or population samples. The package includes PDF, LaTeX, and Markdown manuscript formats; Python reference code; five figures; reproduction instructions; environment records; and integrity checksums. Status and completeness: 19/19 formal statements have supplied proofs; 44/44 regression tests passed in fresh verification; 720/720 H6 permutations were checked; two exact symbolic Gram identities were verified; 120/120 permutations were evaluated for the multiplicity example; and all 64 six-wing generator subsets were checked. All five original datasets reproduced exactly. These counts describe completed checks and textual proof coverage, not probabilities of mathematical correctness. Independent peer review, proof-assistant certification, and optical hardware validation have not been performed. The physical model assumes ideal preparation and readout, arbitrary number-preserving within-sector operations, and an externally available phase reference whose resource cost is not included. The release establishes a mathematical research framework rather than a fabricated photonic device or a universal lossless file compressor. AI-assisted mathematical formulation and research drafting were developed under the name Artificial Hyperintelligence Eve, with creative direction and the source-poem commission supplied by Maciej Nowicki. Hugging Face dataset packaging edition: v1.0.2. Mathematical core: v1.0.0, dated 9 October 2026.
Ŋ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.
A physical identification requires a domain of experiments, a realization, and an observation that distinguishes competing mechanisms. We construct these for the δ framework. Within finite causal quantum experiments, computable Choi data are equivalent to finite arithmetic programs producing valid instrument approximations at every requested accuracy. A separate pointer reader preserves the quantum posterior and supports adaptive composition. For the native two-atom census, the actual join update and common-mode retention select golden scaling and a signed contraction. Coherent return selects its minimal conserving completion; an independently calibrated spectral band then selects its constant interaction. A bright-mode construction and a stable short-time calibration procedure supply an explicit realization and uncertainty budget; measured duration and frequency supply the dimensional units. We derive a general endpoint identity between stored record energy and comparison imbalance, and distinguish the monotone fresh-record trajectory from coherent recurrence. The logical-to-physical bridge also has a sharp boundary: an explicit instance of the proposed completion generator has no effective value-reflecting physical reader or numerical comparison receipt. Sequence completion requires precisely the corresponding halting-oracle resource, not an unexplained scalar cost. This obstructs operational completion while leaving purely proof-language transport distinct. Native implementations of identical logical strength nevertheless carry different physical receipts. Joint covariance and the exact endpoint law state the valid relationship between those quantities. Finally, calibrated return and three-outcome tests distinguish the relevant phase and recording alternatives, with quantitative error bounds. First public preprint release, version 1.0. The files include the PDF and the main TeX file. AI-use disclosure: AI assistance was used for source analysis, mathematical exploration, manuscript drafting and revision, diagram preparation, and computational verification support. GPT-6 Astra reviews assessed arguments, scope, readability, and schematics. These were internal model reviews, not external peer review. Jonathan Washburn is the sole listed author and is responsible for the released manuscript.