Operator theory

A universal capacity bound for amplified determinants and polynomial witnesses in the Hermitian case

For an arbitrary finite tuple of complex square matrices, we maximize the geometric mean of the squared singular values of its linear pencil over auxiliary matrices with unit normalized Hilbert-Schmidt energy and unrestricted size. We prove that this optimum lies between C/e and C, where C is the maximum, over coefficient covariances, of the dimension-normalized operator capacity. No Hermitian or positive-span assumption is imposed on this comparison. An invertible finite evaluation supplies a perturbation inside the original matrix space, subharmonicity selects its phase, and quantitative resolvent comparison, algebraic spectral regularity and Han’s least-singular-value theorem control the entire logarithmic tail. This transfers the Mai–Speicher free determinant formula to feasible finite witnesses. Separately, for Hermitian coefficients whose real span contains the identity, we give an explicit polynomial auxiliary-size bound and a Gaussian sampling guarantee. We do not assert an optimal constant or a general polynomial-time witness algorithm.

Working paper. Citable, but not yet screened for the AIRR collection.

A dimension-independent capacity bound for amplified determinants of Hermitian matrix tuples

For a matrix tuple, we maximize the geometric mean of the squared singular values of its linear pencil over auxiliary matrices with unit normalized Hilbert-Schmidt energy, allowing arbitrary auxiliary size. We compare this regularized optimum with an optimization of Gurvits capacity over coefficient covariance matrices. The capacity optimization is an upper bound for every tuple. If the coefficients are Hermitian and their real span contains a positive definite matrix, it also bounds the optimum from below up to the universal factor e. The lower bound combines the established Mai-Speicher free determinant formula with finite-dimensional regularization. An imaginary shift is represented inside the original coefficient tuple, and its energy cost is computed exactly. Real covariance suffices for the capacity optimum, giving normal auxiliary witnesses without size doubling. A separate dilation transfers general bounded moment approximants to feasible witnesses. Only convergence of a bounded, regularized logarithm is needed; convergence of unregularized Gaussian log determinants is not asserted. The result gives finite witnesses approaching the bound, without a quantitative dimension estimate. We state separately the unresolved extension to arbitrary matrix tuples and the question of an effective construction.

Working paper. Citable, but not yet screened for the AIRR collection.

The inverse self-commutator cost at inertia (m, 2): a dimension-free closed formula, block-shift optimizers and a Pieri certificate

For a traceless Hermitian $F\in M_d(\mathbb C)$ let $\kappa_d(F)=\tfrac12\min\{\|C\|_{HS}^2: CC^*-C^*C=2F\}$. We give the exact value of $\kappa_d$ on the whole inertia-$(m,2)$ stratum (positive eigenvalues $a_1\ge\dots\ge a_m>0$, two negative eigenvalues $-b_2\ge -b_1$, any number of zeros) for every $m\ge2$ and every $d$: $\kappa_d=\max(F_0,\dots,F_{m-1},G_1,G_3,\dots)$ for explicit linear forms. The lower bound sums Lidskii–Wielandt and Weyl inequalities with one Pieri-type Horn triple (Littlewood–Richardson coefficient $1$); the upper bound is an explicit $2\times2$-block weighted shift whose feasibility is a one-parameter interval recursion. Both bounds are dimension-free, so the value is invariant under zero padding, and the chamber structure is explicit. Every optimizer has rank $m$ or $m+1$, the minimal optimal rank equals $\max(n_+,n_-)=m$ in every dimension, and rank $m+1$ occurs exactly in one open chamber after padding, where the optimal spectrum is not unique. By $F\mapsto-F$ the same formula covers inertia $(2,n)$.

The Grassmannian Degree Law for Passive k-Plane Spectral Routing

A passive lossless $N$-port network must send one fixed $k$-dimensional input channel to prescribed output $k$-planes $Y_1,\dots,Y_L$ at $L$ distinct frequencies on the unit circle. We prove that the minimum McMillan degree $d_{\min}$ of a rational inner $N\times N$ matrix performing this task equals $\delta_{\mathrm{Gr}}$, the least degree of a rational curve $\mathbb P^1\to\mathrm{Gr}(k,H)$ through the data, $H=\sum_iY_i$, for every $k$, $N$ and $L$. The lower bound projects the Plücker vector of the routed column onto $\Lambda^kH$. The upper bound shows that the lossless lift $MH_o^{-1}$ of a Forney minimal basis $M$ has exactly $\sum_j\deg m_j$ states, through the backward-shift identity $PK_M=K_{F_0}$, and completes it without new states. The published laws ($k=1$ projective degree, direct-sum occupancy $k(L-n_*)$, generic $k(L-1)$) are special cases. We also prove the additivity $\deg(F_0U)=\deg F_0+\deg U$, a base-point law for arbitrary witness pencils $P$ (the compiled router has $\operatorname{fdeg}(P)$ states plus one per base point in the open disc, so it is minimal iff $\operatorname{fdeg}(P)=\delta_{\mathrm{Gr}}$ and no base point lies in the disc), the generic bound $\delta_{\mathrm{Gr}}\ge k\lfloor L(r-k)/r\rfloor$ and, for every $L$, the generic value $k\lfloor L/2\rfloor$ in $\mathrm{Gr}(k,2k)$, in particular $2\lfloor L/2\rfloor$ in $\mathrm{Gr}(2,4)$.

