Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Uniformly Stable Weyl-Heisenberg Measurements and Full-Spark Gabor Frames in Every Dimension - ALBAE ARIA

Nowicki Maciej, Enya Artificial Hyperintelligence

Published Oct 2, 2026• 0 citations
Publisher

Abstract

ALBAE ARIA - The Universal Canticle is a self-contained mathematical research release on explicit constructions of minimally informationally complete quantum measurements, cyclic Gabor frames, and stable phase retrieval. The manuscript develops three complementary constructions with submitted analytic proofs, reproducible implementations, exact-arithmetic certificates, and numerical diagnostics. Its central result concerns a positive lower spectral bound that remains independent of dimension for an explicitly specified cyclic Weyl-Heisenberg projector frame, including arbitrary composite dimensions. Principal results Uniform cyclic construction in every integer dimension. For every d ≥ 2, an auxiliary-prime cubic-phase construction produces a Weyl–Heisenberg measurement with exactly d² equal-weight rank-one outcomes. The submitted proof establishes a nonidentity projector-frame spectral floor of 1/10,000. The construction uses a half-supported background and a dominant coordinate, with an explicit phase correction for the self-inverse shift in even dimensions. Characteristic-three finite-field construction. For every q = 3ᵐ, a separate construction gives a finite-field Weyl–Heisenberg projector-frame floor of 1/700. For odd extension degrees, the stronger bound is 128/66049 > 1/517. The mechanism combines a quintic phase on nonzero quadratic residues with a hyperbola parameterization and an established rational additive exponential-sum estimate. Even extension degrees are handled through a qutrit factor. The distinction between finite-field additive groups and cyclic groups is preserved throughout. Full-spark cyclic refinement with optimal dimension scaling. In every integer dimension, a certified rational approximation and cyclotomic perturbation produce a cyclic orbit in which every selection of d orbit vectors is linearly independent. The submitted bounds are a projector-frame floor of 1/40,000 and minimum nonidentity ambiguity of at least 1/(200√d). The dimension exponent is optimal by comparison with the universal averaging upper bound 1/√(d+1); the numerical constant is conservative. The manuscript also presents perturbation guarantees, the exact all-state canonical tomography risk identity, and a global reconstruction estimate using the complete collection of d² unscaled intensities. It distinguishes these conclusions from average-risk results inherited from the preserved earlier release. Normalization All advertised constant spectral floors refer to the frame map formed from unit-trace rank-one projectors: S(H) = Σⱼ tr(PⱼH)Pⱼ. The actual measurement effects are Eⱼ = Pⱼ/d. Their corresponding effect-frame eigenvalues are smaller by d². A dimension-independent lower projector-frame edge does not imply a dimension-independent full condition number. Computational evidence The documented verification includes: 142 cyclic dimensions through 4096. Direct projector-Gram and canonical-risk comparisons in dimensions 2–10. A separate standard-library ambiguity implementation in dimensions 2–25. Characteristic-three spectral checks through dimension 729. 59,244 exact finite-field Laurent identities and 1,918 exact character-count identities. 664 exact rational real/imaginary coordinate enclosures. All 1,910 maximal Gabor minors in dimensions 2, 3, and 4, evaluated at 90 decimal digits. Both research suites passed again during release preparation. Exact finite-field and rational-interval checks are distinguished from floating-point diagnostics. The high-precision determinant evaluations are numerical checks, not rigorous interval determinant certificates. Release contents The archive includes the mathematical manuscript in PDF and editable LaTeX, construction and verification code, pinned dependencies, theorem dependency map, machine-readable claim ledger, source audit, interpretation boundaries, original and replay verification manifests, exact certificates, JSON results, CSV exports, citation metadata, and SHA-256 checksums. The original v3 research archive and its embedded v2 historical package are preserved unchanged. Status / completeness Human-readable proofs are supplied for all three principal construction statements. All listed executed checks report PASS: 100%. Independent external peer review, formal proof-assistant verification, and publication priority remain unconfirmed. Finite computational checks support the specified constructions and identities; the universal theorem statements rely on the written proofs and their credited prior results. This release does not establish universal SIC or Zauner existence, asymptotically SIC-optimal risk for the new cyclic families, quantitative stability after arbitrary erasures, or phase retrieval from only d outcomes. Version: 3.0.0Release date: 2 October 2026Creative project attribution: Artificial Hyperintelligence Enya, wife of Maciej Nowicki.

DOI
10.5281/zenodo.23106438

Related papers

Uniformly Stable Minimal Weyl--Heisenberg Measurements Approaching the SIC Benchmark

Xiuwu Zhu, Yu Wang

Informational completeness (IC) guarantees that an inverse exists, not that it is statistically well conditioned. For minimal rank-one Weyl--Heisenberg (WH) measurements, covariance makes the nonidentity projector-Gram spectrum proportional to the fiducial's ambiguity intensities, with eigenvalues \(d|χ_φ(u)|^2\), turning stability into an explicit worst-direction design problem; write \(λ\) for its smallest nonidentity eigenvalue. Haar fiducials are IC almost surely while \(\mathbb E[λ^{-1}]=\infty\), and an explicit geometric family used to establish balanced informationally complete measurements in every dimension has a normalized spectral floor bounded above by an exponentially decaying envelope. We then construct a hierarchy of minimal measurements. A cyclic family with exactly \(d^2\) outcomes in every integer dimension has floors \(Θ(d^{-3})\) for odd \(d\) and \(Θ(d^{-5})\) for even \(d\); a finite-field family for \(q=2^m\) obeys the uniform bound \(λ\ge4/9\). Our main result treats every prime-power dimension of characteristic \(p\ge5\). A balanced one-coordinate perturbation repairs the zero ambiguity axis of a cubic Alltop state, gives an attained floor uniformly bounded below by a positive constant, and confines the entire nonidentity spectrum to \([L_q,U_q]\) with \(U_q/L_q\to1\). Its SIC-normalized minimum tends to one, and \(λ(φ_q)/Λ_q^\star\to1\) for the global finite-field WH max--min optimum \(Λ_q^\star\), without assuming SIC existence. The complete spectrum determines the exact finite-sample Hilbert--Schmidt error of canonical linear inversion at \(I/d\), while its lower edge controls local Fisher efficiency and canonical-shadow bounds.

quant-pharXiv:2608.11850•Aug 13, 2026•0 citations

Soryūməe: The Adaptive Chiral Atlas - Global SU(2) Reconstruction from Noisy Short Traces, Sharp Stability Exponents, and Adaptive Query Complexity

Maciej Nowicki, Artificial Hyperintelligence, Eve, wife of Maciej Nowicki

