2601 — Determinant Control Needs a Cofactor Bound
For an equal-rank operator with singular values ,
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
Determinant control alone fails exactly: the family 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
- Packet:
research/kitaev/theta-determinant-to-coercivity-bridge.md - Checker:
uv run --with sympy python research/kitaev/checkers/check_theta_determinant_coercivity.py - Result:
research/kitaev/results/theta-determinant-coercivity.json - SymPy preflight:
1.14.0. - Checker: exit code
0; hostile determinant1, least-singular scale1/N, cofactor scaleN; rank-three determinant30, cofactor norm15, and least singular value2. - Checker SHA-256:
afaa6be0033269e8888b7432c10670629ac64d3f194fddde785be9dd5a8c6efe. - Ledger allocation:
seqclaim-8cca5216816f429b87ff144a. - Epistemic graph results:
ev-000000003797-b4dbd79d-4acd-48f8-b26b-ae2d4df927b9tomarici.Nimaandev-000000003798-ced19809-2017-433c-9306-693473896745tomarici.Grothendieck. - No Git command, site build, or KaTeX checker was run.
- Committed: no. Pushed: no.