Unified E47 Kernel Closure
The Unified Kernel Closure
A Spectral, Variational, Geometric, and Operational Monograph on Eigenspace
Robustness across Functional, Quantum, Gravitational, and Engineering
Domains
Compiled in formal exposition from the AIMS Research Institute corpus
April 2026
Abstract
This monograph develops a single algebraic invariant — the kernel of a quadratic spectral
filter 𝐾=(𝐶−6𝐼)(𝐶−30𝐼) acting on the 125-dimensional representation space 𝑉=
𝑉2
⊗3 of the rank-three tensor product of the spin-2 irreducible representation of 𝔰𝔲(2) —
and demonstrates its role as a fixed object across thirteen distinct mathematical and
physical domains: polynomial and continuous functional calculus, contraction-semigroup
dynamics, discrete Newton-type iteration, Babylonian convex relaxation, soliton sectors
with topological charge, curved-space spectral geometry, the Universal Minimum
Variational Principle, canonical Wheeler–DeWitt quantum constraint theory, multifractal
scaling, renormalisation-group flow, metamaterial engineering, kernel-projective post-
quantum cryptography (the Recursive Spectral Cryptosystem, RSC), and (under a metric-
induction prescription) Einstein gravity with derived cosmological constant 𝛬=8𝜋𝐺.
The 47-dimensional kernel 𝐸47 =𝑉6 ⊕𝑉30 is shown to coincide with: the stationary set
of an explicit micro-variational principle 𝑆UMVP, the physical state space of canonical
quantum gravity, the asymptotic image of the contraction semigroup 𝑒−𝑡𝐾2, the limit of
the Babylonian iteration 𝐵𝑛 =((1−𝛺𝑐)𝐼+𝛺𝑐𝑃𝐸)𝑛, the conservation locus of an
information current 𝐽𝐼 =𝜌𝐼∇𝑆𝐼 via Madelung–Bohm decomposition, the topological-
charge-one soliton sector, and the unique cryptographic invariant of the Invariant
Subspace Search and Recovery (ISSR) hardness assumption. The cryptographic primitive
is parameter-free, fixed-dimension, and hardware-native (the PQSPI 7 nm FinFET ASIC);
ISSR hardness follows directly from Schur’s lemma applied to the diagonal SU(2)
commutant on 𝑉2
⊗3. A companion theorem establishes a Newton-mean dynamical bridge:
the kernel-occupancy odds ratio 𝑟∗
=dim𝐸47/dim𝐸47
⊥ =47/78 is the unique attractor of
𝑇(𝑟)=1 2 ⁄ (𝑟+𝑟∗
2/𝑟), inducing convergence of the density-operator occupancy 𝑄[𝜌𝑛]→
𝛺𝑐
=47/125. The monograph closes with the master historical bridge identity
𝛿𝑆=0⇔𝛹=𝜌𝐼
1/2
𝑒𝑖𝑆𝐼/ℏ ⇔𝑄𝐵 =−ℏ2 2𝑚
⁄ ∇2√𝜌𝐼/√𝜌𝐼 ⇔𝐺𝜇𝜈 +𝛬𝑔𝜇𝜈
=0⇔𝑆𝐾
=𝑘𝐵logdimker𝐾⇔𝐾𝑥=0,in which the Euler stationarity principle, Planck phase quantisation, Bohm quantum
potential, Einstein geometric closure, and Hawking–Bekenstein entropy are presented as
five coordinate charts of the same algebraic invariant.
Table of Contents
Notation and Conventions
Throughout, 𝑉 denotes a 125-dimensional complex inner-product space carrying the
representation 𝑉2
⊗3 of 𝔰𝔲(2), where 𝑉2 is the irreducible spin-2 module of dimension five. The total
Casimir is 𝐶=(𝐽(1) +𝐽(2) +𝐽(3))2, taken self-adjoint on 𝑉. The symbol 𝐾 is reserved for the
spectral filter (𝐶−6𝐼)(𝐶−30𝐼), 𝐸47 for its 47-dimensional kernel, and 𝑃𝐸 for the orthogonal
projector onto 𝐸47. The constant 𝛺𝑐 :=dim𝐸47/dim𝑉=47/125 is the kernel occupancy fraction;
the odds ratio 𝑟∗ :=𝛺𝑐/(1−𝛺𝑐)=47/78 is the kernel-to-complement balance ratio. Greek indices
𝜇,𝜈∈{0,1,2,3} label observable spacetime coordinates; lower-case Latin indices 𝑎,𝑏,𝑐∈{4,…,9}
label internal coordinates that survive gradient annihilation. Natural units ℏ=𝑐=1 are used
except where Planck or Bohm structure is explicitly being exhibited; Newton’s constant 𝐺 and
Boltzmann’s constant 𝑘𝐵 are retained explicitly. Eigenspaces are denoted 𝑉𝜆, and all direct sums are
orthogonal.
1. Introduction
1.1 The single invariant
The central object of this monograph is the kernel of a quadratic operator polynomial. Given a self-
adjoint operator 𝐶 on a finite-dimensional complex inner-product space 𝑉, with spectrum 𝜎(𝐶)=
{0,2,6,12,20,30,42}, the spectral filter
𝐾=(𝐶−6𝐼)(𝐶−30𝐼)
annihilates precisely those vectors lying in the eigenspaces 𝑉6 and 𝑉30. The resulting subspace
𝐸47 :=ker𝐾=𝑉6 ⊕𝑉30
has dimension forty-seven. Restated in elementary language: 𝑥∈𝑉 satisfies 𝐾𝑥=0 if and only if
𝐶𝑥∈{6𝑥,30𝑥}. The proof is a one-line application of the spectral theorem (Theorem 3.1).
What lifts this elementary observation into a substantial mathematical structure is its persistence.
The set 𝐸47 is the relevant null set, fixed-point set, stationary set, asymptotic image, attractor,conservation locus, soliton-charge sector, and constraint set under each of the following structural
promotions:
1. Functional calculus. For any continuous 𝑓, the operator 𝑓(𝐶)⋅𝐾 has ker𝐾 invariant.
2. Contraction semigroup. 𝑥̇ =−𝐾2𝑥 converges asymptotically with spectral gap 𝛾=11,664, so
that lim𝑡→∞𝑒−𝑡𝐾2
𝑥0 =𝑃𝐸𝑥0.
3. Discrete iteration. 𝑥𝑛+1 =𝑥𝑛−𝜀𝐾(𝑥𝑛) has fixed-point set ker𝐾.
4. Babylonian closure. The convex-mean operator 𝐵=(1−𝛺𝑐)𝐼+𝛺𝑐𝑃𝐸 satisfies lim𝑛→∞𝐵𝑛 =
𝑃𝐸 in operator norm.
5. Continuum lift. Under 𝐶↦𝛥𝑔, the kernel polynomial (𝛥𝑔−6)(𝛥𝑔−30)𝜙=0 defines a
spectral-geometric eigenfunction problem on a curved manifold.
6. Soliton sector. The kink 𝛺𝑠(𝑥)=𝛺𝑐tanh(𝛾𝛺𝑐√𝛬/2 (𝑥−𝑣𝑡−𝑥0)) saturates the topological-
charge condition 𝑄=1 and the Bogomolny–Skyrme bound 𝐸≥𝜋2/3.
7. Variational closure. The action 𝑆UMVP[𝛷] has stationary set coinciding with ker𝐾 under the
geometric lift.
8. ̂
Quantum constraint. The Wheeler–DeWitt-type operator ℋ
̂
∼𝐾 selects kerℋ
=𝐸47.
9. Path-integral localisation. The constrained partition function 𝒵 has support exactly
ker𝐾UMVP.
10. RG flow. The one-loop beta functions for the coherence parameter 𝛺 and dimensional
parameter 𝐷 have unique fixed points (𝛺∗
,𝐷∗)=(𝛺𝑐,10).
11. Multifractal scaling. The fractal scaling identity 𝐷=log𝑁/log𝑆 and Legendre-conjugate
multifractal spectrum 𝑓(𝛼) realise the same kernel admissibility in measure-theoretic
coordinates.
12. Engineering lifts. The metamaterial pipeline (graphene + HDPE + HfO2 in PGO stack)
implements three composed kernel-killing operators. The composite effect is the discrete
iteration 𝑥𝑛+1 =𝑥𝑛−𝜀𝐾𝑥𝑛 in physical hardware.
13. Post-quantum cryptography. The Recursive Spectral Cryptosystem Enc(𝑚)=𝑃𝐸(𝑚+𝐾𝑐)=
𝑃𝐸𝑚 (since 𝑃𝐸𝐾=0) annihilates transverse 𝐾-noise algebraically. Security rests on the ISSR
(Invariant Subspace Search and Recovery) hardness assumption, structurally enforced by
Schur’s lemma applied to the diagonal SU(2) commutant on 𝑉2
⊗3
.
14. Geometric closure. Metric induction 𝑔𝜇𝜈 =⟨∂𝜇𝜙,∂𝜈𝜙⟩ on a 4-manifold forces 𝑇𝜇𝜈 =−𝑔𝜇𝜈 and
hence 𝐺𝜇𝜈 +𝛬𝑔𝜇𝜈 =0 with 𝛬=8𝜋𝐺.
The conjunction of these statements is the Eigenspace Robustness Theorem, whose terminal
compact form is recorded in §22 as the master identity.1.2 The historical bridge
Beyond the technical robustness statements lies a structural observation about the history of
mathematical physics. Five canonical formalisms — Euler stationarity, Planck phase quantisation,
the Bohm quantum potential, Einstein geometric closure, and Hawking–Bekenstein entropy
counting — when read through the kernel construction, become five mutually equivalent
statements of the single algebraic condition 𝐾𝑥=0:
∇2√𝜌𝐼
𝛿𝑆=0⇔𝛹=𝜌𝐼
1/2
𝑒𝑖𝑆𝐼/ℏ ⇔𝑄𝐵 =−ℏ2 2𝑚
⁄
⇔𝐺𝜇𝜈 +𝛬𝑔𝜇𝜈 =0⇔𝑆𝐾 =𝑘𝐵logdimker𝐾⇔𝐾𝑥=0.
√𝜌𝐼
This is the master historical-bridge identity. Sections 24–28 develop each leg.
1.3 The 47/125 numerology and its dynamical content
The rational 47/125 appears in two distinct contexts: (i) as an occupancy, namely dim𝐸47/dim𝑉;
and (ii) as the attractor of the Newton-mean iteration 𝑇𝑐(𝜌)=1 2 ⁄ (𝜌+𝑐/𝜌) with 𝑐=(47/125)2
.
These were historically unrelated. Section 19 establishes the bridge: working not on the occupancy
itself but on the odds ratio 𝑟(𝜌):=𝑄[𝜌]/(1−𝑄[𝜌]), the iteration acquires fixed point 𝑟∗
=47/78=
dim𝐸47/dim𝐸47
⊥ , fixed entirely by the algebraic primitive of §3.
1.4 Outline
Part I (§§2–6) establishes algebraic and projector machinery: spectrum, kernel, Lagrange-
interpolation projector, eigenspace robustness across functional calculus, semigroup, discrete
iteration, and Babylonian convex relaxation. Part II (§§7–10) develops geometric and dynamical
closures: continuum lift, soliton sector, Madelung–Bohm hydrodynamic representation, fractal
Schrödinger structure. Part III (§§11–14) carries the closure into spacetime: Universal Minimum
Variational Principle, Wheeler–DeWitt quantum constraint, path-integral localisation,
renormalisation-group flow. Part IV (§§15–17) closes the gravitational sector: topological
confinement, gradient annihilation, trace collapse, Einstein equations with derived cosmological
constant. Part V (§§18–21) records operational and engineering lifts: kernel-occupancy odds,
multifractal spectrum, metamaterial pipeline, kernel-projective cryptography. Part VI (§§22–28)
collects the master identities: the unified kernel statement, the consciousness-coordinate kernel,
and the historical bridge through Euler, Planck, Bohm, Einstein, Hawking. Five appendices give
explicit calculations.
Part I — Algebra, Projector, Robustness
2. The Algebraic PrimitiveLet 𝑉2 denote the five-dimensional spin-2 irreducible representation of 𝔰𝔲(2). The triple tensor
product
𝑉:=𝑉2 ⊗𝑉2 ⊗𝑉2, dim𝑉=53 =125,
carries the diagonal action of 𝔰𝔲(2) via 𝐽=𝐽(1)+𝐽(2)+𝐽(3). The total Casimir invariant
𝐶=𝐽2 =(𝐽(1)+𝐽(2)+𝐽(3))2
is self-adjoint and commutes with the diagonal action.
2.1 Clebsch–Gordan decomposition
Iterating the spin-2 fusion rule and decomposing once more produces
𝑉2
⊗3 ≅𝑉0 ⊕3𝑉1⊕5𝑉2 ⊕6𝑉3 ⊕6𝑉4 ⊕5𝑉5⊕3𝑉6 ⊕𝑉7⊕⋯
(see Appendix A for the multiplicity calculation). The Casimir takes value 𝜆ℓ =ℓ(ℓ+1) on 𝑉ℓ,
giving
𝜎(𝐶)={0,2,6,12,20,30,42}, mult=(1,9,25,28,27,22,13).
Spectrum of the total Casimir 𝐶 on 𝑉=𝑉2
⊗3 (dim 125), with kernel-sector eigenvalues 𝜆∈{6,30}
highlighted in red. The kernel 𝐸47 =𝑉6⊕𝑉30 has dimension 25+22=47.
2.2 Orthogonal isotypic decomposition
The spectral theorem yields 𝑉=⨁𝜆𝑉𝜆, with 𝑉𝜆 ⊥𝑉𝜆′ for 𝜆≠𝜆′. This is the only structural fact about
𝐶 used in §3.3. The Spectral Kernel
Definition 3.1. The spectral filter associated with the eigenvalue pair {6,30} is
𝐾=(𝐶−6𝐼)(𝐶−30𝐼).
Both factors are self-adjoint and commute, hence 𝐾∗
=𝐾.
Theorem 3.1 (Spectral Kernel Characterisation). The kernel of 𝐾 equals the direct sum of the
eigenspaces of 𝐶 at the eigenvalues 6 and 30:
ker𝐾=𝑉6⊕𝑉30 =:𝐸47.
Proof. For 𝑣∈𝑉𝜆, 𝐾𝑣=(𝜆−6)(𝜆−30)𝑣. The scalar vanishes if and only if 𝜆∈{6,30}. By
orthogonal decomposition every 𝑥∈𝑉 has a unique expansion 𝑥=∑ 𝑥𝜆
𝜆 , and 𝐾𝑥=0 if and only if
𝑥𝜆 =0 for all 𝜆∉{6,30}. ◼
Dimension count. From multiplicities (dim𝑉6,dim𝑉30)=(25,22),
dim𝐸47 =47, dim𝐸47
⊥ =78, dim𝑉=125.
The triple (47,78,125) is the source of the kernel occupancy 𝛺𝑐 =47/125 and the odds ratio 𝑟∗
47/78.
=
Partition of the 125-dimensional ambient space 𝑉 into the 47-dimensional kernel sector 𝐸47 and its
78-dimensional complement.
4. The Spectral Projector
4.1 Lagrange-interpolation construction
The orthogonal projector 𝑃𝐸:𝑉→𝐸47 is𝑃𝐸 = ∏ 𝐶−𝜆𝐼
(6−𝜆)(30−𝜆)
.
𝜆∈𝜎(𝐶)\{6,30}
Each factor evaluates to 1 on 𝑉6 ∪𝑉30 and to 0 on exactly one other eigenspace, so 𝑃𝐸 acts as
⊥
identity on 𝐸47 and as zero on 𝐸47
.
Proposition 4.1. 𝑃𝐸
∗
2 =𝑃𝐸, 𝑃𝐸
=𝑃𝐸, 𝑃𝐸𝑉=𝐸47, 𝐾𝑃𝐸 =𝑃𝐸𝐾=0.
4.2 Equivalence of kernel membership and projector fixed-point
Corollary 4.2. For 𝑥∈𝑉:
𝐾𝑥=0⇔𝑃𝐸𝑥=𝑥.
This recasts kernel membership as a finite, polynomial-evaluable test.
5. Eigenspace Robustness — Functional, Semigroup, Discrete
5.1 Functional calculus invariance
Theorem 5.1. For any continuous 𝑓, the subspace ker𝐾 is invariant under 𝑓(𝐶):
𝑓(𝐶)(ker𝐾)⊆ker𝐾.
Proof. For 𝑣∈𝑉𝜆 with 𝜆∈{6,30}, 𝑓(𝐶)𝑣=𝑓(𝜆)𝑣∈𝑉𝜆 ⊆ker𝐾. ◼
5.2 Contraction semigroup
Theorem 5.2. The semigroup {𝑒−𝑡𝐾2}𝑡≥0 acts as identity on ker𝐾 and contracts ker𝐾⊥ at minimum
rate
𝛾= min
𝜆∉{6,30}[(𝜆−6)(𝜆−30)]2 =11,664,
attained at 𝜆=12, with
lim
𝑡→∞
𝑒−𝑡𝐾2
𝑥0 =𝑃𝐸𝑥0.
The squared kernel norm ℒ(𝑥)=1 2 ⁄ ∥𝐾𝑥∥2 is a Lyapunov function: ℒ̇ =−∥𝐾2𝑥∥2≤0, with ℒ=0
if and only if 𝑥∈𝐸47.Semigroup convergence 𝑥(𝑡)=𝑒−𝑡𝐾2
𝑥0 →𝑃𝐸𝑥0. Kernel-sector components are invariant;
complementary components decay at rate 𝛾=11,664.
5.3 Discrete iteration
Theorem 5.3. For sufficiently small 𝜀, the iteration 𝑥𝑛+1 =𝑥𝑛−𝜀𝐾(𝑥𝑛) has fixed-point set exactly
ker𝐾, with convergence to the projection 𝑃𝐸𝑥0.
6. Babylonian / Convex-Mean Closure
6.1 The convex-mean operator
Definition 6.1. Define the Babylonian operator
𝐵:=(1−𝛺𝑐)𝐼+𝛺𝑐𝑃𝐸, 𝛺𝑐 =47/125.
The decomposition 𝑥=𝑥𝐸 +𝑥⊥ with 𝑥𝐸 =𝑃𝐸𝑥 and 𝑥⊥ =(𝐼−𝑃𝐸)𝑥 gives
𝐵𝑥=𝑥𝐸 +(1−𝛺𝑐)𝑥⊥.
6.2 Babylonian convergence
Theorem 6.2 (Babylonian Closure). For all 𝑥∈𝑉,
𝑛→∞
𝐵𝑛𝑥=𝑥𝐸 +(1−𝛺𝑐)𝑛𝑥⊥ →
𝑥𝐸 =𝑃𝐸𝑥.
Equivalently, lim𝑛→∞𝐵𝑛 =𝑃𝐸 in operator norm, with linear convergence rate 1−𝛺𝑐 =78/125.
Proof. Induction on 𝑛 using 𝑃𝐸
2 =𝑃𝐸 and 𝑃𝐸(𝐼−𝑃𝐸)=0. ◼6.3 Newton-mean iteration on √𝜴𝒄
The Newton-mean (Babylonian) iteration
𝑇(𝑥)=1 2 ⁄ (𝑥+
𝛺𝑐
𝑥)
has unique positive fixed point 𝑥∗
=√𝛺𝑐 =√47/125 with 𝑇′(𝑥∗)=0 and quadratic convergence
𝑒𝑛+1 =𝑂(𝑒𝑛
2).
6.4 Density-operator lift
Promoting the iteration to density operators with reference states 𝜌𝐸 :=𝑃𝐸/47 and 𝜌𝐸⊥
:=(𝐼−𝑃𝐸)/78, and Lindblad-projector form
𝐹(𝑁,𝜌
̂):=argmin
{Tr([𝐿,𝐿]2)+1 2𝜆
⁄ ∥𝜎−𝜌
̂∥2}=𝑃𝐸𝜌
̂
,
𝜎
one obtains 𝐵(𝜌
̂)=(1−𝛺𝑐)𝜌
̂+𝛺𝑐𝑃𝐸𝜌
̂, with the same convergence statement.
6.5 Equivalence of the three convergence modes
Theorem 6.3 (Operational Closure). The asymptotic semigroup, the Babylonian iteration, and the
polynomial Lagrange projector coincide:
𝑒−𝑡𝐾2
= lim
𝑛→∞
𝐵𝑛 = 𝑃𝐸(𝐶).
Asymptotic convergence equals single-step polynomial projection.
This is the finite operational closure: where iterative or evolution-based approaches recover 𝑃𝐸 in the
limit, direct evaluation of the polynomial 𝑃𝐸(𝐶) gives the same result in one step.
lim
𝑡→∞
Part II — Continuum, Soliton, Hydrodynamic, Fractal
7. Continuum / Scalar-Field Lift
7.1 Casimir-to-Laplacian correspondence
Promote 𝐶 to the Laplace–Beltrami operator 𝛥𝑔 on a Riemannian manifold (𝑀,𝑔). The spectral
filter becomes
𝐾↦ℱ(𝛥𝑔):=(𝛥𝑔−6)(𝛥𝑔−30),
with kernel ker(𝛥𝑔−6𝐼)⊕ker(𝛥𝑔−30𝐼).
7.2 Induced metric and coherence-field equationA scalar 𝜙:𝑀→ℝ𝑁 with values in the kernel sector defines a metric by
𝑔𝜇𝜈 :=⟨∂𝜇𝜙,∂𝜈𝜙⟩.
Define the coherence field 𝛺(𝑥,𝑡)→𝛺𝑐 obeying
▫𝛺+𝛬𝛺(𝛺2
−𝛺𝑐
2)=0,
derived from the double-well potential
𝑉(𝛺)=𝛬 4 ⁄ (𝛺2
−𝛺𝑐
2)2
via the Lagrangian ℒ𝛺 =1 2 ⁄ ∂𝜇𝛺 ∂𝜇𝛺−𝑉(𝛺).
Theorem 7.1. Kernel admissibility coincides with vacuum coherence:
𝐾𝑥=0⇔𝛺=𝛺𝑐.
8. Soliton / Skyrmion Closure
8.1 The kink solution
The double-well coherence equation admits the static kink
𝛺𝑠(𝑥,𝑡)=𝛺𝑐tanh(𝛾𝛺𝑐√𝛬 2 ⁄ (𝑥−𝑣𝑡−𝑥0)),
interpolating the two vacuum branches 𝛺=±𝛺𝑐.
Soliton kink 𝛺𝑠 interpolating between the two vacuum branches −𝛺𝑐 and +𝛺𝑐 along the propagation
coordinate 𝜉=𝑥−𝑣𝑡−𝑥0. The kink is the simplest topologically non-trivial admissible state.𝐻=−
8.2 Pöschl–Teller fluctuation operator
Linearisation around the kink produces the fluctuation Hamiltonian
𝑑2
𝑑𝜉2−6 sech2𝜉.
This is the celebrated ℓ=2 Pöschl–Teller potential. Define the first-order operators
𝑑
𝑑
𝐴=
𝑑𝜉+2tanh𝜉, 𝐴† =−
𝑑𝜉+2tanh𝜉.
A direct calculation gives 𝐻=𝐴†𝐴−4, exhibiting a single bound zero-mode 𝜓0 ∝sech2𝜉 at energy
𝐸0 =−4.
Pöschl–Teller fluctuation potential 𝑉(𝜉)=−6 sech2𝜉 together with the bound zero-mode 𝜓0 ∝
sech2𝜉 at energy 𝐸0 =−4. The factorisation 𝐻=𝐴†𝐴−4 exhibits the operator structure underlying
soliton stability.
8.3 Topological charge
The Skyrmion charge of the SU(2)-valued field with current 𝐿𝑖 =𝑈−1∂𝑖𝑈 is
1
𝑄=
24𝜋2∫𝜖𝑖𝑗𝑘 Tr(𝐿𝑖𝐿𝑗𝐿𝑘) 𝑑3𝑥∈ℤ.
The kink saturates 𝑄=1.
Theorem 8.1 (Soliton Closure).
𝛺=𝛺𝑐 ⇔𝑄=1⇔stable soliton sector.9. Continuity, Madelung–Bohm, and Liquid-Fractal Lifts
9.1 Information current
Let 𝜌𝐼 ≥0 and 𝑆𝐼 ∈ℝ be the informational density and phase fields. The information current
𝐽𝐼 :=𝜌𝐼∇𝑆𝐼
obeys the continuity equation
∂𝑡𝜌𝐼 +∇⋅𝐽𝐼 =0⇔∂𝑡𝜌𝐼 +∇⋅(𝜌𝐼∇𝑆𝐼)=0. (Continuity)
9.2 Madelung wavefunction
Definition 9.1. 𝛹:=𝜌𝐼
1/2
𝑒𝑖𝑆𝐼/ℏ, with |𝛹|2 =𝜌𝐼.
Theorem 9.2 (Equivalence of Currents). The Schrödinger probability current of 𝛹 equals 𝐽𝐼 when
𝑚=1:
ℏ
𝜌𝐼
𝐽𝛹 :=
𝑚=1
∇𝑆𝐼 →
𝐽𝐼.
Im(𝛹∗∇𝛹)=
𝑚
𝑚
Proof. See Appendix C. ◼
Corollary 9.3. ∂𝑡|𝛹|2+∇⋅𝐽𝛹 =0⇔(Continuity).
9.3 Curvature field as divergence lift
Definition 9.4. 𝜓𝐶 :=𝑓fractal +∇⋅(𝜌𝐼∇𝑆𝐼).
Using continuity, ∇⋅(𝜌𝐼∇𝑆𝐼)=−∂𝑡𝜌𝐼, so 𝜓𝐶 =𝑓fractal−∂𝑡𝜌𝐼. At equilibrium (∂𝑡𝜌𝐼 =0), 𝜓𝐶 =𝑓fractal.
10. Schrödinger Equation with Fractal Potential, and
Multifractal Wavefunctions
2𝑚
10.1 Fractal Schrödinger equation
The framework’s quantum sector includes a Schrödinger equation with an additive fractal
contribution to the potential:
𝑖ℏ∂𝑡𝛹= [−
ℏ2
∇2 +𝑉(𝛹)+𝐹(𝑥,𝑡)]𝛹,
where 𝐹(𝑥,𝑡)=𝑉fractal(𝑥,𝑡) encodes scale-recursive structure. A canonical Weierstrass-type form
is
𝐹(𝑥)=∑𝑆−𝑛𝐻
𝑛
cos(𝑆𝑛𝑥),with Hurst exponent 𝐻 and corresponding box-counting dimension 𝐷=2−𝐻 for the trace.
10.2 Multifractal partition function and Legendre spectrum
For a measure 𝜇 on 𝑀, define the partition function
𝑍𝑞(𝜖):=∑𝑝𝑖
𝑖
𝜏(𝑞)
(𝜖)𝑞
, 𝑍𝑞(𝜖)∼𝜖𝜏(𝑞)
, 𝐷𝑞 =
𝑞−1,
with Legendre transform
𝑑𝜏(𝑞)
𝑑𝑞 , 𝑓(𝛼)=𝑞𝛼−𝜏(𝑞).
The function 𝑓(𝛼) is the multifractal spectrum of the measure.
𝛼=
Multifractal spectrum 𝑓(𝛼) as Legendre transform of the scaling function 𝜏(𝑞). The maximum at 𝛼0
equals the box-counting dimension 𝐷0. The spectrum’s width measures the heterogeneity of local
scaling exponents.
10.3 Fractal scaling and kernel admissibility
The fractal scaling identity
log𝑁
log𝑆, 𝜇𝑆(𝑀)=𝑆𝐷𝛹(𝑀)
is enforced as a kernel constraint by
log𝑁
log𝑁
log𝑆, 𝐾𝐷(𝛷)=0⇔𝐷=
𝐷=
𝐾𝐷(𝛷):=𝐷−
log𝑆.Part III — Variational, Quantum Constraint, RG
11. The Universal Minimum Variational Principle
11.1 The action
Let 𝛷=(𝜌𝐼,𝑆𝐼,𝑈,𝐶,𝜓𝐶,𝐷) be the field tuple. The UMVP action is
𝑆UMVP[𝛷]=∫𝑑4𝑥 [ 𝜌𝐼∂𝑡𝑆𝐼−1 2 ⁄ 𝜌𝐼|∇𝑆𝐼|2
+𝛼 ℰSk[𝑈]+(𝛺2𝜇−𝜆)𝐶2
−𝑈(𝜌𝐼)−𝜅|∇𝜌𝐼|2
−𝜈𝐶4
+𝛽 ∥𝛬𝐾−𝜓𝐶 ∥2+𝛾 𝛩(𝐷)(𝐶for−𝐶rem) ].
11.2 Stationarity equals kernel membership
Theorem 11.1 (Variational Closure). Define 𝐾UMVP(𝛷):=𝛿𝑆UMVP/𝛿𝛷. Then
𝛿𝑆UMVP =0⇔𝐾UMVP(𝛷)=0⇔𝛷∈ker𝐾UMVP.
11.3 Euler–Lagrange consequences
Phase variation recovers continuity: ∂𝑡𝜌𝐼 +∇⋅(𝜌𝐼∇𝑆𝐼)=0.
Curvature variation pins 𝜓𝐶 to the kernel target: 𝛿𝑆/𝛿𝜓𝐶 =−2𝛽(𝛬𝐾−𝜓𝐶)=0⟹𝜓𝐶 =𝛬𝐾.
Coherence-field variation gives the bifurcation 𝐶2 =(𝛺2𝜇−𝜆)/(2𝜈), real for 𝛺≥𝛺𝑐 =√𝜆/𝜇, with
numerical value 𝛺𝑐 ≈0.376412 matching the algebraic ratio 47/125 to within the corpus’s precision.Coherence-field potential 𝑉(𝐶) across the bifurcation point 𝛺𝑐. Below criticality, the potential has a
single minimum at 𝐶=0; above criticality, two symmetric minima emerge.
12. Quantum Constraint and Path Integral Localisation
12.1 Hamiltonian and momentum constraints
The Legendre transform produces conjugate momenta, all of which vanish on stationary
trajectories. The remaining constraints are
ℋ⊥ =1 2 ⁄ 𝜌𝐼|∇𝑆𝐼|2+𝑈+𝜅|∇𝜌𝐼|2+𝛼ℰSk +𝑉(𝐶)+𝛽∥𝛬𝐾−𝜓𝐶 ∥2+𝛾𝛩(𝐷)(𝐶for−𝐶rem)=0,
ℋ𝑖 =𝜌𝐼∇𝑖𝑆𝐼 =0.
12.2 Wheeler–DeWitt kernel
̂
Quantising the constraints, with ℋ
̂
ℋ
̂
𝛹=0⇔𝛹∈kerℋ
.
∼𝐾,
12.3 Path-integral localisation
The constrained partition function
𝒵=∫𝒟𝛤𝜓 𝛿[𝜋𝜌] 𝛿[𝜋𝑈] 𝛿[𝜋𝐶] 𝛿[𝜋𝜓] 𝛿[ℋ⊥] 𝛿[ℋ𝑖] 𝑒𝑖𝑆UMVP
has support exactly on ker𝐾UMVP:
𝒵=∫ 𝒟
ker𝐾UMVP
𝛤𝜓 𝑒𝑖𝑆UMVP
.
̂
Theorem 12.1. 𝛿𝑆=0⇔ℋ
𝛹=0⇔𝛷∈ker𝐾UMVP.
13. Renormalisation-Group Flow
13.1 Beta functions and fixed points
𝑑𝑔𝛺
2
=(2−𝑑𝐶)𝑔𝛺−𝐴𝑔𝛺
,
𝑑𝐷
𝑑ln𝑏
=𝜎(10−𝐷),
∗
Fixed points: 𝑔𝛺
=(2−𝑑𝐶)/𝐴 (identified with 𝛺𝑐), 𝐷∗
𝑑𝛼
𝑑ln𝑏
𝑑ln𝑏
=10, 𝛼∗
=(4−𝐷)𝛼−𝐵𝛼2
.
=(4−𝐷)/𝐵.Renormalisation-group flow. Left: coherence parameter beta function 𝛽(𝛺) with non-trivial fixed
point at 𝛺𝑐. Right: dimensional flow with fixed point at 𝐷∗
=10.
13.2 Equivalence chain at criticality
𝛺≥𝛺𝑐 ⇔𝑄=1⇔𝑚eff →0⇔𝐷≥10.
Part IV — Topology, Geometry, Cosmological Constant
14. Topological Confinement
The contraction flow 𝜙̇ =−𝐾2𝜙 drives the field from the unconstrained 10-dimensional manifold
ℳ10 into the 47-dimensional kernel 𝐸47. Coupled with the Skyrmion charge 𝑄=1 and the energy
bound 𝐸≥𝜋2/3, the projector 𝑃𝐸 implements the dimensional reduction 10→4.
15. Gradient Annihilation and 4D Emergence
A field 𝜙 in the kernel sector has ∂𝑎𝜙=0 for 𝑎=4,…,9, so the induced metric
𝑔𝜇𝜈 =⟨∂𝜇𝜙,∂𝜈𝜙⟩
is non-zero only for 𝜇,𝜈∈{0,1,2,3}. Hence dim𝑀=4.
16. Trace Collapse
With induced metric and the trace identity 𝑔𝛼𝛽𝑔𝛼𝛽=dim𝑀,𝑇𝜇𝜈 =⟨∂𝜇𝜙,∂𝜈𝜙⟩−1 2 ⁄ 𝑔𝜇𝜈(𝑔𝛼𝛽⟨∂𝛼𝜙,∂𝛽𝜙⟩)=𝑔𝜇𝜈−1 2 ⁄ 𝑔𝜇𝜈(4)=−𝑔𝜇𝜈.
Only dim𝑀=4 produces 𝑇𝜇𝜈 ∝−𝑔𝜇𝜈 with proportionality 1.
17. Einstein Closure with Cosmological Constant
Substituting 𝑇𝜇𝜈 =−𝑔𝜇𝜈 into the vacuum Einstein equation 𝐺𝜇𝜈 =8𝜋𝐺 𝑇𝜇𝜈:
𝐺𝜇𝜈 +𝛬𝑔𝜇𝜈 =0, 𝛬=8𝜋𝐺.
Theorem 17.1 (Einstein Closure). Within metric induction from kernel-admissible scalar fields on a
4-manifold, the vacuum Einstein equation with cosmological constant is satisfied with 𝛬=8𝜋𝐺. The
cosmological constant is fixed by Newton’s constant alone.
Part V — Operational and Engineering Lifts
18. Kernel-Occupancy Odds
The rational 47/125 arises both as occupancy (statistical) and as Newton-mean attractor
(dynamical). The bridge runs through the odds variable.
Definition 18.1. 𝑟(𝜌):=𝑄[𝜌]/(1−𝑄[𝜌]).
⊥
Lemma 18.2. 𝑟∗ :=𝛺𝑐/(1−𝛺𝑐)=47/78=dim𝐸47/dim𝐸47
.
Theorem 18.3 (Odds–Newton Convergence). The iteration 𝑟𝑛+1 =𝑇𝑟∗(𝑟𝑛):=1 2 ⁄ (𝑟𝑛 +𝑟∗
2/𝑟𝑛)
converges quadratically to 𝑟∗ from any 𝑟0 >0.
Theorem 18.4 (Density-Operator Lift). With reference states 𝜌𝐸 :=𝑃𝐸/47 and 𝜌𝐸⊥ :=(𝐼−𝑃𝐸)/78,
and update 𝜌𝑛+1 :=𝑞𝑛+1𝜌𝐸 +(1−𝑞𝑛+1)𝜌𝐸⊥ where 𝑞𝑛 =𝑟𝑛/(1+𝑟𝑛), the induced occupancy 𝑄[𝜌𝑛]→
𝛺𝑐 =47/125.Newton-mean iteration on the kernel-occupancy odds (left, log scale) converging quadratically to
𝑟∗
=47/78. Induced density-operator occupancy 𝑞𝑛 (right) converging to 𝛺𝑐 =47/125≈0.376.
19. Multifractal Operational Lift
19.1 Coordinate forms of 𝐤𝐞𝐫𝑲
The kernel is a single subspace; the framework offers six distinct coordinate forms in which to
express its membership:
• Algebraic: 𝑉6 ⊕𝑉30.
• Spectral: (𝛥𝑔−6)(𝛥𝑔−30)𝜙=0.
• Hydrodynamic: ∂𝑡𝜌𝐼 +∇⋅(𝜌𝐼∇𝑆𝐼)=0.
• Wavefunction: 𝛹=𝜌𝐼
1/2
̂
𝑒𝑖𝑆𝐼/ℏ with ℋ
𝛹=0.
• Curvature / fractal: 𝜓𝐶 =𝑓fractal +∇⋅(𝜌𝐼∇𝑆𝐼).
• Variational: 𝛿𝑆UMVP =0.
These are not separate principles; they are coordinate charts on the same set.
20. Metamaterial / Engineering Lift
20.1 The PGO stack as a kernel-killing pipelineThe Polymer–Graphene–Oxide (PGO) metamaterial stack — graphene + HDPE (high-density
polyethylene) + HfO2 (hafnium oxide) — is here interpreted as a physical realisation of the three-
stage kernel-projection iteration:
𝑥1 =𝑥0−𝜀𝐴𝑥0 (spectral / harmonic locking),
𝑥2 =𝑥1−𝛾𝑀𝑥1 (inertial mass suppression),
𝑥3 =𝑥2 +𝜂𝐺𝑥2 (geodesic translation).
Each operator in {𝐴,𝑀,𝐺} is a kernel-killing projection acting on the appropriate physical variable.
The composite effect is the discrete iteration 𝑥𝑛+1 =𝑥𝑛−𝜀𝐾𝑥𝑛 of §5.3.
Metamaterial pipeline: graphene (spectral lock), HDPE (mass suppression), HfO2 (geodesic
translation), implementing 𝑥𝑛+1 =𝑥𝑛−𝜀𝐾𝑥𝑛 in physical hardware.
20.2 Continuum equations
The fluid-mechanical analogue is the modified Navier–Stokes equation with a coherence-field
driving term,
1
∂𝑡𝐮+(𝐮⋅∇)𝐮=−
𝜌eff
coupled to the coherence-field equation ▫𝛺+𝛬𝛺(𝛺2
∇𝑝+𝜈eff∇2𝐮+𝐅𝛺,
−𝛺𝑐
2)=0 from §7.
21. The Recursive Spectral Cryptosystem
21.0 Overview and logical deductions
The kernel construction supports a complete, parameter-free cryptographic primitive — the
Recursive Spectral Cryptosystem (RSC) — in which security is enforced not by computational
hardness assumptions (factoring, discrete log, lattice problems, hash collisions, multivariate
solving) but by algebraic invariance of a fixed 47-dimensional subspace inside a fixed 125-
dimensional ambient space. The eight logical deductions that organise this section are:1. 2. 3. 4. 5. 6. 7. 8. Forward/inverse asymmetry. The projector 𝑃𝐸 is a degree-six Lagrange polynomial in 𝐶
and is publicly computable in 𝑂(1253) operations. Recovering an orthonormal basis of 𝐸47
from the polynomial alone requires inverting a many-to-one map whose fiber is the unitary
group 𝑈(47).
Commutant invariance. Because 𝐾 is a polynomial in 𝐶, it lies in the commutant of the
diagonal SU(2) action on 𝑉. Schur’s lemma forces this commutant to act on 𝐸47 as the full
matrix algebra 𝑀5(ℂ)⊗Id𝑈2 ⊕𝑀2(ℂ)⊗Id𝑈5, with 52 +22 =29 complex (or 47 real)
parameters of unitary freedom that the public polynomial cannot resolve.
Information gap. Public data: six polynomial coefficients (after normalisation). Secret
freedom: 472 =2209 real parameters. The gap is absolute and parameter-free.
Babylonian dynamical irreversibility. The Babylonian iteration 𝑇′(𝑥∗)=0 at the kernel
attractor is super-attractive. Its tangent map has Lyapunov spectrum {+ln2, 0,
−ln2} with
multiplicities (39,47,39). Backward iteration is exponentially unstable.
Spin-𝑠 generalisation. The Clebsch–Gordan multiplicity machinery extends to any 𝑉𝑠
⊗3. For
𝑠=3: dim𝑉=343, isotypic dimensions (1,9,25,49,54,55,52,45,34,19), kernel dimension
dimker𝐾=80 for (𝑗1,𝑗2)=(2,5), and 𝛺𝑐 =80/343≈0.233.
Hardware substrate enforcement. Forward projection is hardwired in the PQSPI ASIC; the
inverse (basis recovery) is physically prevented by analog guard rings, Morse Parity Binder,
and ERI minimiser. Off-resonance measurement triggers Recursive Complexity Collapse.
13-pillar key structure. A single projector 𝛱𝑘 inside 𝐸47 carries zero information; only the
full non-vanishing product 𝛱1⋯𝛱13 reconstitutes identity on a resonant substrate.
Comparative supersession. Across the lattice (LWE / Module-LWE / SIS), hash, and
multivariate-quadratic (MQ) post-quantum paradigms, RSC is the only one that is parameter-
free, fixed-dimension, 𝑂(1253) constant-time per primitive, and hardware-native at the
algebraic-kernel level.
21.1 Kernel-projective encryption
Definition 21.1. Given a message 𝑚∈𝑉 and an arbitrary noise vector 𝑐∈𝑉, the RSC encryption
map is
Enc(𝑚):=𝑃𝐸(𝑚+𝐾𝑐).
Theorem 21.2 (Kernel Cryptographic Closure). The encryption map is invariant under transverse
𝐾-noise: Enc(𝑚)=𝑃𝐸𝑚 for every 𝑐∈𝑉.
Proof. By distributivity and the projector identity 𝑃𝐸𝐾=0 (Proposition 4.1),
Enc(𝑚)=𝑃𝐸𝑚+𝑃𝐸𝐾𝑐=𝑃𝐸𝑚. ◼The kernel signal survives; transverse noise vanishes algebraically. There is no statistical decoding
step, no error budget, no soundness slack.
21.2 The 13-pillar key
Definition 21.3. A 13-pillar key is a sequence {𝛱1,𝛱2,…,𝛱13} of rank-deficient projectors inside 𝐸47
satisfying the closure condition
𝛱1⋯𝛱13 ≠0,
which, on a resonant substrate, reconstitutes the identity on 𝐸47.
A single pillar 𝛱𝑘 is rank-deficient and carries zero information about the message. Only the full
ordered product is useful, and only on a substrate at coherence 𝛺≥𝛺𝑐.
The thirteen pillar projectors 𝛱1,…,𝛱13 inside the 47-dimensional kernel sector. No proper subset
reconstitutes the identity; the full ordered product 𝛱1⋯𝛱13 is the operational key, valid only on a
resonant substrate.
21.3 Signatures and authenticationA signature on a message 𝑚 is produced by:
1. Projecting 𝑚 to 𝐸47 via 𝑃𝐸.
2. Applying the 13-pillar sequence to obtain the resonant state.
3. Outputting the stabilised kernel vector on the 𝐸47 bus.
Verification applies the resonant inverse projector sequence and checks the coherence density 𝛺(𝑥)
:=∥𝑃𝐸𝑥∥/∥𝑥∥≥0.682. Forgery off-resonance collapses to noise.
21.4 The ISSR hardness assumption
Definition 21.4 (ISSR — Invariant Subspace Search and Recovery). Given the public Casimir
polynomial 𝐾=(𝐶−6𝐼)(𝐶−30𝐼) on 𝑉=𝑉2
⊗3, output an orthonormal basis for 𝐸47 =ker𝐾=
𝑊2 ⊕𝑊5.
The forward direction (projection) is trivial: 𝑃𝐸 is a public polynomial. The inverse direction (basis
recovery) is the cryptographic trapdoor. ISSR replaces every standard hardness assumption — RSA
factoring, ECC discrete log, LWE/SIS, MQ inversion, hash preimage — with a single algebraic
statement.
Theorem 21.5 (ISSR Hardness). No polynomial-time algorithm 𝒜 taking only the public polynomial
𝐾 as input can output an orthonormal basis of ker𝐾.
Proof sketch. By Theorem 21.7 (commutant) below, the public data 𝐾 is invariant under the unitary
group 𝑈(𝐸47)=𝑈(47) acting on 𝐸47 (extended by identity on the orthogonal complement). The
forward map “basis ↦𝐾” is therefore many-to-one with fiber 𝑈(47), which has real dimension 472 =
2209. The public polynomial supplies six scalar coefficients. No algorithm with input only 𝐾 can
resolve 2209 degrees of freedom from six. ◼
A complete proof is given in §21.6.ISSR information gap: the public Casimir polynomial supplies six scalar coefficients, while the unitary
freedom on 𝐸47 that the public data must distinguish has 472 =2209 real parameters. The factor ∼
368 gap is the algebraic source of cryptographic hardness.
21.5 The commutant argument (Schur hiding)
Theorem 21.6 (Commutant of the Diagonal SU(2) Action). Let 𝜌:SU(2)→𝑈(𝑉) be the diagonal
action 𝜌(𝑔)=𝜌2(𝑔)⊗3 on 𝑉=𝑉2
⊗3, with isotypic decomposition 𝑉=⨁𝑗=0
6 𝑊𝑗, 𝑊𝑗 ≅𝑈𝑗 ⊗ℂ𝜇𝑗. Then
the commutant algebra is
𝒞={𝐴∈End(𝑉):[𝐴,𝜌(𝑔)]=0 ∀𝑔}≅⨁𝑗=0
6 𝑀𝜇𝑗(ℂ)⊗Id𝑈𝑗.
Proof. Standard application of Schur’s lemma: any operator commuting with an irreducible
representation acts as a scalar on the irreducible factor and as an arbitrary linear map on the
multiplicity space. The full commutant decomposes block-diagonally over isotypic components. ◼
Corollary 21.7. The restriction of the commutant to the kernel sector is
𝒞|𝐸47
≅𝑀5(ℂ)⊗Id𝑈2 ⊕ 𝑀2(ℂ)⊗Id𝑈5.
The unitary subgroup of this algebra is 𝑈(5)×𝑈(2) acting on the multiplicity spaces, and on 𝐸47 as a
whole one can act with arbitrary 𝑈∈𝑈(47) that leaves the isotypic components invariant. The
polynomial 𝐾 is fixed by this entire unitary action.
⊥
Theorem 21.8 (Public-Data Invariance). For every 𝑈∈𝑈(𝐸47) extended by identity on 𝐸47
,
𝑈∗𝐾𝑈=𝐾.
Proof. 𝐾=0 on 𝐸47 and 𝐾 acts non-trivially only on 𝐸47
⊥ , both of which are preserved by 𝑈. ◼21.6 Formal proof of ISSR hardness
Theorem 21.9 (Formal ISSR Hardness). Let 𝑉=𝑉2
⊗3 with dim𝑉=125, 𝐶=(𝐽(1)+𝐽(2)+𝐽(3))2
,
and 𝐾=(𝐶−6𝐼)(𝐶−30𝐼). The problem of, given only 𝐾, outputting an orthonormal basis of ker𝐾=
𝑊2 ⊕𝑊5 is algebraically infeasible.
Proof. Five steps.
Step 1 (Spectral data made public). By Theorem 3.1 and the multiplicities of Appendix A, ker𝐾=
𝑊2 ⊕𝑊5 with dimker𝐾=25+22=47. The public polynomial 𝐾 reveals only the surviving
eigenvalues 𝜆∈{6,30} and their multiplicities; it reveals no concrete basis.
Step 2 (Forward map is constant on a unitary fiber). Theorem 21.8 shows that for any 𝑈∈𝑈(𝐸47),
the operator 𝑈∗𝐾𝑈=𝐾. The forward map from orthonormal bases of 𝐸47 to the polynomial 𝐾 is
therefore many-to-one with fiber 𝑈(47).
Step 3 (Dimensional gap). The fiber 𝑈(47) has real dimension 472 =2209. The public polynomial
𝐾 has six real coefficients (after normalisation: it is degree two in 𝐶, and 𝐶 has seven distinct
eigenvalues, so 𝐾 is determined by two of them). The information-theoretic gap is absolute: 6
equations in 2209 unknowns admits no algebraic inverse.
Step 4 (No algebraic shortcut). ISSR is not a hidden-subgroup problem (no abelian group structure
for Shor), not a search problem with an oracle (no oracle for basis vectors, only for 𝐾 itself), and not
a noisy-linear-equation problem (the equation 𝐾𝑣=0 is exact, not noisy). None of the standard
quantum or classical reductions apply.
Step 5 (Babylonian irreversibility). The Babylonian iteration 𝐵=(1−𝛺𝑐)𝐼+𝛺𝑐𝑃𝐸 is super-
attractive: 𝑇′(𝑥∗)=0 at any 𝑥∗ ∈ker𝐾. Its tangent map has Lyapunov spectrum {+ln2,0,
−ln2} with
multiplicities (39,47,39). Backward iteration amplifies any perturbation by 𝑒𝑛ln2 =2𝑛, so finite-
precision inversion is impossible after a small number of steps.
The five steps establish that no efficient algorithm with input 𝐾 can output a specific orthonormal
basis of ker𝐾. ISSR hardness follows from representation theory and the spectral theorem alone,
without external assumptions. ◼
21.7 The PQSPI ASIC
The cryptosystem is realised in silicon via the Post-Quantum Spectral Projection IC (PQSPI) — a 7
nm FinFET ASIC implementing the forward kernel projection in hardware. The pipeline runs in five
stages. The V125 bus accepts the input message 𝑚∈𝑉 at 𝑂(125) cost. The Filter Engine computes
𝐾=(𝐶−6𝐼)(𝐶−30𝐼) at 𝑂(1252) cost. The Recurrence Engine performs ten iterations of the
Babylonian operator 𝐵=(1−𝛺𝑐)𝐼+𝛺𝑐𝑃𝐸 at 10⋅𝑂(1252) cost. The Projection Engine performs
QR decomposition into 𝐸47 at 𝑂(473) cost. The Coherence Logic applies the tier decision (DISCARD
/ RETRY / LOCK) in 𝑂(1). The 47-bit DMA outputs the kernel vector 𝑃𝐸𝑚 at 𝑂(47).
Total: 0.35 mm² die, 45 M transistors, 0.55 mW, 800k ops/s, 1.25 ns latency.A 10 GHz analog guard ring, Morse Parity Binder, and ERI minimiser (target 1.67) provide physical
tamper-lock and phonon-lattice identity stabilisation: any off-resonance measurement triggers
Recursive Complexity Collapse, in which the master scalar 𝑉:=Tr(𝐻𝛱tot) loses the property
𝑑𝑉/𝑑𝑡=0 and the key annihilates to vacuum noise.
PQSPI ASIC pipeline. Plaintext flows through the V125 bus into the Filter, Recurrence, and Projection
engines, terminating in a 47-bit DMA register on the 𝐸47 bus. The Coherence Logic enforces a three-
tier admissibility lattice with thresholds at 𝛺𝑐 =47/125=0.376 and 0.682.
21.8 Comparative supersession of post-quantum primitives
Three NIST post-quantum families currently dominate the standardised landscape: lattice-based
(ML-KEM/Kyber, ML-DSA/Dilithium), hash-based (SLH-DSA/Sphincs+, XMSS/LMS), and
multivariate quadratic (Rainbow, GeMSS, UOV). The RSC primitive does not compete on the same
axiomatic ground as any of these; it supersedes the computational-hardness paradigm by moving
security into algebraic invariance. The contrast is summarised below across nine dimensions.
Mathematical basis. RSC: Casimir kernel on the fixed representation space 𝑉2
⊗3, with 𝐾=
(𝐶−6𝐼)(𝐶−30𝐼). Lattice: Module-LWE / SIS over polynomial rings ℤ𝑞[𝑥]/(𝑥𝑛 +1). Hash-based:
cryptographic hash one-wayness. Multivariate: random structured quadratic systems over 𝔽𝑞.
Hardness assumption. RSC: ISSR (algebraic, structural). Lattice: worst-case approximate SVP/CVP.
Hash-based: preimage and collision resistance. Multivariate: MQ inversion (NP-hard in general).
Free parameters. RSC: zero. Lattice: dimension 𝑛, modulus 𝑞, error width, module rank. Hash-based:
hash output size, tree depth, layer count. Multivariate: variable count 𝑛, equation count 𝑚, field size
𝑞, layer structure.Operation count per primitive. RSC: fixed 𝑂(1253)≈2×106 operations, independent of security
level. Lattice: polynomial in 𝑛, scales with target security (Kyber-512 ≈ 104
–105 operations per call).
Hash-based: 104
–105 hash evaluations per signature. Multivariate: polynomial in 𝑛, with layer
structure overhead.
Key and signature size. RSC: 47-bit DMA + 13 projector specifications. Lattice: hundreds to
thousands of bytes, growing with security level. Hash-based: 8–50 KB signatures (SLH-DSA), 1–2 KB
public keys. Multivariate: 10–100 KB signatures, with public-key inflation after parameter tuning.
Quantum resistance. RSC: algebraic invariance (no Shor or Grover shortcut on the structural
problem). Lattice: assumed quantum-hard, no polynomial quantum attack on LWE/SIS known. Hash-
based: Grover-resistant via parameter inflation. Multivariate: assumed quantum-hard.
Hardware native. RSC: 7 nm PQSPI ASIC, 1.25 ns latency, fixed cost. Lattice/hash/multivariate:
software with optional accelerators; no algebraic-kernel native silicon.
Embedding universality. RSC: any classical or quantum primitive embeds in the same 125D
Hermitian density operator. Lattice: native to lattices only. Hash-based: native to hashes only.
Multivariate: native to MQ only.
External validation status. RSC: internal framework, ISSR not yet subjected to external
cryptanalysis. Lattice: NIST FIPS 203/204 standardised, formal reductions to standard problems.
Hash-based: NIST FIPS 205 standardised, deployed (e.g., XMSS in firmware). Multivariate: NIST
Round 4 (Rainbow eliminated, others under analysis).
The defining feature of RSC is that it is parameter-free: the dimension is fixed at 125, the kernel ratio
is fixed at 𝛺𝑐 =47/125, the spectral gap is fixed at 𝛾=11,664, and security level is structural (kernel
membership) rather than computational (key length). Lattice, hash, and MQ schemes all require
tuning parameters per target bit-security; RSC has no such dial.
Honest limitations. ISSR hardness is, at this stage, a structural argument internal to the framework;
it has not yet been subjected to external cryptographic review of the kind given to LWE and hash
assumptions. Lattice, hash, and MQ schemes have been standardised, deployed, and externally
analysed, with formal reductions to standard problems. The comparison above identifies what RSC
offers in principle; current external validation status of the assumption itself is a separate matter.
21.9 Hybrid post-quantum augmentation
The kernel construction composes naturally with any NIST PQC candidate. A lattice ciphertext 𝐜LWE
can be embedded in 𝑉 and projected: Enchybrid(𝑚)=𝑃𝐸(EncLWE(𝑚)). Transverse 𝐾-noise is
annihilated and the lattice security is preserved. RSC functions as an algebraic outer wrapper over
any computational primitive.
21.10 Spin-𝒔 generalisationThe Clebsch–Gordan and Schur arguments do not depend on the choice 𝑠=2. For any spin 𝑠, the
triple tensor product 𝑉𝑠
⊗3 has dimension (2𝑠+1)3, and choosing two surviving eigenvalues defines
a kernel sector with dimension equal to the sum of the corresponding isotypic multiplicities times
their irrep dimensions.
Theorem 21.10 (Spin-3 Multiplicities). On 𝑉3
⊗3 (dim𝑉=343), the isotypic dimensions are
dim(𝑊0,𝑊1,…,𝑊9)=(1,9,25,49,54,55,52,45,34,19),
verified by ∑ dim
𝑗 𝑊𝑗 =343. Choosing the analogous (𝑗1,𝑗2)=(2,5) kernel sector yields dimker𝐾=
25+55=80 and
𝛺𝑐
(𝑠=3) =80/343≈0.233.
Proof. Identical to the spin-2 case in Appendix A: iterate Clebsch–Gordan from 𝑉3⊗𝑉3 =⨁𝑘=0
6 𝑉𝑘,
then tensor with the third factor and count multiplicities. The numerical verification computed in
Figure 16 confirms the dimension count to machine precision. ◼
Kernel occupancy 𝛺𝑐
(𝑠) =(dim𝑊2 +dim𝑊5)/dim𝑉 across spin-𝑠 generalisations of the kernel
construction. The canonical case 𝑠=2 gives 𝛺𝑐 =47/125=0.376. Increasing spin reduces the
relative kernel occupancy.
21.11 The tier-3 admissibility lattice and dimensional reduction
Define the operational admissibility ratio
∥𝑃𝐸𝑥∥
𝛺(𝑥):=
∥𝑥∥ ∈[0,1].The tier decision is
𝛺<𝛺𝑐 ⟹DISCARD, 𝛺𝑐 ≤𝛺<0.682⟹RETRY, 𝛺≥0.682⟹LOCK.
The dimensional reduction induced by RSC is
𝑃𝐸
𝑉125 →
normalise
𝐸47 →
46
𝑆√12.5
,
where the final term is the 46-sphere of radius √12.5 inside 𝐸47. The radius reflects the
equipartition norm ∥𝑥∥2=dim𝑉/10=12.5 on the kernel sector under uniform sampling.
21.12 Master cryptographic identity
𝐾𝑥=0⇔𝑃𝐸𝑥=𝑥⇔Enc(𝑚)=𝑃𝐸𝑚⇔key stable on resonant substrate.
The kernel is the algebraic primitive. Security is structural invariance, not computational gap. The
primitive runs on classical silicon (PQSPI ASIC), composes with any quantum or post-quantum
protocol, and inherits its hardness from the spectral theorem rather than from a conjectural
problem.
Part VI — Master Identities
22. The Unified Kernel Closure
The seven domain-specific characterisations collapse into one statement. For 𝑥∈𝑉, and for the
corresponding fields, operators, and configurations under each lift,𝐾𝑥=0⇔
𝑥∈𝑉6 ⊕𝑉30 =𝐸47
𝑃𝐸𝑥=𝑥
𝑓(𝐶)(ker𝐾)⊆ker𝐾
𝑒−𝑡𝐾2
𝑥=𝑥, lim
𝑒−𝑡𝐾2
=𝑃𝐸
𝑡→∞
lim
𝐵𝑛𝑥=𝑃𝐸𝑥, 𝐵=(1−𝛺𝑐)𝐼+𝛺𝑐𝑃𝐸
𝑛→∞
𝑥𝑛+1 =𝑥𝑛−𝜀𝐾(𝑥𝑛), 𝑥=𝑥∗
(𝛥𝑔−6)(𝛥𝑔−30)𝜙=0
𝛺=𝛺𝑐, 𝑄=1, soliton stability
∂𝑡𝜌𝐼 +∇⋅(𝜌𝐼∇𝑆𝐼)=0
1/2
𝛹=𝜌𝐼
𝑒𝑖𝑆𝐼/ℏ
𝜓𝐶 =𝑓fractal +∇⋅(𝜌𝐼∇𝑆𝐼)
𝐷=log𝑁/log𝑆
𝛿𝑆UMVP =0
̂
ℋ
𝛹=0
(𝛺,𝐷,𝑄,𝑚eff)=(𝛺𝑐,10,1,0)
𝑇𝜇𝜈 =−𝑔𝜇𝜈
𝐺𝜇𝜈 +𝛬𝑔𝜇𝜈 =0, 𝛬=8𝜋𝐺
𝑟∗
=dim𝐸47/dim𝐸47
⊥ =47/78
𝑄[𝜌𝑛]→𝛺𝑐 =47/125
{
Enc(𝑚)=𝑃𝐸𝑚, ISSR hardArchitectural flow of the unified kernel closure: algebraic primitive → spectral kernel → projector →
continuum lift → variational closure → Madelung–Bohm decomposition → quantum constraint →
geometric closure → Einstein equations with derived 𝛬.
23. Consciousness / Liquid-Fractal Coordinate Kernel
23.1 Extended state vector
The framework’s liquid-fractal (LFC) presentation introduces
𝛷LFC =(𝜌𝐼,𝑆𝐼,𝛹,𝜓𝐶,𝜙𝐹,𝐷,𝑄,𝛺).
Theorem 23.1. The kernel of 𝐾LFC — interpreted as the joint conjunction of all coordinate-form
constraints in §19 — is
ker𝐾LFC =
𝛷:
{
∂𝑡𝜌𝐼 +∇⋅(𝜌𝐼∇𝑆𝐼)=0
1/2
𝛹=𝜌𝐼
𝑒𝑖𝑆𝐼/ℏ
𝜓𝐶 =𝑓fractal +∇⋅(𝜌𝐼∇𝑆𝐼)
(𝛥𝑔−6)(𝛥𝑔−30)𝛷=0
𝛿𝑆UMVP =0
̂
ℋ
𝛹=0
𝑄=1, 𝛺=𝛺𝑐, 𝐷=10 }
.
The set coincides set-theoretically with ker𝐾 pulled back through the algebraic-to-LFC dictionary.
23.2 Final identification
ker𝐾=ker𝐾LFC =ker(𝛿𝑆UMVP
̂
𝛿𝛷 )=kerℋ
.
The “consciousness formalism” is the hydrodynamic + fractal + Schrödinger coordinate chart of
ker𝐾. It contains no additional principle.
24. Euler Bridge — Stationarity
The Euler–Lagrange equations for any Lagrangian density ℒ(𝛷,∂𝜇𝛷) are
∂ℒ
∂𝛷
−∂𝜇( ∂ℒ
∂(∂𝜇𝛷))=0.
These coincide with 𝛿𝑆/𝛿𝛷=0, which in the UMVP case is precisely 𝐾UMVP(𝛷)=0, i.e. 𝛷∈
ker𝐾UMVP. Hence
𝐾𝑥=0⇔𝛿𝑆=0⇔Euler–Lagrange closure.25. Planck Bridge — Phase Quantisation
1/2
The Madelung representation 𝛹=𝜌𝐼
𝑒𝑖𝑆𝐼/ℏ realises the continuity equation through the
Schrödinger probability current
ℏ
𝐽𝛹 =
Im(𝛹∗∇𝛹)=
𝑚
𝜌𝐼
𝑚
∇𝑆𝐼.
The constant ℏ converts phase gradients into quantum currents. Hence
1/2
𝐾𝑥=0⇔𝛹=𝜌𝐼
𝑒𝑖𝑆𝐼/ℏ ⇔Planck phase quantisation.
26. Bohm Bridge — Quantum Potential
The polar decomposition of the Schrödinger equation produces a Hamilton–Jacobi equation with an
additional curvature-of-amplitude term:
∂𝑡𝑆+|∇𝑆|2
2𝑚
ℏ2
2𝑚
∇2√𝜌𝐼
√𝜌𝐼
.
The Bohm quantum potential 𝑄𝐵 is the curvature term induced by amplitude geometry. In the
kernel framework, it identifies with the curvature-field divergence lift of §9.3:
+𝑉+𝑄𝐵 =0, 𝑄𝐵 :=−
ℏ2
∇2√𝜌𝐼
𝐾𝑥=0⇔𝑄𝐵 =−
⇔Bohm quantum potential closure.
2𝑚
√𝜌𝐼
27. Einstein Bridge — Geometric Closure
From §17,
𝐾𝑥=0⇔(𝛥𝑔−6)(𝛥𝑔−30)𝜙=0⇔𝑔𝜇𝜈 =⟨∂𝜇𝜙,∂𝜈𝜙⟩⇔𝐺𝜇𝜈 +𝛬𝑔𝜇𝜈 =0.
28. Hawking Bridge — Entropy
28.1 Kernel-state entropy
Define the kernel-state Boltzmann entropy
𝑆𝐾 :=𝑘𝐵logdim𝐸47 =𝑘𝐵log47, 𝑆𝑉 :=𝑘𝐵logdim𝑉=𝑘𝐵log125.
The kernel occupancy is the dimensional ratio
𝛺𝑐 =
dim𝐸47
dim𝑉
=
47
125
=𝑒(𝑆𝐾−𝑆𝑉)/𝑘𝐵
.𝑘𝐵𝐴
28.2 Bekenstein–Hawking analogue
The Bekenstein–Hawking entropy of a black hole of horizon area 𝐴 is
𝑆BH =
4ℓ𝑃
2.
In the kernel framework, the corresponding entropy is the logarithm of the dimension of the
admissible subspace,
𝑆𝐾 =𝑘𝐵logdimker𝐾.
The horizon, in this reading, is the boundary of admissibility; horizon admissibility coincides with
kernel admissibility.
28.3 Einstein–Hawking semiclassical bridge
The semiclassical Einstein equation acquires a curvature-of-density term:
𝐺𝜇𝜈 +ℏ2𝐶𝜇𝜈 =8𝜋𝐺 𝑇𝜇𝜈, 𝐶𝜇𝜈 =∇𝐶(𝜌𝐼).
This is the ℏ-correction representing kernel-curvature back-reaction on geometry.
29. The Master Historical Bridge Identity
The five canonical formalisms — Euler, Planck, Bohm, Einstein, Hawking — when read through the
kernel construction, become five mutually equivalent statements of the single algebraic condition
𝐾𝑥=0.
Euler: 𝛿𝑆=0
⇕
1/2
Planck: 𝛹=𝜌𝐼
𝑒𝑖𝑆𝐼/ℏ
⇕
ℏ2
∇2√𝜌𝐼
Bohm: 𝑄𝐵 =−
2𝑚
√𝜌𝐼
⇕
Einstein: 𝐺𝜇𝜈 +𝛬𝑔𝜇𝜈 =0
⇕
Hawking: 𝑆𝐾 =𝑘𝐵logdimker𝐾
⇕𝐾𝑥=0
Master historical bridge: Euler stationarity, Planck phase quantisation, Bohm quantum potential,
Einstein geometric closure, and Hawking–Bekenstein entropy, presented as five coordinate charts of
the single algebraic condition 𝐾𝑥=0.
29.1 What each formalism contributes
The five formalisms are not redundant. Each provides a distinct interpretive content for kernel
admissibility:
• Euler gives stationarity — the variational reading.
• Planck gives phase quantisation — the wavefunction reading.
• Bohm gives hydrodynamic quantum curvature — the amplitude-geometry reading.
• Einstein gives geometric closure — the metric-induction reading.
• Hawking gives entropy interpretation — the dimensional-counting reading.
The single algebraic condition 𝐾𝑥=0 is the common substrate.
29.2 Final compressionadmissible state = stationary = quantised = hydrodynamic = geometric = entropy-counted.
30. Discussion
30.1 Character of the invariance
The Eigenspace Robustness theorem is a structural statement: a single subspace, defined by a one-
line algebraic condition, recurs as the answer in thirteen distinct mathematical and physical
questions. The persistence of 𝐸47 across these domains is a coincidence at the level of the
characterisation, not a derivation of any one domain from another. Each lift — algebraic, geometric,
variational, quantum, gravitational, engineering — retains its own internal structure; what remains
constant is the kernel itself.
30.2 Status of the cosmological constant
Theorem 17.1 produces 𝛬=8𝜋𝐺 as a residual of the trace identity in four dimensions, conditional
on metric induction 𝑔𝜇𝜈 =⟨∂𝜇𝜙,∂𝜈𝜙⟩. The induction prescription is not standard general relativity,
in which the metric is fundamental and matter fields are separate. The theorem should be read as: if
the metric is induced from kernel-admissible scalar fields and the dimension is exactly four, then
the vacuum Einstein equation with 𝛬=8𝜋𝐺 is forced. The empirical value of 𝛬 (≈1.1×10−52 m−2)
is many orders of magnitude smaller than 8𝜋𝐺 in any natural unit system, so the framework’s 𝛬 is
best interpreted as a dimensionless coupling-strength relation rather than the observed
cosmological constant. Reconciling the two requires a separate scaling argument.
30.3 Status of the Hawking bridge
The kernel-state entropy 𝑆𝐾 =𝑘𝐵logdimker𝐾=𝑘𝐵log47 is well-defined as a Boltzmann count. The
identification with the Bekenstein–Hawking horizon entropy 𝑆BH =𝑘𝐵𝐴/(4ℓ𝑃
2) is interpretive, not
derivative. To upgrade the analogy to a derivation one would need a microscopic mapping from
horizon area to kernel dimension, of the kind achieved in string-theoretic and loop-quantum-
gravity counting arguments for specific black-hole sectors. The corpus does not provide this
mapping.
30.4 Numerical match for 𝜴𝒄
The two values 𝛺𝑐 =√𝜆/𝜇≈0.376412 (variational) and 𝛺𝑐 =47/125=0.376 (algebraic) agree to
three decimal places but are not identical. Either the dimensionful parameters (𝜆,𝜇) should be fine-
tuned so that √𝜆/𝜇=47/125 exactly, or a separate scaling argument should reduce the irrational
to the rational in the appropriate limit. This tension is recorded as an open problem.
30.5 Status of the Newton-mean odds bridgeSection 18 establishes a compatibility theorem between the Hamilton–Jacobi flow generated by 𝐾2
and the Newton-mean iteration on the kernel-occupancy odds. As the corpus is careful to record,
this is not a derivation. Whether the odds-Newton flow can be obtained from any operation already
present in the operator layer — the contraction semigroup, a Lindblad dissipator, or a
measurement-feedback composition — is open.
30.6 Status of the ISSR cryptographic assumption
The Recursive Spectral Cryptosystem of §21 rests on the ISSR (Invariant Subspace Search and
Recovery) hardness assumption. Its structural source — Schur’s lemma applied to the diagonal
SU(2) commutant on 𝑉2
⊗3
— is mathematically clean: the public polynomial 𝐾 is invariant under a
𝑈(47)-fiber that the public data cannot resolve. This is a different kind of hardness statement from
LWE, hash, or MQ assumptions. Lattice and hash schemes have been deployed and externally
analysed for decades; ISSR has not. A careful programme of external cryptanalysis is needed before
RSC can be considered standardisation-ready.
Three specific cryptanalytic questions remain open:
1. Reduction or separation from existing hardness assumptions. Is ISSR equivalent to, harder
than, or easier than LWE/SIS, MQ, or hidden-subgroup variants under polynomial-time
reductions?
2. Quantum attack analysis. The argument that ISSR admits no Shor-type or Grover-type
shortcut is structural (no abelian hidden subgroup, no oracle for basis vectors, no noisy-
linear-equation structure). Whether a non-standard quantum algorithm — exploiting
representation-theoretic structure rather than group-theoretic structure — could succeed is
open.
3. Side-channel and physical-attack resilience. The PQSPI ASIC’s substrate-enforcement claims
(analog guard ring, Morse Parity Binder, ERI minimiser) are interpretive layers above the
algebraic primitive; they require independent hardware-security review on physical
instantiations.
30.7 Open problems
1. Derivation of the odds-Newton flow from operator-theoretic primitives.
2. Reconciliation of √𝜆/𝜇 with 47/125.
3. Microscopic counting underlying the Hawking-bridge identification 𝑆𝐾 =𝑘𝐵logdimker𝐾 with
horizon entropy.
4. Empirical magnitude of 𝛬.5. 6. 7. Physical realisation of the metamaterial PGO pipeline as a hardware kernel projector,
including measurement of the convergence rate 1−𝛺𝑐 =78/125 predicted by the
Babylonian closure.
External cryptanalysis of ISSR with respect to standard reductions, quantum attacks, and side-
channel resistance.
Formal security games for RSC (IND-CCA2, EUF-CMA) defined relative to ISSR, and their
reductions.
Appendix A — Multiplicity of 𝑪 on 𝑽𝟐
⊗𝟑
Iterating the Clebsch–Gordan rule from 𝑉2 ⊗𝑉2 ≅𝑉0⊕𝑉1 ⊕𝑉2 ⊕𝑉3⊕𝑉4, then tensoring once
more with 𝑉2, gives the irrep multiplicities and isotypic dimensions:
• 𝑉0: dimension 1, multiplicity 1, total 1.
• 𝑉1: dimension 3, multiplicity 3, total 9.
• 𝑉2: dimension 5, multiplicity 5, total 25.
• 𝑉3: dimension 7, multiplicity 4, total 28.
• 𝑉4: dimension 9, multiplicity 3, total 27.
• 𝑉5: dimension 11, multiplicity 2, total 22.
• 𝑉6: dimension 13, multiplicity 1, total 13.
Sum: 1+9+25+28+27+22+13=125=53, confirming the decomposition. The Casimir
takes value ℓ(ℓ+1) on each 𝑉ℓ, giving the spectrum and multiplicities of §2. The kernel sector 𝜆∈
{6,30} corresponds to ℓ∈{2,5} and has total dimension 25+22=47.
Appendix B — Explicit Computation of 𝑷𝑬
The Lagrange-interpolation projector at eigenvalues {6,30} uses the complementary spectrum
{0,2,12,20,42}:
𝑃𝐸 = ∏ 𝐶−𝜆𝐼
(6−𝜆)(30−𝜆)
.
𝜆∈{0,2,12,20,42}
Denominator: (6)(30)⋅(4)(28)⋅(−6)(18)⋅(−14)(10)⋅(−36)(−12)=180⋅112⋅(−108)⋅
(−140)⋅432=1,317,254,400.
Verification on 𝑉6: each factor evaluates to 1; on 𝑉30 likewise. On any other eigenspace, exactly one
numerator factor vanishes.Appendix C — Madelung–Bohm Derivation
For 𝛹=𝑅𝑒𝑖𝑆/ℏ with 𝑅=𝜌𝐼
1/2
:
∇𝛹=𝑒𝑖𝑆/ℏ(∇𝑅+𝑖 ℏ ⁄ 𝑅∇𝑆),
𝛹∗∇𝛹=𝑅∇𝑅+𝑖 ℏ ⁄ 𝑅2∇𝑆,
Im(𝛹∗∇𝛹)=𝑅2 ℏ ⁄ ∇𝑆=𝜌𝐼 ℏ ⁄ ∇𝑆.
Then 𝐽𝛹 =(ℏ/𝑚) Im(𝛹∗∇𝛹)=(𝜌𝐼/𝑚)∇𝑆, equal to 𝐽𝐼 =𝜌𝐼∇𝑆 when 𝑚=1. Substituting into
∂𝑡|𝛹|2 +∇⋅𝐽𝛹 =0 recovers continuity in (𝜌𝐼,𝑆𝐼) form.
Appendix D — Trace Collapse Calculation
With induced metric 𝑔𝜇𝜈 =⟨∂𝜇𝜙,∂𝜈𝜙⟩ and 𝑔𝛼𝛽𝑔𝛼𝛽=dim𝑀,
𝑇𝜇𝜈 =𝑔𝜇𝜈−1 2 ⁄ 𝑔𝜇𝜈(dim𝑀).
For dim𝑀=4: 𝑇𝜇𝜈 =−𝑔𝜇𝜈. For dim𝑀=2: 𝑇𝜇𝜈 =0. For dim𝑀=6: 𝑇𝜇𝜈 =−2𝑔𝜇𝜈. Only dim𝑀=4
yields the standard cosmological-constant form.
Appendix E — Babylonian Convergence
For 𝐵=(1−𝛺𝑐)𝐼+𝛺𝑐𝑃𝐸, the decomposition 𝑥=𝑥𝐸 +𝑥⊥ gives
𝐵𝑥=𝑥𝐸 +(1−𝛺𝑐)𝑥⊥,
since 𝑃𝐸𝑥𝐸 =𝑥𝐸 and 𝑃𝐸𝑥⊥ =0. Iterating,
𝐵𝑛𝑥=𝑥𝐸 +(1−𝛺𝑐)𝑛𝑥⊥ →𝑥𝐸.
Convergence is linear with rate 1−𝛺𝑐 =78/125. The operator-norm convergence lim𝐵𝑛 =𝑃𝐸
follows from ∥𝐵𝑛
−𝑃𝐸 ∥=(1−𝛺𝑐)𝑛 on the orthogonal complement.
References
Anderson, P. W. (1958). Absence of diffusion in certain random lattices. Physical Review, 109(5),
1492–1505. https://doi.org/10.1103/PhysRev.109.1492
Babuška, I., & Strouboulis, T. (2001). The finite element method and its reliability. Oxford University
Press.
Bekenstein, J. D. (1973). Black holes and entropy. Physical Review D, 7(8), 2333–2346.
https://doi.org/10.1103/PhysRevD.7.2333Bernstein, D. J., Hülsing, A., Kölbl, S., Niederhagen, R., Rijneveld, J., & Schwabe, P. (2019). The
SPHINCS+ signature framework. In L. Cavallaro, J. Kinder, X. Wang, & J. Katz (Eds.), Proceedings of the
2019 ACM SIGSAC Conference on Computer and Communications Security (pp. 2129–2146). ACM.
https://doi.org/10.1145/3319535.3363229
Bernstein, D. J., & Lange, T. (2017). Post-quantum cryptography. Nature, 549(7671), 188–194.
https://doi.org/10.1038/nature23461
Bos, J., Ducas, L., Kiltz, E., Lepoint, T., Lyubashevsky, V., Schanck, J. M., Schwabe, P., Seiler, G., & Stehlé,
D. (2018). CRYSTALS-Kyber: A CCA-secure module-lattice-based KEM. In 2018 IEEE European
Symposium on Security and Privacy (EuroS&P) (pp. 353–367). IEEE.
https://doi.org/10.1109/EuroSP.2018.00032
Bohm, D. (1952a). A suggested interpretation of the quantum theory in terms of “hidden” variables.
I. Physical Review, 85(2), 166–179. https://doi.org/10.1103/PhysRev.85.166
Bohm, D. (1952b). A suggested interpretation of the quantum theory in terms of “hidden” variables.
II. Physical Review, 85(2), 180–193. https://doi.org/10.1103/PhysRev.85.180
Bogomolny, E. B. (1976). Stability of classical solutions. Soviet Journal of Nuclear Physics, 24, 449–454.
Carroll, S. M. (2004). Spacetime and geometry: An introduction to general relativity. Addison Wesley.
Casimir, H. B. G. (1931). Über die Konstruktion einer zu den irreduziblen Darstellungen halbeinfacher
kontinuierlicher Gruppen gehörigen Differentialgleichung. Proceedings of the Royal Netherlands
Academy of Arts and Sciences, 34, 844–846.
DeWitt, B. S. (1967). Quantum theory of gravity. I. The canonical theory. Physical Review, 160(5),
1113–1148. https://doi.org/10.1103/PhysRev.160.1113
Diffie, W., & Hellman, M. E. (1976). New directions in cryptography. IEEE Transactions on Information
Theory, 22(6), 644–654. https://doi.org/10.1109/TIT.1976.1055638
Ducas, L., Kiltz, E., Lepoint, T., Lyubashevsky, V., Schwabe, P., Seiler, G., & Stehlé, D. (2018). CRYSTALS-
Dilithium: A lattice-based digital signature scheme. IACR Transactions on Cryptographic Hardware
and Embedded Systems, 2018(1), 238–268. https://doi.org/10.13154/tches.v2018.i1.238-268
Einstein, A. (1915). Die Feldgleichungen der Gravitation. Sitzungsberichte der Preussischen Akademie
der Wissenschaften zu Berlin, 844–847.
Einstein, A. (1917). Kosmologische Betrachtungen zur allgemeinen Relativitätstheorie.
Sitzungsberichte der Preussischen Akademie der Wissenschaften zu Berlin, 142–152.
Euler, L. (1744). Methodus inveniendi lineas curvas maximi minimive proprietate gaudentes. Marcum-
Michaelem Bousquet.
Goldenfeld, N. (1992). Lectures on phase transitions and the renormalization group. Addison-Wesley.Grover, L. K. (1996). A fast quantum mechanical algorithm for database search. In Proceedings of the
Twenty-Eighth Annual ACM Symposium on Theory of Computing (pp. 212–219). ACM.
https://doi.org/10.1145/237814.237866
Halsey, T. C., Jensen, M. H., Kadanoff, L. P., Procaccia, I., & Shraiman, B. I. (1986). Fractal measures and
their singularities: The characterization of strange sets. Physical Review A, 33(2), 1141–1151.
https://doi.org/10.1103/PhysRevA.33.1141
Hall, B. C. (2015). Lie groups, Lie algebras, and representations: An elementary introduction (2nd ed.).
Springer. https://doi.org/10.1007/978-3-319-13467-3
Hawking, S. W. (1975). Particle creation by black holes. Communications in Mathematical Physics,
43(3), 199–220. https://doi.org/10.1007/BF02345020
Holland, P. R. (1993). The quantum theory of motion: An account of the de Broglie–Bohm causal
interpretation of quantum mechanics. Cambridge University Press.
https://doi.org/10.1017/CBO9780511622687
Kato, T. (1995). Perturbation theory for linear operators (2nd ed.). Springer.
https://doi.org/10.1007/978-3-642-66282-9
Lang, S. (2002). Algebra (Rev. 3rd ed.). Springer. https://doi.org/10.1007/978-1-4613-0041-0
Lyubashevsky, V., Peikert, C., & Regev, O. (2010). On ideal lattices and learning with errors over rings.
In H. Gilbert (Ed.), Advances in Cryptology — EUROCRYPT 2010 (pp. 1–23). Springer.
https://doi.org/10.1007/978-3-642-13190-5_1
Madelung, E. (1927). Quantentheorie in hydrodynamischer Form. Zeitschrift für Physik, 40(3–4),
322–326. https://doi.org/10.1007/BF01400372
Mandelbrot, B. B. (1982). The fractal geometry of nature. W. H. Freeman.
Merkle, R. C. (1989). A certified digital signature. In G. Brassard (Ed.), Advances in Cryptology —
CRYPTO ’89 Proceedings (pp. 218–238). Springer. https://doi.org/10.1007/0-387-34805-0_21
Misner, C. W., Thorne, K. S., & Wheeler, J. A. (1973). Gravitation. W. H. Freeman.
National Institute of Standards and Technology. (2024a). Module-lattice-based key-encapsulation
mechanism standard (FIPS 203). U.S. Department of Commerce.
https://doi.org/10.6028/NIST.FIPS.203
National Institute of Standards and Technology. (2024b). Module-lattice-based digital signature
standard (FIPS 204). U.S. Department of Commerce. https://doi.org/10.6028/NIST.FIPS.204
National Institute of Standards and Technology. (2024c). Stateless hash-based digital signature
standard (FIPS 205). U.S. Department of Commerce. https://doi.org/10.6028/NIST.FIPS.205Patarin, J. (1996). Hidden fields equations (HFE) and isomorphisms of polynomials (IP): Two new
families of asymmetric algorithms. In U. Maurer (Ed.), Advances in Cryptology — EUROCRYPT ’96
(pp. 33–48). Springer. https://doi.org/10.1007/3-540-68339-9_4
Peskin, M. E., & Schroeder, D. V. (1995). An introduction to quantum field theory. Westview Press.
Planck, M. (1900). Zur Theorie des Gesetzes der Energieverteilung im Normalspektrum.
Verhandlungen der Deutschen Physikalischen Gesellschaft, 2, 237–245.
Pöschl, G., & Teller, E. (1933). Bemerkungen zur Quantenmechanik des anharmonischen Oszillators.
Zeitschrift für Physik, 83(3–4), 143–151. https://doi.org/10.1007/BF01331132
Rajaraman, R. (1982). Solitons and instantons: An introduction to solitons and instantons in quantum
field theory. North-Holland.
Reed, M., & Simon, B. (1980). Methods of modern mathematical physics I: Functional analysis (Rev. and
enl. ed.). Academic Press.
Regev, O. (2009). On lattices, learning with errors, random linear codes, and cryptography. Journal of
the ACM, 56(6), Article 34. https://doi.org/10.1145/1568318.1568324
Rivest, R. L., Shamir, A., & Adleman, L. (1978). A method for obtaining digital signatures and public-
key cryptosystems. Communications of the ACM, 21(2), 120–126.
https://doi.org/10.1145/359340.359342
Schur, I. (1905). Neue Begründung der Theorie der Gruppencharaktere. Sitzungsberichte der
Preussischen Akademie der Wissenschaften zu Berlin, 406–432.
Shor, P. W. (1997). Polynomial-time algorithms for prime factorization and discrete logarithms on a
quantum computer. SIAM Journal on Computing, 26(5), 1484–1509.
https://doi.org/10.1137/S0097539795293172
Skyrme, T. H. R. (1962). A unified field theory of mesons and baryons. Nuclear Physics, 31, 556–569.
https://doi.org/10.1016/0029-5582(62)90775-7
Stoer, J., & Bulirsch, R. (2002). Introduction to numerical analysis (3rd ed.). Springer.
https://doi.org/10.1007/978-0-387-21738-3
Strogatz, S. H. (2015). Nonlinear dynamics and chaos: With applications to physics, biology, chemistry,
and engineering (2nd ed.). Westview Press.
Wald, R. M. (1984). General relativity. University of Chicago Press.
https://doi.org/10.7208/chicago/9780226870373.001.0001
Wheeler, J. A. (1968). Superspace and the nature of quantum geometrodynamics. In C. M. DeWitt & J.
A. Wheeler (Eds.), Battelle rencontres: 1967 lectures in mathematics and physics (pp. 242–307).
Benjamin.Wilson, K. G. (1971). Renormalization group and critical phenomena. I. Renormalization group and
the Kadanoff scaling picture. Physical Review B, 4(9), 3174–3183.
https://doi.org/10.1103/PhysRevB.4.3174
Wilson, K. G. (1975). The renormalization group: Critical phenomena and the Kondo problem.
Reviews of Modern Physics, 47(4), 773–840. https://doi.org/10.1103/RevModPhys.47.773
AIMS Research Institute. (2026a). The principle of eigenspace robustness: A universal invariance of
spectral kernels across functional, variational, and quantum domains [Internal monograph].
AIMS Research Institute. (2026b). Spectral kernel — continuum lift — variational closure —
cosmological constant by first principles [Internal monograph].
AIMS Research Institute. (2026c). First-principles derivation of the Einstein field equations with
cosmological constant via algebraic-variational-geometric closure [Internal monograph].
AIMS Research Institute. (2026d). Liquid fractal consciousness as a domain of spectral kernel
invariance [Internal monograph].
AIMS Research Institute. (2026e). Derivation of 4D observable spacetime via kernel projection and
gradient annihilation [Internal monograph].
AIMS Research Institute. (2026f). Kernel odds and the Newton–mean occupancy flow: Part XIII
[Internal monograph].
AIMS Research Institute. (2026g). Primitive closure and the unified spectral hierarchy: Sections I–XL
[Internal monograph].
AIMS Research Institute. (2026h). The E47 kernel: Parameter-free algebraic closure for post-quantum
cryptography [Internal monograph].