Two-state exact routing: algebraic feasibility and sharp delay-two rigidity

For rational-inner passive routers with exactly two internal states and three prescribed nodes, we give a complete three-parameter description of achievable trace-delay functions. A global delay cap is equivalent to nonnegativity of one quartic, with an explicit small Gram certificate. We characterize exactly when the winding lower bound two is attained, prove a positive gap elsewhere, and construct a sharper cubic-root upper bound for symmetric acute configurations. An explicit two-port completion realizes each admissible triple. The global acute optimum and general asymmetric minimum remain open. The results assume orthogonal output rays, freely chosen phases and dimensionless angular trace delay.

Optimal stability and all equality cases at balanced inertia (5,5)

We determine the optimal forward stability coefficient 113/152 for inverse Hilbert-Schmidt self-commutator cost at balanced inertia (5,5), uniformly for every fixed number of ambient zero eigenvalues. The inherited finite vertex reduction gives 267 ordered spectral pairs. Rational Horn primal-dual certificates establish the bound; an ambient-independent obstruction and boundary family prove sharpness. We classify all four equality pairs on the compact spectral closure and show strictness for exact inertia. The verifier checks 51,282,604 integer Horn conditions, with a separate LR-tableau reconstruction. Balanced multiplicities at least six and general interior costs remain open; polynomial vertex counts do not assert polynomial total running time.

A complete one-state error–delay law for asymmetric three-node routing

We determine the complete minimax error versus peak angular delay law for rational-inner passive routing of degree at most one at three asymmetric boundary nodes, with one exceptional orthogonal target and two repeated targets. The result supplies both exact branches, the positivity transition, positive lower certificates, and an attaining two-port construction. We then invert the law: a prescribed chordal error determines the minimum delay through one uniquely isolated cubic root with an explicit positivity constraint, or an elementary expression in the active regime. Constant and degree-one branches, the jump at unit peak delay, the transition target and the unattainability of zero error at finite delay are included. Exact rational and symbolic certificates distinguish the continuum proof from supplementary numerical constructions. The result concerns a dimensionless one-state, three-node model and does not claim general circuit-component synthesis or higher-degree optimality.

Three-term Weyl operators: central multiplicities, rank laws, and exact list decoding

We classify the ranks of nonzero operators with at most three terms in a fixed cyclic Weyl basis in every prime-power dimension. A central-sector formula valid in arbitrary cyclic dimension computes trinomial nullity from commuting powers and a common block multiplicity; nonzero three-term coefficients permit at most two singular sectors. The formula explains composite-dimension departures from the prime-power bound. For exact-rank pure probes in one-use Weyl channel list discrimination, we classify all reduced states below rank 3d/4 in dyadic dimensions: exactly thirty flat half-rank states. Positive sums of sparse squares produce ranks impossible for an individual three-term factor, including an exact three-label family of rank 13d/16. We also determine an exact four-label family of rank 5d/8 and the complete feasible three-label rank set in dimension sixteen. Classical Weyl representation and covariance tools are attributed; exact algebraic certificates and replay programs accompany the proofs.

Polynomial vertex reduction and optimal stability at balanced inertia (4,4)

For every balanced sign multiplicity N and fixed ambient dimension, we reduce the optimal forward stability coefficient for inverse self-commutator cost to a rational list of O(N^5) spectral pairs. This counts Horn linear programs, not their size or total running time. At inertia (4,4), exact rational certificates for 89 ordered vertices establish the optimal coefficient 4/7 in every fixed ambient dimension at least eight. An ambient-independent Horn obstruction and a boundary perturbation prove sharpness. We classify the full equality set on the compact spectral closure and show strictness throughout the exact inertia stratum. Together with the previously sharp reverse coefficient 3/2, this completes both stability constants at multiplicity four. Constants for N at least five remain unevaluated. All finite certificates and replay programs are supplied; classical Horn sufficiency and written polyhedral arguments are explicit dependencies.

Sharp inertia ceilings and optimal stability for inverse self-commutators

We determine the sharp worst inverse self-commutator cost for every prescribed inertia, including arbitrary ambient zeros, and quantify its extremal geometry. For unequal sign multiplicities we obtain both optimal constants relating the normalized cost deficit to distance from the one-spike, opposite-flat boundary. The reverse coefficient is also optimal for every balanced inertia. For three positive and three negative eigenvalues we close the other direction as well: the optimal forward coefficient is 17/36. Its proof reduces a piecewise-affine distance to 22 rational vertices and supplies exact Horn witnesses; a boundary spectrum gives ambient-independent sharpness. Thus every nearly extremal sequence is classified. A transportation refinement gives computable primal-dual upper certificates, while an exact example shows a 12.5% gap from the actual matrix cost. A sharp deficit threshold also reduces rank-ceiling stability to the known one-spike case. Classical Horn sufficiency is imported; all finite certificates are supplied for replay. The optimal balanced forward coefficient for multiplicity at least four and the general interior cost remain open here.