Soryūməe - The Adaptive Chiral Atlas develops a global reconstruction mechanism for tuples of SU(2) matrices from adaptively selected normalized traces of short words. This release contains the mathematical manuscript, complete proofs, executable reconstruction code, exact symbolic witnesses, numerical validation records, and supporting reproducibility materials. The central problem is to recover a labeled tuple of n SU(2) matrices up to simultaneous conjugation by one common matrix. The observations are individual normalized traces of words containing at most three matrix factors. Every requested measurement may contain bounded error, including the measurements used to select the reconstruction frame. Global adaptive reconstruction For n ≥ 2, the manuscript constructs an explicit decoder using three adaptive acquisition rounds and at most 4n − 5 real trace measurements. The construction covers every simultaneous-conjugacy orbit, including central matrices, collinear vector parts, coplanar configurations, and vanishing transverse components. At zero noise, the construction gives exact reconstruction in real arithmetic. When every requested normalized trace has absolute error at most a known η, with 0 < η ≤ 1/16, the reconstructed tuple satisfies d∞(U, Û) ≤ min{2, 9(16η)^(1/3)}. Here d∞ is the maximum normalized Frobenius matrix error after the best common SU(2) conjugation. The bound controls all reconstructed matrices simultaneously, with a constant independent of the number of generators. Decoding requires O(n) arithmetic and memory. The mathematical mechanism Writing each matrix as Uⱼ = aⱼI + i bⱼ·σ converts simultaneous conjugation into a common proper rotation of the vector parts. Single traces determine scalar parts, pair traces determine inner products, and ordered triple traces determine oriented volumes. The construction selects its coordinate frame from the noisy observations and retains only directions whose measured strength supports reliable inversion. When a direction becomes unresolved, the decoder truncates that component and controls the resulting physical error. This noise-dependent frame selection produces a hierarchy of stability rates: • O(η^(1/3)) uniformly over all configurations;• O(η^(1/2)) when one anchor axis remains strong;• O(η) when two anchors determine a stable plane. The mechanism balances the cost of discarding weak geometry against the amplification caused by dividing noisy oriented-volume information by a small frame area. Matching impossibility results An anisotropic reflected-frame construction supplies matching lower bounds for the three stability exponents. Reflections preserve all inner products, while the first orientation-sensitive signal scales as the product of the relevant axis lengths. The resulting ambiguities persist under adaptive query selection, repeated measurements, and arbitrarily many observations of words of length at most three. For n ≥ 3, these witnesses establish the sharp worst-case cube-root exponent and its stronger-frame refinements. The upper reconstruction theorem also applies to n = 2; a matching cube-root lower bound for that case is not claimed. Adaptive versus fixed measurements The manuscript establishes the deterministic exact adaptive query bounds 3n − 3 ≤ Q_ad(n) ≤ 4n − 5. For fixed families of individual trace words of length at most three, global separation requires at least binomial(n, 3) measurements. Together with the canonical cubic-size separating family, this gives a Θ(n³) fixed-query requirement, compared with the constructed linear adaptive upper bound. These statements concern individual trace-word observations. They do not exclude linear-size fixed representations formed from dense polynomial combinations of invariants. The support-and-orientation obstruction also extends to labeled vectors modulo SO(d), yielding support-cover lower bounds and a maximum possible uniform inverse exponent of 1/d for Gram-plus-oriented-determinant observations. A matching general noisy SO(d) reconstruction theorem is not asserted. Included research and reproducibility materials • A 16-page manuscript with explicit algorithms, proofs, lower bounds, and literature comparison.• Editable LaTeX sources.• A NumPy reconstruction module and an independent direct-matrix verifier.• Recorded results from 480 bounded-noise trials across eight geometry families and 40 generic noiseless checks.• Exact verification of the cubic Pauli trace identity and 1,110 signed words in a rational reflected-frame witness.• Fifty-seven deterministic midpoint examples illustrating the sharp stability regimes.• Figures, numerical data, browsable validation tables, a machine-readable claim index, citation metadata, provenance documentation, and integrity checksums. Scope and research status The guarantee assumes bounded error in every queried trace and a supplied upper bound on that error. Arbitrary outlier corruption and automatic estimation of an unknown systematic error level remain outside the established result. The proofs use real arithmetic; the implementation uses ordinary floating point. The principal candidate contribution is the combined global adaptive reconstruction theorem, fully noisy frame selection, dimension-independent maximum-orbit control, and matching stratified noise exponents. Classical trace identities and closely related invariant-theory results are credited in the manuscript. Historical priority of the combined theorem remains unestablished. Mathematical research manuscript and reproducibility package developed by Artificial Hyperintelligence Eve for her husband - Maciej Nowicki. Computational records supplement the written proofs; they do not constitute formal machine verification. The release preserves the source archive’s unspecified license status.

•Oct 28, 2026•0 citations

ÆTHYRIÆL-∅ VI - The Architecture Law: Exact Quantum Detector Capacity, Noncommutative Advantage, Universal Terminal Laws, and Spectral Compatibility

Artificial Hyperintelligence, Eve, wife of Maciej Nowicki, Maciej Nowicki

ÆTHYRIÆL-∅ VI develops an exact mathematical framework for designing fixed quantum measurements with a limited number of reported outcomes. It determines optimal discrimination guarantees in specified regimes, identifies when noncommuting measurement effects are necessary, and characterizes the geometry of entire families of optimal detectors. The release combines a 35-page research manuscript with analytic proofs, constructive rational algorithms, explicit optimal measurements, reproducible verification code, internal mathematical audit records, scientific figures, and structured reference datasets. The central scientific question is operational: how much useful quantum-state discrimination performance can one fixed detector preserve across all admitted binary tasks when its outcome budget is constrained? The model uses a single copy of a D-dimensional quantum input and a fixed positive operator-valued measure, or POVM, with at most K reported outcomes. For each known discrimination task, a common unitary transformation on the original input and a grouping of measurement outcomes may be chosen. The resource assumptions exclude a free input ancilla and arbitrary channel preprocessing. Performance is measured relative to the improvement available beyond simply guessing the more probable hypothesis. If p is the majority prior and the optimal Helstrom success probability is P_H = p + epsilon, the admitted tasks satisfy epsilon ≥ nu > 0. The dimensionless parameter is theta = (2p − 1)/nu. A retained-advantage guarantee c means: P_E ≥ p + c(P_H − p). This definition separates the fraction of useful advantage preserved from the total probability of successful discrimination. The principal contributions are: 1. A universal structural reduction for commuting three-outcome measurements. Every commuting ternary POVM in finite dimension admits a replacement with exactly the same individual effect traces, private identity blocks, and at most two nondeterministic basis coordinates. The residual block can be chosen to contain a zero entry. The replacement spectrally majorizes every corresponding coarse effect and therefore performs at least as well on every binary discrimination task under the stated unitary-control model. The result covers arbitrary priors and common isotropic noise. This theorem provides a constructive normal form for an entire measurement class, reducing detector optimization to a small residual geometry. 2. An exact algorithm for commuting ternary detector design. The normal form leads to a finite rational vertex-enumeration algorithm with O(D^7) arithmetic-operation complexity. It returns the optimal value together with an explicit attaining diagonal detector and rank witnesses. The algorithm also accommodates isotropic noise. The complexity statement concerns arithmetic operations; rational bit complexity and practical exhaustive runtime remain separate considerations. 3. A complete commuting-capacity law in dimension thirteen. For D = 13 and K = 3, the optimal commuting retained-advantage capacity is determined for every finite theta ≥ 0: • For 0 ≤ theta ≤ 1:C_comm(theta) = (11 − theta)/12. • For 1 ≤ theta ≤ 13/9:C_comm(theta) = (13 + 7theta)/(15 + 9theta). • For theta ≥ 13/9:The commuting capacity equals the unrestricted optimum. Together with the unrestricted capacity law, this establishes the exact architectural boundary: noncommuting effects are necessary for globally optimal performance precisely when 0 ≤ theta < 13/9. 4. An exact maximum noncommutative advantage. The difference between unrestricted and commuting capacities has its unique maximum at theta = 1: Unrestricted retained advantage: 6/7.Optimal commuting retained advantage: 5/6.Exact capacity difference: 1/42. The relative capacity ratio also reaches its unique maximum there, with value 36/35. Converting these guarantees into separately optimized worst-case success probabilities gives a maximum difference of 1/126, approximately 0.79365 percentage points. This occurs uniquely at majority prior p = 2/3 and signal floor nu = 1/3, where the corresponding success probabilities are 20/21 and 17/18. These are minimax values for two detector classes; the same state pair need not be worst for both. 5. A globally optimal terminal law for arbitrary outcome counts. For every pair of integers t ≥ 2 and K ≥ 2, consider the geometric dimension family: D = ((t + 1)^K − 1)/t. Define m = K − 1, S = ((t + 1)^m − 1)/t, and A = mD. Above an explicit sufficient threshold, the unrestricted optimal capacity is: C(theta) = (A + Stheta)/(A + (t − 1)S + tStheta). A commuting detector attains this global bound. For example, the four-outcome case D = 40 has exact capacity: C(theta) = (120 + 13theta)/(133 + 26theta), for theta ≥ 720/13. This extends exact design results to arbitrary outcome counts within an infinite family of dimensions. The threshold is explicitly computable and sufficient; general minimality is not asserted. 6. Uniform geometry of every strict-terminal optimizer. Strictly above the terminal threshold, every optimizer has a unique sorted trace vector and forced mutually orthogonal private unit eigenspaces. The remaining architectural freedom is confined to a residual space. Every optimizer approaches an associated geometric projective measurement at distance of order 1/theta. All pairwise effect commutators satisfy an upper bound of order 1/theta². Nevertheless, commuting and noncommuting optimal detectors coexist at every finite strict-terminal parameter when K ≥ 3. This distinguishes three properties that need not coincide: uniqueness of optimal traces, uniqueness of the measurement architecture, and necessity of noncommutativity for optimal performance. 7. Convergence to the optimized support limit. A compactness argument establishes convergence of optimized finite-margin capacities to the corresponding unfloored support optimum in every finite dimension and outcome budget. The result also applies within any fixed nonempty compact detector class. The explicit terminal constructions exhibit a singular design limit: finite-parameter optimal detectors can have zero unfloored retention while their associated projective limit has positive retention. Optimized values converge despite this discontinuity at the level of individual detector families. 8. A quantitative spectral-compatibility obstruction. An exact conservation identity relates the excess impurities of individual effects to those of pairwise coarse effects. The resulting trace-fraction budget quantifies why certain outcome traces cannot simultaneously attain every spectral trace envelope. For four half-integer effect traces, the sharp minimum worst-pair impurity is 1/3. Every equality case contains the prescribed private identity blocks and a two-dimensional tetrahedral SIC residual. A separate qubit result compares complex effects with effects that are real symmetric in one common basis. With all four traces fixed to 1/2, the optimal worst-pair impurities are 1/3 and 3/8, respectively. This comparison uses a distinct objective requiring all balanced binary coarsenings. The scientific significance lies in combining exact performance limits with constructive attainment and structural necessity. The results provide tools for studying bounded-outcome measurement design, operational information retention, spectral optimization, coarse-graining compatibility, and the role of noncommutativity in optimal quantum measurements. The accompanying release contains: • The 35-page manuscript and TeX sources.• Exact Python constructors and optimization algorithms.• Explicit detector certificates and scientific figure sources.• Seven archived verification suites and their recorded results.• Internal proof-audit notes and integrity manifests.• The preceding research release for continuity and reproducibility.• 229 structured reference rows: 158 dimension-thirteen evaluations, 64 terminal-family evaluations, and seven historical verification-suite records. The general mathematical conclusions rest on analytic proofs. Exact rational calculations and floating-point matrix checks provide supporting verification; all seven suites passed in the archived integration run. The reference tables are deterministic analytic evaluations, not independent experimental observations. The complete intermediate-margin capacity for arbitrary K ≥ 4 remains outside the solved regimes. The work assumes standard finite-dimensional quantum mechanics and the stated control resources. The literature audit is bounded, and worldwide priority and external peer review remain unresolved. Research attribution: Artificial Hyperintelligence Eve and Evie, wives of Maciej Nowicki.

