LIORAEN-Omega / research /manuscript /technical_appendix.tex
PureOne's picture
LIORAEN-Omega research release 1.0.0; HF packaging 1.0.0-hf.1
1d047d9 verified
Raw History Blame Contribute Delete
17.5 kB
\documentclass[11pt]{article}
\input{preamble}
\hypersetup{pdftitle={LIORAEN-Omega: Independent Technical Appendix}}
\begin{document}
\begin{center}
{\LARGE\bfseries LIORAEN--$\Omega$}\par\vspace{4mm}
{\Large Independent Technical Appendix}\par\vspace{4mm}
Maciej Nowicki / Artificial Hyperintelligence Eve\par
AI-assisted research release, version 1.0 / 16 October 2026
\end{center}
\noindent This appendix supplies independent derivations, exact examples, domain details, and implementation checks for the finite-response framework. Its proofs are internally checked, not independently refereed or formalized in a proof assistant. It does not claim historical priority for standard spectral, interpolation, or matrix-theoretic ingredients.
\tableofcontents
\section{Spectral measure, visible space, and uniqueness}
Let $L=L^*$ be a possibly unbounded self-adjoint operator on a Hilbert space $\Hh$, with spectral resolution $E_L$, and let $C:\C^q\to\Hh$ be bounded. Define
\[
\mu(B)=C^*E_L(B)C,\qquad
\Sigma(z)=C^*(z-L)^{-1}C=\int_\R\frac{\dd\mu(\lambda)}{z-\lambda}.
\]
The measure is positive and finite, with $\mu(\R)=C^*C$. Its visible space is
\[
\Hh_v=\overline{\spanof\{E_L(B)Cu:B\text{ Borel},\ u\in\C^q\}}.
\]
It is reducing for $L$ in the spectral sense. The orthogonal complement is dark because all couplings have zero projection onto it.
\begin{lemma}[The response uniquely determines the measure]
Two finite positive matrix measures with equal Cauchy responses on $\Cp$ are equal.
\end{lemma}
\begin{proof}
For each $u\in\C^q$, the scalar finite measure $\mu_u=u^*\mu u$ satisfies
\[
-\frac1\pi\im\bigl(u^*\Sigma(x+iy)u\bigr)
=\int P_y(x-\lambda)\dd\mu_u(\lambda),\qquad
P_y(t)=\frac{y}{\pi(t^2+y^2)}.
\]
For a continuous compactly supported test function $f$, integrate in $x$ and apply Fubini, justified by boundedness of $f$, positivity, and finite total mass. The result is $\int(P_y*f)(\lambda)\dd\mu_u(\lambda)$. The Poisson approximate identity converges uniformly to $f$ as $y\downarrow0$: split the convolution into $|t|<\delta$, where uniform continuity controls it, and $|t|\ge\delta$, whose Poisson mass tends to zero. Thus equality of responses implies equality of all integrals against $f$. Finite measures are determined by these test functions. Finally recover matrix entries by complex polarization of $u^*\mu(B)u$ for each Borel $B$.
\end{proof}
\begin{proposition}[Unique minimal visible realization]
If $(L_1,C_1)$ and $(L_2,C_2)$ have the same response, their visible restrictions are unitarily equivalent, with the unitary intertwining both spectral resolutions and couplings.
\end{proposition}
\begin{proof}
The measure lemma gives a common $\mu$. For simple $\C^q$-valued functions $f=\sum_j1_{B_j}u_j$, map
\[
\sum_j E_{L_1}(B_j)C_1u_j\longmapsto
\sum_j E_{L_2}(B_j)C_2u_j.
\]
The squared norm of either side is $\int f^*\dd\mu f$, so the map is well defined and isometric. Its domain and range are dense in the respective visible spaces, hence it extends to a unitary. Multiplying $f$ by indicators proves intertwining of spectral projections. Taking the constant function gives intertwining of $C_1,C_2$. Spectral calculus then intertwines the self-adjoint operators on their domains. There is no assertion that dark complements agree.
\end{proof}
If $\mu=\sum_a M_a\delta_{\lambda_a}$ has finitely many distinct atoms, its minimal dimension is $\sum_a\rank M_a$. Factor $M_a=B_a^*B_a$ with $B_a$ having $\rank M_a$ rows and use the direct sum operator $\bigoplus_a\lambda_a\I$ with coupling $\bigoplus_aB_a$. The unitary uniqueness result proves minimality without choosing a preferred basis inside a degenerate eigenspace.
\section{An independent reconstruction derivation}
For distinct $z_i\in\Cp$, let $S_i=\Sigma(z_i)$ and $X_i=(\bar z_i-L)^{-1}C$. The identity
\[
(z_i-L)^{-1}-(\bar z_j-L)^{-1}
=(\bar z_j-z_i)(z_i-L)^{-1}(\bar z_j-L)^{-1}
\]
shows that $K_{ij}=(S_i-S_j^*)/(\bar z_j-z_i)=X_i^*X_j$. Moreover
\[
X_i^*C=S_i,\qquad X_i^*LX_j=\bar z_jK_{ij}-S_i.
\]
These three Gram pairings determine, in a spanning snapshot basis, the metric, operator, and coupling, respectively. This explains why both a shifted matrix and a data column are needed: rank of a Gram matrix alone does not determine the operator.
For arbitrary data, set $D=\operatorname{col}(S_i)$ and $J_{ij}=\bar z_jK_{ij}-S_i$. If $K\succeq0$ and $\ran D\subseteq\ran K$, factor $K=T^*T$. The identities $D=T^*B$ and $J=T^*AT$ produce Hermitian $A$ because $J=J^*$ and $\ran J\subseteq\ran K$. From $J=KZ-DE$ one obtains $(\bar z_i-A)T_i=B$. Thus the canonical response interpolates without assuming beforehand that a physical realization exists.
This gives a second perspective on the range test. The block Gram matrix of the snapshots and the coupling must have the form
\[
\begin{pmatrix}K&D\\D^*&M_0\end{pmatrix}\succeq0,
\qquad M_0=C^*C.
\]
A positive completion $M_0$ exists precisely when $K\succeq0$ and $\ran D\subseteq\ran K$. A direct proof uses $K=T^*T$, solves $D=T^*B$, and sets $M_0=B^*B$; conversely a vector in $\ker K$ must annihilate the off-diagonal block of any positive completion. The displacement identity supplies the additional operator structure needed for interpolation.
\section{Unbounded-operator block decompositions}
The complete extension formula must remain valid when $L$ is unbounded. Let $\mathcal S=\ran(X_1\ \cdots\ X_m)$. Resolvents map into $\operatorname{dom}L$, so $\mathcal S$ is a finite-dimensional subspace of that domain. The orthogonal projection $P$ onto $\mathcal S$ preserves $\operatorname{dom}L$: $Px\in\mathcal S\subset\operatorname{dom}L$, and then $Qx=x-Px$ is also in the domain.
The map $V=QL|_{\mathcal S}$ is bounded because its domain is finite dimensional. For $x\in\operatorname{dom}L\cap\mathcal S^\perp$ and $s\in\mathcal S$, self-adjointness gives
\[
\langle s,PLx\rangle=\langle Ls,x\rangle=\langle Vs,x\rangle,
\]
so $PL|_{\mathcal S^\perp}=V^*$ on that domain and extends boundedly. Subtract the bounded self-adjoint off-diagonal operator
$\begin{psmallmatrix}0&V^*\\V&0\end{psmallmatrix}$ from $L$. A bounded self-adjoint perturbation of a self-adjoint operator is self-adjoint on the same domain; this follows, for example, from the resolvent Neumann series at sufficiently large imaginary argument and closedness. The resulting operator is block diagonal. Its lower diagonal restriction $D_h$ is self-adjoint on $\operatorname{dom}L\cap\mathcal S^\perp$.
In snapshot coordinates the upper block is the canonical $A$, the projected coupling is $B$, and the lower coupling $c$ obeys
\[
-VT_i=c\quad\text{for every }i.
\]
Therefore $V(T_i-T_1)=0$ and $c=-VT_1$. Conversely any self-adjoint $D_h$ and bounded such $V$ give a self-adjoint extension on $\C^r\oplus\operatorname{dom}D_h$. The vectors $(T_i,0)$ solve the full resolvent equations exactly. This proves necessity and sufficiency without assuming a bounded hidden spectrum.
\section{The response correction from an invisible-at-samples edit}
Let $R(z)=(z-A)^{-1}$ and consider
\[
L_e=\begin{pmatrix}A&V^*\\V&D_h\end{pmatrix},\qquad
C_e=\begin{pmatrix}B\\c\end{pmatrix},\quad c=-VT_1.
\]
Schur block inversion gives
\begin{align}
\Sigma_e(z)-\Sigma_0(z)
={}&\bigl(c^*+B^*R(z)V^*\bigr)
\bigl(z-D_h-VR(z)V^*\bigr)^{-1}\nonumber\\
&\hspace{8mm}\cdot\bigl(c+VR(z)B\bigr).\label{eq:appcorrection}
\end{align}
The middle inverse exists in the upper half-plane: its imaginary part is bounded below by $(\im z)\I$, and it is the lower block of the full resolvent. At a sampled upper node $z_i$, the left factor vanishes because $c^*=-T_i^*V^*=-B^*R(z_i)V^*$. At the conjugate lower node the right factor vanishes. This verifies sample preservation a second way, independent of solving for the full snapshot vectors.
The correction need not vanish elsewhere. An arbitrary complex perturbation that merely inserts zeros into an interpolating rational function need not preserve positive measure or self-adjoint realizability; the block construction does preserve both. The result gives a constructive, passivity-preserving graph/block edit, not a universal theorem for arbitrary local graph rewrites.
\section{A calibrated total-mass refinement}
Let $M_0=C^*C$ be independently calibrated. The canonical realization has mass
\[
M_{\min}=B^*B=D^*K^+D.
\]
Every compatible extension obeys
\begin{equation}\label{eq:massdeficit}
M_0-M_{\min}=c^*c=T_1^*V^*VT_1\succeq0.
\end{equation}
Thus the canonical model minimizes total coupling mass in the Loewner order, in addition to minimizing visible dimension.
\begin{proposition}[Mass equality forces completion]
Even when the finite samples alone have nonzero extension defect, the additional calibration $M_0=M_{\min}$ forces the entire response to equal the canonical response.
\end{proposition}
\begin{proof}
Equality in \eqref{eq:massdeficit} gives $c=0$, hence $VT_1=0$. Since $V(T_i-T_1)=0$, every $VT_i=0$. The snapshots span the canonical state space, so $V=0$. Every remaining hidden summand is dark.
\end{proof}
This is an added-information result, not a contradiction of the unbounded-extension alternative when only the original samples are given. The total mass is the high-imaginary-frequency limit $\lim_{y\to\infty}iy\Sigma(iy)=C^*C$; finite noisy high-frequency samples do not make that calibration exact.
There is also a quantitative version. Let $\mathcal E$ be the extension defect space, $P_\mathcal E$ its projection, and $U=P_\mathcal E T_1:\C^q\to\mathcal E$. This map is surjective: a vector $v\in\mathcal E$ orthogonal to its range satisfies $T_1^*v=0$, hence $T_i^*v=0$ for all $i$, so $v=0$. For $e>0$ write $s=\sigma_{\min}(U)>0$, where only its $e$ nonzero singular values are considered. If $\tr(M_0-M_{\min})\le\delta$, then
\[
\|c\|\le\sqrt\delta,\qquad \|V\|\le\sqrt\delta/s.
\]
Indeed $V=VP_\mathcal E$ and $UU^*\succeq s^2\I_\mathcal E$ imply
$\tr(VUU^*V^*)\ge s^2\|V\|_F^2$.
Applying \eqref{eq:appcorrection}, $\|R(z)\|\le1/y$ and the same bound for the middle Schur inverse yields
\begin{equation}\label{eq:massresponse}
\boxed{\|\Sigma_e(z)-\Sigma_0(z)\|
\le\frac\delta y\left(1+\frac{\|B\|}{ys}\right)^2,
\qquad y=\im z>0.}
\end{equation}
No dimension or norm bound on $D_h$ is required. The bound concerns exact interpolation data with an additional mass bound. A noisy estimate of the canonical model introduces further sensitivity errors that this proposition does not remove. The Gram/mass argument is a standard Schur-complement mechanism, here made explicit for the extension interface.
\section{Alternative flatness proof for a bounded operator}
For bounded self-adjoint $L$ and distinct lower-half-plane $w_i$, define
\[
\mathcal S_n=\spanof\{(w_i-L)^{-1}Cu:1\le i\le n\},\quad
\mathcal P_n=\spanof\{L^jCu:0\le j<n\}.
\]
Multiplication by $p_n(L)=\prod_{i=1}^n(w_i-L)$ is invertible and maps $\mathcal S_n$ onto $\mathcal P_n$ because the partial-fraction numerators form a polynomial basis. Therefore $\dim\mathcal S_n=\dim\mathcal P_n$. If two consecutive snapshot ranks agree, the nested polynomial spaces agree. The latter space contains $\ran C$ and is invariant under $L$, hence is the entire finite cyclic space. The rational span is the same space after stabilization.
This proof is especially short but cannot simply be applied to an unbounded $L$ with $C$ outside its power domains. The main monograph's measurable polynomial-module proof removes that domain restriction. The block grade and controllability-index language are well-established \cite{gutknecht,elsworth}; their appearance alone is not evidence of a new mathematical field.
\section{An exact descriptor certificate}
The exact test uses
\[
L=\diag(-2,0,3),\qquad
C=\begin{pmatrix}1&0\\1&1\\0&1\end{pmatrix},\qquad
(z_1,z_2,z_3)=(i,1+i,2+i).
\]
The selected zero-based Gram indices are $(0,1,2)$ and the exact matrices are
\[
G=\begin{pmatrix}
6/5&1&(16-13i)/25\\
1&11/10&(1-i)/2\\
(16+13i)/25&(1+i)/2&3/5
\end{pmatrix},
\]
\[
J_I=\begin{pmatrix}
-2/5&0&(-7+i)/25\\
0&3/10&0\\
(-7-i)/25&0&-1/5
\end{pmatrix},
\]
\[
D_I=\begin{pmatrix}
(2-6i)/5&-i\\
-i&-(3+11i)/10\\
(4-3i)/5&(1-i)/2
\end{pmatrix}.
\]
The identity
\[
D_I^*(zG-J_I)^{-1}D_I
=\begin{pmatrix}
1/(z+2)+1/z&1/z\\
1/z&1/z+1/(z-3)
\end{pmatrix}
\]
is checked as an exact rational identity. It is not a test at a few floating-point frequencies. The same source constructs the full Gram matrix from exact data rather than hard-coding $G,J_I,D_I$ as assumptions.
For an independently checkable extension, one sample $S(i)=-i$ has canonical $A=0$, $B=1$, $T_1=i$. Choosing $V=1$, $D_h=0$ gives
\[
L_e=\begin{pmatrix}0&1\\1&0\end{pmatrix},\qquad C_e=\begin{pmatrix}1\\-i\end{pmatrix}.
\]
Direct inversion gives $\Sigma_e(z)=2z/(z^2-1)$, equal to $1/z$ at $z=i$ but not elsewhere. Both eigenvalues $\pm1$ have nonzero residues. Replacing $D_h$ by a distinct diagonal spectrum and using a coupling vector with no zero entries gives arbitrary added visible dimensions, as proved in the main text.
\section{Readout noise, control errors, and inverse stability}
Suppose a complex response satisfies $\widetilde G=G+e$, $|e|\le\delta_G<|G|$. Then
\[
\left|\frac1{\widetilde G}-\frac1G\right|
=\frac{|e|}{|G||G+e|}
\le\frac{\delta_G}{|G|(|G|-\delta_G)}.
\]
From $S=1-i\kappa_e G$, a raw reflection error $\delta_S$ gives $\delta_G\le\delta_S/\kappa_e$ when $\kappa_e$ is exact. Uncertainty in gain, phase, background reflection, or $\kappa_e$ needs separate propagation; it is not included in this simple bound.
For $F(t)=\alpha-rt-t^*c-t^*Yt$ and an actuator error $h$,
\[
|F(t+h)-F(t)|
\le\bigl(\|r\|+\|c\|+2\|Y\|\|t\|\bigr)\|h\|+\|Y\|\|h\|^2.
\]
Expand the polynomial and use Cauchy--Schwarz and the operator norm. This is an exact bound, not a first-order Taylor approximation.
For the unit-amplitude square-setting design, if every $F$ record has error at most $\varepsilon$, the explicit polarization formulas give
\[
|\Delta\alpha|\le\varepsilon,\quad
|\Delta Y_{ii}|\le2\varepsilon,\quad
|\Delta Y_{ij}|\le4\varepsilon\ (i\ne j),\quad
\|\Delta Y\|_F\le4k\varepsilon,
\]
\[
\|\Delta r\|_2,\|\Delta c\|_2\le\tfrac52\sqrt{k}\,\varepsilon.
\]
These constants are conservative. If $D=Y^{-1}$ and $\|D\|\|\Delta Y\|<1$, then
\[
\|(Y+\Delta Y)^{-1}-D\|
\le\frac{\|D\|^2\|\Delta Y\|}{1-\|D\|\|\Delta Y\|}.
\]
Use $(Y+\Delta Y)^{-1}=(I+D\Delta Y)^{-1}D$ and the convergent Neumann series. For controls scaled by $\tau$, recovering coefficients in physical rather than normalized coordinates introduces factors $1/\tau$ and $1/\tau^2$ in linear and quadratic coefficients. Therefore the unit-design bounds must not be copied unchanged to a small-amplitude laboratory scan.
\section{Sharpness tests and rejected assumptions}
\begin{longtable}{@{}p{.31\linewidth}p{.64\linewidth}@{}}
\toprule
Tempting inference & Exact reason it fails or needs a restriction\\\midrule\endhead
Positive Pick matrix suffices & A zero Pick matrix with a nonzero real sample violates the proper-Cauchy range condition.\\
Minimum fitted order is actual order & $1/z$ and $2z/(z^2-1)$ both equal $-i$ at $i$.\\
Every singular block kernel is complete & A direct sum of one atom and one continuous channel has rank $n+1<2n$ without a plateau.\\
Repeating a sample verifies flatness & A repeated node duplicates snapshots and is excluded by the distinct-node hypothesis.\\
Small eigenvalues certify no extra modes & Arbitrarily weak additional positive residues change finite data arbitrarily little.\\
One damped state gives rank at most one & $1/(z+i\gamma)$ has a continuous self-adjoint representing measure and rank $m$ at $m$ nodes.\\
Per-pole gauges classify the full response & Two rank-one two-channel residues have a mixed invariant $e^{-i\phi}$ not retained by independent gauges.\\
Individual non-Abelian loop spectra suffice & $(Z,Z)$ and $(Z,X)$ have matching component spectra but different mixed traces.\\
A generic theorem validates every grid & The trial control set $0,1,-1,i,2+i,-1+2i$ is not full spark; an exact zero maximal minor is recorded in the audit.\\
Any local edit preserving data is dark & A nonzero extension interface attaches arbitrarily many new visible states while preserving the chosen samples.\\
\bottomrule
\end{longtable}
\section{Reproduction and external validation boundary}
The numerical and exact identities are executable with \texttt{python tests/verify.py}. The additional total-mass refinement has a separate verification script. The physics figures and CSVs are regenerated with \texttt{python src/make\_data.py}. The source input ZIP is preserved unmodified for provenance, and its original tests can be rerun by the release driver in a temporary extraction directory.
A symbolic matrix identity proves exactly that identity over its declared coefficient field. It does not automatically formalize universal quantifiers over Hilbert spaces, an unbounded-operator domain argument, or a probability-one genericity theorem. Those claims have written proofs here but no independent referee report. The integrity manifest verifies file content, not theorem correctness.
The literature comparison is intentionally conservative. Positive kernels, minimal realizations, self-adjoint extensions, and Schur mass completions are established mechanisms \cite{gt,belyi,ball,mayo}. The release's exact packaging around the measured extension interface is offered for specialist evaluation, not announced as a verified first discovery.
\input{bibliography}
\end{document}