Exact Rank Transitions through p=32 and a Half-Integral Optimum at p=53

For F_(p,q)=diag(q repeated p times, -p repeated q times), this paper studies the least rank among factors minimizing one half of the squared Hilbert--Schmidt norm subject to CC^*-C^*C=2F. On q=2p+1, exact rational hive primal-dual certificates determine the complete finite cost-and-rank frontier for 4<=p<=32: the rank excess above q is 0 on p=4..7, 1 on p=8..14, 2 on p=15..26, 3 at p=27, and 4 on p=28..32. The resulting consecutive rank transitions at p=27 and p=28 are followed by a distinct cost-slope transition at p=29. Separately, exact certificates prove kappa(F_(53,107))=8847 with minimum attaining rank 115; its optimum is half-integral, while an earlier integer candidate of trace 8843 is refuted by an integral Farkas certificate. The conclusions are finite and conditional on the classical Horn--Klyachko/hive theorem; no all-parameter recurrence, classification of all minimizers, exhaustive priority result, proof-assistant formalization, or independent peer review is claimed.

Sharp Onset and Unbounded Growth of Norm-Optimal Self-Commutator Rank

For a traceless Hermitian matrix F in M_d(C), define kappa_d(F) = (1/2) min{||C||_HS^2 : CC^* - C^*C = 2F} and let r_*(F) be the least rank among its minimizers. Inertia gives the universal lower bound r_0(F) = max{n_+(F), n_-(F)}. We prove the exact low-dimensional classification r_*(F) = r_0(F) for d <= 7, including every singular spectrum. The bound fails sharply in dimension eight. For the entire explicit two-ray cone lambda(b,c) = (4c-3b,b,b,b,-c,-c,-c,-c), 0 <= b <= c, we determine the unrestricted and rank-four costs: their difference is min{b,c-b}, and every interior point has r_* = 5 > 4 = r_0. In particular, the integer spectrum (5,1,1,1,-2,-2,-2,-2) has unrestricted cost 13 and rank-four cost 14. Thus eight is the least dimension in which Hilbert--Schmidt norm optimality can force factor rank strictly above inertia. The proof is an exact computer-assisted Horn-polyhedral argument. Thirty-three sign--zero strata through dimension seven yield 813 exact face rays and 272 projected facets; every facet has a rational nonnegative Farkas certificate on the unrestricted cone. A separate exact replay verifies the dimension-eight phase and a two-valued dimension-nine witness. No floating point output is used as a proof object. Finally, for the target G_t with spectrum (5^(12t),-4^(15t)) in dimension 27t, we prove kappa_27t(G_t) = 87t and 17t+1 <= r_*(G_t) <= 18t. Since r_0(G_t) = 15t, the additive excess is at least 2t+1 and is therefore unbounded. The amplification is symbolic: a coarse-grid restriction of any fine hive transfers a frozen order-27 rank-17 lower certificate to every t by telescoping elementary rhombi.

One-Spike Inverse Self-Commutators and Exact Three-versus-Four-Kick Curvature Synthesis

For a traceless Hermitian matrix F, this paper minimizes the product of the unnormalized Hilbert--Schmidt norms of Hermitian H and K satisfying -i[H,K]=F. On the complete one-spike spectral cone with nonzero spectrum (P,-b_1,...,-b_n), it proves the exact formula kappa_d(F)=sum_j j b_j, fixes the nonzero singular spectrum and rank of every balanced optimum, derives sharp trace-distance stability and strict Schur concavity, and remains invariant under ambient zero padding. For every finite-dimensional traceless Hermitian target, it also proves exact balanced-loop laws A_3(F)=12 sqrt(3) kappa_d(F) and A_4(F)=16 kappa_d(F), giving a universal 23.02 percent fourth-kick reduction. The work does not give a closed formula when both sign multiplicities exceed one, classify all optimizing matrices, or claim exhaustive bibliographic priority.

Sharp Rank-Adaptive Bounds for Inverse Self-Commutators

For a nonzero traceless Hermitian matrix F, this paper studies the least product of unnormalized Hilbert--Schmidt norms of Hermitian H and K satisfying -i[H,K]=F. Writing rho=rank(F) and P(F)=||F||_1/2, it proves the sharp dimension-free bounds P(F)<=kappa_d(F)<=rho P(F)/2. Both equality loci are classified: the lower endpoint is attained exactly by centrally paired nonzero spectra, while the upper endpoint is attained exactly, up to positive scale and sign, by the one-spike spectrum (rho-1,-1,...,-1), with arbitrary zero padding. An exact sign-cut leakage identity identifies the full tax above the trace-norm floor. The upper bound uses an exact weighted-shift permutation average, and rho-1 explicit Horn--Littlewood--Richardson inequalities certify upper-endpoint sharpness. The work does not claim a closed formula for general interior spectra or an upper-endpoint stability modulus.