Instant TravelLuminary Oddities — Enter the Portal
Research Archive

Research Article · Preprint Mathematics

Occupation bounds for coupled permanent cofactors

Scott Schubr

Luminary Oddities LLC

  • Mathematics
  • Linear Algebra and Matrix Inequalities
Primary subject
Mathematics
Subject subfields
Linear Algebra and Matrix Inequalities
Paper type
Research Article
Manuscript stage
Preprint
Manuscript
Archived
Edition
3 · Permanent link

Overview

Abstract

For a complex positive semidefinite Gram matrix B = VV*, we couple the permanent-cofactor contractions of B and |B|² and prove the sharp all-order bound 0 ⪯ U − aT/n! ⪯ (n − 1)(c − a²/n!)I, where a = per(B) and c = per(|B|²). For the actual bordered permanent defect, a nonnegative cofactor-weighted variance E has a geometric zero set. A trace-contraction argument gives an explicit nonlinear lower bound for arbitrary trace-one positive operators. For six unit Gram factors it implies E ≥ v²/1600, and E ≥ v²/600 at rank at most five, where v is the total occupation variance. The quadratic power is sharp. Arbitrary complex phases, singular limits and kernel mixtures are included.

A coherence-dependent base-defect reserve includes a uniform rank-five reserve. An all-border matrix certificate holds at coherence at most 1/15. A self-contained reconstruction of the attributed small-order coefficient induction supplies the scalar inequalities through order six used in these certificates. Relative Gram-factor stability, occupied-vertex domains, neighborhoods of repeated orthogonal blocks and exact adaptive occupation-box certificates are retained and augmented by the uniform variance bound. The original residual occupation polynomial, thinning law and nonreal-root examples remain. The generic rank-six compensation inequality and unrestricted Chollet conjecture remain open.

Keywords permanent inequalities · positive semidefinite matrices · coupled cofactors · occupation bounds · Gram factors · adaptive certificates

Scope of the work

Same-paper substantive strengthening. Uniform variance: E ≥ v²/1600 for six unit Gram factors, improved to v²/600 at rank at most five; mixed trace-one extension uses actual operator variance and support dimension. Quadratic power sharp, constants not claimed optimal. Includes complex phases, all kernel mixtures and rank limits. Coherence-dependent base reserve and coherence ≤ 1/15 matrix certificate are proved. Included reconstruction discharges the order-five premise in the order-seven one-high-row transfer; the general transfer retains its complementary self-Chollet hypothesis. Generic rank-six compensation, unrestricted Chollet, a complete uniform box cover, optimal radii, global complexity and separation from the exact shifted cofactor surrogate remain unproved.

Reproduction notes

The eleven-member package contains the 16-page PDF, main.tex, extensions.tex, uniform.tex, three standard-library Python checkers, rational adaptive certificate data, citation metadata, reader instructions and a checksum manifest. Run verify.py, verify_adaptive.py adaptive_certificates.json --self-test, and verify_uniform.py in normal and optimized modes with Python 3.10+. Exact finite checks corroborate identities, constants and examples; universal statements follow the displayed analytic proofs. Keep both included TeX files beside main.tex. The adaptive geometric checker conservatively retains its two-high-row rule.

The manuscript

Read the paper

Open PDF

The complete manuscript, as published in this edition.

If the reader is unavailable on your device, open or download the PDF directly.

Author disclosures

AI tools assisted mathematical exploration, drafting and checking. The author is responsible for the statements and presentation. Internal computational and AI checks are not external human peer review.

References and related publications

  1. J. Chollet, Problem 6482, Amer. Math. Monthly 89 (1982), 57–58.
  2. K. Rodtes, Chollet’s permanent conjecture for 4 × 4 matrices, Linear Multilinear Algebra 72 (2024), 2633–2638, arXiv:2211.02839.
  3. Q. Li, Q. Zhao and W. Luo, Chollet’s permanent conjecture through order six via border induction, Preprints.org 202608.2196v1 (31 August 2026), doi:10.20944/preprints202608.2196.v1.
  4. V . E. Paksoy, A permanent inequality for positive semidefinite matrices,Electron. J. Linear Algebra 39 (2023), 71–77, publisher’s article.
  5. A. W. Harrow, The church of the symmetric subspace (2013), arXiv:1308.6595.
  6. J. M. Zhang, H. F. Song and Y . Liu, Permanent variational wave functions for bosons (2021), arXiv:2106.14679.
  7. S. Geller and E. Knill, Measuring multiparticle indistinguishability with the generalized bunching probability, arXiv:2509.04550v2 (2025).
  8. C. Ryba, Stable centres of wreath products, Algebraic Combinatorics 6 (2023), 413–455, doi:10.5802/alco.264.
  9. A. Prékopa and G. Alexe, Dual methods for the numerical solution of the univariate power moment problem, RUTCOR Research Report 14-2003, report.
  10. W. Tang and F. Tang, The Poisson binomial distribution—old & new, arXiv:1908.10024 (2019).
  11. S. Schubr, Chollet’s inequality for positive semidefinite matrices of rank at most four (2026), authorpublished preprint, edition 1.
  12. S. Schubr, Sharp limitations of two permanental cofactor comparisons (2026), author-published preprint, edition 1.
  13. R. Bhatia, P . Grover and T. Jain, Derivatives of tensor powers and their norms, arXiv:1102.2414v3 (2015).
  14. H. Terao, Algebras generated by reciprocals of linear forms, J. Algebra 250 (2002), 549–558, doi:10.1006/jabr.2001.9121.
  15. M. Marcus, The permanent analogue of the Hadamard determinant theorem, Bull. Amer. Math. Soc. 69 (1963), 494–496.
  16. D. Lu, Nonlinear eigenvector methods for convex minimization over the numerical range, SIAM J. Matrix Anal. Appl. 41 (2020), 1771–1796, doi:10.1137/18M1234473.
  17. A. Neumaier, Complete search in continuous global optimization and constraint satisfaction, Acta Numer. 13 (2004), 271–369, doi:10.1017/S0962492904000194.

A stable scholarly record

Cite this edition

Scott Schubr. (2026). Occupation bounds for coupled permanent cofactors (Version 3). Luminary Research Archive. https://research.luminaryoddities.com/occupation-bounds-coupled-permanent-cofactors/v/3

BibTeX
@techreport{luminary_occupation_bounds_coupled_permanent_cofactors_v3,
  title = {Occupation bounds for coupled permanent cofactors},
  author = {Scott Schubr},
  year = {2026},
  institution = {Luminary Research Archive},
  type = {Research Article},
  note = {Version 3},
  url = {https://research.luminaryoddities.com/occupation-bounds-coupled-permanent-cofactors/v/3}
}

Loading discussion…