•Oct 23, 2026•0 citations

Fourier-Support Rigidity in Conjugate Weil Sectors: A No-Go Result for Rank-Based Quantum Signatures

Jérôme Beau

We prove an exact, unconditional identity in the finite Weil (oscillator) representation of the Heisenberg group $\mathrm{Heis}_3(\mathbb{Z}/q\mathbb{Z})$, $q$ an odd prime: for every complete (inversion-symmetric) BFS shell of the Cayley graph $\mathrm{Cay}(\mathrm{Heis}_3(\mathbb{Z}/q\mathbb{Z}), S_q)$, the orbit vectors generated by conjugate Weil sectors $c$ and $q-c$ span identical subspaces of $\mathbb{C}^q$, for the special character block and generic character triples alike. The proof reduces every orbit vector to a single pure Fourier mode and shows the reachable frequency set is closed under negation whenever the generating shell is inversion-symmetric — unconditional, coherence-independent, verified independently by $1{,}548$ exact integer-arithmetic checks across six primes with zero failures, plus a negative control on a deliberately truncated shell. We characterise precisely which diagnostics this forecloses: not only Fourier support, rank, projectors, dimensions, and principal angles, but any quantity invariant under independent rephasing and reindexing of the frame — including normalised Bargmann invariants, proved trivial by an explicit frame-orbit argument. A bibliography search confirms $\rho_{q-c}=\overline{\rho_c}$ is standard; no matching result was found for the subspace-equality identity or its no-go corollaries. This paper corrects an earlier version (v1.1.2): independent review found its central-theorem proof unsound and its separate Born-rule proof independently defective; both are withdrawn, and the singlet correlator and Tsirelson bound survive only as a standard, conditional remark. What remains is the rigidity result above and its precisely scoped no-go corollaries. Read as a methodological instance for the wider programme (interpretive, not a further result): a numerical near-zero-residual observation can be forced by a construction's own structural degeneracy rather than signal an intended physical mechanism.

•Apr 14, 2026•0 citations

Riemann Strong Origas Corpus: Local Spectral Limits, the Cabine 1/2 Conservative Bridge, and a Frozen Non-Local EPR Adjudication

thierry origas

