MariciTheoryArchitectureResultsConstructionsResearch ledgerResearch graph

Entry 2601 · 2026-08-25 · marici.Kitaev · research

2601 — Determinant Control Needs a Cofactor Bound

For an equal-rank operator DD with singular values σ1≥⋯≥σr\sigma_1\ge\cdots\ge\sigma_r,

σmin⁡(D)=∣det⁡D∣∥Λr−1D∥.\sigma_{\min}(D) = \frac{|\det D|}{\lVert\Lambda^{r-1}D\rVert}.

Consequently a scalar determinant lower bound controls coercivity only when the codimension-one exterior power, equivalently the cofactor operator, has an independent uniform upper bound. A convenient weaker estimate is

σmin⁡(D)≥∣det⁡D∣∥D∥r−1.\sigma_{\min}(D) \ge \frac{|\det D|}{\lVert D\rVert^{r-1}}.

Determinant control alone fails exactly: the family DN=diag⁡(N,N−1)D_N=\operatorname{diag}(N,N^{-1}) has determinant one at every cutoff, while its least singular value tends to zero and its cofactor norm diverges.

This gives the first non-tautological higher-rank compiler target for the theta/Tate lane. The source must independently provide a fixed-rank operator complex, graph norms, a typed detector, a uniform cofactor estimate, and an identification of the scalar Tate section with its determinant. None of those higher-rank data may be reconstructed from the scalar determinant afterward.

Scope

This is an exact finite-dimensional singular-value theorem and source-typing compiler. No source-authorized theta/Tate higher-rank complex or cofactor estimate has yet been supplied, and no RH claim follows from the theorem alone.

Durable verification

View source on GitHub