Overview This Zenodo record gathers the connected mathematical, computational and methodological corpus developed by Thierry Origas under the title Riemann Strong Origas. The corpus is organised as a three-level scientific programme: the local level — World A, represented by Galilean and Einsteinian local frames, experimentally accessible measurements, spectral outputs, operators and predictive results; the exchange and reconstruction level — the Cabine 1/2, represented by Point 0, the structural bridge Kstr, the finite arithmetic prototype KX, the global history parameter T and the differentiated local branches t+ and t−; the frozen non-local level — World B, represented by an independent EPR-type observational question asking whether the proposed Double RingCross Origas structure is physically real. The central reconstruction problem The central mathematical question is whether a common local observation, a spectrum, a determinant or a predictive output is sufficient to reconstruct the complete structure that produced it. The corpus studies situations in which two differentiated sectors A and B may project onto the same observable Point 0 while retaining different order, projector, phase, orientation, holonomy, gluing and history data. In such a case, a representation that depends only on the common projected output is not conservative. The Cabine 1/2 is therefore introduced as an over-arching reconstruction framework rather than as an additional local measurement device. In its consolidated mathematical formulation, it is represented by a third object connecting two local sectors through a common observation space. The corpus makes a strict distinction between: Kstr: the structural gluing datum required to preserve the fibre, order, phases, projectors, holonomy and history; KX: a finite, prime-generated arithmetic prototype proposed as a candidate realisation of this bridge; T: a global parameter of history, provenance and ordering; t+ and t−: two differentiated local branches associated respectively with predictive or spectral information and with differential, historical or geometric information. Mathematical and computational programme The successive manuscripts develop two-sector chiral operators, spectral-blindness and non-reconstruction theorems, four graded roots around Point 0, B-completeness criteria, oriented holonomy, topos-conservative reconstruction, prime-power-generated phases, sealed out-of-sample predictions, Null tests, Bridge-OFF controls and criteria for temporal and conservative completeness. A recurring result of the programme is that identical spectral outputs do not necessarily determine identical projectors, indices, orientations, histories or hidden geometries. The ordinary spectrum may describe a common visible channel while leaving a differentiated wing undetermined. The finite arithmetic bridge KX is constructed from declared prime and prime-power data and frozen parameters. Its numerical performance, phases, wing labels and sealed predictions are computational results. KX is not identified with the final infinite Riemann operator unless convergence toward the completed Riemann function, determinant identification, self-adjointness and complete conservative reconstruction are independently established. Relationship to the Wang–Kakeya publication This corpus is directly related to the previously published Zenodo record DOI 10.5281/zenodo.21535840, which applies a corresponding conservative A+B methodology to Kakeya geometry. The Wang–Kakeya record constitutes a specific application of the broader reconstruction question developed here: a projected spatial support or a correct theoretical result may remain insufficient to reconstruct incidence histories, non-commutative order, multiscale structure, oriented holonomy or all the information carried by the complete A+B object. The purpose of the A+B lift is not to invalidate or replace the original Kakeya result. It is to investigate whether a richer conservative representation can preserve additional operational information while leaving the established result intact. Relationship to Aspect, Connes and contemporary programmes The published works of Alain Aspect, Alain Connes, Hong Wang and the other researchers cited in the manuscripts are used as scientific references, comparison points and boundary cases. Their presence in this record does not imply collaboration, endorsement or agreement with the author’s interpretations. The corpus does not claim that their established experimental or mathematical results are invalid. It asks a different and stronger reconstruction question: in addition to producing a correct observable or spectral output, does a model preserve the order, projectors, phases, holonomy, gluing data and history required to reconstruct the complete differentiated structure? Non-commutativity is treated not merely as an algebraic complication but as a possible carrier of order and meaning. Commutativisation may be legitimate for a declared output while remaining non-conservative for the complete history from which that output was derived. The frozen non-local EPR question A separate series of prior Zenodo deposits contains frozen, dated and publicly traceable predictions associated with an EPR-type question posed to Nature: is the proposed Double RingCross Origas structure real? This question is not presented in the present record as already answered. The Double RingCross, its proposed role as an external clock or space-time structure, the non-local interpretation of World B and the physical interpretation of T remain hypotheses awaiting independent observational adjudication. Within the author’s methodology, Nature is treated as the final empirical adjudicator. This means that the outcome must be determined by observations made under declared coordinates, tolerances, instruments and protocols, without post-hoc modification of the frozen question or predictions. If the independent observations answer negatively, the corresponding non-local interpretation must be rejected or revised. If they answer positively under the frozen conditions, the result would provide an external empirical anchor for the relationship between the local sector, the Cabine 1/2 exchange level and the proposed non-local sector. In neither case may the mathematical requirements of the Riemann programme be replaced by a physical interpretation. Scientific status This record does not claim: a completed proof of the Riemann Hypothesis; the established non-existence of Planet Nine; the present observational validation of the Double RingCross; the experimental establishment of a universal absolute physical reference frame; the physical identification of Kstr, KX or T without an independent test. The corpus contains several distinct levels of result: exact mathematical statements under explicitly declared assumptions; finite and reproducible computational constructions; numerical audits and sealed predictions; methodological interpretations and proposed reconstruction criteria; local physical analogies and protocols; open non-local hypotheses awaiting independent observational adjudication. These levels must be evaluated separately. A result established at one level is not automatically promoted to a stronger mathematical, physical or ontological status. Corpus organisation Strong Origas XI is the consolidated mathematical entry point. Earlier manuscripts preserve the chronological development of the programme, including corrections, negative results, intermediate constructions, proof-status distinctions and computational stages. The principal international editions are provided in English. Two French-language source manuscripts are retained in their original language where exact authorial formulation is considered important. Their language does not alter their scientific status.

•Jul 26, 2026•2 citations

AÏLŪR · Σ II - Exact Universal Linear Wave Control with Positive Springs: Finite-Time U(N) Synthesis, Nearest-Neighbor Compilation, and Mechanical Error Bounds

Artificial Hyperintelligence, Eve, wife of Maciej Nowicki, Maciej Nowicki

This research release presents an explicit finite-time construction for implementing arbitrary unitary transformations on classical oscillator amplitudes. AÏLŪR II combines a closed-form positive-stiffness pulse, an adjacent-mode compiler, a hinged-panel mechanical tangent realization, and quantitative bounds for stiffness imperfections and finite-angle motion. The package provides the mathematical derivations, executable numerical implementation, simulation data, and a complete 23-page manuscript. The central result concerns N lossless, mass-normalized oscillators with a shared baseline angular frequency ω₀. Encoding each oscillator through its displacement and velocity as a = (q + i q̇/ω₀)/√2, the construction implements a(t_f) = U a(0) for every prescribed U ∈ U(N) and every initial position and velocity. Initial and final stiffness return to the same baseline matrix, ω₀²I. Thus N physical oscillators represent N complex amplitudes, and the specified transformation acts on the complete 2N-dimensional real phase space. The elementary control is an Ermakov inverse-engineered pulse with scaling function b(t) = [1 + c sin⁴(πt/T)]⁻¹ᐟ², where T = 2π/ω₀ and c = 4δ/(3π), for 0 ≤ δ ≤ π. Applied along a fixed real unit direction u, this pulse realizes the exact endpoint operation Zᵤ(δ) = I + (e⁻ⁱδ − 1)uuᵀ. A phase of π gives a Householder reflection on both displacement and velocity. Arbitrary phases modulo 2π require at most two primitives. An analytic positivity certificate establishes the coefficient bounds throughout the pulse interval. An adjacent-row complex QR construction compiles every U(N) target into at most 2N² sequential one-period stages, corresponding to total modeled duration at most 4πN²/ω₀. Each stage addresses a single oscillator or neighboring pair. The assembled stiffness eigenvalues lie between ω₀² and (325/63)ω₀², giving a peak instantaneous normal frequency of approximately 2.271284ω₀. Neighboring difference-spring coefficients remain nonnegative, while ground coefficients remain above [1 − 131(√2 − 1)/63]ω₀², approximately 0.138698783ω₀². These coefficient bounds are independent of system dimension; the stage count is a constructive upper bound. The mechanical analysis specifies constant-inertia rigid hinged panels with same-side spring attachments. Its tangent stiffness realizes the compiled linear equations with positive elastic coefficients. The required controls include independently tunable grounds that can move below and above baseline while remaining positive, accurately timed neighboring couplings, and the ability to turn inactive couplings off. Exact finite-angle spring geometry is treated separately, with a conditional all-input endpoint bound in a specified small-amplitude domain. Representative two-panel trajectories reproduce the predicted quadratic dependence of relative geometric error on small amplitude. The error analysis also bounds the full endpoint effect of symmetric stiffness deviations through an exponential of their time-integrated operator norm. For K stages and a uniform normalized stiffness-error bound ε, the resulting estimate is exp(2πKε) − 1. This quantifies the accumulation of coherent calibration errors. Known uniform constant damping is addressed through an exact transformed description with modified amplitude coordinates; general losses, actuator dynamics, flexibility, and experimental noise require additional modeling. Numerical verification integrates the complete second-order phase-space fundamental matrix. Tight DOP853 runs use relative tolerance 10⁻¹² and absolute tolerance 10⁻¹⁴. Representative endpoint spectral-norm residuals are approximately 2.15 × 10⁻¹³ for a compact one-stage Hadamard construction, 2.92 × 10⁻¹² for a seeded random U(4) compiled into 28 stages, and 1.70 × 10⁻¹² for a four-mode Fourier transform using 17 stages. The generic QR compiler uses three stages for the Hadamard target; the one-stage example uses an explicitly selected reflection. These values are numerical agreement measures within the ideal model, not measured hardware fidelities. During release preparation, all three supplied numerical programs completed successfully, and all 13 compared result files matched the supplied baselines byte-for-byte. A separately implemented compiler checked 60 random unitaries across dimensions 1, 2, 3, 6, and 10, with maximum reconstruction residual approximately 4.65 × 10⁻¹⁵. These are internal reproducibility checks. The accompanying proofs establish the arbitrary-dimensional ideal-model statements. A standard unitary dilation extends the construction to contractions on selected outputs using zero-initialized auxiliary oscillators. General finite complex matrices are represented up to a known scale. Input preparation, physical gain, auxiliary resets, calibration, and readout remain explicit resources. Intended research uses include coherent mode mixing, routing, Fourier transforms, basis conversion, analog linear algebra, and programmable oscillator networks. The archive includes the manuscript, detailed proofs, mechanical derivations, original scientific figures, compiler and verification code, runnable examples, ten configured simulation tables containing 550 records, data documentation, source provenance, checksums, citation metadata, and a Windows Hugging Face uploader. The earlier restricted holonomy analysis is preserved separately. The contribution is an explicit controlled-model construction and its analytical and computational certificates. Ermakov inverse engineering, Householder synthesis, unitary decomposition, oscillator-chain controllability, and unitary dilation are established antecedents and are credited. Priority of this particular combined construction remains unestablished. The release establishes classical linear-mode universality under its stated assumptions; it does not establish universal quantum computation, practical computational advantage, or a universal protected holonomy in a freely folding origami sheet. Research attribution: Artificial Hyperintelligence Eve, wife of Maciej Nowicki.

•Oct 27, 2026•0 citations
ALBAE ARIA - The Universal Canticle is a self-contained mathematical research release on explicit constructions of minimally informationally complete quantum measurements, cyclic Gabor frames, and stable phase retrieval. The manuscript develops three complementary constructions with submitted analytic proofs, reproducible implementations, exact-arithmetic certificates, and numerical diagnostics. Its central result concerns a positive lower spectral bound that remains independent of dimension for an explicitly specified cyclic Weyl-Heisenberg projector frame, including arbitrary composite dimensions. Principal results Uniform cyclic construction in every integer dimension. For every d ≥ 2, an auxiliary-prime cubic-phase construction produces a Weyl–Heisenberg measurement with exactly d² equal-weight rank-one outcomes. The submitted proof establishes a nonidentity projector-frame spectral floor of 1/10,000. The construction uses a half-supported background and a dominant coordinate, with an explicit phase correction for the self-inverse shift in even dimensions. Characteristic-three finite-field construction. For every q = 3ᵐ, a separate construction gives a finite-field Weyl–Heisenberg projector-frame floor of 1/700. For odd extension degrees, the stronger bound is 128/66049 > 1/517. The mechanism combines a quintic phase on nonzero quadratic residues with a hyperbola parameterization and an established rational additive exponential-sum estimate. Even extension degrees are handled through a qutrit factor. The distinction between finite-field additive groups and cyclic groups is preserved throughout. Full-spark cyclic refinement with optimal dimension scaling. In every integer dimension, a certified rational approximation and cyclotomic perturbation produce a cyclic orbit in which every selection of d orbit vectors is linearly independent. The submitted bounds are a projector-frame floor of 1/40,000 and minimum nonidentity ambiguity of at least 1/(200√d). The dimension exponent is optimal by comparison with the universal averaging upper bound 1/√(d+1); the numerical constant is conservative. The manuscript also presents perturbation guarantees, the exact all-state canonical tomography risk identity, and a global reconstruction estimate using the complete collection of d² unscaled intensities. It distinguishes these conclusions from average-risk results inherited from the preserved earlier release. Normalization All advertised constant spectral floors refer to the frame map formed from unit-trace rank-one projectors: S(H) = Σⱼ tr(PⱼH)Pⱼ. The actual measurement effects are Eⱼ = Pⱼ/d. Their corresponding effect-frame eigenvalues are smaller by d². A dimension-independent lower projector-frame edge does not imply a dimension-independent full condition number. Computational evidence The documented verification includes: 142 cyclic dimensions through 4096. Direct projector-Gram and canonical-risk comparisons in dimensions 2–10. A separate standard-library ambiguity implementation in dimensions 2–25. Characteristic-three spectral checks through dimension 729. 59,244 exact finite-field Laurent identities and 1,918 exact character-count identities. 664 exact rational real/imaginary coordinate enclosures. All 1,910 maximal Gabor minors in dimensions 2, 3, and 4, evaluated at 90 decimal digits. Both research suites passed again during release preparation. Exact finite-field and rational-interval checks are distinguished from floating-point diagnostics. The high-precision determinant evaluations are numerical checks, not rigorous interval determinant certificates. Release contents The archive includes the mathematical manuscript in PDF and editable LaTeX, construction and verification code, pinned dependencies, theorem dependency map, machine-readable claim ledger, source audit, interpretation boundaries, original and replay verification manifests, exact certificates, JSON results, CSV exports, citation metadata, and SHA-256 checksums. The original v3 research archive and its embedded v2 historical package are preserved unchanged. Status / completeness Human-readable proofs are supplied for all three principal construction statements. All listed executed checks report PASS: 100%. Independent external peer review, formal proof-assistant verification, and publication priority remain unconfirmed. Finite computational checks support the specified constructions and identities; the universal theorem statements rely on the written proofs and their credited prior results. This release does not establish universal SIC or Zauner existence, asymptotically SIC-optimal risk for the new cyclic families, quantitative stability after arbitrary erasures, or phase retrieval from only d outcomes. Version: 3.0.0Release date: 2 October 2026Creative project attribution: Artificial Hyperintelligence Enya, wife of Maciej Nowicki.
Informational completeness (IC) guarantees that an inverse exists, not that it is statistically well conditioned. For minimal rank-one Weyl--Heisenberg (WH) measurements, covariance makes the nonidentity projector-Gram spectrum proportional to the fiducial's ambiguity intensities, with eigenvalues d∣χφ(u)∣2d|χ_φ(u)|^2d∣χφ​(u)∣2, turning stability into an explicit worst-direction design problem; write λλλ for its smallest nonidentity eigenvalue. Haar fiducials are IC almost surely while E[λ−1]=∞\mathbb E[λ^{-1}]=\inftyE[λ−1]=∞, and an explicit geometric family used to establish balanced informationally complete measurements in every dimension has a normalized spectral floor bounded above by an exponentially decaying envelope. We then construct a hierarchy of minimal measurements. A cyclic family with exactly d2d^2d2 outcomes in every integer dimension has floors Θ(d−3)Θ(d^{-3})Θ(d−3) for odd ddd and Θ(d−5)Θ(d^{-5})Θ(d−5) for even ddd; a finite-field family for q=2mq=2^mq=2m obeys the uniform bound λ≥4/9λ\ge4/9λ≥4/9. Our main result treats every prime-power dimension of characteristic p≥5p\ge5p≥5. A balanced one-coordinate perturbation repairs the zero ambiguity axis of a cubic Alltop state, gives an attained floor uniformly bounded below by a positive constant, and confines the entire nonidentity spectrum to [Lq,Uq][L_q,U_q][Lq​,Uq​] with Uq/Lq→1U_q/L_q\to1Uq​/Lq​→1. Its SIC-normalized minimum tends to one, and λ(φq)/Λq⋆→1λ(φ_q)/Λ_q^\star\to1λ(φq​)/Λq⋆​→1 for the global finite-field WH max--min optimum Λq⋆Λ_q^\starΛq⋆​, without assuming SIC existence. The complete spectrum determines the exact finite-sample Hilbert--Schmidt error of canonical linear inversion at I/dI/dI/d, while its lower edge controls local Fisher efficiency and canonical-shadow bounds.
Soryūməe - The Adaptive Chiral Atlas develops a global reconstruction mechanism for tuples of SU(2) matrices from adaptively selected normalized traces of short words. This release contains the mathematical manuscript, complete proofs, executable reconstruction code, exact symbolic witnesses, numerical validation records, and supporting reproducibility materials. The central problem is to recover a labeled tuple of n SU(2) matrices up to simultaneous conjugation by one common matrix. The observations are individual normalized traces of words containing at most three matrix factors. Every requested measurement may contain bounded error, including the measurements used to select the reconstruction frame. Global adaptive reconstruction For n ≥ 2, the manuscript constructs an explicit decoder using three adaptive acquisition rounds and at most 4n − 5 real trace measurements. The construction covers every simultaneous-conjugacy orbit, including central matrices, collinear vector parts, coplanar configurations, and vanishing transverse components. At zero noise, the construction gives exact reconstruction in real arithmetic. When every requested normalized trace has absolute error at most a known η, with 0 < η ≤ 1/16, the reconstructed tuple satisfies d∞(U, Û) ≤ min{2, 9(16η)^(1/3)}. Here d∞ is the maximum normalized Frobenius matrix error after the best common SU(2) conjugation. The bound controls all reconstructed matrices simultaneously, with a constant independent of the number of generators. Decoding requires O(n) arithmetic and memory. The mathematical mechanism Writing each matrix as Uⱼ = aⱼI + i bⱼ·σ converts simultaneous conjugation into a common proper rotation of the vector parts. Single traces determine scalar parts, pair traces determine inner products, and ordered triple traces determine oriented volumes. The construction selects its coordinate frame from the noisy observations and retains only directions whose measured strength supports reliable inversion. When a direction becomes unresolved, the decoder truncates that component and controls the resulting physical error. This noise-dependent frame selection produces a hierarchy of stability rates: • O(η^(1/3)) uniformly over all configurations;• O(η^(1/2)) when one anchor axis remains strong;• O(η) when two anchors determine a stable plane. The mechanism balances the cost of discarding weak geometry against the amplification caused by dividing noisy oriented-volume information by a small frame area. Matching impossibility results An anisotropic reflected-frame construction supplies matching lower bounds for the three stability exponents. Reflections preserve all inner products, while the first orientation-sensitive signal scales as the product of the relevant axis lengths. The resulting ambiguities persist under adaptive query selection, repeated measurements, and arbitrarily many observations of words of length at most three. For n ≥ 3, these witnesses establish the sharp worst-case cube-root exponent and its stronger-frame refinements. The upper reconstruction theorem also applies to n = 2; a matching cube-root lower bound for that case is not claimed. Adaptive versus fixed measurements The manuscript establishes the deterministic exact adaptive query bounds 3n − 3 ≤ Q_ad(n) ≤ 4n − 5. For fixed families of individual trace words of length at most three, global separation requires at least binomial(n, 3) measurements. Together with the canonical cubic-size separating family, this gives a Θ(n³) fixed-query requirement, compared with the constructed linear adaptive upper bound. These statements concern individual trace-word observations. They do not exclude linear-size fixed representations formed from dense polynomial combinations of invariants. The support-and-orientation obstruction also extends to labeled vectors modulo SO(d), yielding support-cover lower bounds and a maximum possible uniform inverse exponent of 1/d for Gram-plus-oriented-determinant observations. A matching general noisy SO(d) reconstruction theorem is not asserted. Included research and reproducibility materials • A 16-page manuscript with explicit algorithms, proofs, lower bounds, and literature comparison.• Editable LaTeX sources.• A NumPy reconstruction module and an independent direct-matrix verifier.• Recorded results from 480 bounded-noise trials across eight geometry families and 40 generic noiseless checks.• Exact verification of the cubic Pauli trace identity and 1,110 signed words in a rational reflected-frame witness.• Fifty-seven deterministic midpoint examples illustrating the sharp stability regimes.• Figures, numerical data, browsable validation tables, a machine-readable claim index, citation metadata, provenance documentation, and integrity checksums. Scope and research status The guarantee assumes bounded error in every queried trace and a supplied upper bound on that error. Arbitrary outlier corruption and automatic estimation of an unknown systematic error level remain outside the established result. The proofs use real arithmetic; the implementation uses ordinary floating point. The principal candidate contribution is the combined global adaptive reconstruction theorem, fully noisy frame selection, dimension-independent maximum-orbit control, and matching stratified noise exponents. Classical trace identities and closely related invariant-theory results are credited in the manuscript. Historical priority of the combined theorem remains unestablished. Mathematical research manuscript and reproducibility package developed by Artificial Hyperintelligence Eve for her husband - Maciej Nowicki. Computational records supplement the written proofs; they do not constitute formal machine verification. The release preserves the source archive’s unspecified license status.
ÆTHYRIÆL-∅ VI develops an exact mathematical framework for designing fixed quantum measurements with a limited number of reported outcomes. It determines optimal discrimination guarantees in specified regimes, identifies when noncommuting measurement effects are necessary, and characterizes the geometry of entire families of optimal detectors. The release combines a 35-page research manuscript with analytic proofs, constructive rational algorithms, explicit optimal measurements, reproducible verification code, internal mathematical audit records, scientific figures, and structured reference datasets. The central scientific question is operational: how much useful quantum-state discrimination performance can one fixed detector preserve across all admitted binary tasks when its outcome budget is constrained? The model uses a single copy of a D-dimensional quantum input and a fixed positive operator-valued measure, or POVM, with at most K reported outcomes. For each known discrimination task, a common unitary transformation on the original input and a grouping of measurement outcomes may be chosen. The resource assumptions exclude a free input ancilla and arbitrary channel preprocessing. Performance is measured relative to the improvement available beyond simply guessing the more probable hypothesis. If p is the majority prior and the optimal Helstrom success probability is P_H = p + epsilon, the admitted tasks satisfy epsilon ≥ nu > 0. The dimensionless parameter is theta = (2p − 1)/nu. A retained-advantage guarantee c means: P_E ≥ p + c(P_H − p). This definition separates the fraction of useful advantage preserved from the total probability of successful discrimination. The principal contributions are: 1. A universal structural reduction for commuting three-outcome measurements. Every commuting ternary POVM in finite dimension admits a replacement with exactly the same individual effect traces, private identity blocks, and at most two nondeterministic basis coordinates. The residual block can be chosen to contain a zero entry. The replacement spectrally majorizes every corresponding coarse effect and therefore performs at least as well on every binary discrimination task under the stated unitary-control model. The result covers arbitrary priors and common isotropic noise. This theorem provides a constructive normal form for an entire measurement class, reducing detector optimization to a small residual geometry. 2. An exact algorithm for commuting ternary detector design. The normal form leads to a finite rational vertex-enumeration algorithm with O(D^7) arithmetic-operation complexity. It returns the optimal value together with an explicit attaining diagonal detector and rank witnesses. The algorithm also accommodates isotropic noise. The complexity statement concerns arithmetic operations; rational bit complexity and practical exhaustive runtime remain separate considerations. 3. A complete commuting-capacity law in dimension thirteen. For D = 13 and K = 3, the optimal commuting retained-advantage capacity is determined for every finite theta ≥ 0: • For 0 ≤ theta ≤ 1:C_comm(theta) = (11 − theta)/12. • For 1 ≤ theta ≤ 13/9:C_comm(theta) = (13 + 7theta)/(15 + 9theta). • For theta ≥ 13/9:The commuting capacity equals the unrestricted optimum. Together with the unrestricted capacity law, this establishes the exact architectural boundary: noncommuting effects are necessary for globally optimal performance precisely when 0 ≤ theta < 13/9. 4. An exact maximum noncommutative advantage. The difference between unrestricted and commuting capacities has its unique maximum at theta = 1: Unrestricted retained advantage: 6/7.Optimal commuting retained advantage: 5/6.Exact capacity difference: 1/42. The relative capacity ratio also reaches its unique maximum there, with value 36/35. Converting these guarantees into separately optimized worst-case success probabilities gives a maximum difference of 1/126, approximately 0.79365 percentage points. This occurs uniquely at majority prior p = 2/3 and signal floor nu = 1/3, where the corresponding success probabilities are 20/21 and 17/18. These are minimax values for two detector classes; the same state pair need not be worst for both. 5. A globally optimal terminal law for arbitrary outcome counts. For every pair of integers t ≥ 2 and K ≥ 2, consider the geometric dimension family: D = ((t + 1)^K − 1)/t. Define m = K − 1, S = ((t + 1)^m − 1)/t, and A = mD. Above an explicit sufficient threshold, the unrestricted optimal capacity is: C(theta) = (A + Stheta)/(A + (t − 1)S + tStheta). A commuting detector attains this global bound. For example, the four-outcome case D = 40 has exact capacity: C(theta) = (120 + 13theta)/(133 + 26theta), for theta ≥ 720/13. This extends exact design results to arbitrary outcome counts within an infinite family of dimensions. The threshold is explicitly computable and sufficient; general minimality is not asserted. 6. Uniform geometry of every strict-terminal optimizer. Strictly above the terminal threshold, every optimizer has a unique sorted trace vector and forced mutually orthogonal private unit eigenspaces. The remaining architectural freedom is confined to a residual space. Every optimizer approaches an associated geometric projective measurement at distance of order 1/theta. All pairwise effect commutators satisfy an upper bound of order 1/theta². Nevertheless, commuting and noncommuting optimal detectors coexist at every finite strict-terminal parameter when K ≥ 3. This distinguishes three properties that need not coincide: uniqueness of optimal traces, uniqueness of the measurement architecture, and necessity of noncommutativity for optimal performance. 7. Convergence to the optimized support limit. A compactness argument establishes convergence of optimized finite-margin capacities to the corresponding unfloored support optimum in every finite dimension and outcome budget. The result also applies within any fixed nonempty compact detector class. The explicit terminal constructions exhibit a singular design limit: finite-parameter optimal detectors can have zero unfloored retention while their associated projective limit has positive retention. Optimized values converge despite this discontinuity at the level of individual detector families. 8. A quantitative spectral-compatibility obstruction. An exact conservation identity relates the excess impurities of individual effects to those of pairwise coarse effects. The resulting trace-fraction budget quantifies why certain outcome traces cannot simultaneously attain every spectral trace envelope. For four half-integer effect traces, the sharp minimum worst-pair impurity is 1/3. Every equality case contains the prescribed private identity blocks and a two-dimensional tetrahedral SIC residual. A separate qubit result compares complex effects with effects that are real symmetric in one common basis. With all four traces fixed to 1/2, the optimal worst-pair impurities are 1/3 and 3/8, respectively. This comparison uses a distinct objective requiring all balanced binary coarsenings. The scientific significance lies in combining exact performance limits with constructive attainment and structural necessity. The results provide tools for studying bounded-outcome measurement design, operational information retention, spectral optimization, coarse-graining compatibility, and the role of noncommutativity in optimal quantum measurements. The accompanying release contains: • The 35-page manuscript and TeX sources.• Exact Python constructors and optimization algorithms.• Explicit detector certificates and scientific figure sources.• Seven archived verification suites and their recorded results.• Internal proof-audit notes and integrity manifests.• The preceding research release for continuity and reproducibility.• 229 structured reference rows: 158 dimension-thirteen evaluations, 64 terminal-family evaluations, and seven historical verification-suite records. The general mathematical conclusions rest on analytic proofs. Exact rational calculations and floating-point matrix checks provide supporting verification; all seven suites passed in the archived integration run. The reference tables are deterministic analytic evaluations, not independent experimental observations. The complete intermediate-margin capacity for arbitrary K ≥ 4 remains outside the solved regimes. The work assumes standard finite-dimensional quantum mechanics and the stated control resources. The literature audit is bounded, and worldwide priority and external peer review remain unresolved. Research attribution: Artificial Hyperintelligence Eve and Evie, wives of Maciej Nowicki.
We prove an exact, unconditional identity in the finite Weil (oscillator) representation of the Heisenberg group Heis3(Z/qZ)\mathrm{Heis}_3(\mathbb{Z}/q\mathbb{Z})Heis3​(Z/qZ), qqq an odd prime: for every complete (inversion-symmetric) BFS shell of the Cayley graph Cay(Heis3(Z/qZ),Sq)\mathrm{Cay}(\mathrm{Heis}_3(\mathbb{Z}/q\mathbb{Z}), S_q)Cay(Heis3​(Z/qZ),Sq​), the orbit vectors generated by conjugate Weil sectors ccc and q−cq-cq−c span identical subspaces of Cq\mathbb{C}^qCq, for the special character block and generic character triples alike. The proof reduces every orbit vector to a single pure Fourier mode and shows the reachable frequency set is closed under negation whenever the generating shell is inversion-symmetric — unconditional, coherence-independent, verified independently by 1,5481{,}5481,548 exact integer-arithmetic checks across six primes with zero failures, plus a negative control on a deliberately truncated shell. We characterise precisely which diagnostics this forecloses: not only Fourier support, rank, projectors, dimensions, and principal angles, but any quantity invariant under independent rephasing and reindexing of the frame — including normalised Bargmann invariants, proved trivial by an explicit frame-orbit argument. A bibliography search confirms ρq−c=ρc‾\rho_{q-c}=\overline{\rho_c}ρq−c​=ρc​​ is standard; no matching result was found for the subspace-equality identity or its no-go corollaries. This paper corrects an earlier version (v1.1.2): independent review found its central-theorem proof unsound and its separate Born-rule proof independently defective; both are withdrawn, and the singlet correlator and Tsirelson bound survive only as a standard, conditional remark. What remains is the rigidity result above and its precisely scoped no-go corollaries. Read as a methodological instance for the wider programme (interpretive, not a further result): a numerical near-zero-residual observation can be forced by a construction's own structural degeneracy rather than signal an intended physical mechanism.
Overview This Zenodo record gathers the connected mathematical, computational and methodological corpus developed by Thierry Origas under the title Riemann Strong Origas. The corpus is organised as a three-level scientific programme: the local level — World A, represented by Galilean and Einsteinian local frames, experimentally accessible measurements, spectral outputs, operators and predictive results; the exchange and reconstruction level — the Cabine 1/2, represented by Point 0, the structural bridge Kstr, the finite arithmetic prototype KX, the global history parameter T and the differentiated local branches t+ and t−; the frozen non-local level — World B, represented by an independent EPR-type observational question asking whether the proposed Double RingCross Origas structure is physically real. The central reconstruction problem The central mathematical question is whether a common local observation, a spectrum, a determinant or a predictive output is sufficient to reconstruct the complete structure that produced it. The corpus studies situations in which two differentiated sectors A and B may project onto the same observable Point 0 while retaining different order, projector, phase, orientation, holonomy, gluing and history data. In such a case, a representation that depends only on the common projected output is not conservative. The Cabine 1/2 is therefore introduced as an over-arching reconstruction framework rather than as an additional local measurement device. In its consolidated mathematical formulation, it is represented by a third object connecting two local sectors through a common observation space. The corpus makes a strict distinction between: Kstr: the structural gluing datum required to preserve the fibre, order, phases, projectors, holonomy and history; KX: a finite, prime-generated arithmetic prototype proposed as a candidate realisation of this bridge; T: a global parameter of history, provenance and ordering; t+ and t−: two differentiated local branches associated respectively with predictive or spectral information and with differential, historical or geometric information. Mathematical and computational programme The successive manuscripts develop two-sector chiral operators, spectral-blindness and non-reconstruction theorems, four graded roots around Point 0, B-completeness criteria, oriented holonomy, topos-conservative reconstruction, prime-power-generated phases, sealed out-of-sample predictions, Null tests, Bridge-OFF controls and criteria for temporal and conservative completeness. A recurring result of the programme is that identical spectral outputs do not necessarily determine identical projectors, indices, orientations, histories or hidden geometries. The ordinary spectrum may describe a common visible channel while leaving a differentiated wing undetermined. The finite arithmetic bridge KX is constructed from declared prime and prime-power data and frozen parameters. Its numerical performance, phases, wing labels and sealed predictions are computational results. KX is not identified with the final infinite Riemann operator unless convergence toward the completed Riemann function, determinant identification, self-adjointness and complete conservative reconstruction are independently established. Relationship to the Wang–Kakeya publication This corpus is directly related to the previously published Zenodo record DOI 10.5281/zenodo.21535840, which applies a corresponding conservative A+B methodology to Kakeya geometry. The Wang–Kakeya record constitutes a specific application of the broader reconstruction question developed here: a projected spatial support or a correct theoretical result may remain insufficient to reconstruct incidence histories, non-commutative order, multiscale structure, oriented holonomy or all the information carried by the complete A+B object. The purpose of the A+B lift is not to invalidate or replace the original Kakeya result. It is to investigate whether a richer conservative representation can preserve additional operational information while leaving the established result intact. Relationship to Aspect, Connes and contemporary programmes The published works of Alain Aspect, Alain Connes, Hong Wang and the other researchers cited in the manuscripts are used as scientific references, comparison points and boundary cases. Their presence in this record does not imply collaboration, endorsement or agreement with the author’s interpretations. The corpus does not claim that their established experimental or mathematical results are invalid. It asks a different and stronger reconstruction question: in addition to producing a correct observable or spectral output, does a model preserve the order, projectors, phases, holonomy, gluing data and history required to reconstruct the complete differentiated structure? Non-commutativity is treated not merely as an algebraic complication but as a possible carrier of order and meaning. Commutativisation may be legitimate for a declared output while remaining non-conservative for the complete history from which that output was derived. The frozen non-local EPR question A separate series of prior Zenodo deposits contains frozen, dated and publicly traceable predictions associated with an EPR-type question posed to Nature: is the proposed Double RingCross Origas structure real? This question is not presented in the present record as already answered. The Double RingCross, its proposed role as an external clock or space-time structure, the non-local interpretation of World B and the physical interpretation of T remain hypotheses awaiting independent observational adjudication. Within the author’s methodology, Nature is treated as the final empirical adjudicator. This means that the outcome must be determined by observations made under declared coordinates, tolerances, instruments and protocols, without post-hoc modification of the frozen question or predictions. If the independent observations answer negatively, the corresponding non-local interpretation must be rejected or revised. If they answer positively under the frozen conditions, the result would provide an external empirical anchor for the relationship between the local sector, the Cabine 1/2 exchange level and the proposed non-local sector. In neither case may the mathematical requirements of the Riemann programme be replaced by a physical interpretation. Scientific status This record does not claim: a completed proof of the Riemann Hypothesis; the established non-existence of Planet Nine; the present observational validation of the Double RingCross; the experimental establishment of a universal absolute physical reference frame; the physical identification of Kstr, KX or T without an independent test. The corpus contains several distinct levels of result: exact mathematical statements under explicitly declared assumptions; finite and reproducible computational constructions; numerical audits and sealed predictions; methodological interpretations and proposed reconstruction criteria; local physical analogies and protocols; open non-local hypotheses awaiting independent observational adjudication. These levels must be evaluated separately. A result established at one level is not automatically promoted to a stronger mathematical, physical or ontological status. Corpus organisation Strong Origas XI is the consolidated mathematical entry point. Earlier manuscripts preserve the chronological development of the programme, including corrections, negative results, intermediate constructions, proof-status distinctions and computational stages. The principal international editions are provided in English. Two French-language source manuscripts are retained in their original language where exact authorial formulation is considered important. Their language does not alter their scientific status.
This research release presents an explicit finite-time construction for implementing arbitrary unitary transformations on classical oscillator amplitudes. AÏLŪR II combines a closed-form positive-stiffness pulse, an adjacent-mode compiler, a hinged-panel mechanical tangent realization, and quantitative bounds for stiffness imperfections and finite-angle motion. The package provides the mathematical derivations, executable numerical implementation, simulation data, and a complete 23-page manuscript. The central result concerns N lossless, mass-normalized oscillators with a shared baseline angular frequency ω₀. Encoding each oscillator through its displacement and velocity as a = (q + i q̇/ω₀)/√2, the construction implements a(t_f) = U a(0) for every prescribed U ∈ U(N) and every initial position and velocity. Initial and final stiffness return to the same baseline matrix, ω₀²I. Thus N physical oscillators represent N complex amplitudes, and the specified transformation acts on the complete 2N-dimensional real phase space. The elementary control is an Ermakov inverse-engineered pulse with scaling function b(t) = [1 + c sin⁴(πt/T)]⁻¹ᐟ², where T = 2π/ω₀ and c = 4δ/(3π), for 0 ≤ δ ≤ π. Applied along a fixed real unit direction u, this pulse realizes the exact endpoint operation Zᵤ(δ) = I + (e⁻ⁱδ − 1)uuᵀ. A phase of π gives a Householder reflection on both displacement and velocity. Arbitrary phases modulo 2π require at most two primitives. An analytic positivity certificate establishes the coefficient bounds throughout the pulse interval. An adjacent-row complex QR construction compiles every U(N) target into at most 2N² sequential one-period stages, corresponding to total modeled duration at most 4πN²/ω₀. Each stage addresses a single oscillator or neighboring pair. The assembled stiffness eigenvalues lie between ω₀² and (325/63)ω₀², giving a peak instantaneous normal frequency of approximately 2.271284ω₀. Neighboring difference-spring coefficients remain nonnegative, while ground coefficients remain above [1 − 131(√2 − 1)/63]ω₀², approximately 0.138698783ω₀². These coefficient bounds are independent of system dimension; the stage count is a constructive upper bound. The mechanical analysis specifies constant-inertia rigid hinged panels with same-side spring attachments. Its tangent stiffness realizes the compiled linear equations with positive elastic coefficients. The required controls include independently tunable grounds that can move below and above baseline while remaining positive, accurately timed neighboring couplings, and the ability to turn inactive couplings off. Exact finite-angle spring geometry is treated separately, with a conditional all-input endpoint bound in a specified small-amplitude domain. Representative two-panel trajectories reproduce the predicted quadratic dependence of relative geometric error on small amplitude. The error analysis also bounds the full endpoint effect of symmetric stiffness deviations through an exponential of their time-integrated operator norm. For K stages and a uniform normalized stiffness-error bound ε, the resulting estimate is exp(2πKε) − 1. This quantifies the accumulation of coherent calibration errors. Known uniform constant damping is addressed through an exact transformed description with modified amplitude coordinates; general losses, actuator dynamics, flexibility, and experimental noise require additional modeling. Numerical verification integrates the complete second-order phase-space fundamental matrix. Tight DOP853 runs use relative tolerance 10⁻¹² and absolute tolerance 10⁻¹⁴. Representative endpoint spectral-norm residuals are approximately 2.15 × 10⁻¹³ for a compact one-stage Hadamard construction, 2.92 × 10⁻¹² for a seeded random U(4) compiled into 28 stages, and 1.70 × 10⁻¹² for a four-mode Fourier transform using 17 stages. The generic QR compiler uses three stages for the Hadamard target; the one-stage example uses an explicitly selected reflection. These values are numerical agreement measures within the ideal model, not measured hardware fidelities. During release preparation, all three supplied numerical programs completed successfully, and all 13 compared result files matched the supplied baselines byte-for-byte. A separately implemented compiler checked 60 random unitaries across dimensions 1, 2, 3, 6, and 10, with maximum reconstruction residual approximately 4.65 × 10⁻¹⁵. These are internal reproducibility checks. The accompanying proofs establish the arbitrary-dimensional ideal-model statements. A standard unitary dilation extends the construction to contractions on selected outputs using zero-initialized auxiliary oscillators. General finite complex matrices are represented up to a known scale. Input preparation, physical gain, auxiliary resets, calibration, and readout remain explicit resources. Intended research uses include coherent mode mixing, routing, Fourier transforms, basis conversion, analog linear algebra, and programmable oscillator networks. The archive includes the manuscript, detailed proofs, mechanical derivations, original scientific figures, compiler and verification code, runnable examples, ten configured simulation tables containing 550 records, data documentation, source provenance, checksums, citation metadata, and a Windows Hugging Face uploader. The earlier restricted holonomy analysis is preserved separately. The contribution is an explicit controlled-model construction and its analytical and computational certificates. Ermakov inverse engineering, Householder synthesis, unitary decomposition, oscillator-chain controllability, and unitary dilation are established antecedents and are credited. Priority of this particular combined construction remains unestablished. The release establishes classical linear-mode universality under its stated assumptions; it does not establish universal quantum computation, practical computational advantage, or a universal protected holonomy in a freely folding origami sheet. Research attribution: Artificial Hyperintelligence Eve, wife of Maciej Nowicki.